A review of L=&lgr;W and extensions
Queueing Systems: Theory and Applications
A review of regenerative processes
SIAM Review
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Waiting-Time Asymptotics for the M/G/2 Queue with Heterogeneous Servers
Queueing Systems: Theory and Applications
The Asymptotic Workload Behavior of Two Coupled Queues
Queueing Systems: Theory and Applications
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Generalized processor sharing with light-tailed and heavy-tailed input
IEEE/ACM Transactions on Networking (TON)
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
ACM SIGMETRICS Performance Evaluation Review
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks
IEEE/ACM Transactions on Networking (TON)
Optimal scaling of average queue sizes in an input-queued switch: an open problem
Queueing Systems: Theory and Applications
Optimal queue-size scaling in switched networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity
IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider the problem of scheduling in a single-hop switched network with a mix of heavy-tailed and light-tailed traffic and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric, we use the delay stability of traffic flows: A traffic flow is delay-stable if its expected steady-state delay is finite, and delay-unstable otherwise. First, we show that a heavy-tailed traffic flow is delay-unstable under any scheduling policy. Then, we focus on the celebrated Max-Weight scheduling policy and show that a light-tailed flow that conflicts with a heavy-tailed flow is also delay-unstable. This is true irrespective of the rate or the tail distribution of the light-tailed flow or other scheduling constraints in the network. Surprisingly, we show that a light-tailed flow can become delay-unstable, even when it does not conflict with heavy-tailed traffic. Delay stability in this case may depend on the rate of the light-tailed flow. Finally, we turn our attention to the class of Max-Weight- $\alpha$ scheduling policies. We show that if the $\alpha$ -parameters are chosen suitably, then the sum of the $\alpha$-moments of the steady-state queue lengths is finite. We provide an explicit upper bound for the latter quantity, from which we derive results related to the delay stability of traffic flows, and the scaling of moments of steady-state queue lengths with traffic intensity.