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

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.

[1]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[3]  Hung-Hsiang Jonathan Chao,et al.  A VLSI sequencer chip for ATM traffic shaper and queue manager , 1992 .

[4]  Dimitrios Stiliadis,et al.  Traffic scheduling in packet-switched networks: analysis, design, and implementation , 1996 .

[5]  Hui Zhang,et al.  Service disciplines for packet-switching integrated services networks , 1993 .

[6]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[7]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1997, Multimedia Systems.

[8]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[9]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[10]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[11]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[12]  Donald F. Towsley,et al.  Statistical Analysis of Generalized Processor Sharing Scheduling Discipline , 1995, IEEE J. Sel. Areas Commun..

[13]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[14]  Rene L. Cruz,et al.  Service Burstiness and Dynamic Burstiness Measures: A Framework , 1992, J. High Speed Networks.

[15]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[16]  George Kesidis,et al.  Bandwidth scheduling for wide-area ATM networks using virtual finishing times , 1996, TNET.

[17]  Anujan Varma,et al.  Efficient fair queueing algorithms for packet-switched networks , 1998, TNET.

[18]  G. Varghese.  Eecient Fair Queuing Using Deecit round Robin , 1995 .

[19]  T. V. Lakshman,et al.  On adaptive bandwidth sharing with rate guarantees , 1998, 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.

[20]  Randy Brown,et al.  Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem , 1988, CACM.

[21]  R. Cruz,et al.  Service Guarantees for Window Flow Control 1 , 1996 .

[22]  George Varghese,et al.  Efficient fair queueing using deficit round-robin , 1996, TNET.

[23]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[24]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[25]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[26]  S. Jamaloddin Golestani,et al.  Network Delay Analysis of a Class of Fair Queueing Algorithms , 1995, IEEE J. Sel. Areas Commun..

[27]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[28]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[29]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[30]  Rene L. Cruz,et al.  End-to-End Queueing Delay in ATM Networks , 1994, J. High Speed Networks.

[31]  Geoffrey G. Xie,et al.  Burst scheduling: architecture and algorithm for switching packet video , 1995, Proceedings of INFOCOM'95.

[32]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[33]  Anujan Varma,et al.  FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS , 1995 .

[34]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[35]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[36]  S. Jamaloddin Golestani,et al.  A Framing Strategy for Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[37]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.

[38]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.