ROUTING SWITCH DETECTING CHANGE IN SESSION IDENTIFIER BEFORE RECONFIGURING ROUTING TABLE

• US 20090092064A1
• Filed: 11/19/2008
• Published: 04/09/2009
• Est. Priority Date: 03/03/2000
• Status: Active Grant

• Current Assignee: Jason Chia-Sun Fan, Prasad P. Jogalekar, Vinay K. Bannai
• Original Assignee: Jason Chia-Sun Fan, Prasad P. Jogalekar, Vinay K. Bannai
• Inventors: Fan, Jason C., Bannai, Vinay K., Jogalekar, Prasad P.
• Granted Patent: US 7,570,603 B2
• Time in Patent Office: Days
• US Class Current: 370/255
• CPC Class Codes: H04L 2101/622 Layer-2 addresses, e.g. medium access control [MAC] addresses
• CPC Class Codes: H04L 2101/672 Short addresses
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/021 Ensuring consistency of routing table updates, e.g. by using epoch numbers
• CPC Class Codes: H04L 61/00 Network arrangements, protocols or services for addressing or naming
• CPC Class Codes: H04L 61/2596 Translation of addresses of the same type other than IP, e.g. translation from MAC to MAC addresses
• CPC Class Codes: H04L 61/35 involving non-standard use of addresses for implementing network functionalities, e.g. coding subscription information within the address or functional addressing, i.e. assigning an address to a function

Abstract

An automatic network topology identification technique is described herein. Each node in the network periodically or constantly transmits its unique address to its neighboring node. Once a node receives a different message from its neighbor, the node identifies a topology change in the network. In one embodiment, a current topology is associated with a session number. When a change in the topology is detected, the detecting node increments the session number and broadcasts the change in topology. The other nodes, detecting the changed session number, now know that there has been a change in the network. In response, the nodes in the network modify routing tables and other information stored at the node related to the topology. In one embodiment, the technique is used to reassign shortened addresses to each device on the network to support a dual-addressing mode of the network. The dual addressing mode substitutes reduced-length addresses (referred to as short addresses) for standard addresses (referred to as long addresses) for traffic whose source or destination is internal to a given virtual network topology. The required length of short addresses used for a given virtual topology is dependent on the number of devices reachable within the topology.

Claims

1. A communications network, comprising:

a plurality of routing switches interconnected by communication links, wherein each of the routing switches comprises;

one or more transceivers for being connected to associated links to one or more other routing switches in neighboring nodes;

a switch fabric for routing information to and from said one or more transceivers; and

one or more processors, said one or more processors for controlling said routing switch to;

monitor a message from a neighboring node identifying attributes of said neighboring node;

detect a change in said message from a previous message so as to identify a change in attributes of said neighboring node, corresponding to a topology change in said network;

increment a session identifier, each said session identifier being associated with a different topology of said network; and

communicate to other nodes in said network said change in topology by identifying an incremented session identifier along with information identifying said change in said topology of said network,

wherein each of said routing switches associates said same incremented session identifier to said topology.

2. The routing switch of claim 1, wherein said one or more processors for controlling said routing switch to monitor a message from a neighboring node controls said routing switch to detect neighboring node'"'"'s unique address.

3. The routing switch of claim 1, wherein said quality of said link is determined based on a bit error rate.

4. The routing switch of claim 1, wherein said one or more processors for controlling said routing switch to detect a change in said message from a previous message controls said routing switch to detect that said neighboring node has an address different from a previous address of said neighboring node.

5. The routing switch of claim 1, wherein said one or more processors for controlling said routing switch controls said routing switch to update a routing table within said routing switch based upon said topology change of said network.

6. The routing switch of claim 1, wherein said change in said topology comprises the addition or deletion of a node in the network.

7. The routing switch of claim 1, wherein said one or more processors for controlling said routing switch controls said routing switch to store in memory information regarding the status of said neighboring node upon receiving a change in said session identifier.

8. The routing switch of claim 1, wherein said information regarding the status of said neighboring node is replaced with new status information only after the topology has been stabled for a threshold period of time.

9. A computer-implemented method performed by a communications network, said network comprising nodes interconnected by communication links, said method comprising:

monitoring by each node a message from a neighboring node identifying attributes of said neighboring node;

detecting by a first node a change in said message from a previous message so as to identify a change in attributes of said neighboring node, corresponding to a topology change in said network;

incrementing a session identifier, each said session identifier being associated with a different topology of said network; and

communicating to other nodes in said network said change in said topology by identifying an incremented session identifier along with information identifying said change in said topology of said network, wherein each node associates said same incremented session identifier with said changed topology.

10. The method of claim 9, wherein said monitoring by each node comprises detecting said neighboring node'"'"'s unique address.

11. The method of claim 9, wherein said quality of said link is determined based on a bit error rate.

12. The method of claim 9, wherein said detecting a change in said message from a previous message comprises detecting that said neighboring node has an address different from a previous address of said neighboring node.

13. The method of claim 9, wherein said change in said topology comprises the addition of a node in the network.