Skip to main content
SpringerLink
Log in
Book cover

International Conference on Grid and Cooperative Computing

GCC 2003: Grid and Cooperative Computing pp 452–455Cite as

A Multicast Routing Algorithm for P2P Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3032))

Abstract

Multicast communication is one of particular important services in peer-to-peer networking context. The problem of finding a minimum cost multicast routing is NP-completeness. We present a novel solution to improve the MPH algorithm. The cost of multicast tree generated by the proposed algorithm with the same time as MPH is not larger than that of MPH in the worst case.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Winter, P.: Steiner problem in networks: a survey. Networks 17(2), 129–167 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Hwang, F.K.: Steiner tree problems. Networks 22(1), 55–89 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Salama, H.F., Reeves, D.S.: Evaluation of multicast routing algorithms for real-time communication on high speed networks. IEEE Journal on selected areas in communication 15(3), 332–349 (1997)

    Article  Google Scholar 

  4. Takahasi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica (24), 573–577 (1980)

    Google Scholar 

  5. Novak, R.: A note on distributed multicast routing in point-to-point networks. Computers and Operations Research 28(12), 1149–1164 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Smirnov, M.I.: Efficient multicast routing in high speed networks. Computer communications 19(1), 59–75 (1996)

    Article  Google Scholar 

  7. Wang, C.-F., et al.: Heuristic algorithms for packing of multiple-group multicasting. Computers and Operations Research 29(7), 905–924 (2002)

    Article  MATH  Google Scholar 

  8. Ramanathan, S.: Multicast tree generation in networks with asymmetric links. IEEE ACM Trans. On Networking 4(4), 558–568 (1996)

    Article  MathSciNet  Google Scholar 

  9. Han-bing, L., Jian-ping, Y., Wei-xin, X.: Locally Searching Minimum Path Cost Heuristic. Acta Electronica Sinsca 28(5), 92–95 (2000)

    Google Scholar 

  10. Guang-ming, H., LiLe-ming: A fast heuristic algorithm of minimum cost tree. Acta Electronica Sinsca 30(6), 880–882 (2002)

    Google Scholar 

  11. Waxman, M.: Routing of multipoint connections. IEEE Journal on Selected Areas in communication 6(9), 1617–1621 (1988)

    Article  Google Scholar 

  12. Dijkstra, E.N.: A note on two problems in connection with graphs. Numerische Mathematik 1(2), 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  13. Prim, R.C.: Shortest connection networks and some generalizations. Bell Systems Tech. (36), 1389–1401 (1957)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Electrical Engineering & Information, Technology China Three Gorges University, Yichang, 443000, China

    Tingyao Jiang & Aling Zhong

Authors
  1. Tingyao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aling Zhong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiatong University, 80 Dongcuan Road, 200240, Shanghai, China

    Minglu Li

  2. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, USA

    Xian-He Sun

  3. Department. of Computer Science, Shanghai Jiaotong University, 1954 HuaShan Road, 200030, Shanghai, P.R. China

    Qian-ni Deng

  4. Department of Computer Science, College of Liberal Arts, University of Iowa, 52242, Iowa City, IA, USA

    Jun Ni

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiang, T., Zhong, A. (2004). A Multicast Routing Algorithm for P2P Networks. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_83

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24679-4_83

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21988-0

  • Online ISBN: 978-3-540-24679-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation