Output Process Analysis of the Peak Cell Rate Monitor Algorithm

The monitoring of traac streams in ATM networks is one of the crucial actions which a r e performed to avoid network congestion and to beable to guarantee the users a desired grade of service. In this paper, we derive the exact cell inter-departure time distribution from the peak cell rate monitor algorithm as proposed by the CCITT (ITU-TSS) in Draft Rec. I.371 7]. For input cell streams which follow a general independent distribution, we compute the distribution of the time that is expected by the monitor algorithm to pass until the next cell arrives. This distribution is derived by a discrete-time iteration and using this distribution, the cell inter-departure time distribution is given in closed form. We present some numerical examples which show how the inter-cell distributions are altered by passing the monitor algorithm.

[1]  Hermann Gold,et al.  Multi Server Batch Service Systems in Push and Pull Operating Mode - a Performance Comparison , 1991 .

[2]  Miroslaw Kowaluk,et al.  Vector Language: Simple Description of Hard Instances (Extended Abstract) , 1990, MFCS.

[3]  Michael R. Frater,et al.  A Comparison of Models for VBR Video Traffic Sources in B-ISDN , 1994, Broadband Communications.

[4]  Phuoc Tran-Gia,et al.  Discrete-time analysis of cell spacing in ATM systems , 1994, Telecommun. Syst..

[5]  Heribert Vollmer,et al.  Classes of Counting Functions and Complexity Theoretic Operators , 1996 .

[6]  Ulrich Hertrampf.  Locally Definable Acceptance Types - The Three-Valued Case , 1992, LATIN.

[7]  N Gerlich,et al.  Reducing the Variance of Sojourn times in Queueing Networks with Overtaking , 1993 .

[8]  Ronald V. Book.  On Random Oracle Separations , 1991, Inf. Process. Lett..

[9]  Celia Wrathall.  Confluence of One-Rule Thue Systems , 1990, IWWERT.

[10]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Heribert Vollmer,et al.  The Complexity of Finding Middle Elements , 1993, Int. J. Found. Comput. Sci..

[12]  Hermann Gold,et al.  Performance Analysis of a Batch Service System , 1994 .

[13]  J.-P. Coudreuse,et al.  Spacing cells protects and enhances utilization of ATM network links , 1992, IEEE Network.

[14]  Masayuki Murata,et al.  Analysis of Interdeparture Processes for Bursty Traffic , 1991 .

[15]  H. Ahmadi,et al.  Analysis of a discrete-time G/sup (X)//D/1-S queueing system with applications in packet-switching systems , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[16]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[17]  Sajal K. Das,et al.  Incomplete Hypercubes: embeddings of Tree-Related Networks , 1995, J. Parallel Distributed Comput..

[18]  Phuoc Tran-Gia,et al.  Approximate Performance Analysis of the DQDB Acess Protocol , 1990, Comput. Networks ISDN Syst..

[19]  Eric Allender,et al.  On the Power of Uniform Families of Constant Depth Treshold Circuits , 1990, MFCS.

[20]  T. Fritsch,et al.  Communication network routing using neural nets-numerical aspects and alternative approaches , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[21]  P. Tran-Gia,et al.  A discrete time analysis of the DQDB access protocol with general input traffic , 1990, SBT/IEEE International Symposium on Telecommunications.

[22]  F Hh.  Autocorrelation and Power Density Spectrum of Atm Multiplexer Output Processes , 1992 .

[23]  Phuoc Tran-Gia,et al.  An Analysis of Multi-Service Systems with Trunk Reservation Mechanisms , 1992 .

[24]  Phuoc Tran-Gia,et al.  Structure and Performance of Neural Nets in Broadband System Admission Control , 1994 .

[25]  Riccardo Melen,et al.  On the Limit Behaviour of the ATM Traffic within a Network , 1993, Integrated Broadband Communications.

[26]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[27]  Jack H. Lutz,et al.  On Complexity Classes and Algorithmically Random Languages (Extended Abstract) , 1992, STACS.

[28]  R. Melen,et al.  On the modification of the cell streams within an ATM network , 1993, Proceedings of GLOBECOM '93. IEEE Global Telecommunications Conference.

[29]  Phuoc Tran-Gia,et al.  Performance of a neural net scheduler used in packet switching interconnection networks , 1993, IEEE International Conference on Neural Networks.

[30]  F. H. Ubner.  Analysis of a nite capacity asynchronous multiplexer with periodic sources , 1990 .

[31]  Krzysztof Lorys,et al.  The Variable Membership Problem: Succinctness Versus Complexity , 1994, STACS.

[32]  Conny Friedewald,et al.  WUMPS, Würzburger Message Passing System , 1990, Transputer-Anwender-Treffen.

[33]  Phuoc Tran-Gia,et al.  Basic Concepts and Performance of High-Speed Protocols , 1993, Integrated Broadband Communications.

[34]  F Hh,et al.  Dimensioning of a Peak Cell Rate Monitor Algorithm Using Discrete-time Analysis , 1993 .

[35]  Phuoc Tran-Gia.  Analysis of polling systems with general input process and finite capacity , 1992, IEEE Trans. Commun..

[36]  F Hh,et al.  Queueing Analysis of Resource Dispatching and Scheduling in Multi-media Systems , 1991 .

[37]  Phuoc Tran-Gia,et al.  Performance analysis of a batch service queue arising out of manufacturing system modelling , 1993, Queueing Syst. Theory Appl..

[38]  Ulrich Hertrampf.  Locally Definable Acceptance Types for Polynomial Time Machines , 1992, STACS.

[39]  M. Ritter,et al.  Blocking in Multi-service Broadband Systems with Cbr and Vbr Input Traac , 1992 .

[40]  Frank Puppe,et al.  COKE: efficient solving of complex assignment problems with the propose-and-exchange method , 1992, Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92.

[41]  R. Dittmann,et al.  Discrete-time Analysis of a Cyclic Service System with Gated Limited Service , 1993 .

[42]  F Hh,et al.  Discrete-time Analysis of the Output Process of an Atm Multiplexer with Periodic Input , 1991 .

[43]  Lane A. Hemaspaandra,et al.  Using Inductive Counting to Simulate Nondeterministic Computation , 1990, MFCS.

[44]  Manfred Mittler,et al.  Triggering Scheduler , 1993 .