Architecture and Requirement for Distribution of Link-State and TE Information via PCEP.
draft-leedhody-teas-pcep-ls-03
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2017-03-27 (latest revision 2016-09-14) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-leedhody-teas-pcep-ls-03.txt
Abstract
In order to compute and provide optimal paths, Path Computation Elements (PCEs) require an accurate and timely Traffic Engineering Database (TED). Traditionally this Link State and TE information has been obtained from a link state routing protocol (supporting traffic engineering extensions). This document provides possible architectural alternatives for link- state and TE information distribution and their potential impacts on PCE, network nodes, routing protocols etc.
Authors
Young Lee
(leeyoung@huawei.com)
Dhruv Dhody
(dhruv.ietf@gmail.com)
Daniele Ceccarelli
(daniele.ceccarelli@ericsson.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)