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

The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate based flow control. The authors propose the use of a packet service discipline at the nodes of the network that is based on a multiplex scheme called generalized processor sharing (GPS). This service discipline is combined with leaky bucket rate admission control to provide flexible, efficient and fair use of the links. A single server GPS system is analyzed exactly, and tight bounds on worst case packet delay, output burstiness and backlog are derived for each session, when the sources are constrained by leaky buckets. The analysis yields a simple resource assignment scheme that allows the server to make worst case delay and rate guarantees to every session in the system. Extensions of this work to arbitrary topology networks are also discussed.<<ETX>>

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  Sarah Williams,et al.  Computer applications , 1988 .

[3]  N. S. Barnett,et al.  Private communication , 1969 .

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

[5]  Anthony Unwin,et al.  Reversibility and Stochastic Networks , 1980 .

[6]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[7]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

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

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

[10]  Lixia Zhang,et al.  NETBLT: a high throughput transport protocol , 1987, SIGCOMM '87.

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

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

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

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

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

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

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

[18]  Joseph Yu Hui,et al.  Switching and Traffic Theory for Integrated Broadband Networks , 1990 .

[19]  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.

[20]  Albert G. Greenberg,et al.  Comparison of a Fair Queueing Discipline to Processor Sharing , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.

[21]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[22]  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.

[23]  Jon M. Peha,et al.  A cost-based scheduling algorithm to support integrated services , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[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.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

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

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

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

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

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

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

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

[33]  Moshe Sidi,et al.  Generalized processor sharing networks with exponentially bounded burstiness arrivals , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.