Hi Everyone,
This version contains:
• A new centralized solution, which seems much more efficient. For 63
nodes network, if flooding topology is a binary tree, this new solution uses
about 120 bytes for flooding topology, the existing solution uses about 438
bytes. 438/120 = 3.65.
• An incremental solution for flooding topology changes, which further
improves the efficiency of the centralized solution. When there are some
changes on the flooding topology, we can flood only these changes, and we do
not need to flood the whole flooding topology.
• A solution for backup flooding topology split, which makes flooding
topology more tolerant to failures (thus the flooding topology may be slim),
and quickly flood link states to every live node when multiple failures split
the flooding topology.
• Support for selecting N leaders.
In addition, we have improved the quality of our draft, and addressed the
comments from IETF meetings and the mailing list.
Best Regards,
Huaimo
-----Original Message-----
From: [email protected] [mailto:[email protected]]
Sent: Wednesday, September 12, 2018 10:48 PM
To: Huaimo Chen <[email protected]>; Yi Yang <[email protected]>; Dean
cheng <[email protected]>; Mehmet Toy <[email protected]>
Subject: New Version Notification for draft-cc-ospf-flooding-reduction-03.txt
A new version of I-D, draft-cc-ospf-flooding-reduction-03.txt
has been successfully submitted by Huaimo Chen and posted to the IETF
repository.
Name: draft-cc-ospf-flooding-reduction
Revision: 03
Title: LS Flooding Reduction
Document date: 2018-09-12
Group: Individual Submission
Pages: 39
URL:
https://www.ietf.org/internet-drafts/draft-cc-ospf-flooding-reduction-03.txt
Status:
https://datatracker.ietf.org/doc/draft-cc-ospf-flooding-reduction/
Htmlized: https://tools.ietf.org/html/draft-cc-ospf-flooding-reduction-03
Htmlized:
https://datatracker.ietf.org/doc/html/draft-cc-ospf-flooding-reduction
Diff:
https://www.ietf.org/rfcdiff?url2=draft-cc-ospf-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.
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.
The IETF Secretariat
_______________________________________________
Lsr mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/lsr
