Flooding Topology Minimum Degree AlgorithmFutureweiBostonUSAhuaimo.chen@futurewei.com Verizon USAmehmet.toy@verizon.comIBMCaryNCUnited States of Americayyietf@gmail.comChina TelecomBeiqijia Town, Changping DistrictBeijing102209Chinawangaj3@chinatelecom.cnIBM CorporationUSAxufeng.liu.ietf@gmail.comCasa SystemsUSAyfan@casa-systems.comFujitsuUSAliulei.kddi@gmail.comThis 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 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. For some networks such as dense Data Center (DC) networks,
the existing Link State (LS) flooding mechanism
is not efficient and may have some issues.
The extra LS flooding consumes network bandwidth.
Processing the extra LS flooding,
including receiving, buffering and decoding the extra LSs,
wastes memory space and processor time.
This may cause scalability issues and
affect the network convergence negatively.
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.
The physical network can be any network, including
clos leaf spine network.
It can be used in the distributed mode of flooding topology computation
for flooding reduction
and the centralized mode, which are described in
.
When the distributed mode is selected,
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.
There may be multiple algorithms for computing a flooding topology.
Users can select one they prefer,
and smoothly switch from one to another.
A Link State Advertisement in OSPF.A Link State Protocol Data Unit (PDU) in IS-IS.A Link Sate, which is an LSA or LSP.Flooding Topology.Flooding Topology Computation.
For a given network topology,
a flooding topology is a sub-graph or sub-network of the given
network topology that has the same reachability to every node
as the given network topology. Thus all the nodes in the
given network topology MUST be in the flooding topology. All
the nodes MUST be inter-connected directly or indirectly.
As a result, LS flooding will in most cases occur only on
the flooding topology, that includes all nodes but a
subset of links. Note even though the flooding topology is a
sub-graph of the original topology, any single LS MUST
still be disseminated in the entire network.
Many different flooding topologies can be constructed for a given
network topology. For example,
a chain connecting all the nodes in the given network topology is
a flooding topology.
A circle connecting all the nodes is another flooding topology.
A tree connecting all the nodes is a flooding topology.
In addition, the tree plus the connections
between some leaves of the tree and branch nodes of the tree is
a flooding topology.
The following parameters need to be considered for constructing
a flooding topology:
Degree: The degree of the flooding topology is the maximum degree
among the degrees of the nodes on the flooding topology.
The degree of a node on the flooding topology is the number of
connections on the flooding topology it has to other nodes.
Number of links: The number of links on the flooding topology
is a key factor for reducing the amount of LS flooding.
In general, the smaller the number of links,
the less the amount of LS flooding.
Diameter: The diameter of the flooding topology is the shortest
distance between the two most distant nodes on the flooding topology.
It is a key factor for reducing the network convergence time.
The smaller the diameter, the less the convergence time.
Redundancy: The redundancy of the flooding topology means
a tolerance to the failures of some links and nodes on the flooding topology.
If the flooding topology is split by some failures,
it is not tolerant to these failures.
In general, the larger the number of links on the flooding topology is,
the more tolerant the flooding topology to failures.
Note that the flooding topology constructed by a
node is dynamic in nature, that means when the base
topology (the entire topology graph) changes, the flooding
topology (the sub-graph) MUST be re-computed/re-constructed
to ensure that any node that is reachable on the base
topology MUST also be reachable on the flooding topology.
There are many algorithms to compute a flooding topology.
A simple and efficient one is briefed, which comprises:
Selecting a node R0 with the smallest node ID;
Building a tree using R0 as root in breadth first; and then
Connecting each node whose degree is one to another node to have a flooding topology.
The algorithm is described below,
where a variable MaxD with an initial value 3,
data structures candidate queue Cq and flooding topology FT are used.
Cq and FT comprise elements of form (N, D, PHs),
where N represents a Node, D is the Degree of node N, and
PHs contains the Previous Hops of node N.
The detailed FT computation by the algorithm is illustrated
in
through an example.
The algorithm starts from node R0 as root with
a maximum degree MaxD of value 3;
an initial flooding topology FT = {(R0, D=0, PHs={ })},
where node R0 is the root,
D = 0 indicates that the Degree (D for short) of R0 is 0 (i.e.,
the number of links on the flooding topology connected to R0 is 0),
PHs = { } indicates that the Previous Hops (PHs for short) of R0
is empty;
an initial candidate queue Cq = {(R1,D=0, PHs={R0}), (R2,D=0, PHs={R0}),
..., (Rm,D=0, PHs={R0})}, where each of nodes R1 to Rm
is connected to R0, its Degree D = 0 and Previous Hops PHs ={R0},
R1 to Rm are in increasing order by their IDs.
Finding and removing the first element with node A from Cq
that is not on FT and one PH's D in PHs < MaxD,
and add the element with A into FT;
Set A's D to one, increase A's PH's D by one.
If no element in Cq satisfies the conditions,
algorithm is restarted with ++MaxD, the initial FT and Cq.
If all the nodes are on the FT, then goto step 4;
Suppose that node Xi (i = 1, 2,..., n) is connected to node A and not on FT,
and X1, X2,..., Xn are in an increasing order by their IDs
(i.e., X1's ID < X2's ID < ... < Xn's ID).
If Xi is not in Cq, then add it into the end of Cq with D = 0 and PHs = {A};
otherwise (i.e., Xi is in Cq), add A into the end of Xi's PHs;
Goto step 1.
For each node B on FT whose D is one
(from minimum to maximum node ID),
find a link L attached to B such that
L's remote node R has minimum D and ID and R'D < MaxD,
add link L between B and R into FT and increase B's D and R's D by one.
Return FT if every node on FT has its D > 1;
otherwise, algorithm is restarted with ++MaxD, the initial FT and Cq.
There may be some constraints on some nodes in a network.
For example, in a spine-and-leaf network,
there may be a constraint on the degree of every leaf node on the
flooding topology, which is that the degree of every leaf node is
not greater than a given number ConMaxD of value 2.
For each of the other nodes such as the spine nodes,
there is no such constraint, that is that ConMaxD is a huge number
for each of these nodes.
Step 1 of the algorithm described above is updated below
to consider this constraint.
In addition to checking constraint PH's D < MaxD,
step 1 checks another constraint PH's D < PH's ConMaxD.
Finding and removing the first element with node A from Cq
that is not on FT and
one PH's D in PHs < MaxD and PH's D < PH's ConMaxD,
and add the element with A into FT;
Set A's D to one, increase A's PH's D by one.
If no element in Cq satisfies the conditions,
algorithm is restarted with ++MaxD, the initial FT and Cq.
Similarly, step 4 of the algorithm described above is updated
to consider this constraint.
In addition to checking constraint R's D < MaxD,
step 4 checks another constraint R's D < R's ConMaxD.
This document does not introduce any new security issue.
Under Registry Name: "IGP Algorithm Type For
Computing Flooding Topology" under an existing "Interior Gateway
Protocol (IGP) Parameters" IANA registries (refer to
Section 7.3. IGP),
IANA is requested to assign one value of
IGP Algorithm Type For Computing Flooding Topology as follows:
The authors would like to thank Dean Cheng,
Acee Lindem, Zhibo Hu, Robin Li, Stephane Litkowski
and Alvaro Retana
for their valuable suggestions and comments on this draft.
This section presents the details on FT computation
by the algorithm through an example.
The detailed procedure of computing a FT for a network of five nodes
with full mess connections is illustrated.
Suppose that the network has five nodes R0, R1, R2, R3 and R4;
R0's ID < R1's ID < R2's ID < R3's ID < R4's ID.
The algorithm starts with MaxD = 3, FT = {(R0, D=0, PH={})},
Cq = { (R1,0,{R0}), (R2,0,{R0}), (R3,0,{R0}), (R4,0,{R0}) }.
All nodes are on FT now. In the following,
for each node on FT whose D = 1 (from minimum to maximum ID),
link L attached to it and not on FT is found such that L's remote
node has minimum D and ID. L is added into FT.
FT is computed, which has Degree of 3 and Diameter of 2.