Browse Prior Art Database

Core Based Trees (CBT) Multicast Routing Architecture (RFC2201)

IP.com Disclosure Number: IPCOM000002759D
Original Publication Date: 1997-Sep-01
Included in the Prior Art Database: 2019-Feb-15
Document File: 15 page(s) / 23K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

A. Ballardie: AUTHOR

Related Documents

10.17487/RFC2201: DOI

Abstract

CBT is a multicast routing architecture that builds a single delivery tree per group which is shared by all of the group's senders and receivers. This memo defines an Experimental Protocol for the Internet community.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 9% of the total text.

Network Working Group A. Ballardie Request for Comments: 2201 Consultant Category: Experimental September 1997

Core Based Trees (CBT) Multicast Routing Architecture

Status of this Memo

This memo defines an Experimental Protocol for the Internet community. This memo does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited.

Abstract

CBT is a multicast routing architecture that builds a single delivery tree per group which is shared by all of the group’s senders and receivers. Most multicast algorithms build one multicast tree per sender (subnetwork), the tree being rooted at the sender’s subnetwork. The primary advantage of the shared tree approach is that it typically offers more favourable scaling characteristics than all other multicast algorithms.

The CBT protocol [1] is a network layer multicast routing protocol that builds and maintains a shared delivery tree for a multicast group. The sending and receiving of multicast data by hosts on a subnetwork conforms to the traditional IP multicast service model [2].

CBT is progressing through the IDMR working group of the IETF. The CBT protocol is described in an accompanying document [1]. For this, and all IDMR-related documents, see http://www.cs.ucl.ac.uk/ietf/idmr

TABLE OF CONTENTS

1. Background................................................... 2 2. Introduction................................................. 2 3. Source Based Tree Algorithms................................. 3 3.1 Distance-Vector Multicast Algorithm...................... 4 3.2 Link State Multicast Algorithm........................... 5 3.3 The Motivation for Shared Trees.......................... 5 4. CBT - The New Architecture................................... 7 4.1 Design Requirements...................................... 7 4.2 Components & Functions................................... 8 4.2.1 CBT Control Message Retransmission Strategy........ 10 4.2.2 Non-Member Sending................................. 11 5. Interoperability with Other Multicast Routing Protocols ..... 11

Ballardie Experimental [Page 1]

RFC 2201 CBT Multicast Routing Architecture September 1997

6. Core Router Discovery........................................ 11 6.1 Bootstrap Mechanism Overview............................. 12 7. Summary ..................................................... 13 8. Security Considerations...................................... 13 Acknowledgements ............................................... 14 References ..................................................... 14 Author Information.............................................. 15

1. Background

Shared trees were first described by Wall in his investigation into low-delay approaches to broadcast and selective broadcast [3]. Wall concluded that delay will not be minimal, as with shortest-path trees, but the delay can be kept within bounds that may be acceptable. Back then, the benefits an...

Processing...
Loading...