Modeling and Performance Comparison of Policing Mechanisms for ATM Networks

Asynchronous transfer mode (ATM) networks, as proposed by CCITT as the solution for the future broadband ISDN, will provide high flexibility with respect to the varying bandwidth requirements of the different services. They will also support variable bit rates within a connection. The packetized information transfer, without flow control between the user and the network, in combination with the asynchronous multiplexing principle, results in a need to control the individual cell stream during the entire duration of the calls to ensure an acceptable quality of service for all coexisting calls sharing the same network resources. This kind of control will be provided by introducing a policing or usage parameter control function. Basic design objectives and requirements for such a function are described. These requirements serve as a basis for the comparison of some of the mechanisms proposed so far, namely the leaky bucket, the jumping window, the triggered jumping window, the moving window, and the exponentially weighted moving average mechanisms. >

[1]  R. Lehnert,et al.  The 'policing function' to control user access in ATM networks-definition and implementation , 1988, ISSLS 88., International Symposium on Subscriber Loops and Services.

[2]  David M. Lucantoni,et al.  Bandwidth Management: A Congestion Control Strategy for Broadband Packet Networks - Characterizing the Throughput-Burstiness Filter , 1990, Comput. Networks ISDN Syst..

[3]  D. V. Lindley,et al.  Stochastic Service Systems. , 1963 .

[4]  F Schoute SIMPLE DECISION RULES FOR ACCEPTANCE OF MIXED TRAFFIC STREAMS , 1988 .

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

[6]  Luigi Fratta,et al.  ATM: bandwidth assignment and bandwidth enforcement policies , 1989, IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond.

[7]  Roger C. F. Tucker,et al.  Accurate method for analysis of a packet-speech multiplexer with limited delay , 1988, IEEE Trans. Commun..

[8]  G. M. Jenkins,et al.  Stochastic Service Systems. , 1964 .

[9]  J. Filipiak,et al.  M-architecture: a structural model of traffic management and control in broadband ISDNs , 1989, IEEE Communications Magazine.

[10]  Gunnar Karlsson,et al.  Performance models of statistical multiplexing in packet video communications , 1988, IEEE Trans. Commun..

[11]  Israel Cidon,et al.  Congestion control through input rate regulation , 1993, IEEE Trans. Commun..

[12]  E. Desmet,et al.  The policing function in an ATM network , 1990, International Zurich Seminar on Digital Communications, Electronic Circuits and Systems for Communications..

[13]  Hirokazu Ohnishi,et al.  Flow control schemes and delay/loss tradeoff in ATM networks , 1988, IEEE J. Sel. Areas Commun..

[14]  Carsten Rasmussen,et al.  A Simple Call Acceptance Procedure in an ATM Network , 1990, Comput. Networks ISDN Syst..

[15]  Janusz Filipiak Structured systems analysis methodology for design of an ATM network architecture , 1989, IEEE J. Sel. Areas Commun..

[16]  Zbigniew Dziong,et al.  Admission Control and Routing in ATM Networks , 1990, Comput. Networks ISDN Syst..

[17]  David M. Lucantoni,et al.  A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..

[18]  Joseph Y. Hui Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[19]  P. Henrici Fast Fourier Methods in Computational Complex Analysis , 1979 .

[20]  E. P. Rathgeb,et al.  The poucing function in atm networks , 1990, International Symposium on Switching.