Dynamic Flooding on Dense Graphs
draft-li-dynamic-flooding-05
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Tony Li , Peter Psenak | ||
| Last updated | 2018-12-30 (Latest revision 2018-06-28) | ||
| Replaces | draft-li-dynamic-flooding-isis | ||
| Replaced by | draft-li-lsr-dynamic-flooding | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-li-lsr-dynamic-flooding | |
| 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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)