Skip to main content
SpringerLink
Log in

On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

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 router. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. N. M. A. Ayad and F. A. Mohamed. Performance analysis of a cut-through vs. packet-switching techniques. In Proceedings of the Second IEEE Symposium on Computers and Communications, pp. 230–234, 1997.

  2. Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell. On update algorithms for quickest paths. Computer Communications, 23: 1064–1068.

  3. Y. C. Bang, S. Radharkrishnan, N. S. V. Rao, and S. G. Batsell. On multicasting with minimum end-to-end delay. ICCCN 1999, 604–609, 1999.

    Google Scholar 

  4. Y. L. Chen and Y. H. Chin, The quickest path problem. Computers and Operations Research, 17(2): 153–161.

  5. T. H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1996.

  6. Y. C. Hung and G. H. Chen, Distributed algorithms for the quickest path problem. Parallel Computing, 18: 823–834.

  7. B. K. Kadaba and J. M. Jaffe. Routing to multiple destinations in computer networks. IEEE Transactions on Communicaitons, COM-31, 3: 343–351, 1983.

    Google Scholar 

  8. P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3(4): 1979.

  9. V. P. Kompella, J. C. Pasquale, and G. C. Polyzoa. Multicast routing for multimedia communications. IEEE/ACM Transactions on Networking, 1(3): 286–292, 1993.

    Article  Google Scholar 

  10. E. Q. V. Martins and J. L. E. Santos. An algorithms for the quickest path problem. Operation Research Letters, 20: 195–198.

  11. Y. Mingyao and L. M. Ni. Design of scalable and multicast capable cut-through switches for high-speed LANs. In Proceedings of the 1997 International Conference on Parallel Processing, pp. 324–332, 1997.

  12. J. F. Mollenauer. On the fastest routes for convoy-type traffic in flow-rate-constrained networks. Transportation Science, 10: 113–124, 1976.

    Google Scholar 

  13. S. Radharkrishan. Pipeline Routing Architecture in Wide Area Networks. Technical Report, University of Oklahoma, 2001.

  14. N. S. V. Rao and S. G. Batsell. Algorithm for minimum end-to-end delay paths. IEEE Communications Letters, 1(5): 152–154.

  15. J. B. Rosen, S. Z. Sun, and G. L. Xue. Algorithms for the quickest path problem and the enumeration of quickest paths. Computers and Operations Research, 18(6): 579–584.

  16. H. F. Salama, D. S. Reeves, and Y. Viniotis. Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Area in Communications, 15(3): 332–345, 1997.

    Article  Google Scholar 

  17. K. G. Shin and S. W. Daniel Analysis and implementation of hybrid switching. IEEE Transactions on Computers, 45(6): 684–692, 1996.

    Article  Google Scholar 

  18. H. Takahashi and A. Matsuyama. An approximate solution for the Steiner problem in graphs. Mathematica Japonica, 24(6): 573–577, 1980.

    Google Scholar 

  19. L. Tassiulas, Cut-through switching, pipelining, and scheduling for network evacuation. IEEE/ACM Transactions on Networking, 7(1): 88–97, Feb. 1999.

    Article  Google Scholar 

  20. B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6(9): 1988.

  21. G. Xue, End-to-End data paths: Quickest or most reliable?. IEEE Communications Letters, 2(6): 156–158.

  22. E. W. Zegura, K. L. Calvert, and M. J. Donahoo. A quantitative comparison of graph-based models for internet topology. IEEE/ACM Transactions on Networking, 5(6), 1997.

  23. Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves. A source-based algorithm for delay constrained minimum-cost multicasting. In Proceeding of INFOCOM, pp. 377–385, 1995.

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Computer Engineering, Sungkyunkwan University, Suwon, 440-746, Korea

    Young-Cheol Bang & Hyunseung Choo

Authors
  1. Young-Cheol Bang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyunseung Choo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Young-Cheol Bang.

Additional information

This work was supported in parts by BK21 and the Ministry of Information and Communication, Korea. Corresponding author: H. Choo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bang, YC., Choo, H. On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture. J Supercomput 33, 7–18 (2005). https://doi.org/10.1007/s11227-005-0217-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-005-0217-z

Keywords

Search

Navigation