A generalized processor sharing approach to flow control in integrated services networks: the single-node case

Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers. The inherent flexibility of the service discipline is exploited to analyze broad classes of networks. When only a subset of the sessions are leaky bucket constrained, we give succinct per-session bounds that are independent of the behavior of the other sessions and also of the network topology. However, these bounds are only shown to hold for each session that is guaranteed a backlog clearing rate that exceeds the token arrival rate of its leaky bucket. A much broader class of networks, called consistent relative session treatment (CRST) networks is analyzed for the case in which all of the sessions are leaky bucket constrained. First, an algorithm is presented that characterizes the internal traffic in terms of average rate and burstiness, and it is shown that all CRST networks are stable. Next, a method is presented that yields bounds on session delay and backlog given this internal traffic characterization. The links of a route are treated collectively, yielding tighter bounds than those that result from adding the worst-case delays (backlogs) at each of the links in the route. The bounds on delay and backlog for each session are efficiently computed from a universal service curve, and it is shown that these bounds are achieved by "staggered" greedy regimes when an independent sessions relaxation holds. Propagation delay is also incorporated into the model. Finally, the analysis of arbitrary topology GPS networks is related to Packet GPS networks (PGPS). The PGPS scheme was first proposed by Demers, Shenker and Keshav (1991) under the name of weighted fair queueing. For small packet sizes, the behavior of the two schemes is seen to be virtually identical, and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments. >

[1]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

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

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Israel Cidon,et al.  Real-time packet switching: a performance analysis , 1988, IEEE J. Sel. Areas Commun..

[5]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

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

[7]  J. R. Perkins,et al.  Stable, distributed, real-time scheduling of flexible manufacturing/assembly/diassembly systems , 1989 .

[8]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer prioritization , 1990, 29th IEEE Conference on Decision and Control.

[9]  S. Jamaloddin Golestani.  Congestion-free transmission of real-time traffic in packet networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[10]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer priorities , 1991 .

[11]  S. Jamaloddin Golestani.  Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

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

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

[14]  Albert G. Greenberg,et al.  How fair is fair queuing , 1992, JACM.

[15]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[16]  Sidney L. Hantler,et al.  BUFFER SIZE REQUIREMENTS UNDER LONGEST QUEUE FIRST , 1992 .

[17]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[18]  Cheng-Shang Chang.  Stability, Queue Length and Delay, Part 11: Stochastic Queueing Networks , 1992 .

[19]  Galen H. Sasaki.  Input Buffer Requirements for Round Robin Polling Systems , 1993, Perform. Evaluation.

[20]  Roch Guérin,et al.  Buffer Size Requirements Under Longest Queue First , 1993, Perform. Evaluation.

[21]  Moshe Sidi,et al.  Calculating performance bounds in communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.