On the Performance Improvement Achieved by Packet Dispersion

This paper analytically studies performance improvement achieved by packet dispersion. Contrary to the previous work on packet dispersion, we consider the tail distribution of queue length and that of packet delay as performance measures, and we model a packet network as multiple parallel queues where the arrival processes from sources are not renewal but highly bursty. To appropriately evaluate the performance improvement achieved by packet dispersion, we develop approximate formulas to estimate the tail distributions. Our approximate formulas yield more accurate estimations than the standard approximate formulas. In the numerical results, we observe that packet dispersion can greatly improve the delay performance of packets. We also see that packet-level load balancing is superior to flow-level load balancing for any distribution ratio.

[1]  Egbert Falkenberg,et al.  On the asymptotic behaviour of the stationary distribution of Markov chains of M/G/1-type , 1994 .

[2]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

[3]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[4]  Tetsuya Takine,et al.  Bounds for the tail distribution in a queue with a superposition of general periodic Markov sources: theory and application , 2000, Queueing Syst. Theory Appl..

[5]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[6]  Oliver W. W. Yang,et al.  Load balancing of multipath source routing in ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[7]  Tak-Shing Peter Yum,et al.  Resequencing of messages in communication networks , 1986, IEEE Trans. Commun..

[8]  Jonathan M. Smith,et al.  Striping within the network subsystem , 1995, IEEE Netw..

[9]  Lars Dittmann,et al.  String Mode-A New Concept for Performance Improvement of ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[10]  Cheng-Shang Chang,et al.  Performance guarantees in communication networks , 2000, Eur. Trans. Telecommun..

[11]  Parviz Kermani,et al.  Analysis of a Resequencing problem in Communication Networks , 1983, INFOCOM.

[12]  Khosrow Sohraby,et al.  On the asymptotic behavior of heterogeneous statistical multiplexer with applications , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[13]  Hanoch Levy,et al.  Packet dispersion and the quality of voice over IP applications in IP networks , 2004, IEEE INFOCOM 2004.

[14]  E. Gustafsson,et al.  A literature survey on traffic dispersion , 1997 .

[15]  Nicholas F. Maxemchuk,et al.  Dispersity Routing in High-Speed Networks , 1993, Comput. Networks ISDN Syst..

[16]  Zheng Li,et al.  Multipath routing modeling in ad hoc networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[17]  Tetsuya Takine,et al.  Bounds for the tail distribution in a queue with the superposition of general periodic Markov sources , 1997, Proceedings of INFOCOM '97.

[18]  Ward Whitt,et al.  Squeezing the Most Out of ATM , 1995, IEEE Trans. Commun..

[19]  George Varghese,et al.  A Reliable and Scalable Striping Protocol , 1996, SIGCOMM.

[20]  Anindo Banerjea.  Simulation Study of the Capacity Effects of Dispersity Routing for Fault Tolerant Realtime Channels , 1996, SIGCOMM.

[21]  Fumio Ishizaki,et al.  Loss probability in a finite queue with service interruptions and queue length distribution in the corresponding infinite queue , 2006, Perform. Evaluation.

[22]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[23]  Ram Krishnan,et al.  Choice of allocation granularity in multipath source routing schemes , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[24]  Zygmunt J. Haas,et al.  Multipath routing in the presence of frequent topological changes , 2001, IEEE Commun. Mag..