Limited Flooding as a scalability improvement to OSPF
draft-dovolsky-ccamp-ospf-limited-flooding-00
| Document | Type |
Expired Internet-Draft
(individual in gen area)
Expired & archived
|
|
|---|---|---|---|
| Author | Dan Dovolsky | ||
| Last updated | 2015-10-14 (Latest revision 2002-11-04) | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | WG state | (None) | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired (IESG: Dead) | |
| Action Holders |
(None)
|
||
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | Alex D. Zinin | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This draft describes a limited flooding approach to address the problem of routing scalability in link state IGPs. The solution is based on decomposition of a routing area into 'zones' and the restriction of the exchange of routing information between zones. This approach introduces an extra level in the isolation of knowledge within a routing domain. The advantage of this solution is that it considerably decreases the amount of information flooded in link state advertisements and reduces the size of the link-state database (and traffic engineering entries) on network elements utilizing link state protocols. The technique presented in this document has been particularized to OSPF in order to make the discussion practical and concrete. However, the underlying concepts are very general and similar modifications can be easily applied to other IGPs, such as ISIS.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)