Sciweavers

Share
SIGMETRICS
2004
ACM

Performance analysis of LAS-based scheduling disciplines in a packet switched network

10 years 3 months ago
Performance analysis of LAS-based scheduling disciplines in a packet switched network
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for short flows while not significantly increasing the average flow time for the long flows that share the same bottleneck. No modification of the packet headers is required to implement the simple LAS policy. However, previous work has also shown that a drawback of the LAS scheduler is that, when link utilization is greater than 70%, long flows experience large jitter in their packet transfer times as compared to the conventional First-Come-First-Serve (FCFS) link scheduling. This paper proposes and evaluates new differentiated LAS scheduling policies that reduce the jitter for long flows that are identified as ”priority” flows. To evaluate the new policies, we develop analytic models to estimate average flow transfer time as a function of flow size, and average packet transmission time as a functio...
Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vern
Added 30 Jun 2010
Updated 30 Jun 2010
Type Conference
Year 2004
Where SIGMETRICS
Authors Idris A. Rai, Guillaume Urvoy-Keller, Mary K. Vernon, Ernst W. Biersack
Comments (0)
books