Distributed Route Exchangers
draft-lee-mpls-te-exchange-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | C.J. Lee , Alicja B. Celer, Gerald Ash | ||
| Last updated | 2002-07-03 | ||
| 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 current link state routing protocols flood link states to all routers so that routers have the information required to compute the shortest paths to route packets on a hop by hop basis. However, for the purpose of establishing MPLS paths, constraint path computation is only performed at certain nodes, for instance, at the node where path setup is triggered or at the head-end of a loosely routed segment that crosses a network (or area) boundary. In addition, it not possible to have all required constraints present in all nodes in a network, nor is it always feasible for nodes setting up paths to compute the constraint paths themselves, a notable example is when a path traverses network or area boundary. These reasons motivate a solution using a 'subset' of routers (called route exchangers), to collect constraint information and exchange it with other route exchangers. Route exchangers store traffic engineering link states and other types of constraint information and compute on demand, the explicit routes required by routers establishing paths. Hence, link state information need only be distributed to the subset of nodes that help compute constraint paths in the network.
Authors
C.J. Lee
Alicja B. Celer
Gerald Ash
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)