Notes on Path Computation in Constraint-Based Routing
draft-kompella-te-pathcomp-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Kireeti Kompella , Daniel O. Awduche | ||
| Last updated | 2000-07-24 | ||
| 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 presents some notes on Constraint-Based Routing. The main purpose is to standardize the terminology used, and define the semantics of the various constructs used in Constraint-Based Routing so that implementations from a wide variety of vendors will have (at least to the first order) similar results in path selection. A secondary goal is to define the semantics of optimization, which we define as the recalculation of routes that have already been computed and established.
Authors
Kireeti Kompella
Daniel O. Awduche
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)