Flooding optimizations in link-state routing protocols

Document Type Expired Internet-Draft (ospf WG)
Authors Alex Zinin  , Mike Shand 
Last updated 2001-03-06
Stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Expired & archived
plain text pdf htmlized 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


The flooding algorithm is one of the most important parts of any link state routing protocol. It ensures that all routers within a link state domain converge on the same topological information within a finite period of time. To ensure reliability, typical implementations of the flooding algorithm send new information via all interfaces other than the one the new piece of information was received on. This redundancy is necessary to guarantee that flooding is performed reliably, but implies considerable overhead of utilized bandwidth and CPU time if neighboring routers are connected with more than one link. This document describes a method that reduces this overhead.


Alex Zinin (azinin@cisco.com)
Mike Shand (shand@mail.dec.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)