Fixing Backbone Partition with Dynamic Virtual Links
draft-zhang-ospf-dvl-01

Document Type Expired Internet-Draft (individual)
Last updated 1997-11-26
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html 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-zhang-ospf-dvl-01.txt

Abstract

This document proposes a Dynamic Virtual Link (DVL) algorithm to dynamically detect and fix OSPF backbone area partition. In the DVL algorithm, each ABR periodically checks if it can reach via backbone area all other ABRs that it can reach via its transit areas. If not, it knows that a backbone partition has occurred and a spanning tree of Dynamic Virtual Links are created. When the DVLs are not needed, they are automatically deleted.

Authors

Zhaohui Zhang (zzhang@baynetworks.com)

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