DiffServ Aggregation Strategies of Real Time Services in a WFQ+ Schedulers Network
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
Weighted deficit earliest departure first scheduling
Computer Communications
Emulation of optical PIFO buffers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Token bucket characterization of long-range dependent traffic
Computer Communications
An elastic compensation model for frame-based scheduling algorithms in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we develop a general model, called Latency-Rate servers ($\cal LR$-servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an $\cal LR$ scheduler is determined by two parameters --- the latency and the allocated rate. We show that 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 $\cal LR$-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 ${\cal LR}$-servers in terms of the latencies of the individual schedulers in the network, when the session traffic is shaped by a leaky bucket. Thus, the theory of $\cal LR$-servers enables computation of tight upper-bounds on end-to-end delay and buffer requirements in a network of servers in which the servers on a path may not all use the same scheduling algorithm. We also define a self-contained approach to evaluate the fairness of $\cal LR$-servers and use it to compare the fairness of many well-known scheduling algorithms.