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

Document Type Active Internet-Draft (individual)
Last updated 2018-10-18
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
LSR Working Group                                            Dave Allan 
Internet Draft                                                 Ericsson 
Intended status: Standards Track                           October 2018          
Expires: April 2019 
                                                                                 
                                      

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

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. 

Status of this Memo 

   This Internet-Draft is submitted to IETF in full conformance 
   with the provisions of BCP 78 and BCP 79. 

   Internet-Drafts are working documents of the Internet 
   Engineering Task Force (IETF), its areas, and its working 
   groups.  Note that other groups may also distribute working 
   documents as Internet-Drafts. 

   Internet-Drafts are draft documents valid for a maximum of six 
   months and may be updated, replaced, or obsoleted by other 
   documents at any time.  It is inappropriate to use Internet-
   Drafts as reference material or to cite them other than as "work 
   in progress". 

   The list of current Internet-Drafts can be accessed at 
   http://www.ietf.org/ietf/1id-abstracts.txt. 

   The list of Internet-Draft Shadow Directories can be accessed at 
   http://www.ietf.org/shadow.html. 

   This Internet-Draft will expire in March 2019. 

Copyright and License Notice 

 
Allan,                    Expires April 2019                   [Page 1] 
 

Internet-Draft    draft-allan-lsr-flooding-algorithm       October 2018 
 

   Copyright (c) 2018 IETF Trust and the persons identified as the 
   document authors.  All rights reserved. 

   This document is subject to BCP 78 and the IETF Trust's Legal 
   Provisions Relating to IETF Documents 
   (http://trustee.ietf.org/license-info) in effect on the date of 
   publication of this document. Please review these documents 
   carefully, as they describe your rights and restrictions with 
   respect to this document. Code Components extracted from this 
   document must include Simplified BSD License text as described 
   in Section 4.e of the Trust Legal Provisions and are provided 
   without warranty as described in the Simplified BSD License. 

Table of Contents 

   1. Introduction...................................................3 
   1.1. Authors......................................................3 
   1.2. Requirements Language........................................3 
   2. Conventions used in this document..............................3 
   2.1. Terminology..................................................3 
   3. Solution Overview..............................................4 
   3.1. The Flooding Topology........................................4 
   3.2. Solution Applicability.......................................4 
   3.3. Algorithm....................................................4 
   3.3.1. Algorithm Basics...........................................5 
   3.3.2. Generating Diverse Trees...................................5 
   3.3.3. Desirable Properties Computation Wise......................6 
   4. Applying the Algorithm.........................................6 
   4.1. Tree Generation..............................................6 
   4.2. Illustrating the result......................................6 
   4.3. Interactions between Participating and Non-Participating 
   Nodes.............................................................7 
   4.4. Flooding of LSAs.............................................8 
   4.5. Root Selection...............................................9 
   4.6. Node Additions...............................................9 
   5. Further work..................................................10 
   5.1. Thoughts on Coexistence in the Context of a Larger Network..10 
   5.1.1. Multiple flooding Domains and the Severing of Flooding 
   Domains..........................................................10 
   5.2. Thoughts on Flooding Topology Re-Optimization...............10 
   5.3. Thoughts on Node and Network Initialization.................11 
   5.4. Thoughts on Loop Prevention.................................11 
   5.5. Thoughts on Pathological Failure Scenarios..................11 
   6. Acknowledgements..............................................12 
   7. Security Considerations.......................................12 
   8. IANA Considerations...........................................12 
Show full document text