Simple Multicast: A Design for Simple, Low-Overhead Multicast

Document Type Expired Internet-Draft (individual)
Last updated 1999-10-27
Stream (None)
Intended RFC status (None)
Expired & archived
plain text pdf html
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


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


Radia Perlman (
Jon Crowcroft (
Anthony Ballardie (
Thomas Maufer (
Mark 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.)