Skip to main content

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

The information below is for an old version of the document.
Document Type
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
Authors Dhruv Dhody , Udayasree Palle
Last updated 2014-03-03 (Latest revision 2013-08-23)
RFC stream (None)
Formats
Additional resources
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:

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
Udayasree Palle

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