Skip to main content

A Min-Max Hop-Count Based Self-discovering Method of a Bootstrap Router for the Bootstrap Mechanism in Multicast Routing

  • Conference paper
  • 453 Accesses

Abstract

In this paper, a min-max hop-count based self-discovering method of a Bootstrap Router (BSR) for the bootstrap mechanism in multicast routing is proposed and its performance is evaluated. The key for the proposed method is that the BSR is selected as to become a position such as almost equal distances from the other routers by the min-max hop-count way. Especially, the proposed method can reduce the processing time efficiently to discover a Rendezvous Point which plays a central role of the data transmission. Simulation results show that the proposed method can reduce the processing time by average more than 43% compared with that of the conventional one.

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

Buying options

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. Edwards, B.M., Giuliano, L.A., Wright, B.R.: Interdomain Multicast Routing. Addison-Wesley, Reading (2002)

    Google Scholar 

  2. Paul, P., Raghvan, S.V.: Survey of Multicast Routing Algorithm and Protocols. In: 15th Int’l. Conf. Computer Communication, pp. 902–926. IEEE Press, New York (2002)

    Google Scholar 

  3. Sahasrabuddhe, L.H., Mukherjee, B.: Multicast Routing Algorithms and Protocols: A Tutorial. IEEE Network 14(1), 90–102 (2000)

    Article  Google Scholar 

  4. Ramalho, M.: Intra- and Inter- Domain Multicast Routing Protocols: A Survey and Taxonomy. IEEE Communications Surveys & Tutorials 3(1), 2–25 (2000)

    Article  Google Scholar 

  5. Deering, S., Estrin, D., Farrinacci, D., Jacobson, V., Liu, C., Wei, L.: The PIM Architecture for Wide-Area Multicast Routing. IEEE/ACM Trans. Networking 4(2), 153–162 (1996)

    Article  Google Scholar 

  6. Fenner, W., Handley, M., Holbrook, H., Kouvelas, I.: Protocol Independent Multicast - Sparse Mode (PIM-SM): Protocol Specification (Revised). RFC 4601 (August 2006)

    Google Scholar 

  7. Estrin, D., Handly, M., Helmy, A., Huang, P., Thaler, D.: A Dynamic Bootstrap Mechanism for Rendezvous-Based Multicast Routing. In: IEEE 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 1999), vol. 3, pp. 1090–1098. IEEE Press, New York (1999)

    Google Scholar 

  8. Bhaskar, N., Gall, A., Lingard, J., Venaas, S.: Bootstrap Router (BSR) Mechanism for Protocol Independent Multicast (PIM). RFC 5059 (January 2008)

    Google Scholar 

  9. Takabatake, T.: A Hybrid Bootstrap Mechanism for Multicast Routing in PIM-SM. In: Australasian Telecommunication Networks and Applications Conference 2007 (ATNAC 2007), pp. 332–336. IEEE Press, New York (2007)

    Chapter  Google Scholar 

  10. Takabatake, T.: Evaluation of the Hybrid Bootstrap Mechanism for Multicast Routing. In: 2nd IEEE Int’l. Symp. Advanced Networks and Telecommunication Systems (IEEE ANTS 2008), pp. 1–3. IEEE Press, New York (2008)

    Chapter  Google Scholar 

  11. Savoa, P., Haberman, B.,: Embedding the Rendezvous Point (RP) Address in an IPv6 Multicast Address. RFC 3956 (November 2004)

    Google Scholar 

  12. Bista, B.B., Chakraborty, G., Takata, T.: An Efficient RP (Rendezvous Point) Replacement Mechanism for Rendezvous-Based Multicast Routing. In: 23rd Int’l. Conf. Distributed Computing Systems Workshops (ICDCSW 2003), pp. 514–518. IEEE Press, New York (2003)

    Google Scholar 

  13. Harutyunyan, H.A., Dong, X.: A New Algorithm for RP Selection in PIM-SM Multicast Routing. In: 3rd IASTED Int’l. Conf. Wireless and Optical Communications, pp. 566–571. ACTA Press (2003)

    Google Scholar 

  14. Lin, H.-C., Lin, Z.-H.: Selection of Candidate Cores for Core-Based Multicast Routing Architectures. In: IEEE Int’l. Conf. Communications (ICC 2002), vol. 1, pp. 2662–2666. IEEE Press, New York (2002)

    Google Scholar 

  15. Lin, Y.-D., Hsu, N.-B., Pan, C.-J.: Extension of RP Relocation to PIM-SM Multicast Routing. In: IEEE Int’l. Conf. Communications (ICC 2001), vol. 1, pp. 234–238. IEEE Press, New York (2001)

    Google Scholar 

  16. Gulati, A., Rai, S.: Core Discovery in Internet Multicast Routing Protocol. Int’l. J. Communication Systems. 12(5–6), 349–362 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Takabatake, T. (2011). A Min-Max Hop-Count Based Self-discovering Method of a Bootstrap Router for the Bootstrap Mechanism in Multicast Routing. In: Szabó, R., Zhu, H., Imre, S., Chaparadza, R. (eds) Access Networks. AccessNets 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20931-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20931-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20930-7

  • Online ISBN: 978-3-642-20931-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics