On Bandwidth Adjusted Multicast in Pipelined Routing Architecture for Mobile Environment

  • Young-Cheol Bang
  • Won-Seok Jang
  • ByungJun Ahn
  • Jin-Ho Hahm
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2668)


We have developed a novel algorithm to adjust link-bandwidths of a given multicast tree, which sends a message with size r from a source to a multiple destinations taking into consideration pipelined routing architecture for the mobile environment. The algorithm that we have developed tries to minimize the end-to-end delay time and resources such as bandwidths of a multicast tree, and performs admirably well in any given multicast tree. Our evaluation shows that the proposed algorithm dramatically reduces the end-to-end delay time and resources reserved to satisfy the time-constraints.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell, On update algorithms for quickest paths, Computer Communications, vol. 23, pp. 1064–1068.Google Scholar
  2. 2.
    B. K. Kadaba and J. M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communicaitons, COM-31, no. 3, pp. 343–351, 1983.Google Scholar
  3. 3.
    V. P. Kompella, J. C. Pasquale, and G. C. Polyzoa, Multicast routing for multimedia com-munications, IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 286–292, 1993.CrossRefGoogle Scholar
  4. 4.
    B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, 1988.Google Scholar
  5. 5.
    Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, A source-based algorithm for delay constrained minimum-cost multicasting, Proceedings of INFOCOM, pp. 377–385, 1995.Google Scholar
  6. 6.
    Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, MIT Press, 1996.Google Scholar
  7. 7.
    Hussein F. Salama, Doulas S. Reeves, and Yannis Viniotis, Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks, IEEE Journal on Selected Area in Communications, vol. 15, no. 3, 332–345, 1997.CrossRefGoogle Scholar
  8. 8.
    Y. C. Bang, S. Radharkrishnan, N. S. V. Rao, and S. G. Batsell, On Multicasting with Minimum End-to-End Delay, ICCCN, pp. 604–609, 1999.Google Scholar
  9. 9.
    H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Mathematica Japonica, vol. 24, no. 6, pp. 573–577, 1980.zbMATHMathSciNetGoogle Scholar
  10. 10.
    Ayad N.M.A., and Mohamed F.A., Performance analysis of a cut-through vs. packet-switching techniques, Proceedings of the Second IEEE Symposium on Computers and Communications, pp. 230–234, 1997.Google Scholar
  11. 11.
    Tassiulas L., Cut-through switching, pipelining, and scheduling for network evacuation IEEE/ACM Transactions on Networking, vol. 7, no. 1, pp. 88–97, 1999.CrossRefGoogle Scholar
  12. 12.
    Shin K.G. and Daniel S.W., Analysis and implementation of hybrid switching, IEEE Transactions on Computers, vol. 45, no. 6, pp. 684–692, 1996.zbMATHCrossRefGoogle Scholar
  13. 13.
    Mingyao Y., and Ni L.M., Design of scalable and multicast capable cut-through switches for high-speed LANs, Proceedings of the 1997 International Conference on Parallel Processing, pp. 324–332, 1997.Google Scholar
  14. 14.
    S. Radharkrishan, Pipeline Routing Architecture in Wide Area Networks, Technical Report, University of Oklahoma, 2001Google Scholar
  15. 15.
    P. Kermani and L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique, Computer Networks, vol. 3, no. 4, 1979.Google Scholar
  16. 16.
    Ellen W. Zegura, Kenneth L. Calvert, and Michael J. Donahoo, A quantitative comparison of graph-based models for internet topology, IEEE/ACM Transactions on Networking, vol. 5, no. 6, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Young-Cheol Bang
    • 1
  • Won-Seok Jang
    • 2
  • ByungJun Ahn
    • 2
  • Jin-Ho Hahm
    • 2
  1. 1.Department of Computer EngineeringKorea Polytechnic UniversityShihung-City, Kyunggi-DoKOREA
  2. 2.Network Technology LaboratoryElectronics and Telecommunications Research InstituteDaejeonKOREA

Personalised recommendations