[Lsr] I-D Action: draft-ietf-lsr-flooding-topo-min-degree-01.txt

internet-drafts@ietf.org Mon, 30 November 2020 21:10 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: lsr@ietf.org
Delivered-To: lsr@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 6DA033A11AD; Mon, 30 Nov 2020 13:10:36 -0800 (PST)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: <i-d-announce@ietf.org>
Cc: lsr@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 7.23.0
Auto-Submitted: auto-generated
Precedence: bulk
Reply-To: lsr@ietf.org
Message-ID: <160677063641.7444.3895998386256796985@ietfa.amsl.com>
Date: Mon, 30 Nov 2020 13:10:36 -0800
Archived-At: <https://mailarchive.ietf.org/arch/msg/lsr/KcACKNusDDsVcz5WUd7jLSSaU58>
Subject: [Lsr] I-D Action: draft-ietf-lsr-flooding-topo-min-degree-01.txt
X-BeenThere: lsr@ietf.org
X-Mailman-Version: 2.1.29
List-Id: Link State Routing Working Group <lsr.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/lsr>, <mailto:lsr-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/lsr/>
List-Post: <mailto:lsr@ietf.org>
List-Help: <mailto:lsr-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/lsr>, <mailto:lsr-request@ietf.org?subject=subscribe>
X-List-Received-Date: Mon, 30 Nov 2020 21:10:36 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Link State Routing WG of the IETF.

        Title           : Flooding Topology Minimum Degree Algorithm
        Authors         : Huaimo Chen
                          Mehmet Toy
                          Yi Yang
                          Aijun Wang
                          Xufeng Liu
                          Yanhe Fan
                          Lei Liu
	Filename        : draft-ietf-lsr-flooding-topo-min-degree-01.txt
	Pages           : 12
	Date            : 2020-11-30

   This document proposes an algorithm for a node to compute a flooding
   topology, which is a subgraph of the complete topology per underline
   physical network.  When every node in an area automatically
   calculates a flooding topology by using a same algorithm and floods
   the link states using the flooding topology, the amount of flooding
   traffic in the network is greatly reduced.  This would reduce
   convergence time with a more stable and optimized routing

The IETF datatracker status page for this draft is:

There are also htmlized versions available at:

A diff from the previous version is available at:

Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at: