LS Distributed Flooding Reduction
draft-cc-lsr-flooding-reduction-03

Document Type Active Internet-Draft (individual)
Last updated 2019-03-11
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)
Network Working Group                                            H. Chen
Internet-Draft                                                  D. Cheng
Intended status: Standards Track                     Huawei Technologies
Expires: September 12, 2019                                       M. Toy
                                                                 Verizon
                                                                 Y. Yang
                                                                     IBM
                                                                 A. Wang
                                                           China Telecom
                                                                  X. Liu
                                                          Volta Networks
                                                                  Y. Fan
                                                            Casa Systems
                                                                  L. Liu
                                                          March 11, 2019

                   LS Distributed Flooding Reduction
                   draft-cc-lsr-flooding-reduction-03

Abstract

   This document proposes an approach to flood link states on a topology
   that is a subgraph of the complete topology per underline physical
   network, so that the amount of flooding traffic in the network is
   greatly reduced, and it would reduce convergence time with a more
   stable and optimized routing environment.  The approach can be
   applied to any network topology in a single area.  In this approach,
   every node in the area automatically calculates a flooding topology
   by using a same algorithm concurrently.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 [RFC2119].

Status of This Memo

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

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

Chen, et al.           Expires September 12, 2019               [Page 1]
Internet-Draft            Distributed Reduction               March 2019

   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."

   This Internet-Draft will expire on September 12, 2019.

Copyright Notice

   Copyright (c) 2019 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
   (https://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
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   4
   3.  Flooding Topology . . . . . . . . . . . . . . . . . . . . . .   4
     3.1.  Flooding Topology Construction  . . . . . . . . . . . . .   4
     3.2.  Scheduling for Flooding Topology Computation  . . . . . .   5
       3.2.1.  Scheduler with Exponential Delay  . . . . . . . . . .   6
       3.2.2.  Scheduler with Constant Delay . . . . . . . . . . . .   6
     3.3.  Flooding Topology Consistency . . . . . . . . . . . . . .   7
     3.4.  Flooding Topology Protection  . . . . . . . . . . . . . .   7
   4.  Protocol Extensions . . . . . . . . . . . . . . . . . . . . .   8
     4.1.  Extensions for Operations . . . . . . . . . . . . . . . .   8
       4.1.1.  Extensions to OSPF  . . . . . . . . . . . . . . . . .   8
       4.1.2.  Extensions to IS-IS . . . . . . . . . . . . . . . . .  10
     4.2.  Extensions for Consistency  . . . . . . . . . . . . . . .  11
       4.2.1.  Extensions to OSPF  . . . . . . . . . . . . . . . . .  11
       4.2.2.  Extensions to IS-IS . . . . . . . . . . . . . . . . .  12
   5.  Flooding Behavior . . . . . . . . . . . . . . . . . . . . . .  12
     5.1.  Nodes Perform Flooding Reduction without Failure  . . . .  13
       5.1.1.  Receiving an LS . . . . . . . . . . . . . . . . . . .  13
Show full document text