METHOD OF DETERMINING ROUTING PATH BASED ON CHANGE IN DYNAMIC STATE OF NODES

• US 20140233561A1
• Filed: 11/11/2011
• Published: 08/21/2014
• Est. Priority Date: 11/10/2011
• Status: Active Grant

• Current Assignee: Institute for Basic Science
• Original Assignee: Korea Basic Science Institute
• Inventors: Heo, Joon, Kang, Jung Im, Lee, Jung Yeon
• Granted Patent: US 9,106,568 B2
• Time in Patent Office: Days
• US Class Current: 370/389
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/123 Evaluation of link metrics techniques for monitoring network metrics H04L43/08
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 45/64 using an overlay routing layer
• CPC Class Codes: H04L 45/70 Routing based on monitoring results

Abstract

The present invention relates to a method of determining a routing path in a communication network in which a plurality of logical networks shares a physical network, and more particularly to such a method of determining a routing path of data, in which multiple routing paths from a source node to a destination node are created based on a change in the dynamic state of a plurality of nodes constituting a logical network, and routing costs for the created multiple routing paths are calculated based on a routing registration message received from the plurality of nodes, and a process time transition value and a transmission time transition value shared by the plurality of nodes.

Claims

1. A method for determining a routing path in a communication network consisting of a plurality of nodes, the method comprising:

allowing a source node to receive a routing registration message from the remaining nodes except the source node among the plurality of nodes;

allowing the source node to create multiple routing paths from the source node to a destination node of the nodes based on a change in the dynamic state of the nodes using the received routing registration message;

allowing the source node to calculate routing costs for the created multiple routing paths based on the received routing registration message, and a process time transition value and a transmission time transition value shared by the nodes; and

allowing the source node to determine a routing path with the lowest routing cost among the multiple routing paths as a data routing path based on the calculated routing costs,

wherein the routing registration message includes node connection state information, optimum data process time, optimum data transmission time, maximum state transition information, and estimated state transition information until the present time.

2. The method according to claim 1, further comprising creating a routing table having stored therein the calculated routing costs for the multiple routing paths prior to the step of determining the routing path.

3. The method according to claim 2, wherein the source node periodically receives the registration update message including current state information and estimated state transition change information, which are measured in the nodes, from the nodes and

the source node determines a routing path with the lowest routing cost among the multiple routing paths as a data routing path based on the current state information of the registration update message and the routing costs for the multiple routing paths stored in the routing table.

4. The method according to claim 3, wherein the communication network supports the plurality of logical networks, and the plurality of logical networks selectively shares the plurality of nodes constituting the communication network.

5. The method according to claim 4, wherein the step of allowing the source node to create the multiple routing paths further comprises the steps of:

determining a single routing path from the source node to the destination node based on the node connection state information of the routing registration message; and

creating multiple routing paths from source node to the destination node based on a change in the dynamic state of an estimated state transition range of node constituting the single routing path using the estimated state transition information of the nodes constituting the single routing path.

6. The method according to claim 5, wherein the source node re-creates the multiple routing paths from source node to the destination node based on a change in the dynamic state of an estimated state transition range changed when estimated state transition information of the node is changed using on the estimated state transition change information of the registration update message.

7. The method according to claim 4, wherein the step of allowing the source node to create the multiple routing paths further comprises the steps of:

determining a single routing path from the source node to the destination node based on the node connection state information of the routing registration message; and

creating multiple routing paths from source node to the destination node based on a change in the dynamic state of a maximum state transition range of node constituting the single routing path using the maximum state transition information of the nodes constituting the single routing path.