skip to main content
10.1145/1280940.1281051acmconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
Article

An efficient rendezvous point recovery mechanism in multicasting networks

Published:12 August 2007Publication History

ABSTRACT

PIM multicast network is very convenient and can be fully applied in applications that provide one-to-many services, such as video conference, online games and real time voice stream, etc. The key point is the share tree environment formed by Rendezvous Point (RP) and Core node. When RP node fails, the share tree network will solve the crash. In this paper, an efficient bootstrap router (BSR) based RP mechanism was proposed to solve the RP recovery problem in share tree network of PIM while the RP fails.

References

  1. Brisco, T. DNS support for Loading Balancing. RFC 1794, Apr. 1995.Google ScholarGoogle Scholar
  2. Cisco Systems, Inc. Configuring a Rendezvous Point. Cisco IP Multicast Solutions documentation, http://www.cisco.com/univercd/cc/td/doc/cisintwk/intsolns/mcst_sol/rps.pdf, Mar. 2002.Google ScholarGoogle Scholar
  3. Estrin, D., Farinacci, D., Helmy, A., Thaler, D., Deering, S., Handley, M., Jacobson, V., Liu, C., Sharma, P., and Wei, L. Protocol Independent Multicast-Sparse Mode (PIM-SM):Protocol Specification. RFC 2362, Jun. 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Farinacci, D., and Cai, Y. Anycast-RP using PIM. draft-ietf-pim-anycast-rp-07.txt, Feb. 2006.Google ScholarGoogle Scholar
  5. Lin, H.C., and Lin, Z.H. Selection of candidate core for core based multicast routing architectures. IEEE International Conference on Communications, ICC 2002, 2002, 2662--2666.Google ScholarGoogle Scholar
  6. Lin, Y.D., Hsu, N.B., and Pan, C.J. Extension of RP relocation to PIM-SM multicast routing. IEEE International Conference on Communications, ICC 2001, 2001, 234--238.Google ScholarGoogle Scholar
  7. Liu, B.H., Tsai, M.J., and Ko, W.C. Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks. Advanced Information Networking and Applications, AINA 2005, 2005, 90--95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Partridge, C., Mendez, T., and Milliken, W. Host Anycasting Service. RFC 1546, Nov. 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Zhang, B., and Mouftah, H.T. Providing Multicast through Recursive Unicast. IEEE Communication Magazine, 43, 1 (Jan. 2005), 115--121. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An efficient rendezvous point recovery mechanism in multicasting networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      IWCMC '07: Proceedings of the 2007 international conference on Wireless communications and mobile computing
      August 2007
      716 pages
      ISBN:9781595936950
      DOI:10.1145/1280940

      Copyright © 2007 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 August 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader