Name
Abstract | ||
|---|---|---|
Processor sharing (PS) queuing systems and particularly their well-known class of egalitarian processor (EPS) sharing are widely investigated by research community and applied for the analysis of wire and wireless communication systems and networks. The same can be said for queuing systems in random environment, with unreliable servers, interruptions, pre-emption mechanisms. Nevertheless, only few works focus on queues with both PS discipline and unreliable servers. In the paper, compared with the previous results we analyse a finite capacity PS queuing system with unreliable server 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 chains. The paper also includes a practical numerical example of web browsing in a wireless network when the corresponding low priority traffic can be interrupted by more priority applications. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-43904-4_20 | Analytical and Stochastic Modelling Techniques and Applications |
Keywords | Field | DocType |
Queuing system,Processor sharing,Egalitarian processor sharing,Unreliable server,Interruption,Probability distribution,Recursive algorithm,Mean sojourn time,Embedded Markov chain,Web browsing | Mean sojourn time,Wireless network,Computer science,Server,Queue,Markov chain,Processor sharing,Real-time computing,Queueing theory,Queue management system,Distributed computing | Conference |
Volume | ISSN | Citations |
9845 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 10 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Konstantin Samouylov | 1 | 39 | 15.31 |
| Valery Naumov | 2 | 0 | 0.34 |
| Eduard Sopin | 3 | 14 | 6.55 |
| Irina Gudkova | 4 | 69 | 12.82 |
| Sergey Shorgin | 5 | 19 | 12.04 |