Restricted dissemination of topology information in a communication network

• US 20060010249A1
• Filed: 10/13/2004
• Published: 01/12/2006
• Est. Priority Date: 06/09/2004
• Status: Abandoned Application

• Current Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Original Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Inventors: Sabesan, Subramaniam, Biddiscombe, Martin, Denney, Glenn
• Application Number:
  US10/975,067
• Publication Number:
  US 20060010249A1
• Time in Patent Office: Days
• US Class Current: 709/238
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/03 by updating link state protocols
• CPC Class Codes: H04W 40/20 based on geographic position or location
• CPC Class Codes: H04W 40/30 for proactive routing

Abstract

A communication network comprises a plurality of nodes interconnected by communication links. A node maintains a database of topology information relating to the network. A node receives a topology advertisement from another node of the network which provides information about a part of the network. The topology advertisement includes a metric which is related to aggregate distance or cost of the path travelled by the topology advertisement. The node compares the metric in the newly received topology advertisement with one previously received for the same part of the network. The database is updated with the newly received topology advertisement if the value of the metric in the newly received topology advertisement is lower than the metric in the topology advertisement previously received for the same part of the network. The method can be used during flooding or database synchronisation. The metric can be carried within a header or body of a topology advertisement, such as a Link State Advertisement (LSA).

Claims

1. A method of processing topology information at a node within a communication network, the network comprising a plurality of nodes interconnected by communication links, the node comprising a database of topology information relating to the network, the method comprising:

receiving a topology advertisement from another node of the network which provides information about a part of the network;

comparing a metric within the newly received topology advertisement which is related to aggregate distance or cost of the path travelled by the topology advertisement with the metric of a topology advertisement previously received for the same part of the network; and

,

updating the database with the newly received topology advertisement if the value of the metric in the newly received topology advertisement is lower than the metric in the topology advertisement previously received for the same part of the network.

2. A method according to claim 1 wherein the comparing step comprises updating the metric in the newly received topology advertisement to include a value indicative of the distance or cost of the most recent portion of the path before comparing the metric of the newly received topology advertisement with one previously received.

3. A method according to claim 1 further comprising selectively forwarding the topology advertisement to another node if the metric is less than a predetermined value.

4. A method according to claim 3 further comprising acknowledging receipt of the topology advertisement, regardless of whether the topology advertisement is useful to the node.

5. A method according to claim 3 further comprising updating the value of the metric to include a value indicative of the distance or cost of the most recent portion of the path before forwarding the topology advertisement.

6. A method according to claim 1 further comprising an initial step of requesting a further copy of a topology advertisement which is already stored in the database.

7. A method according to claim 1 wherein the step of receiving a topology advertisement includes calculating a checksum on the contents of the topology advertisement which ignores the metric field, and comparing the checksum with a checksum value within the received topology advertisement.

8. A method according to claim 1 further comprising performing a calculation of a shortest path between nodes using information in the database, comparing a calculated shortest path with a metric in a stored topology advertisement received via that path and, if the calculated shortest path is less than the metric, forwarding a topology advertisement to another node which includes a metric representing the calculated shortest path.

9. A method according to claim 1 wherein the topology advertisement is a link state advertisement.

10. A node for use as part of a communication network, the network comprising a plurality of nodes interconnected by communication links, the node comprising a database of topology information relating to the network and control logic which is operable to:

receive a topology advertisement from another node of the network which provides information about a part of the network;

compare a metric within the newly received topology advertisement which is related to aggregate distance or cost of the path travelled by the topology advertisement with the metric of a topology advertisement previously received for the same part of the network; and

,

update the database with the newly received topology advertisement if the value of the metric in the newly received topology advertisement is lower than the metric in the topology advertisement previously received for the same part of the network.

11. A node according to claim 10 wherein the control logic is further operable to update the metric in the newly received topology advertisement to include a value indicative of the distance or cost of the most recent portion of the path before comparing the metric of the newly received topology advertisement with one previously received.

12. A node according to claim 10 wherein the control logic is further operable to selectively forward the topology advertisement to another node if the metric is less than a predetermined value.

13. A node according to claim 12 wherein the control logic is further operable to acknowledge receipt of the topology advertisement, regardless of whether the topology advertisement is useful to the node.

14. A node according to claim 12 wherein the control logic is further operable to update the value of the metric to include a value indicative of the distance or cost of the most recent portion of the path before forwarding the topology advertisement.

15. A node according to claim 10 wherein the control logic is further operable to request a further copy of a topology advertisement which is already stored in the database.

16. A node according to claim 10 wherein the control logic is further operable to calculate a checksum on the contents of the topology advertisement which ignores the metric field, and compare the checksum with a checksum value within the received topology advertisement.

17. A node according to claim 10 wherein the control logic is further operable to perform a calculation of a shortest path between nodes using information in the database, compare a calculated shortest path with a metric in a stored topology advertisement received via that path and, if the calculated shortest path is less than the metric, forward a topology advertisement to another node which includes a metric representing the calculated shortest path.

18. A node according to claim 10 wherein the topology advertisement is a link state advertisement.

19. A communication network including at least one node according to claim 10.

20. A computer program product comprising a machine readable medium carrying instructions for controlling a node of a communication network, the network comprising a plurality of nodes interconnected by communication links, the node comprising a database of topology information relating to the network, the instructions causing the node to:

receive a topology advertisement from another node of the network which provides information about a part of the network;

compare a metric within the newly received topology advertisement which is related to aggregate distance or cost of the path travelled by the topology advertisement with the metric of a topology advertisement previously received for the same part of the network; and

,

update the database with the newly received topology advertisement if the value of the metric in the newly received topology advertisement is lower than the metric in the topology advertisement previously received for the same part of the network.

21. A signal for transmission across a communication network which carries a topology advertisement message, the message comprising a header and a body and wherein a metric indicative of the distance travelled by the message is included within the header.

22. A signal for transmission across a communication network which carries a topology advertisement message, the message comprising a header and a body and wherein a metric indicative of the distance travelled by the message is included within the body.

23. A signal according to claim 22 wherein the topology advertisement is a link state advertisement.

24. A signal according to claim 23 wherein the link state advertisement is an Open Shortest Path First (OSPF) Link State Advertisement (LSA), the body of the message comprises a flags field and the metric is positioned within the flags field.

25. A signal according to claim 24 wherein the metric is positioned within the unused 13 bits of the flags field.