Recursive BitString Structure (RBS) Addresses for BIER and MSR6
draft-eckert-bier-rbs-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Toerless Eckert , Michael Menth , Xuesong Geng , Xiuli Zheng , Rui Meng , Fengkai Li | ||
| Last updated | 2023-04-27 (Latest revision 2022-10-24) | ||
| Replaces | draft-eckert-bier-cgm2-rbs | ||
| 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 memo introduces a compact data-structure representation of multicast trees called "Recursive Bitstring Structure" (RBS) and its use for (stateless) forwarding of packets that include this structure in their header. It is intended as an alternative to "flat" bitstring addresses as used in BIER and BIER-TE or possible forwarding plane variations such as MSR6. RBS aims to improve performance and scalability over flat bitstrings and simplify operations. Operations is simplified because RBS does not require the use, management and optimization of network-wide configured address spaces BIFT-ID and SI and because one common RBS mechanism can replace flat bitstring addresses for both shortest-path forwarding and tree engineered forwarding. It intends to improve performance by allowing multicast to sparse set of receivers in larger networks with fewer packets and it intends to improve scalability by requiring less BIFT state on routers.
Authors
Toerless Eckert
Michael Menth
Xuesong Geng
Xiuli Zheng
Rui Meng
Fengkai Li
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)