OSPF Protocol Extensions for Boundary Node Discovery (BND)
draft-dhody-pce-bn-discovery-ospf-09

 
Document Type Expired Internet-Draft (individual)
Last updated 2015-03-23 (latest revision 2014-09-15)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html
Stream Stream state (No stream defined)
Document shepherd No shepherd assigned
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-dhody-pce-bn-discovery-ospf-09.txt

Abstract

The Path Computation Element (PCE) may be used for computing multi- domain (Area or AS) Multiprotocol Label Switching (MPLS) and Generalized MPLS (GMPLS) Traffic Engineered (TE) Label Switch Path (LSP). In this circumstance, it is highly desirable to be able to dynamically and automatically discover a set of Boundary Nodes (BN) along with their domain information in a simple way. For that purpose, this document defines extensions to the Open Shortest Path First (OSPF) routing protocol for the advertisement of Boundary Node (BN) Discovery information within an OSPF area or within the entire OSPF routing domain.

Authors

Dhruv Dhody (dhruv.ietf@gmail.com)
Udayasree Palle (udayasree.palle@huawei.com)

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