Dynamic Flooding on Dense Graphs
draft-li-lsr-dynamic-flooding-02

Document Type Replaced Internet-Draft (lsr WG)
Last updated 2019-02-25 (latest revision 2018-12-03)
Replaces draft-li-dynamic-flooding, draft-li-dynamic-flooding-isis
Replaced by draft-ietf-lsr-dynamic-flooding
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state Adopted by a WG
Document shepherd No shepherd assigned
IESG IESG state Replaced by draft-ietf-lsr-dynamic-flooding
Consensus Boilerplate Unknown
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-lsr-dynamic-flooding-02.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)
Les Ginsberg (ginsberg@cisco.com)
Tony Przygienda (prz@juniper.net)
Dave Cooper (dave.cooper@centurylink.com)
Luay Jalil (luay.jalil@verizon.com)
Srinath Dontula (sd947e@att.com)

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