Traffic Splitting and Its Application to Network-Wise Performance Analysis

Traffic in a network may split into several streams when passing through an intermediate node, e.g., router or switch. Then one question may arise: what do the resultant traffic streams become? Trying to answer such question, we characterize the split traffic routed by a probabilistic routing algorithm when the input traffic is modelled by a Markov-modulated Poisson process (MMPP) in this paper. We find out that each split traffic under such splitting mechanism is also an MMPP with a proper parameter modification which is investigated in this paper. After having characterized the split traffic, we apply the result to enable us to get network-wise performance measures, i.e., end-to-end sojourn delay and delay variance in networks employing probabilistic routing algorithms via an approximate approach. With the evidence of numerical experiments, we show that the accuracy for those performance measures remains in an acceptable region. Therefore, such network-wise performance tool may have widespread applications in networks, such as the Internet and asynchronous transfer mode (ATM) network.

[1]  Y. N. Singh,et al.  An Approach for Performance Analysis of Discrete-Time Finite Capacity Open Queuing Network with Correlated arrivals , 2000 .

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

[3]  S. Bahk,et al.  Preventive congestion control based routing in ATM networks , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

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

[5]  Offer Kella Markov-modulated Feedforward Fluid Networks , 2001, Queueing Syst. Theory Appl..

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

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

[8]  Victor O. K. Li,et al.  Flow assignment and packet scheduling for multipath networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  P. Skelly,et al.  A histogram-based model for video traffic behavior in an ATM multiplexer , 1993, TNET.

[10]  Victor O. K. Li,et al.  Generalized load sharing for packet-switching networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[11]  Armin Heindl Decomposition of general tandem queueing networks with MMPP input , 2001, Perform. Evaluation.

[12]  John A. Silvester,et al.  An approach to path-splitting in multipath networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[13]  William Stallings,et al.  High-Speed Networks and Internets: Performance and Quality of Service , 2002 .

[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]  Jin-Fu Chang,et al.  Connection-wise end-to-end performance analysis of queueing networks with MMPP inputs , 2001, Perform. Evaluation.

[16]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

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