On the departure process of burst aggregation algorithms in optical burst switching

We characterize analytically the departure process from the following three burst aggregation algorithms: the time based aggregation algorithm, the burst-length based aggregation algorithm and the time and burst-length based aggregation algorithm. The arrival process of packets is assumed to be Poisson or bursty modeled by an Interrupted Poisson Process (IPP). The analytic results are approximate and validation against simulation data showed that they have good accuracy.

[1]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[2]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[3]  T. Tachibana,et al.  Burst-cluster transmission: service differentiation mechanism for immediate reservation in optical burst switching networks , 2006, IEEE Communications Magazine.

[4]  Yannis Viniotis.  Probability and random processes for electrical engineers , 1997 .

[5]  M. Rodrigo.  An Analytical Study of Optical Burst Switching Aggregation Strategies , 2004 .

[6]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[7]  Harry G. Perros,et al.  Characterization of the Burst Aggregation Process in Optical Burst Switching , 2006, Networking.

[8]  An Ge,et al.  On optical burst switching and self-similar traffic , 2000, IEEE Communications Letters.

[9]  Jin Cao,et al.  Internet Traffic Tends Toward Poisson and Independent as the Load Increases , 2003 .

[10]  Nuno M. Garcia,et al.  Burst Assembly with Real IPv4 Data - Performance Assessement of Three Assembly Algorithms , 2006, NEW2AN.

[11]  Harry G. Perros.  Queueing networks with blocking , 1994 .

[12]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

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

[14]  X. Mountrouidou,et al.  Performance evaluation of an optical burst switching scheme for grid networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[15]  Raymond A. Marie,et al.  The uniformized power method for transient solutions of Markov processes , 1993, Comput. Oper. Res..

[16]  Chunming Qiao,et al.  Traffic statistics and performance evaluation in optical burst switched networks , 2004 .

[17]  Minho Kang,et al.  Dimensioning Burst Assembly Process in Optical Burst Switching Networks , 2005, IEICE Trans. Commun..

[18]  Christoph M. Gauger,et al.  Does burst assembly really reduce the self-similarity? , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[19]  Harry G. Perros.  Queueing Networks with Blocking: Exact and Approximate Solutions , 1994 .

[20]  S. Leigh,et al.  Probability and Random Processes for Electrical Engineering , 1989 .

[21]  Roy D. Yates,et al.  Probability and stochastic processes , 1998 .