Problem Statement and Architecture for Information Exchange Between Interconnected Traffic Engineered Networks
draft-ietf-teas-interconnected-te-info-exchange-02
| Document | Type | Expired Internet-Draft (teas WG) | |
|---|---|---|---|
| Authors | Adrian Farrel , John Drake , Dr. Nabil N. Bitar , George Swallow , Daniele Ceccarelli , Xian Zhang | ||
| Last updated | 2015-09-09 (Latest revision 2015-03-08) | ||
| Replaces | draft-ietf-ccamp-interconnected-te-info-exchange | ||
| Stream | Internet Engineering Task Force (IETF) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| Reviews |
SECDIR Last Call review
(of
-04)
Has Issues
GENART Early review
(of
-04)
Almost Ready
|
||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
https://www.ietf.org/archive/id/draft-ietf-teas-interconnected-te-info-exchange-02.txt
Abstract
In Traffic Engineered (TE) systems, it is sometimes desirable to establish an end-to-end TE path with a set of constraints (such as bandwidth) across one or more network from a source to a destination. TE information is the data relating to nodes and TE links that is used in the process of selecting a TE path. TE information is usually only available within a network. We call such a zone of visibility of TE information a domain. An example of a domain may be an IGP area or an Autonomous System. In order to determine the potential to establish a TE path through a series of connected networks, it is necessary to have available a certain amount of TE information about each network. This need not be the full set of TE information available within each network, but does need to express the potential of providing TE connectivity. This subset of TE information is called TE reachability information. This document sets out the problem statement and architecture for the exchange of TE information between interconnected TE networks in support of end-to-end TE path establishment. For reasons that are explained in the document, this work is limited to simple TE constraints and information that determine TE reachability.
Authors
Adrian Farrel
John Drake
Dr. Nabil N. Bitar
George Swallow
Daniele Ceccarelli
Xian Zhang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)