[New-wg-docs] I-D Action: draft-ietf-lsr-flooding-topo-min-degree-00.txt

internet-drafts@ietf.org Sat, 06 June 2020 22:11 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: new-wg-docs@ietf.org
Delivered-To: new-wg-docs@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id AD8A93A0E2E for <new-wg-docs@ietf.org>; Sat, 6 Jun 2020 15:11:45 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: <new-wg-docs@ietf.org>
X-Test-IDTracker: no
X-IETF-IDTracker: 7.1.0
Auto-Submitted: auto-generated
Precedence: bulk
Message-ID: <159148150568.21592.1792696866666689551@ietfa.amsl.com>
Date: Sat, 06 Jun 2020 15:11:45 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/new-wg-docs/VJWdgaSUEqMdrAYlvug7qi8PeHM>
Subject: [New-wg-docs] I-D Action: draft-ietf-lsr-flooding-topo-min-degree-00.txt
X-BeenThere: new-wg-docs@ietf.org
X-Mailman-Version: 2.1.29
List-Id: <new-wg-docs.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/new-wg-docs>, <mailto:new-wg-docs-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/new-wg-docs/>
List-Post: <mailto:new-wg-docs@ietf.org>
List-Help: <mailto:new-wg-docs-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/new-wg-docs>, <mailto:new-wg-docs-request@ietf.org?subject=subscribe>
X-List-Received-Date: Sat, 06 Jun 2020 22:11:46 -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-00.txt
	Pages           : 12
	Date            : 2020-06-06

Abstract:
   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
   environment.



The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-lsr-flooding-topo-min-degree/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-ietf-lsr-flooding-topo-min-degree-00
https://datatracker.ietf.org/doc/html/draft-ietf-lsr-flooding-topo-min-degree-00


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:
ftp://ftp.ietf.org/internet-drafts/