Simple Multicast: A Design for Simple, Low-Overhead Multicast
draft-perlman-simple-multicast-03
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Radia Perlman , Jon Crowcroft , Anthony J. Ballardie , Thomas A. Maufer , Mark A. Green , Christophe Diot , Cheng-Yin Lee , Joseph Thoo | ||
Last updated | 1999-10-27 | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This paper describes a design for multicast that is simple to understand and low enough overhead for routers that a single scheme can work both within and between domains. It also eliminates the need for coordinated multicast address allocation across the Internet. It is not very different from the tree-based schemes CBT, PIM-SM, and BGMP. Essentially all of the mechanisms to support this have already been implemented in the other designs. The contribution of this protocol is in what is NOT required to be implemented. The main idea for simplifying multicast is to consider the identity of a group to be the 8-byte combination of a
Authors
Radia Perlman
Jon Crowcroft
Anthony J. Ballardie
Thomas A. Maufer
Mark A. Green
Christophe Diot
Cheng-Yin Lee
Joseph Thoo
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)