Bit Indexed Explicit Replication (BIER) Problem Statement
draft-ietf-bier-problem-statement-00
| Document | Type |
Expired Internet-Draft
(bier WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Greg Shepherd , Andrew Dolganow , Arkadiy Gulko | ||
| Last updated | 2016-10-05 (Latest revision 2016-04-03) | ||
| Replaces | draft-shepherd-bier-problem-statement | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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
There is a need to simplify network operations for multicast services. Current solutions require a tree-building control plane to build and maintain end-to-end tree state per flow, impacting router state capacity and network convergence times. Multi-point tree building protocols are often considered complex to deploy and debug and may include mechanics from legacy use-cases and/or assumptions which no longer apply to the current use-cases. When multicast services are transiting a provider network through an overlay, the core network has a choice to either aggregate customer state into a minimum set of core states resulting in flooding traffic to unwanted network end-points, or to map per-customer, per-flow tree state directly into the provider core state amplifying the network-wide state problem.
Authors
Greg Shepherd
Andrew Dolganow
Arkadiy Gulko
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)