IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Large deviations and the generalized processor sharing scheduling for a multiple-queue system
Queueing Systems: Theory and Applications
Large deviations analysis of the generalized processor sharing policy
Queueing Systems: Theory and Applications
A Reduced-Load Equivalence for Generalised Processor Sharing Networks with Long-Tailed Input Flows
Queueing Systems: Theory and Applications
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Generalized processor sharing with light-tailed and heavy-tailed input
IEEE/ACM Transactions on Networking (TON)
Optimal call admission control on a single link with a GPS scheduler
IEEE/ACM Transactions on Networking (TON)
Sample-path large deviations for generalized processor sharing queues with Gaussian inputs
Performance Evaluation - Long range dependence and heavy tail distributions
ACM SIGMETRICS Performance Evaluation Review
Energy-aware capacity scaling in virtualized environments with performance guarantees
Performance Evaluation
| Hi-index | 0.00 |
We consider a system with two service classes with heterogeneous traffic characteristics and Quality-of-Service requirements. The available bandwidth is shared between the two traffic classes in accordance with the Generalized Processor Sharing (GPS) discipline. GPS-based scheduling algorithms, such as Weighted Fair Queueing, provide a popular mechanism for service differentiation among heterogeneous traffic classes. While the performance of GPS for given weights has been thoroughly examined, the problem of selecting weight values that maximize the traffic-carrying capacity, has only received limited attention so far. In the present paper, we address the latter problem for the case of general Gaussian traffic sources. Gaussian models cover a wide variety of both long-range dependent and short-range dependent processes, and are especially suitable at relatively high levels of aggregation. In particular, we determine the realizable region, i.e., the combinations of traffic sources that can be supported for given Quality-of-Service requirements in terms of loss and delay metrics. The results yield the remarkable observation that simple priority scheduling strategies achieve nearly the full realizable region. 1.