Analysis and Minimization of Microloops in Link-state Routing Protocols
draft-ietf-rtgwg-microloop-analysis-01
| Document | Type | Expired Internet-Draft (rtgwg WG) | |
|---|---|---|---|
| Last updated | 2005-10-24 | ||
| Stream | IETF | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
pdf
html
bibtex
|
||
| Stream | WG state | WG Document | |
| Document shepherd | No shepherd assigned | ||
| IESG | IESG state | Expired | |
| Consensus Boilerplate | Unknown | ||
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
This Internet-Draft is no longer active. A copy of
the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-ietf-rtgwg-microloop-analysis-01.txt
https://www.ietf.org/archive/id/draft-ietf-rtgwg-microloop-analysis-01.txt
Abstract
Link-state routing protocols (e.g. OSPF or IS-IS) are known to converge to a loop-free state within a finite period of time after a change in the topology. It is normal, however, to observe short-term loops during the period of topology update propagation, route recalculation, and forwarding table update, due to the asynchronous nature of link-state protocol operation. This document provides an analysis of formation of such microloops and suggests simple mechanisms to minimize them.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)