An algorithmic analysis of the generalized processor-sharing queue

详细信息    查看全文

• 作者：Souvik Ghosh ^{souvikghosh589@gmail.com sg19@iitbbs.ac.in} ; A.D. Banik ; ^{banikad@gmail.com} ; ^{adattabanik@iitbbs.ac.in}
• 关键词：Generalized processor-sharing (GPS) queue ; Batch Markovian arrival process (BMAP) ; Markovian service process (MSP) ; RG-factorization
• 刊名：Computers & Operations Research
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：79
• 期：Complete
• 页码：1-11
• 全文大小：957 K
• 卷排序：79

文摘

An infinite-buffer single server queue with batch Markovian arrival is considered. The service process is non-renewal as well under generalized processor sharing. Stationary system-length distribution is obtained using RG-factorization approach. The mean sojourn time of a tagged customer is analyzed in detail. Performance indices and blocking probability for finite-buffer are also obtained.