Dynamic Flooding for IS-IS
draft-li-dynamic-flooding-isis-01
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | Tony Li | ||
Last updated | 2018-03-18 | ||
Replaced by | draft-li-dynamic-flooding, 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-dynamic-flooding, 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 extensions to the IS-IS routing protocol to support a solution to flooding in dense subgraphs.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)