Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions
Queueing Systems: Theory and Applications
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
An overview of Brownian and non-Brownian FCLTs for the single-server queue
Queueing Systems: Theory and Applications
Modeling and analysis of power-tail distributions via classical teletraffic methods
Queueing Systems: Theory and Applications
Random Walk with a Heavy-Tailed Jump Distribution
Queueing Systems: Theory and Applications
Placement of network resources in communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling techniques for VBR video: feasibility and limitations
Performance Evaluation
BUST: enabling scalable service orchestration
Proceedings of the 2nd international conference on Scalable information systems
Scheduling performance of heavy-tailed data traffic in wireless high-speed shared channels
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Explicit M/G/1 waiting-time distributions for a class of long-tail service-time distributions
Operations Research Letters
| Hi-index | 0.07 |
In modern teletraffic applications of queueing theory, service time distributions B(t) with a heavy tail occur, i.e., 1-B(t)~Ct-v for t→∞ with v>1. For such service time distributions, not much explicit information is available concerning the tail probabilities of the corresponding waiting time distribution W(t). In the present study, which is devoted to the M/G/1 queue, a class of heavy-tailed service time distributions is introduced that does allow a rather detailed analysis of the tail behavior of the waiting time distribution. For v=1½, an explicit expression for W(t) is derived. For rational v with 1