A BGP based method to compute inter-AS Traffic engineering Label Switched Paths with PCE
draft-vijay-somen-pce-bgp-interas-te-path-01
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | C Vijayanand , Somen Bhattacharya | ||
| Last updated | 2007-01-22 | ||
| 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
The ability to compute an optimal path for setting up Traffic engineering Label Switched Paths spanning multiple autonomous systems managed by different operators has been a key requirement in MPLS and GMPLS networks. This document specifies a method of computing inter-AS paths consisting of a list of ASes to be traversed and a list of TE-Tunnels to be traversed in each AS. The method described here uses BGP speakers in the PCEs of each AS to distribute the inter-AS connectivity information and the TE-Tunnels in each AS to its neighbors to facilitate the construction of an inter-AS topology graph which can be used for computing inter-AS paths.
Authors
C Vijayanand
Somen Bhattacharya
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)