Using maximum entropy principle for output burst characterization of an ATM switch

Maximum Entropy Principle is used in deriving an approximate expression for the burst length of a taggedcall at the output of an ATM switch. The statistical multiplexer is approximated as a variable server, infinite buffer queuing system with only cells from the tagged call as clients where each incoming cell sees the server in randomly variable vacations. Numerical experiments are carried out and compared with the simulation results.

[1]  San-qi Li,et al.  Traffic analysis in large-scale high-speed integrated networks: validation of nodal decomposition approach , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[2]  Chuan Wang,et al.  Interdeparture processes of traffic from ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[3]  Demetres D. Kouvatsos,et al.  ME-Based Approximations for General Discrete-Time Queueing Models , 1994, Perform. Evaluation.

[4]  Rodney W. Johnson,et al.  Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.

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

[6]  A. G. Wilson,et al.  The Use of the Concept of Entropy in System Modelling , 1970 .

[7]  Ioannis Stavrakakis,et al.  Efficient Modeling of Merging and Splitting Processes in Large Networking Structures , 1991, IEEE J. Sel. Areas Commun..

[8]  Israel Cidon,et al.  Dispersed messages in discrete-time queues: delay, jitter and threshold crossing , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[9]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[10]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[11]  Pravin Varaiya,et al.  Burstiness bounds for some burst reducing servers , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[12]  Pravin Varaiya,et al.  A simple theory of traffic and resource allocation in ATM , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[13]  Masayuki Murata,et al.  Analysis of Interdeparture Processes for Bursty Traffic in ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[14]  V. Ramaswami.  The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

[15]  Fabrice Guillemin,et al.  Jitter in ATM Networks and its Impact on Peak Rate Enforcement , 1992, Perform. Evaluation.

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

[17]  Chatschik Bisdikian,et al.  Jitter calculus in ATM networks: multiple node case , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  Chatschik Bisdikian,et al.  Jitter calculus in ATM networks: single node case , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

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

[20]  J. W. Wong,et al.  The effect of multiplexing, switching and other factors on the performance of broadband networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.