Sojourn Time Analysis for Processor Sharing Loss Queuing System with Service Interruptions and MAP Arrivals

被引：5

作者：

Samouylov, Konstantin ^{[1
,2
]}

Sopin, Eduard ^{[1
,2
]}

Gudkova, Irina ^{[1
,2
]}

机构：

[1] RUDN Univ, Dept Appl Probabil & Informat, Miklukho Maklaya Str 6, Moscow 117198, Russia

[2] FRC CSC RAS, Inst Informat Problems, Vavilova Str 44, Moscow 119333, Russia

来源：

DISTRIBUTED COMPUTER AND COMMUNICATION NETWORKS, DCCN 2016 | 2016年 / 678卷

基金：

俄罗斯科学基金会;

关键词：

Queuing system; Processor sharing; Egalitarian processor sharing; Unreliable server; Interruption; Probability distribution; Recursive algorithm; Sojourn time; Absorbing Markov chain;

D O I：

10.1007/978-3-319-51917-3_36

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Processor sharing (PS) queuing systems are widely investigated by research community and applied for the analysis of wire and wireless communication systems and networks. Nevertheless, only few works focus on finite queues with both PS discipline and service interruptions. In the paper, compared with the previous results we analyze a finite capacity PS queuing system with Markovian arrival process, unreliable server, service interruptions, and an upper limit of the number of customers it serves simultaneously. For calculating the mean sojourn time, unlike a popular but computational complex technique of inverse Laplace transform we use an effective method based on embedded Markov chain. A practical example concludes the paper.

引用

页码：406 / 417

页数：12

共 16 条

[1]

[Anonymous], 2003, APPL PROBABILITY QUE

[2]

Basharin G. P., P 3 INT SEM TEL THEO, P38

[3]

FREDJ SB, 2001, ACM SIGCOMM 2001, P111

[4]

Kleinrock L., J ACM, V14, P242