Generalized processor sharing with heterogeneous traffic classes

Authors:
Sem Borst;Michel Mandjes;Miranda van Uitert
Affiliations:
CWI, 1090 GB Amsterdam, The Netherlands and Lucent Technologies, Murray Hill, NJ and Eindhoven University of Technology, The Netherlands;CWI, 1090 GB Amsterdam, The Netherlands and University of Twente, The Netherlands;CWI, 1090 GB Amsterdam, The Netherlands
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2001

Citing 7
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

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
Large deviations and the generalized processor sharing scheduling for a multiple-queue system

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

Monotonicity Properties for Multi-Class Queueing Systems

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a system with two heterogeneous traffic classes, one having light-tailed characteristics, the other one exhibiting heavy-tailed properties. The two traffic classes are served in accordance with the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing (WFQ), have emerged as an important mechanism for achieving service differentiation in integrated-services networks.We determine the workload asymptotics of the light-tailed class for the situation where 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 class 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 class. Specifically, the pre-factor represents the probability that the heavy-tailed class is backlogged long enough for the light-tailed class to reach overflow. The results provide crucial qualitative insight in the typical overflow scenario.