Method and apparatus for controlling the dissemination of routing information on a communication network

• US 7,697,454 B2
• Filed: 01/14/2004
• Issued: 04/13/2010
• Est. Priority Date: 01/14/2004
• Status: Active Grant

• Current Assignee: Avaya Management L.P. (Avaya Incorporated)
• Original Assignee: Avaya Incorporated
• Inventors: Smith, Peter Ashwood
• Primary Examiner(s): Patel, Jayanti K
• Assistant Examiner(s): PARK, JUNG H
• Application Number:
  US10/757,139
• Publication Number:
  US 20050152333A1
• Time in Patent Office: 2,281 Days
• Field of Search: None
• US Class Current: 370/254
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/03 by updating link state protocols

Abstract

The propagation of link state advertisements (LSAs) is limited by defining a propagation radius on the network, measured by sum of link cost, or using another metric. By limiting the distance a LSA will propagate on the network it is possible to limit LSA traffic on the network without defining areas on the network. This eliminates the need to name those areas and designate nodes as belonging to particular areas, which enables the nodes to be added on an ad-hoc basis without a centralized management structure. Additionally, this enables the nodes to be mobile on the network without requiring close monitoring and updating of area affiliation by the nodes. Further, not having areas on the network eliminates the requirement for area border routers to control link state advertisements, reduces or eliminates special intra-area communication protocol exchanges, and avoids potential congestion which may occur in connection with inter-area traffic.

Claims

1. A method of controlling the dissemination of routing information on a communication network without requiring flooding areas to be pre-defined on the communication network, the method comprising the steps of:

defining a maximum flooding radius for each link state advertisement to be flooded on the network, the maximum flooding radius enabling dissemination of the link state advertisement to be controlled on the network; and

preventing, by each network element on the communication network, link state advertisements from flooding beyond their maximum flooding radius to control the dissemination of routing information by each node on the communication network without requiring flooding areas to be pre-defined on the communication network to thereby implement radius limited dissemination of routing information by each node on the communication network.

2. A network topology, comprising:

a plurality of OSPF routers interconnected in a network, each of said plurality of OSPF routers being configured to define a maximum flooding radius for link state advertisements to be flooded on the network, the maximum flooding radius enabling dissemination of the link state advertisement to be controlled on the network; and

each of the plurality of OSPF routers being further configured to prevent link state advertisements from flooding beyond their maximum flooding radius to control the dissemination of routing information by each of the plurality of OSPF routers on the network without requiring flooding areas to be pre-defined on the network, to thereby implement radius limited dissemination of routing information by each of the plurality of OSPF routers on the network, such that not every OSPF router within the an OSPF area receives every Link State Advertisement (LSA).

3. The network topology of claim 2, wherein the plurality of OSPF routers are interconnected in an ad-hoc wireless mesh network.

4. The network topology of claim 2, wherein the network is configured such that LSAs are disseminated only a predefined distance within the OSPF area.

5. The network topology of claim 2, wherein a subset of the OSPF routers are focal nodes.

6. The network topology of claim 5, wherein the network is configured such that LSAs are disseminated only a predetermined distance within the OSPF area.

7. The network topology of claim 6, wherein the predetermined distance is selected such that each LSA is received by at least two focal nodes.

8. The network topology of claim 6, wherein nodes on the network other than focal nodes are configured to maintain a routing table containing information obtained from LSAs, said routing table containing information associated with at least two focal nodes.

9. The network topology of claim 5, wherein the focal nodes are area border routers to an OSPF backbone area.

10. The network topology of claim 9, wherein the focal nodes on the OSPF backbone area are configured to disseminate link state information for nodes in their local area, their local area being defined as that portion of the network from which the focal nodes receive LSAs.

11. A network node, comprising:

ports interconnected by a switch fabric to enable the network node to communicate on a network; and

control logic configured to inspect a link state advertisement received from the network, ascertain link state information from the link state advertisement, determine a relevance of the link state information; and

selectively drop the link state advertisement if the link state information is not relevant;

the control logic being further configured to enable the network node to participate in defining a maximum flooding radius for each link state advertisement to be flooded on the network, the maximum flooding radius for a particular link state advertisement enabling dissemination of that particular link state advertisement to be controlled on the network; and

the control logic being still further configured to enable the node to prevent link state advertisements from flooding beyond their maximum flooding radius to control the dissemination of routing information by the node on the communication network without requiring flooding areas to be pre-defined on the communication network to thereby implement radius limited dissemination of routing information by the node and a plurality of similarly configured other nodes on the communication network.

12. The network node of claim 11, wherein the relevance is a sum of link costs associated with the link state advertisement.

13. The network node of claim 11, further comprising a routing table, and wherein the control logic is further configured to update information in the routing table from the link state information contained in the link state advertisement if the link state information is determined to be relevant.

14. The network node of claim 11, further comprising a routing table, and wherein the control logic is further configured to update information in the routing table from the link state information contained in the link state advertisement, and wherein the control logic is configured to selectively drop the link state advertisement if the link state information contained in the link state advertisement is not likely to be relevant to another node on the network.