datatracker.ietf.org
Sign In
Version 4.50, 2013-05-15
Report a bug

Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Path-Key-Based Mechanism
draft-ietf-pce-path-key-06

RFC
Document Stream: IETF
Last updated: 2009-03-07
Replaces: draft-bradford-pce-path-key
Intended RFC status: Proposed Standard
Other versions: (expired, archived): plain text, pdf, html

Document shepherd:(None)
Shepherd writeup
Consensus:Unknown

IESG State: RFC 5520
IANA Action State: RFC-Ed-Ack 
Responsible AD: Ross Callon
Send notices to: pce-chairs@tools.ietf.org, draft-ietf-pce-path-key@tools.ietf.org

This Internet-Draft is no longer active. Unofficial copies of old Internet-Drafts can be found here:
http://tools.ietf.org/id/draft-ietf-pce-path-key.

Abstract:
Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineering (TE) Label Switched Paths (LSPs) may be computed by Path Computation Elements (PCEs). Where the TE LSP crosses multiple domains, such as Autonomous Systems (ASes), the path may be computed by multiple PCEs that cooperate, with each responsible for computing a segment of the path. However, in some cases (e.g., when ASes are administered by separate Service Providers), it would break confidentiality rules for a PCE to supply a path segment to a PCE in another domain, thus disclosing AS-internal topology information. This issue may be circumvented by returning a loose hop and by invoking a new path computation from the domain boundary Label Switching Router (LSR) during TE LSP setup as the signaling message enters the second domain, but this technique has several issues including the problem of maintaining path diversity.

Authors:
Adrian Farrel <adrian@olddog.co.uk>
Richard Bradford <rbradfor@cisco.com>

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