Skip to main content

A Distributed Algorithm for Constrained Flooding of IGP Advertisements
draft-allan-lsr-flooding-algorithm-00

Document Type Expired Internet-Draft (individual)
Author David Allan
Last updated 2019-04-21 (Latest revision 2018-10-18)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text htmlized pdfized bibtex
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
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-allan-lsr-flooding-algorithm-00.txt

Abstract

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.

Authors

David Allan

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