2002 · 127 citations · 22 references
ComputingComputer ScienceComputer SystemsComputer NetworksQueuing TheorySchedulingBuffer ManagementNetwork Performance AnalysisQueueing NetworksQueueing SystemsQueueing TheoryResource SchedulingBroadband NetworksEnd-to-end DelayEnd-to-end Delay AnalysisFair QueueingScheduling AlgorithmsTraffic SchedulingUpper BoundsWeighted Fair Queueing
An /spl Lscr//spl Rscr/ server’s behavior is governed by latency and allocated rate, and many common scheduling algorithms (e.g., weighted fair queueing, virtualclock, self‑clocked fair queueing, weighted round robin, deficit round robin) fall into this class. The authors develop a general latency‑rate server model to analyze traffic scheduling algorithms in broadband packet networks. They derive tight upper bounds on end‑to‑end delay, internal burstiness, and buffer requirements for sessions in arbitrary latency‑rate server networks, expressed via scheduler latencies, assuming token‑bucket‑shaped traffic. This theory allows computation of tight upper bounds on end‑to‑end delay and buffer requirements in heterogeneous networks with diverse scheduling architectures and traffic models.
We develop a general model, called latency-rate servers (/spl Lscr//spl Rscr/ servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an /spl Lscr//spl Rscr/ server is determined by two parameters-the latency and the allocated rate. Several well-known scheduling algorithms, such as weighted fair queueing, virtualclock, self-clocked fair queueing, weighted round robin, and deficit round robin, belong to the class of /spl Lscr//spl Rscr/ servers. We derive tight upper bounds on the end-to-end delay, internal burstiness, and buffer requirements of individual sessions in an arbitrary network of /spl Lscr//spl Rscr/ servers in terms of the latencies of the individual schedulers in the network, when the session traffic is shaped by a token bucket. The theory of /spl Lscr//spl Rscr/ servers enables computation of tight upper bounds on end-to-end delay and buffer requirements in a heterogeneous network, where individual servers may support different scheduling architectures and under different traffic models.
22
Analysis and simulation of a fair queueing algorithm
Alan Demers, Srinivasan Keshav, Scott Shenker · 1989 · 1.7K citations
A self-clocked fair queueing scheme for broadband applications
S. Jamaloddin Golestani · 2002 · 1.1K citations