Search RFCs

RFC Editor

File formats:

Status:

BEST CURRENT PRACTICE

Authors:

A. Farrel, Ed.
J. Drake
N. Bitar
G. Swallow
D. Ceccarelli
X. Zhang

Stream:

IETF

Source:

teas (rtg)

Cite this RFC:TXT  | XML  |  BibTeX

DOI:  https://doi.org/10.17487/RFC7926

Discuss this RFC: Send questions or comments to the mailing listteas@ietf.org

Other actions:Submit Errata  | Find IPR Disclosures from the IETF  | View History of RFC 7926

Abstract

In Traffic-Engineered (TE) systems, it is sometimes desirable toestablish an end-to-end TE path with a set of constraints (such asbandwidth) across one or more networks from a source to adestination. TE information is the data relating to nodes and TElinks that is used in the process of selecting a TE path. TEinformation is usually only available within a network. We call sucha zone of visibility of TE information a domain. An example of adomain may be an IGP area or an Autonomous System.

In order to determine the potential to establish a TE path through aseries of connected networks, it is necessary to have available acertain amount of TE information about each network. This need notbe the full set of TE information available within each network butdoes 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 for the exchange of TEinformation between interconnected TE networks in support ofend-to-end TE path establishment and describes the best currentpractice architecture to meet this problem statement. For reasonsthat are explained in this document, this work is limited to simpleTE constraints and information that determine TE reachability.

For the definition ofStatus,seeRFC 2026.

For the definition ofStream, seeRFC 8729.