PCEP Extensions for Tree Engineering for Bit Index Explicit Replication (BIER-TE)
draft-chen-pce-bier-13
| Document | Type |
Replaced Internet-Draft
(pce WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Ran Chen , Zheng Zhang , Huaimo Chen , Senthil Dhanaraj , Fengwei Qin , Aijun Wang | ||
| Last updated | 2023-10-24 (Latest revision 2023-10-01) | ||
| Replaced by | draft-ietf-pce-bier-te | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Adopted by a WG | |
| Document shepherd | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-pce-bier-te | |
| 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
Tree Engineering for Bit Index Explicit Replication (BIER-TE) shares architecture and packet formats with BIER. BIER-TE forwards and replicates packets based on a BitString in the packet header, but every BitPosition of the BitString of a BIER-TE packet indicates one or more adjacencies. BIER-TE Path can be derived from a Path Computation Element (PCE). This document specifies extensions to the Path Computation Element Protocol (PCEP) that allow a PCE to compute and initiate the path for the Tree Engineering for Bit Index Explicit Replication (BIER-TE).
Authors
Ran Chen
Zheng Zhang
Huaimo Chen
Senthil Dhanaraj
Fengwei Qin
Aijun Wang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)