Latency-rate servers: a general model for analysis of traffic scheduling algorithms

@article{Stiliadis1998LatencyrateSA,
title={Latency-rate servers: a general model for analysis of traffic scheduling algorithms},
journal={IEEE/ACM Trans. Netw.},
year={1998},
volume={6},
pages={611-624}
}
• Published 1998
• Computer Science
• IEEE/ACM Trans. Netw.
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. [...] Key Result 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.Expand
218 Citations
An efficient packet fair queueing (PFQ) architecture for latency rate server
• Computer Science
• Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE
• 2002
This paper proves that all the latency-rate (LR) servers only need to calculate their system virtual times once per packet service time, no matter how many packet arrivals occur in this interval. Expand
An M/G/1 Queuing System with Multiple Vacations to Assess the Performance of a Simplified Deficit Round Robin Model
• Computer Science
• Computer Performance Evaluation / TOOLS
• 2003
This paper proposes and solves a specific worst-case model that enables to calculate quantiles of the queue length distribution at any time (and hence average delays) as a function of the offered load, when the arrival process is Poissonian. Expand
Analysis of Frame-Based Fair Queueing under Self-Similar Traffic
• Computer Science
• 2002
This paper analyzes FFQ under self-similar traffic source in terms of the delay experienced in FFQ and compares it to the delays in Packet-by-packet Generalized Processor Sharing (PGPS) and Self Clocked Fair Queueing (SCFQ). Expand
Pre-order Deficit Round Robin: a new scheduling algorithm for packet-switched networks
• Computer Science
• Comput. Networks
• 2001
This work describes a new scheme, Pre-order Deficit Round Robin, which overcomes the problems of DRR and provides an analysis on latency and fairness, which shows this scheme as a better alternative to DRR. Expand
Flexible Scheduling Discipline for Fixed-Size-Packet Switched Networks
• Computer Science
• 2007
This paper shows that ARR is in the class of Latency Rate servers, therefore all results of LR-servers can be applied for ARR, and presents the fairness-index of ARR which is one of the most important feature of schedulers. Expand
Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility
• Computer Science
• Wirel. Pers. Commun.
• 2012
An exclusive multi-server scheduling algorithm specifically tuned for mobile routers equipped with multiple wireless interfaces and has attained multiple care-of-address registrations with its home agent to demonstrate higher degree of reliability and scalability of service provisioning to flows during mobility. Expand
Instant Service Policy and Its Application to Deficit Round Robin
• Computer Science
• AAIM
• 2006
This research suggests a novel policy of Instant Service, which is applicable to any round-robin schedulers, and applies this policy to DRR, makes a variation called DRR with Instant Service (DRR-IS), and proves it is still an $\mathcal{LR}$ server. Expand
On adaptive bandwidth sharing with rate guarantees
• Computer Science
• Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
• 1998
Three modified scheduling schemes are proposed which preserve the rate guarantees of fair queueing (and hence preserve deterministic delay bounds) but adaptively redistribute the excess bandwidth such that either losses are reduced or delays equalized. Expand
Fair scheduling with tunable latency: a round robin approach
• Computer Science
• Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)
• 1999
Contrary to conventional belief, it is shown that appropriate modifications of the weighted round robin (WRR) service discipline can, in fact, provide tight fairness properties and efficient delay guarantees to multiple sessions. Expand
Block-based fair queuing: An efficient network QoS provisioning algorithm for high-speed data transmission
• Computer Science
• 2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)
• 2012
An extension of WFQ is proposed, called BWFQ, to reduce the computation time and guarantee the QoS performances as well, which is capable of saving a great amount of computation, especially under traffic congestion. Expand

References

SHOWING 1-10 OF 52 REFERENCES
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
• Computer Science
• Proceedings of IEEE INFOCOM '96. Conference on Computer Communications
• 1996
The theory of 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. Expand
Rate-proportional servers: a design methodology for fair queueing algorithms
• Computer Science
• TNET
• 1998
This work presents a methodology for the design of scheduling algorithms that provide the same end-to-end delay bound as that of WFQ and bounded unfairness without the complexity of GPS emulation, and produces a class of algorithms, called rate-proportional servers (RPSs). Expand
FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS
• Computer Science
• 1995
This paper introduces and analyze frame-based fair queueing, a novel traffic scheduling algorithm for packet-switched networks that provides end-to-end delay bounds identical to those of PGPS without the complexity of simulating the fluid-model system in the background as required in PGPS. Expand
A general methodology for designing efficient traffic scheduling and shaping algorithms
• Computer Science
• Proceedings of INFOCOM '97
• 1997
It is shown that, under this framework, even an unfair scheduling algorithm belonging to the RPS class, such as VirtualClock, can yield worst-case fairness identical to that obtained with weighted fair queueing. Expand
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
• Computer Science
• TNET
• 1993
Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments. Expand
Network Delay Analysis of a Class of Fair Queueing Algorithms
It is shown that the SCFQ scheme can provide adequate performance guarantees for the delay-sensitive traffic in ATM, and the end-to-end session delays and backlogs corresponding to this class of algorithms are shown to be bounded. Expand
Statistical Analysis of Generalized Processor Sharing Scheduling Discipline
• Computer Science
• IEEE J. Sel. Areas Commun.
• 1995
Borders on the individual session backlog and delay distribution under the generalized processor sharing (GPS) scheduling discipline are developed and it is shown that networks belonging to a broad class of GPS assignments, the so-called consistent relative session treatment (CRST) GPS assignments are stable in a stochastic sense. Expand
On adaptive bandwidth sharing with rate guarantees
• Computer Science
• Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
• 1998
Three modified scheduling schemes are proposed which preserve the rate guarantees of fair queueing (and hence preserve deterministic delay bounds) but adaptively redistribute the excess bandwidth such that either losses are reduced or delays equalized. Expand
A generalized processor sharing approach to flow control in integrated services networks-the multiple node case
• A. Parekh
• Computer Science
• IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings
• 1993
Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing servers and shown to be achieved by staggered regimes when an independent sessions relaxation holds. Expand
Service Guarantees for Window Flow Control 1
• 1996
After presenting some new insight into the concept of \service curves," we derive a \service curve guarantee" for a window ow control protocol with cross-traac characterized by burstinessExpand