Method of searching for available path in mesh architecture

• US 5,963,546 A
• Filed: 02/13/1997
• Issued: 10/05/1999
• Est. Priority Date: 02/14/1996
• Status: Expired due to Fees

• Current Assignee: NEC Corporation
• Original Assignee: NEC Corporation
• Inventors: Shoji, Yoshiaki
• Primary Examiner(s): Pham, Chi H.
• Assistant Examiner(s): Duong, Frank
• Application Number:
  US08/800,117
• Time in Patent Office: 964 Days
• Field of Search: 370/400, 370/401, 370/406, 370/408, 370/389, 370/352, 370/244, 370/255, 370/256, 370/238
• US Class Current: 370/255
• CPC Class Codes: H04L 45/12 Shortest path evaluation

Abstract

A method of searching for an available path in a mesh architecture in a multinode transmission system having a plurality of node apparatuses is disclosed. In setting a shortest path between first and second node apparatuses, the identity of a destination node and the immediate adjacent path along the shortest path from a source node are registered as path management data, for the source node, in a path management table. The identity of a destination node and the immediate adjacent path along the shortest path from each relay node is registered as path management data, for each relay node, in a path management table. Searching for an available path between two node apparatuses is performed on the basis of the path management data in the path management table. By limiting each data registration for each respective node to a destination and immediate path, the memory space for maintaining path management and control and the time required to search for an available path are reduced.

Claims

1. A method of searching for an available path within a mesh architecture of a transmission system including a plurality of nodes having a plurality of paths connected to a mesh network, comprising the steps of:

in setting a shortest path between first and second nodes;

registering first data associated with a transmission path connected to a first relay node adjacent to said first node, and constituting a transmission path included in said shortest path, as path management data for said first node, in a path management table;

registering second data associated with a transmission path connected to a node adjacent to each relay node present on the shortest path as path management data for said each relay node apparatus, in said path management table;

wherein said path management data contains only said single adjacent path, included in said shortest path, for each target node registered for each of the nodes; and

searching for an available path between said nodes on the basis of the path management data in said path management table.

2. A method as claimed in claim 1, further comprising the step of erasing path management data from said path management table when a corresponding transmission path registered in said path management table is not used within a predetermined period of time.

3. A method as claimed in claim 2, wherein each data registering step further comprises the step of registering, in said path management table, time data indicating the time a transmission path was used, and wherein the step of erasing the path management data from said path management table comprises the step of erasing path management data in accordance with the time data in said path management table.

4. A method as claimed in claim 3, further comprising the step of, when data associated with a transmission path connected to said second node and constituting the shortest path has already been registered as path management data for said first node and for said each relay node apparatus in said path management table, updating corresponding time data of the path management data in said path management table.

5. A method as claimed in claim 4, further comprising the step of chronologically sorting path management data when time data of the path management data is updated.

6. A method as claimed in claim 1, wherein the path management data further comprises the identity of a target node indicated by said second node, a transmission path connecting an adjacent node to said second node, said transmission path included in said shortest path, and a time when said transmission path was used.

7. A method as claimed in claim 1, wherein each of the steps of registering the data associated with the transmission paths in said path management table further comprises the step of registering at least one transmission path in said path management table corresponding to said second node as a target node.

8. A method as claimed in claim 1, wherein each of the steps of registering the data associated with the transmission paths in said path management table comprises registering transmission paths in said path management table corresponding to said second node and at least one of said each relay node as target nodes.

9. A method of searching for an available path within a mesh architecture of a transmission system including a plurality of nodes having a plurality of paths connected to a mesh network, comprising the steps of:

in setting a shortest path between first and second nodes;

registering first data associated with a transmission path connected to a first relay node adjacent to said first node, and constituting a transmission path included in said shortest path, as path management data for said first node, in a path management table;

registering second data associated with a transmission path connected to a node adjacent to each relay node present on the shortest path as path management data for said each relay node apparatus, in said path management table;

searching for an available path between said nodes on the basis of the path management data in said path management table; and

erasing path management data from said path management table when a corresponding transmission path registered in said path management table is not used within a predetermined period of time.

10. A method as claimed in claim 9, wherein each data registering step further comprises the step of registering, in said path management table, time data indicating the time a transmission path was used, and wherein the step of erasing the path management data from said path management table comprises the step of erasing path management data in accordance with the time data in said path management table.

11. A method as claimed in claim 10, further comprising the step of, when data associated with a transmission path connected to said second node and constituting the shortest path has already been registered as path management data for said first node and for said each relay node apparatus in said path management table, updating corresponding time data of the path management data in said path management table.

12. A method as claimed in claim 11, further comprising the step of chronologically sorting path management data when time data of the path management data is updated.

13. A method as claimed in claim 9, wherein the path management data further comprises the identity of a target node indicated by said second node, a transmission path connecting an adjacent node to said second node, said transmission path included in said shortest path, and a time when said transmission path was used.

14. A method as claimed in claim 9, wherein each of the steps of registering the data associated with the transmission paths in said path management table further comprises the step of registering at least one transmission path in said path management table corresponding to said second node as a target node.

15. A method as claimed in claim 9, wherein each of the steps of registering the data associated with the transmission paths in said path management table comprises registering transmission paths in said path management table corresponding to said second node and at least one of said each relay node as target nodes.