Dynamic Flooding on Dense Graphs
draft-li-dynamic-flooding-05

Document Type Expired Internet-Draft (individual)
Last updated 2018-12-30 (latest revision 2018-06-28)
Replaces draft-li-dynamic-flooding-isis
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-li-dynamic-flooding-05.txt

Abstract

Routing with link state protocols in dense network topologies can result in sub-optimal convergence times due to the overhead associated with flooding. This can be addressed by decreasing the flooding topology so that it is less dense. This document discusses the problem in some depth and an architectural solution. Specific protocol changes for IS-IS, OSPFv2, and OSPFv3 are described in this document.

Authors

Tony Li (tony.li@tony.li)
Peter Psenak (ppsenak@cisco.com)

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