Dynamic Flooding on Dense Graphs
draft-li-lsr-dynamic-flooding-02
| Document | Type |
Replaced Internet-Draft
(lsr WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Tony Li , Peter Psenak , Les Ginsberg , Tony Przygienda , Luay Jalil , Srinath Dontula | ||
| 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 | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Adopted by a WG | |
| Document shepherd | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-lsr-dynamic-flooding | |
| Consensus boilerplate | Unknown | ||
| 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
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
Peter Psenak
Les Ginsberg
Tony Przygienda
Luay Jalil
Srinath Dontula
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)