Dynamic Flooding on Dense Graphs
draft-ietf-lsr-dynamic-flooding-11
Document | Type |
Expired Internet-Draft
(lsr WG)
Expired & archived
|
|
---|---|---|---|
Authors | Tony Li , Tony Przygienda , Peter Psenak , Les Ginsberg , Huaimo Chen , David Cooper , Luay Jalil , Srinath Dontula , Gyan Mishra | ||
Last updated | 2022-12-09 (Latest revision 2022-06-07) | ||
Replaces | draft-li-lsr-dynamic-flooding | ||
RFC stream | Internet Engineering Task Force (IETF) | ||
Formats | |||
Additional resources | Mailing list discussion | ||
Stream | WG state | WG Document | |
Document shepherd | Acee Lindem | ||
IESG | IESG state | Expired | |
Consensus boilerplate | Yes | ||
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | Acee Lindem <acee@cisco.com> |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
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 Przygienda
Peter Psenak
Les Ginsberg
Huaimo Chen
David Cooper
Luay Jalil
Srinath Dontula
Gyan Mishra
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)