Problem Statement and Architecture for Information Exchange Between Interconnected Traffic Engineered Networks
draft-ietf-teas-interconnected-te-info-exchange-02

The information below is for an old version of the document
Document Type Expired Internet-Draft (teas WG)
Authors Adrian Farrel  , John Drake  , Nabil 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 IETF
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized (tools) htmlized bibtex
Reviews
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
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 (adrian@olddog.co.uk)
John Drake (jdrake@juniper.net)
Nabil Bitar (nabil.bitar@verizon.com)
George Swallow (swallow@cisco.com)
Daniele Ceccarelli (daniele.ceccarelli@ericsson.com)
Xian Zhang (zhang.xian@huawei.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)