How large delays build up in a GI/G/1 quqe
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
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)
Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
On the relevance of long-range dependence in network traffic
IEEE/ACM Transactions on Networking (TON)
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
Large deviations and the generalized processor sharing scheduling for a multiple-queue system
Queueing Systems: Theory and Applications
Activity periods of an infinite server queue and performance of certain heavy tailed fluid queues
Queueing Systems: Theory and Applications
Large Deviations for Small Buffers: An Insensitivity Result
Queueing Systems: Theory and Applications
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
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Generalized processor sharing queues with heterogeneous traffic classes
Generalized processor sharing queues with heterogeneous traffic classes
Reduced Load Equivalence under Subexponentiality
Queueing Systems: Theory and Applications
Sample-path large deviations for generalized processor sharing queues with Gaussian inputs
Performance Evaluation - Long range dependence and heavy tail distributions
GPS scheduling: selection of optimal weights and comparison with strict priorities
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
ACM SIGMETRICS Performance Evaluation Review
An analytical model for generalized processor sharing scheduling with heterogeneous network traffic
Proceedings of the 2007 ACM symposium on Applied computing
A new scheduling scheme for high-speed packet networks: Earliest-virtual-deadline-first
Computer Communications
Power-law vs exponential queueing in a network traffic model
Performance Evaluation
Computers and Operations Research
A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic
Journal of Computer and System Sciences
Scheduling policies for single-hop networks with heavy-tailed traffic
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Approximation for a two-class weighted fair queueing discipline
Performance Evaluation
Performance analysis of an integrated scheduling scheme in the presence of bursty MMPP traffic
Journal of Systems and Software
Contention free scheme for asymmetrical traffic load in IEEE 802.11x wireless LAN
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
IEEE/ACM Transactions on Networking (TON)
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider a queue fed by a mixture of light-tailed and heavy-tailed traffic. The two traffic flows are served in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queueing, have emerged as an important mechanism for achieving service differentiation in integrated networks. We derive the asymptotic workload behavior of the light-tailed traffic flow under the assumption that its GPS weight is larger than its traffic intensity. The GPS mechanism ensures that the workload is bounded above by that in an isolated system with the light-tailed flow served in isolation at a constant rate equal to its GPS weight. We show that the workload distribution is in fact asymptotically equivalent to that in the isolated system, multiplied with a certain pre-factor, which accounts for the interaction with the heavy-tailed flow. Specifically, the pre-factor represents the probability that the heavy-tailed flow is backlogged long enough for the light-tailed flow to reach overflow. The results provide crucial qualitative insight in the typical overflow scenario.