A Distributed Algorithm for Constrained Flooding of IGP Advertisements

Document Type Expired Internet-Draft (individual)
Author David Allan 
Last updated 2019-04-21 (latest revision 2018-10-18)
Stream (None)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
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


This document describes a distributed algorithm that can be applied to the problem of constraining IGP flooding in dense mesh topologies. The flooding topology utilizes two node-diverse spanning trees in order to provide complete coverage in the presence of any single failure while constraining the number of LSAs received by any IGP speaker connected to the flooding topology.


David Allan (david.i.allan@ericsson.com)

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