Shared Risk Link Groups Encoding and Processing
draft-papadimitriou-ccamp-srlg-processing-02
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | Dimitri Papadimitriou | ||
Last updated | 2003-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 Shared Risk Link Group (SRLG) concept introduced in [IPO-Frame] and extended in [CCAMP-SRG] is considered as one of the most important criteria concerning the constraint-based path computation of optical channel routes. By applying the SRLG disjointness criteria to the constraint-based path computation, one can select a route taking into account both resource and logical structure disjointness. That implies a lower probability of simultaneous optical channel failure. This document describes the various physical and logical resource types considered in the SRLG concept. The proposed method focuses on the inference of SRLG information between the network physical and logical layers and the logical structures representing geographical locations. The main applications of the proposed model are related to the Constraint-based Shortest Path First (CSPF) algorithm for optical channel route computation and the aggregation of the SRLG information flooded throughout traffic engineering extensions of the IGP routing protocols (such as OSPF and IS-IS).
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)