Method of determining routing path based on change in dynamic state of nodes
First Claim
1. A method for determining a routing path in a communication network of a plurality of nodes, the method comprising:
- receiving, by a source node, a routing registration message from the remaining nodes other than the source node among the plurality of nodes;
creating, by the source node, multiple routing paths from the source node to a destination node based on a change in a dynamic state of the remaining nodes using the received routing registration message;
calculating, by the source node, 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 remaining nodes;
creating, by the source node, a routing table having stored therein the calculated routing costs for the multiple routing paths; and
determining, by the source node, 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,wherein the source node periodically receives a registration update message including current state information and estimated state transition change information, which are measured in the remaining nodes, from the remaining nodes,wherein 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.
2 Assignments
0 Petitions
Accused Products
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.
4 Citations
5 Claims
-
1. A method for determining a routing path in a communication network of a plurality of nodes, the method comprising:
-
receiving, by a source node, a routing registration message from the remaining nodes other than the source node among the plurality of nodes; creating, by the source node, multiple routing paths from the source node to a destination node based on a change in a dynamic state of the remaining nodes using the received routing registration message; calculating, by the source node, 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 remaining nodes; creating, by the source node, a routing table having stored therein the calculated routing costs for the multiple routing paths; and determining, by the source node, 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, wherein the source node periodically receives a registration update message including current state information and estimated state transition change information, which are measured in the remaining nodes, from the remaining nodes, wherein 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. - View Dependent Claims (2, 3, 4, 5)
-
Specification