The M/G/1 queue with processor sharing and its relation to a feedback queue
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
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
On a reduced load equivalence for fluid queues under subexponentiality
Queueing Systems: Theory and Applications
Sojourn time asymptotics in the M/G/1 processor sharing queue
Queueing Systems: Theory and Applications
A Reduced-Load Equivalence for Generalised Processor Sharing Networks with Long-Tailed Input Flows
Queueing Systems: Theory and Applications
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Performance of TCP-friendly streaming sessions in the presence of heavy-tailed elastic flows
Performance Evaluation - Long range dependence and heavy tail distributions
Sojourn time asymptotics in Processor Sharing queues with varying service rate
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider a system with two service classes, one of which supports elastic traffic. The traffic characteristics of the other class can be completely general, allowing streaming applications as an important special case. The link capacity is shared between the two traffic classes in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queuing, provide a flexible mechanism for service differentiation and prioritization.We examine the user-level performance of the elastic traffic. The elastic traffic users randomly initiate file transfers with a heavy-tailed distribution. Within the elastic traffic class, the active flows share the available bandwidth in an ordinary processor-sharing (PS) fashion. The PS discipline has emerged as a natural paradigm for evaluating the user-perceived performance of bandwidth sharing algorithms like TCP. For a certain parameter range, we establish that the transfer delay incurred by the elastic traffic flows is asymptotically equivalent to that in an isolated PS system with constant service rate. This service rate is only affected by the streaming traffic through its average rate. Specifically, the elastic traffic is largely immune from possible adverse traffic characteristics or performance degradation due to prioritization of the streaming traffic. This confirms that GPS-based multiplexing mechanisms achieve significantly better performance for both traffic classes than a static bandwidth partitioning approach.