Resource matched topology database synchronization in communications networks having topology state routing protocols
View Patent ↗A method for selecting a neighboring node to synchronize network topology database information with a network node from among a plurality of neighboring nodes coupled to the network node in a network, the method comprising: receiving from each of the neighboring nodes an identifier and an indication as to whether synchronization resources have been assigned to the network node; comparing by magnitude the identifier of the neighboring node with identifiers of others of the neighboring nodes to determine whether to synchronize with the neighboring node; and, synchronizing with the neighboring node if the neighboring node has assigned synchronization resources to the network node.
1. A method for selecting a neighboring node to synchronize network topology database information with a network node from among a plurality of neighboring nodes coupled to the network node in a network, the method comprising:
receiving, from each of the neighboring nodes, an identifier selected from a group consisting of a unique value, an Internet Protocol (IP) address, an Asynchronous Transfer Mode (ATM) address, and a node identification (ID) number, and an indication as to whether synchronization resources have been assigned to the network node;
comparing, for each of the neighboring nodes, the identifier of the neighboring node with identifiers of other neighboring nodes to select at least one neighboring node having an identifier with an extreme value;
assigning synchronization resources to the at least one selected neighboring node; and
synchronizing the network node with the at least one selected neighboring node after assigning synchronization resources.
2. The method of claim 1 , further comprising the following step:
sending an indication of assignment of synchronization resources to the at least one neighboring node.
3. The method of claim 1 wherein the synchronization resources are at least one of node memory, node input/output capacity, and node processor capacity.
4. The method of claim 1 wherein the indication is a flag and the identifier is a field contained in one or more messages communicated over the network.
5. The method of claim 4 wherein the network is an ATM network.
6. The method of claim 5 wherein the messages are at least one of Private Network-Node Interface (“PNNI”) Hello protocol messages and PNNI database summary packets.
7. The method of claim 1 wherein the network node and each of the plurality of neighboring nodes are at least one of a router, a switch, and a data processing system.
8. The method of claim 1 , further comprising the following step:
receiving an indication of priority to synchronize with the network node from each of the neighboring nodes.
9. The method of claim 8 , further comprising the following step:
comparing a priority of the neighboring node with priorities of others of the neighboring nodes to determine whether to synchronize with the neighboring node.
10. The method of claim 1 , further comprising the following step:
determining whether the neighboring node belongs to a group of neighboring nodes having one of largest and smallest identifier magnitudes, the group having a number of neighboring nodes determined by synchronization resources available within the network node.
11. A system for selecting a neighboring node with which to synchronize network topology database information with a network node from among a plurality of neighboring nodes coupled to the system in a network, the system comprising:
a processor coupled to memory and an interface to the network that;
receives, from each of the neighboring nodes, an identifier selected from a group consisting of a unique value, an Internet Protocol (IP) address, an Asynchronous Transfer Mode (ATM) address, and a node identification (ID) number, and an indication as to whether synchronization resources have been assigned to the system;
compares the identifier of the neighboring node with identifiers of other neighboring nodes to select at least one neighboring node having an identifier with an extreme value;
assigns synchronization resources to the at least one selected neighboring node; and
synchronizes the network node with the at least one selected neighboring node after assigning synchronization resources.
12. The system of claim 11 , wherein the processor
sends an indication of assignment of synchronization resources to the neighboring node.
13. The system of claim 11 wherein the synchronization resources are at least one of node memory, node input/output capacity, and node processor capacity.
14. The system of claim 11 wherein the indication is a flag and the identifier is a field contained in one or more messages communicated over the network.
15. The system of claim 14 wherein the network is an ATM network.
16. The system of claim 15 wherein the messages are at least one of Private Network-Node Interface (“PNNI”) Hello protocol messages and PNNI database summary packets.
17. The system of claim 11 wherein the network node and each of the plurality of neighboring nodes are at least one of a router, a switch, and a data processing system.
18. The system of claim 11 wherein the processor receives an indication of priority to synchronize with the network node from each of the neighboring nodes.
19. The system of claim 18 wherein the processor compares a priority of the neighboring node with priorities of others of the neighboring nodes to determine whether to synchronize with the neighboring node.
20. The system of claim 11 wherein the processor determines whether the neighboring node belongs to a group of neighboring nodes having one of largest and smallest identifier magnitudes, the group having a number of neighboring nodes determined by synchronization resources available within the network node.
21. A computer program product recorded on a computer readable storage medium having computer executable code for directing a data processing system to select a neighboring node with which to synchronize network topology database information with a network node from among a plurality of neighboring nodes coupled to the data processing system in a network, the code comprising:
code recorded on a computer readable storage medium that receives from each of the neighboring nodes an identifier selected from a group consisting of a unique value, an Internet Protocol (IP) address, an Asynchronous Transfer Mode (ATM) address, and a node identification (ID) number, and an indication as to whether synchronization resources have been assigned to the data processing system;
code recorded on a computer readable storage medium that compares the identifier of the neighboring node with identifiers of others of the neighboring nodes to select at least one neighboring node having an identifier with an extreme value;
code recorded on a computer readable storage medium that assigns synchronization resources to the at least one selected neighboring node; and
code recorded on a computer readable storage medium that synchronizes with the selected neighboring node after assigning synchronization resources.
22. The computer program product of claim 21 , further comprising: code recorded on a computer readable storage medium that sends an indication of assignment of synchronization resources to the neighboring node.
23. The computer program product of claim 21 wherein the synchronization resources are at least one of node memory, node input/output capacity, and node processor capacity.
24. The computer program product of claim 21 wherein the indication is a flag and the identifier is a field contained in one or more messages communicated over the network.
25. The computer program product of claim 24 wherein the network is an ATM network.
26. The computer program product of claim 25 wherein the messages are at least one of Private Network-Node Interface (“PNNI”) Hello protocol messages and PNNI database summary packets.
27. The computer program product of claim 21 wherein the network node and each of the plurality of neighboring nodes are at least one of a router, a switch, and a data processing system.
28. The computer program product of claim 21 , further comprising: code recorded on a computer readable storage medium that receives an indication of priority to synchronize with the network node from each of the neighboring nodes.
29. The computer program product of claim 28 , further comprising: code recorded on a computer readable storage medium that compares a priority of the neighboring node with priorities of others of the neighboring nodes to determine whether to synchronize with the neighboring node.
30. The computer program product of claim 21 , further comprising: code recorded on a computer readable storage medium that determines whether the neighboring node belongs to a group of neighboring nodes having one of largest and smallest identifier magnitudes, the group having a number of neighboring nodes determined by synchronization resources available within the network node.