Overlay Network - Path Computation Approaches
draft-bardalai-ccamp-overlay-path-comp-02

Document Type Expired Internet-Draft (individual)
Authors Snigdho Bardalai  , Khuzema Pithewan  , Rajan Rao 
Last updated 2014-04-19 (latest revision 2013-10-16)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text htmlized pdfized 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)

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-bardalai-ccamp-overlay-path-comp-02.txt

Abstract

This document discusses various path computations approaches which are applicable to overlay networks [framework doc ref]. It discusses how the customer edge nodes uses the information advertised by the provider network to compute a path between two customer edge nodes or how it can request the provider network to compute a path and setup an end-2-end LSP.

Authors

Snigdho Bardalai (sbardalai@infinera.com)
Khuzema Pithewan (kpithewan@infinera.com)
Rajan Rao (rrao@infinera.com)

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