QQ客服 官方微博 反馈留言

	An RG-factorization approach for a BMAP/M/1 generalized processor-sharing queue
	Li, QL ; Lian, ZT
	2010-05-10 ; 2010-05-10
会议名称	STOCHASTIC MODELS ; 5th International Conference on Matrix Analytic Methods in Stochastic Models ; Pisa, ITALY ; Web of Science
关键词	batch Markovian arrival process (BMAP) generalized processor-shafing Markov chain of M/G/1 type processor-sharing queue sojourn time WAITING TIME DISTRIBUTIONS REDUCED-LOAD EQUIVALENCE MARKOV-CHAINS SOJOURN TIME SHARED SYSTEMS RESPONSE-TIME GI/M/1 QUEUE SERVICE FLUID NETWORKS Statistics & Probability
中文摘要	In this paper, we study a BAMP/M/1 generalized processor-sharing queue. We propose an RG-factorization approach, which can be applied to a wider class of Markovian block-structured processor-sharing queues. We obtain the expressions for both the distribution of the stationary queue length and the Laplace transform of the sojourn time distribution. From these two expressions, we develop an algorithm to compute the mean and variance of the sojourn time approximately.
会议录出版者	TAYLOR & FRANCIS INC ; PHILADELPHIA ; 325 CHESTNUT ST, SUITE 800, PHILADELPHIA, PA 19106 USA
语种	英语 ; 英语
内容类型	会议论文
源URL	[http://hdl.handle.net/123456789/18976]
专题	清华大学
推荐引用方式 GB/T 7714	Li, QL,Lian, ZT. An RG-factorization approach for a BMAP/M/1 generalized processor-sharing queue[C]. 见:STOCHASTIC MODELS, 5th International Conference on Matrix Analytic Methods in Stochastic Models, Pisa, ITALY, Web of Science.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。