Analysis of a rate-based access control mechanism for high-speed networks

The authors present an analysis of a rate-based access control mechanism for high-speed networks that is based on the buffered leaky bucket scheme. The analysis assumes a discrete time environment representative of asynchronous transfer mode (ATM) networks and a batch arrival process that captures cell arrivals generated by segmentation of large user packets or superposition of a number of arrival streams. The solution method is based on matrix analytic techniques, but the particular structure of the system allowed for a number of important improvements. It is shown that the problem can be partitioned and that the matrix G, central to the matrix analytic technique, can be computed using exact recursive procedures instead of the traditional iterative approach. These improvements not only extend the range of systems that can be handled, but also eliminate computational issues such as convergence rate and stopping criterion. >

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

[2]  C.F. Hemrick,et al.  Switched multi-megabit data service and early availability via MAN technology , 1988, IEEE Communications Magazine.

[3]  P. Burke The Output of a Queuing System , 1956 .

[4]  Daniel P. Heyman A Performance Model of the Credit Manager Algorithm , 1992, Comput. Networks ISDN Syst..

[5]  Hamid Ahmadi,et al.  A survey of modern high-performance switching techniques , 1989, IEEE J. Sel. Areas Commun..

[6]  Marcel F. Neuts,et al.  Statistical group testing with queueing involved , 1987, Queueing Syst. Theory Appl..

[7]  P. S. Richards,et al.  A congestion control framework for high-speed integrated packetized transport , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[8]  Arthur W. Berger Performance Analysis of a Rate-Control Throttle where Tokens and Jobs Queue , 1991, IEEE J. Sel. Areas Commun..

[9]  Jonathan S. Turner,et al.  The Challenge of Multipoint Communication , 1987 .

[10]  Israel Cidon,et al.  Congestion control for high speed packet switched networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  V. Ramaswami A stable recursion for the steady state vector in markov chains of m/g/1 type , 1988 .

[12]  Marcel F. Neuts A Queueing Model for a Storage Buffer in Which the Arrival Rate is Controlled by a Switch with a Random Delay , 1985, Perform. Evaluation.

[13]  Schellhaas Helmut,et al.  On ramaswami's algorithm for the computation of the steady state vector in markov chains of M/G/1-Type , 1990 .

[14]  Vaidyanathan Ramaswami,et al.  Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems , 1988 .

[15]  David M. Lucantoni,et al.  Meeting the challenge: congestion and flow control strategies for broadband information transport , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[16]  Marcel F. Neuts Problems of Reducibility in Structured Markov Chains of M/G/1 Type and Related Queueing Models in Communication Engineering , 1983, Computer Performance and Reliability.

[17]  Levent Gun,et al.  Experimental results on matrix-analytical solution techniques–extensions and comparisons , 1989 .