On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
On the departure process of a leaky bucket system with long-range dependent input traffic
Queueing Systems: Theory and Applications
Tail probabilities for a multiplexer with self-similar traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
A Reduced-Load Equivalence for Generalised Processor Sharing Networks with Long-Tailed Input Flows
Queueing Systems: Theory and Applications
The Asymptotic Workload Behavior of Two Coupled Queues
Queueing Systems: Theory and Applications
Heavy Tails: The Effect of the Service Discipline
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review
Adaptive and scalable comparison scheduling
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
Queueing Systems: Theory and Applications
Scheduling policies for single-hop networks with heavy-tailed traffic
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Tail-robust scheduling via limited processor sharing
Performance Evaluation
Long-range dependence of traffic across schedulers with multiple service classes
Computer Communications
On the nature and impact of self-similarity in real-time systems
Real-Time Systems
IEEE/ACM Transactions on Networking (TON)
Is Tail-Optimal Scheduling Possible?
Operations Research
| Hi-index | 0.00 |
Consider a single server queue with unit service rate fed by an arrival process of the following form: sessions arrive at the times of a Poisson process of rate \lambda, with each session lasting for an independent integer time \tau \geq 1, where P(\tau = k ) = p_k with p_k \sim \alpha k^{-(1 +\alpha)}L(k), where 1 and L(\cdot) is a slowly varying function. Each session brings in work at unit rate while it is active. Thus the work brought in by each arrival is regularly varying, and, because 1 , the arrival process of work is long-range dependent. Assume that the stability condition \lambda E[\tau] holds. By simple arguments we show that for any stationary nonpreemptive service policy at the queue, the stationary sojourn time of a typical session must stochastically dominate a regularly varying random variable having infinite mean; this is true even if the duration of a session is known at the time it arrives. On the other hand, we show that there exist causal stationary preemptive policies, which do not need knowledge of the session durations at the time of arrival, for which the stationary sojourn time of a typical session is stochastically dominated by a regularly varying random variable having finite mean. These results indicate that scheduling policies can have a significant influence on the extent to which long-range dependence in the arrivals influences the performance of communication networks.