Interior gateway protocol flood minimization
AssigneeHuawei Technologies Co., Ltd.
InventorsHuaimo Chen, Dean Cheng
Life of this patent
Estimating the term…
Abstract
Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.
Claims21
A method implemented in a first node in a network, the method comprising:
- receiving data indicating connectivity of a plurality of nodes in the network including the first node;
- selecting one of the plurality of nodes as a root node,
- building a flooding topology based on the root node and according to a selected algorithm, wherein the selected algorithm is indicated in an algorithm field of a received link state message;
- storing the flooding topology;
- and
- flooding link state messages according to the flooding topology to one or more of the plurality of nodes to prompt the one or more of the plurality of nodes to flood link state messages on the flooding topology without transmitting such link state messages through network links that are excluded from the flooding topology.
A first node in a network, the first node comprising:
- at least one processor;
- and
- one or more memories coupled to the at least one processor and storing instructions for execution by the at least one processor, the instructions instruct the at least one processor to cause the first node to:
- receive data indicating connectivity of a plurality of nodes in the network including the first node;
- select one of the plurality of nodes as a root node,
- build a flooding topology based on the root node and according to a selected algorithm, wherein the selected algorithm is indicated in an algorithm field of a received link state message;
- store the flooding topology;
- and
- flood link state messages according to the flooding topology to one or more of the plurality of nodes to prompt the one or more of the plurality of nodes to flood link state messages on the flooding topology without transmitting such link state messages through network links that are excluded from the flooding topology.
A non-transitory computer readable medium comprising a computer program product for use by a first node in a network, the computer program product comprising computer executable instructions stored on the non-transitory computer readable medium such that when executed by a processor cause the first node to:
- receive data indicating connectivity of a plurality of nodes in the network including the first node;
- selecting one of the plurality of nodes as a root node, and building a flooding topology based on the root node and according to a selected algorithm, wherein the selected algorithm is indicated in an algorithm field of a received link state message;
- store the flooding topology;
- and
- flood link state messages according to the flooding topology to one or more of the plurality of nodes to prompt the one or more of the plurality of nodes to flood link state messages on the flooding topology without transmitting such link state messages through network links that are excluded from the flooding topology.
Dependencies are inferred from the claim text.