Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Flow Assignment and Packet Scheduling for Multipath Routing

  • Leung, Ka-Cheong (Department of Computer Science, Texas Tech University) ;
  • Victor O. K. Li (Department of Electrical and Electronic Engineering, University of Hong Kong)
  • Published : 2003.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.

Keywords

References

  1. S. N. Chiou and V. O. K. Li, 'Diversity transmissions in a communication network with unreliable components,' in Proc. IEEE ICC '87, vol. 2,Seattle, WA, USA, 7-10 June 1987, PP. 968-973
  2. J. H. Dejean, L. Dittmann, and C. N. Lorenzen, 'String mode - A newconcept for performance improvement of ATM networks,' IEEE J. Select.Areas Commun., vol. 9, no. 9, pp. 1452-1460, Dec. 1991 https://doi.org/10.1109/49.108682
  3. E. Gustafsson and G. Karlsson, 'A literature survey on traffic dispersion,'IEEE Network, vol. 11, no. 2, pp. 28-36, Mar.-Apr. 1997 https://doi.org/10.1109/65.580915
  4. K.-C. Leung and V. 0. K. Li, 'Generalized load sharing for packet-switching networks,' in Proc. ICNP 2000, Osaka, Japan, 14-17 Nov. 2000,pp.305-314
  5. N. F. Maxemchuk, 'Dispersity routing,' in Proc. IEEEICC '75, San Francisco, CA, USA, June 1975, pp. 41-10 - 41-13
  6. N. F. Maxemchuk, 'Dispersity routing in high-speed networks,' ComputerNetworks and ISDN Systems, vol. 25, no. 6, pp. 645-661, Jan. 1993 https://doi.org/10.1016/0169-7552(93)90059-D
  7. W. Stallings, High-Speed Nefworks: TCP/IP and ATM Desisn Principles,Prentice-Hall International, Inc., 1998
  8. V. 0. K. Li and W. Liao, 'Distributed multimedia systems,' Proc. IEEE, vol. 85, no. 7, July 1997, pp. 1063-1108 https://doi.org/10.1109/5.611116
  9. J. Beran et. cl., 'Long-range dependence in variable-bit-rate video traffic,'IEEE Trans. Commun., vol. 43, no. 2-4, pp. 1566-1579, Feb.-Apr. 1995 https://doi.org/10.1109/26.380206
  10. W. E. Leland, et. at., 'On the self-similar nature of ethernet traffic (extended version),' IEEE/ACM Trans. Networking. vol. 2, no. 1, pp. 1-15,Feb.1994 https://doi.org/10.1109/90.282603
  11. A. Erramilli, 0. Narayan, and W. Willinger, 'Experimental queueing analysis with long-range dependent packet traffic,' IEEE/ACM Trans. Networking, vol. 4, no. 2, pp. 209-223, Apr. 1996 https://doi.org/10.1109/90.491008
  12. D. Bertsekas and R. Gallager, Data Networks, Second Edition. PrenticeHall, 1992
  13. K.-C. Leung and V. 0. K. Li, 'Plow assignment and packet schedulingfor multipath networks,' in Proc. IEEE GLOBECOM '99, vol. 1, Rio deJaneiro, RJ, Brazil, 5-9 Dec. 1999, PP. 246-250
  14. S. Vutukury and J. J. Garcia-Luna-Aceves, 'A simple approximationto minimum-delay routing,' Computer Communication Review, vol. 29,no. 4, pp. 227-238, Oct. 1999 https://doi.org/10.1145/316194.316227
  15. D. A. Khotimsky, 'A packet resequencing protocol for fault-tolerant multipath transmission with non-uniform traffic splitting,' in Proc. IEEEGLOBECOM '99, vol. 2, Rio de Janeiro, RJ, Brazil, 5-9 Dec. 1999,pp. 1283-1289
  16. H. Adiseshu, G. Varghese, and G. Parulkar., 'An architecture for packet-striping protocols,' ACM Trans. Computer Systems, vol. 17, no. 4,pp. 249-287, Nov. 1999 https://doi.org/10.1145/329466.329471
  17. S. Chen and K. Nahrstedt, 'An overview of quality of service routing fornext-generation high-speed networks: Problems and solutions,' lEEE Network, vol. 12, no. 6, pp. 64-79, Nov.-Dec. 1998
  18. T. T. Lee, S. C. Liew, and Q.-L. Ding, 'Parallel communications forATM network control and management,' Performance Evaluation, vol. 30,no. 4, pp. 243-264, Oct. 1997 https://doi.org/10.1016/S0166-5316(96)00064-8
  19. S. Bahk and M. E. Zarki, 'Preventive congestion control based routing inATM networks,' in Proc. IEEE ICC '94, vol. 3, New Orleans, LA, USA1-5 May 1994, pp. 1592-1599
  20. R. Krishnan and J. A. Silvester, 'An approach to path-splitting in multipath networks,' in Proc. IEEE ICC '93, vol. 3, Geneva, Switzerland23-26 May 1993, pp. 1353-1357 https://doi.org/10.1109/ICC.1993.397509
  21. D. G. Luenberger, Linear and Nonlinear Programming, Second Edition,Addison-Wesley, 1984
  22. C. G. Cassandras, M. V. Abidi, and D. Towsley, 'Distributed routing withon-line marginal delay estimation,' IEEE Trans. Commun., vol. 38, no. 3pp. 348-359, Mar. 1990 https://doi.org/10.1109/26.48893
  23. Y. Arian and Y. Levy, 'Algorithms for generalized roundrobin routing,' Operations Research Letters, vol. 12, no. 5,pp. 313-319, Nov. 1992 https://doi.org/10.1016/0167-6377(92)90091-G
  24. K.-C. Leung and V. 0. K. Li, 'A resequencing model for high speednetworks,' in Proc. IEEE ICC '99, vol. 2, Vancouver, BC, Canada, 6-lO June 1999, pp. 1239-1243
  25. L. Kleinrock, Queueing Systems (Votume I: Theory), John Wiley & Sons,1975
  26. W. W. Hines and D. C. Montgomery, Probability and Statistics in Engineering and Management Science, Third Edition, John Wiley & Sons,1990
  27. F. Y. S. Lin, 'Allocation of end-to-end delay objectives for networks supporting SMDS,' in Proc. IEEE GLOBECOM '93, vol. 3, Houston, TXUSA, Nov. 29-Dec. 2, 1993, pp. 1346-1350