Flex Algorithm for BIER
draft-nainar-bier-flex-algo-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Nagendra Kumar Nainar , IJsbrand Wijnands , Mankamana Prasad Mishra | ||
| Last updated | 2020-05-07 (Latest revision 2019-11-04) | ||
| 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
Bit Index Explicit Replication (BIER) is an architecture that provides optimal multicast forwarding through a "BIER domain" without requiring intermediate routers to run explicit tree-building protocol or to maintain multicast-related, per-flow state. IGP protocols are extended to carry BFR-Id and other encapsulation informations that are used by traditional path computing algorithm using link metric for a loop-free best path selection. This document defines a constrained based path selection using IGP flexible Algorithm for BIER.
Authors
Nagendra Kumar Nainar
IJsbrand Wijnands
Mankamana Prasad Mishra
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)