Path Computation Service discovery via Border Gateway Protocol
draft-boucadair-pce-discovery-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Pierrick Morand , Mohamed Boucadair | ||
| Last updated | 2005-05-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 a simple mechanism that ease discovery of remote Autonomous Systems (AS) supporting inter-domain MPLS-based constrained tunnels service (this service is also denoted by Path Computation Service (PCSv)) thanks to the use of Path Computation Elements (PCEs). Remote ASs could be managed by a single or distinct Internet Network Providers (INP). Particularly, this draft describes how Border Gateway Protocol (BGP) is used to announce Path Computation Service unique identifiers across the Internet in order for other PCEs to be able to discover a path towards every AS supporting this Path Computation Service.
Authors
Pierrick Morand
Mohamed Boucadair
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)