Designed by
../epic_logo.gif (359 bytes)
EPIC
SOLUTIONS INTERNATIONAL



SIGCOMM 1998 LOGO The MASC/BGMP Architecture for Inter-domain Multicast Routing
Satish Kumar (ISI/USC), Pavlin Radoslavov (ISI/USC), David Thaler (Merit Network, Inc) Cengiz Alaettinoglu (ISI/USC), Deborah Estrin (ISI/USC), and Mark Handley (ISI/USC)

Multicast routing enables efficient data distribution to multiple recipients. However, existing work has concentrated on extending single-domain techniques to wide-area networks, rather than providing mechanisms to realize inter-domain multicast on a global scale in the Internet.

We describe an architecture for inter-domain multicast routing that consists of two complementary protocols. The Multicast Address-Set Claim (MASC) protocol forms the basis for a hierarchical address allocation architecture. It dynamically allocates to domains multicast address ranges from which groups initiated in the domain get their multicast addresses. The Border-Gateway Multicast Protocol (BGMP), run by the border routers of a domain, constructs inter-domain bidirectional shared trees, while allowing any existing multicast routing protocol to be used within individual domains. The resulting shared tree for a group is rooted at the domain whose address range covers the group's address; this domain is typically the group initiator's domain. We demonstrate the feasibility and performance of these complementary protocols through simulation. This architecture, together with existing protocols operating within each domain, is intended as a framework in which to solve the problems facing the current multicast addressing and routing infrastructure.

The slides from the presentation are available here in Powerpoint or Adobe Portable Document Format (PDF)


ACM Copyright Notice: Copyright (c) 1998 by Association for Computing Machinery, Inc. (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 the copies are not made or distributed for profit or commercial advantage and that the copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permission to publish from: Publications Dept. ACM, Inc. Fax +1 212 869 0481 or email <permissions@acm.org>.

The referenced paper is in Computer Communication Review, a publication of ACM SIGCOMM, volume 28, number 4, October 1998. ISSN # 0146-4833.

This electronic facsimile may differ slighty from the printed version. It has may have been reformated to better support electronic viewing. Therefore, please use the printed version when referencing layout details, such as page numbers.

This paper is available in Postscript and Adobe Portable Document Format (PDF)

Get Acrobat Reader Get Microsoft Powerpoint Viewer, Get Ghostview Ghostview