Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs

A systematic method for link/connection-wise end-to-end performance evaluation in queueing networks receiving heterogeneous Markov-modulated Poisson processes (H-MMPPs) is proposed. The method consists of (i) connection-wise nodal performance analysis; (ii) tagged departure process analysis; and (iii) moment matching. For the tagged departure process of an H-MMPPs/G/1 queue, we propose two decomposition schemes to approximate the output process of a tagged traffic stream which is mixed with other traffic streams. A moment matching method is further proposed to emulate the tagged output process as a two-state MMPP. The adjacent down-stream node along a reference connection can be then modeled as an H-MMPPs/G/1 queue. Recursively performing (i)‐(iii), the end-to-end performance of a reference connection is obtained. The methodology developed in this paper can be applied to packet-switched high-speed networks, especially to asynchronous transfer mode (ATM) networks. © 2001 Elsevier Science B.V. All rights reserved.

[1]  C. H. Ng,et al.  Modelling multimedia traffic over ATM using MMBP , 1997 .

[2]  Alberto Leon-Garcia,et al.  A simulation study of delay and delay variation in ATM networks .I. CBR traffic , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[3]  Paul J. Kühn.  Reminder on queueing theory for ATM networks , 1996, Telecommun. Syst..

[4]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[5]  Yoshitaka Takahashi,et al.  Switched Batch Bernoulli Process (SBBP) and the Discrete-Time SBBP/G/1 Queue with Application to Statistical Multiplexer Performance , 1991, IEEE J. Sel. Areas Commun..

[6]  Raif O. Onvural,et al.  Asynchronous Transfer Mode Networks: Performance Issues, Second Edition , 1993 .

[7]  David E. McDysan,et al.  ATM: Theory and Application , 1994 .

[8]  Paul G. Hoel,et al.  Introduction to Probability Theory , 1972 .

[9]  M. Neuts.  A Versatile Markovian Point Process , 1979 .

[10]  A. Adas,et al.  Traffic models in broadband networks , 1997, IEEE Commun. Mag..

[11]  Hans Kröner,et al.  Approximate analysis of the end-to-end delay in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[12]  Anatol Kuczura,et al.  The interrupted poisson process as an overflow process , 1973 .

[13]  H. Heffes,et al.  A class of data traffic processes — covariance function characterization and related queuing results , 1980, The Bell System Technical Journal.

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

[15]  Khosrow Sohraby,et al.  End-to-end jitter analysis in networks of periodic flows , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[17]  Peter G. Harrison,et al.  Performance modelling of communication networks and computer architectures , 1992, International computer science series.

[18]  Dooyeong Park,et al.  Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss , 1994, Oper. Res. Lett..

[19]  Moshe Zukerman,et al.  Queueing performance of a tree type ATM network , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[20]  Younghan Kim,et al.  Performance analysis of statistical multiplexing for heterogeneous bursty traffic in an ATM network , 1994, IEEE Trans. Commun..

[21]  Wolfgang Fischer,et al.  The interdeparture-time distribution for each class in the ∑iMi/Gi/1 queue , 1989, Queueing Syst. Theory Appl..

[22]  Jon W. Mark,et al.  End-to-end performance in ATM networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[23]  George D. Stamoulis,et al.  Traffic source models for ATM networks: a survey , 1994, Comput. Commun..

[24]  Jin-Fu Chang,et al.  Departure Processes of BMAP/G/1 Queues , 2001, Queueing Syst. Theory Appl..

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

[26]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[27]  Wolfgang Fischer,et al.  The Markov-Modulated Poisson Process (MMPP) Cookbook , 1993, Perform. Evaluation.

[28]  M. Neuts,et al.  A SINGLE-SERVER QUEUE WITH SERVER VACATIONS AND A CLASS OF NON-RENEWAL ARRIVAL PROCESSES , 1990 .

[29]  R. F. Brown,et al.  PERFORMANCE EVALUATION , 2019, ISO 22301:2019 and business continuity management – Understand how to plan, implement and enhance a business continuity management system (BCMS).

[30]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[31]  Eytan Modiano,et al.  A simple analysis of average queueing delay in tree networks , 1996, IEEE Trans. Inf. Theory.

[32]  Jin-Fu Chang,et al.  Connection-Wise End-to-End Delay Analysis in ATM Networks , 2000 .