Considerations of point-to-multipoint route optimization using PCEMP
draft-choi-pce-p2mp-framework-04
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Dipnarayan Guha , Jun Kyun Choi | ||
Last updated | 2006-08-02 | ||
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 draft describes the basic concepts of point-to-multipoint (p2mp) path computation on the basis of the Path Computation Element Metric Protocol (PCEMP). PCEMP, being soft-memory based, has the capability of dynamic configuration of its finite state machines (FSMs) in the participating PCEMP peers, and thus can support a wide variety of traffic engineering techniques that are needed to guarantee bandwidth demand and scalable fast protection and restoration in PCE based p2mp frameworks. To take advantage of bandwidth considerations and fast restoration mechanisms, the centralized Controller, which is the key element in a PCE node, is used for path computation in case of p2mp paths and can be used in a scenario where reliable multicasting of bandwidth-on-demand services becomes an important criteria for multiple-domain and/or inter-domain PCE based architectures.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)