KR101395009B1 - Method and apparatus for selecting route - Google Patents

Abstract

A method and an apparatus for selecting a routing path are disclosed. A desirable embodiment of the present invention determines whether a size of data to be transmitted is at least a preset reference size or more than a preset reference size and, in the case that the size of the data to be transmitted is at least the preset reference size or more than the preset reference size, selects a routing path, having an RTT value whose maximum among RTT values between nodes positioned thereon is the smallest, among routing paths connectable between a source and a destination. The present invention may more rapidly transmit or receive data as compared with a method of selecting the shortest path by simply summing the RTTs, and may more effectively reduce data transmission time in the case of a physically distant network like an international network or large capacity data transmission.

Description

[0001] The present invention relates to a method and apparatus for selecting a routing path,

BACKGROUND OF THE INVENTION 1. Field of the Invention [0002] The present invention relates to a routing path selection method and apparatus, and more particularly, to a routing path selection method and apparatus between nodes that enable faster data transmission.

A network is a channel through which information can be exchanged with each other.

The devices constituting such a network are called various names such as a server, a client, a router, a switch, and the like according to functions and locations, but generally, When each or a combination of these is regarded as one set, each set is generally referred to as a node.

In addition, a device that is to transmit information, that is, data, on a network is referred to as a source, and a device that will eventually receive data is referred to as a destination.

On the other hand, with the development of electric / electronic devices and networks, the configuration of such networks is becoming more and more complicated, and therefore, in order to transfer data from a source to a destination, data may be directly transmitted from a source to a destination, Data is transmitted through various devices in a variety of paths.

Thus, it is very important to determine the optimal path for transmission from the source to the destination, that is, the communication.

Choosing or setting the path through which such data is transmitted is referred to as routing, and the path through which the selected data passes is called a routing path or simply a path.

Currently, various methods for selecting such a routing path have been researched and developed, but the shortest path selection method is generally used most widely.

The shortest path is the path with the shortest distance to transmit data from the source to the destination.

The distance between a node and a node in a network not only includes the physical and geographical distances between the nodes where the actual node is located, but also includes a concept according to the data transmission speed between the node and the node.

However, in general, the distance measurement between nodes is a relative concept according to a data transmission speed between a node and a node, and a distance measurement method using RTT (Round Trip Time) measurement is generally used as the measurement method.

1, a path from a source to a destination, that is, a routing path is A, B, and C, respectively.

In the example of FIG. 1, RTT 20 ms from the source to the node 1, 130 ms from the node 1 to the node, and RTT from the node 2 to the destination through the node 1, the node 2, The sum of the RTTs between each node from the source to the destination is 60ms, which is 210ms.

In the case of the C path, the sum of the RTTs between the nodes 3 and 4 and the two nodes is 210 ms by the same method.

On the other hand, since the RTT is 190 ms in the case of the B path, which is a path directly from the source to the destination, the B path by the conventional shortest path selection method is selected.

However, in the shortest path selection method, when the RTT is large between one node, i.e., one hop, data transmission time is larger than other paths in actual data transmission.

In particular, in the case of a network such as the international network connecting the countries and countries where the physical distance between the nodes is considerably large, the number of RTTs in one hop is large. Therefore, There is a problem that the data transmission time is larger than other paths in actual data transmission.

Also, in the case of a large amount of data transmission, in the case of selecting the shortest path by simple summing of RTT, there is a problem that data transmission time is larger than other paths in actual data transmission due to a bottleneck on the selected routing path.

In order to solve the above-described problems, the present invention proposes a routing path selection method and apparatus that can reduce a data transmission time compared to a simple shortest path selection method.

It also proposes a routing path selection method and apparatus that can reduce the data transmission time on a physically distant network such as an international network.

In addition, the present invention proposes a routing path selection method and apparatus that can reduce the data transmission time even in the case of a large amount of data.

Other objects of the present invention will become readily apparent from the following description of the embodiments.

According to an aspect of the present invention, a routing path selection method is provided.

According to a preferred embodiment of the present invention, there is provided a routing path selection method for selecting a routing path from a source for transmitting data to a destination for receiving data in a network composed of a plurality of nodes, Determining whether the reference size is greater than or equal to a set reference size; And a maximum value of each Round Trip Time (RTT) value between nodes located on the path for each possible routing path from the source to the destination when the size of the data to be transmitted is greater than or equal to a preset reference size Selecting a routing path having the smallest value is provided.

If the size of the data to be transmitted is greater than or equal to a preset reference size, only a routing path that is within a predetermined range in comparison with a path having the smallest sum of RTTs for each possible routing path from the source to the destination is selected, It is possible to perform a step of selecting a routing path having the smallest maximum value among the RTT values between the nodes located on the path only for each of the paths.

When the size of the data to be transmitted is greater than or equal to a preset reference size, a routing path having the smallest maximum value among the RTT values among the nodes located on the route for each possible routing path from the source to the destination is selected A routing path having a hop count of a maximum among the available routing paths from the source to the destination can be selected when the routing path having the smallest maximum value is a plurality of routing paths.

In addition, the maximum hop count is an RTT with a minimum RTT between each node among the possible routing paths from the source to the destination, and the RTT of the route with the smallest sum of the RTTs among the possible routing paths from the source to the destination The value divided by the sum is set as the effective hop count, and only the hop count within the range of the valid hop count can be selected.

When the size of the data to be transmitted is greater than or equal to a preset reference size, a routing path having the smallest maximum value among the RTT values among the nodes located on the route for each possible routing path from the source to the destination is selected A routing path having a minimum deviation of RTT values between nodes located on a path is selected for each of the possible routing paths from the source to the destination when a plurality of routing paths having the smallest maximum value are selected .

If the size of the data to be transmitted is less than or equal to a predetermined reference size, a path having the smallest sum of RTTs among the possible routing paths from the source to the destination can be selected.

According to another aspect of the present invention, there is provided a routing path selecting apparatus.

According to a preferred embodiment of the present invention, there is provided an apparatus for selecting a routing path from a source for transmitting data to a destination for receiving data in a network composed of a plurality of nodes, A data size comparing unit for determining whether the reference size is greater than or equal to a preset reference size; And when a size of data to be transmitted is greater than or equal to a predetermined reference size, a maximum value of RTT (Round Trip Time) values between nodes located on a path for each possible routing path from the source to the destination is the smallest value And a routing path selection unit for selecting a routing path having the routing path selection unit.

Wherein the routing path selector selects one of the routing paths from the source to the destination when the size of the data to be transmitted is greater than or equal to a preset reference size, And selects the routing path having the smallest maximum value among the Round Trip Time (RTT) values between the nodes located on the route only for each of the selected routes.

The routing path selection unit selects a routing path from the source to the destination when there is a plurality of routing paths having the smallest maximum value among the RTT values between the nodes located on the path for each possible routing path from the source to the destination It is possible to select a routing path having the highest hop count among the routing paths.

In addition, the maximum hop count is an RTT with a minimum RTT between each node among the possible routing paths from the source to the destination, and the RTT of the route with the smallest sum of the RTTs among the possible routing paths from the source to the destination The value divided by the sum is set as the effective hop count, and only the hop count within the range of the valid hop count can be selected.

Wherein the routing path selection unit selects one of a plurality of routing paths having a smallest maximum value among round trip time (RTT) values between nodes located on a path for each possible routing path from the source to the destination, For each of the possible routing paths from the destination to the destination, a routing path with a minimum deviation of the RTT values between the nodes located on the path.

If the size of the data to be transmitted is less than or equal to a preset reference size, the routing path selector may select a path having the smallest sum of RTTs among the possible routing paths from the source to the destination have.

According to another aspect of the present invention, there is provided a recording medium recording a program for implementing a routing path selection method.

According to a preferred embodiment of the present invention, there is provided a program for implementing a routing path selection method from a source for transmitting data to a destination for receiving data in a network constituted by a plurality of nodes, Determining whether a size of data to be transmitted is greater than or equal to a preset reference size; And a maximum value of each Round Trip Time (RTT) value between nodes located on the path for each possible routing path from the source to the destination when the size of the data to be transmitted is greater than or equal to a preset reference size And selecting a routing path having the smallest value. The recording medium records the program for implementing the routing path selection method.

If the size of the data to be transmitted is greater than or equal to a preset reference size, only a routing path that is within a predetermined range in comparison with a path having the smallest sum of RTTs for each possible routing path from the source to the destination is selected, It is possible to perform a step of selecting a routing path having the smallest maximum value among the RTT values between the nodes located on the path only for each of the paths.

When the size of the data to be transmitted is greater than or equal to a preset reference size, a routing path having the smallest maximum value among the RTT values among the nodes located on the route for each possible routing path from the source to the destination is selected A routing path having a hop count of a maximum among the available routing paths from the source to the destination can be selected when the routing path having the smallest maximum value is a plurality of routing paths.

In addition, the maximum hop count is an RTT with a minimum RTT between each node among the possible routing paths from the source to the destination, and the RTT of the route with the smallest sum of the RTTs among the possible routing paths from the source to the destination The value divided by the sum is set as the effective hop count, and only the hop count within the range of the valid hop count can be selected.

When the size of the data to be transmitted is greater than or equal to a preset reference size, a routing path having the smallest maximum value among the RTT values among the nodes located on the route for each possible routing path from the source to the destination is selected A routing path having a minimum deviation of RTT values between nodes located on a path is selected for each of the possible routing paths from the source to the destination when a plurality of routing paths having the smallest maximum value are selected .

If the size of the data to be transmitted is less than or equal to a predetermined reference size, a path having the smallest sum of RTTs among the possible routing paths from the source to the destination can be selected.

As described above, according to the routing path selection method and apparatus of the present invention, it is possible to transmit / receive data faster than the shortest path selection by simple summing of RTTs.

In addition, there is an advantage in that data transmission time can be reduced on a physically distant network such as an international network.

And a method and apparatus for selecting a routing path that can reduce data transmission time more effectively in the case of large-capacity data transmission.

1 is an exemplary diagram illustrating a path between a source and a destination;
BACKGROUND OF THE INVENTION 1. Field of the Invention [0002] The present invention relates to a routing path selection method,
3 is a diagram illustrating a configuration of a routing path selection apparatus according to a preferred embodiment of the present invention.
FIG. 4 is a diagram comparing data transmission times according to a conventional shortest path selection method and a routing path selection method according to a preferred embodiment of the present invention; FIG.

While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the invention is not intended to be limited to the particular embodiments, but includes all modifications, equivalents, and alternatives falling within the spirit and scope of the invention.

Like reference numerals are used for like elements in describing each drawing. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail with reference to the accompanying drawings.

The terms first, second, etc. may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.

For example, without departing from the scope of the present invention, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component.

And / or < / RTI > includes any combination of a plurality of related listed items or any of a plurality of related listed items.

It is to be understood that when an element is referred to as being "connected" or "connected" to another element, it may be directly connected or connected to the other element, .

On the other hand, when an element is referred to as being "directly connected" or "directly connected" to another element, it should be understood that there are no other elements in between.

The terminology used in this application is used only to describe a specific embodiment and is not intended to limit the invention.

The singular expressions include plural expressions unless the context clearly dictates otherwise. In the present application, the terms "comprises" or "having" and the like are used to specify that there is a feature, a number, a step, an operation, an element, a component or a combination thereof described in the specification, But do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, or combinations thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as either ideal or overly formal in the sense of the present application Do not.

Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings, wherein like or corresponding elements are denoted by the same reference numerals, and a duplicate description thereof will be omitted.

First, a process of selecting a routing path according to a preferred embodiment of the present invention will be described with reference to FIG.

FIG. 2 is a flowchart illustrating a process of selecting a routing path according to an exemplary embodiment of the present invention. Referring to FIG.

As shown in FIG. 2, the routing path selection method according to an exemplary embodiment of the present invention first compares the size of data to be transmitted with a preset reference size (S200).

The preset reference size can be variously set according to the situation of the network, the type of data, the performance of the nodes constituting the network, and the like.

If the size of the data to be transmitted is not larger than a preset reference size, a route having a minimum sum of RTTs is selected on a path that is the shortest path selection method as in the conventional art (S202).

The size of the data to be transmitted is not large compared with the predetermined reference size includes the case where the size of the data to be transmitted is less than or equal to a preset reference size.

However, if the size of the data to be transmitted is larger than the predetermined reference size, a path including the minimum value of the RTT between the node and the node constituting the path is minimum (S204).

The size of the data to be transmitted is larger than the predetermined reference size includes all the cases where the size of the data to be transmitted is larger than or equal to a preset reference size.

Meanwhile, in order to find a path including the minimum value of the maximum RTT between the node and the node constituting the path due to the complexity of the network configuration, a process of comparing all the RTT values between the respective nodes in a number of paths is performed It can take a lot of time.

Assuming such a case, the sum of the RTTs is compared with the sum of the RTTs of the shortest paths before the route including the minimum value of the maximum RTT between the node and the nodes constituting the path is selected as the routing path. It is also possible to select only the path in the case where

For example, assume that the sum of the RTTs of the shortest paths is 190 ms and the sum of the RTTs of the other paths A, B, C, and D is 210, 220, 250, and 270 ms.

In this case, only the path that is within 30ms, which is the sum of the RTT of the shortest path, is selected first, and the maximum value of the RTT value between each node constituting the path only for paths A and B is calculated. The smaller or the minimum path is chosen as the routing path.

On the other hand, there may be a case where a plurality of paths having the minimum value of the RTT is minimum.

Therefore, a path having the maximum hop count can be selected as information to be used additionally for routing path selection (S206).

In this case, it is preferable to select the path having the maximum hop count from among the plurality of paths selected when there is a plurality of paths having the smallest maximum value of the RTT, but the present invention is not limited thereto.

As a method of selecting a path having the maximum hop count, more specifically, a method of selecting a minimum RTT among RTTs between respective nodes constituting each path and dividing the sum of RTTs in each path by a minimum RTT Value to the effective hop count, and the hop count maximum value can be determined within a range that does not exceed the calculated effective hop count.

In addition, it is possible to select a path having a minimum deviation of RTT as additional information to be used for selecting a routing path (S208).

In this case, it is preferable to select a path having a minimum deviation of the RTT among the plurality of paths selected when there is a plurality of paths having the smallest maximum value of the RTT, but the present invention is not limited thereto.

That is, in the present invention, in the case of data having a large data size, the routing path is selected in consideration of the maximum value of the RTT, the hop count, and the RTT deviation rather than the shortest path.

In the description of FIG. 2, the route with the minimum RTT value is selected first, followed by the hop count, and then the RTT deviation is taken into consideration. However, RTT maximum value, hop count and RTT It is obvious that the application order and application method of the deviation can be variously changed.

Alternatively, the routing path may be selected from a source to which data is to be transmitted or a destination from which data is to be received. Alternatively, the routing path may be selected using a separate device, and the selected routing path information may be transmitted to the source or destination It is also possible to transmit and receive data through the network.

In addition, it is possible to select a routing path included in each node constituting the network as a routing policy.

Meanwhile, the routing path selection method according to the present invention is applicable to all communication networks, but may be more effective in an overlay network, which is another network configured on the basis of the existing network.

The overlay network is known as a virtual network formed by configuring separate nodes and logical links on an existing network to utilize the existing network to provide more efficient service.

In particular, the present invention can be more effectively applied to widely used TCP (Transfer Control Protocol) -based networks, but the types of networks and protocols are not limited thereto.

Meanwhile, it is apparent that the above-described routing path selection method can be implemented by being implemented in the form of a program, and that the program is installed in the digital processing apparatus and can be performed through the program.

Hereinafter, a configuration of a routing path selection device for selecting the routing path will be described with reference to FIG.

3 is a diagram illustrating a configuration of a routing path selection apparatus according to an exemplary embodiment of the present invention.

As shown in FIG. 3, the routing path selection apparatus according to an exemplary embodiment of the present invention may include a data size comparison unit 300 and a routing path selection unit.

The data comparison unit 300 compares the size of data to be transmitted or received with a preset reference size.

The routing path selector 310 selects the shortest path if the size of the data to be transmitted or received is less than or equal to a predetermined reference size according to the comparison result in the data comparison unit 300.

However, according to the comparison result of the data comparison unit 300, if the size of the data to be transmitted or received is greater than or equal to a preset reference size, the routing path selector is located on the path for each possible routing path from the source to the destination And selects a routing path whose maximum value among the RTT values between the nodes is the minimum.

Meanwhile, the routing path selector 310 compares the sum of the RTTs with the sum of the RTTs of the shortest paths before selecting the path including the minimum value of the maximum RTT between the node and the nodes constituting the path as a routing path, It is also possible to select as the paths for finding the routing path having the maximum value among the RTT values only when the path is included in the preset range.

In addition, the routing path setting unit 310 can further select the routing path by using the deviation of the hop count and the RTT.

The hop count can select a hop count of the maximum among the routing paths with the maximum value among the RTT values between the nodes located on the path for each of the routing paths as described above.

More specifically, a method of selecting a path having the maximum hop count is as follows. That is, the minimum RTT among the RTTs between the nodes constituting each path is selected, and the sum of the RTTs in each path is divided by the minimum RTT Value to the effective hop count, and the hop count maximum value can be determined within a range that does not exceed the calculated effective hop count.

In case of the RTT deviation, it is possible to select a route having the minimum deviation of the RTT between the nodes among the routing paths having the smallest maximum value among the RTT values between the nodes located on the route for each routing route.

Such a routing path selection device may be included in each of the nodes including the network so as to perform a function of selecting a routing path when transmitting and receiving data at the node.

In addition, it can be configured separately from a node or included in a device that controls or manages each node, so that when data is exchanged between nodes, it is possible to select a routing path and transmit / receive data only in accordance with the selected routing path information Do.

In addition, the routing path selection device according to the present invention may be coupled to the device separately or in combination to select a routing path and allow data to be transmitted according to the selected routing path, the implementation being limited by the method described above It is not.

Hereinafter, a routing path selection method according to an embodiment of the present invention will be described with reference to FIGS. 1 and 4, comparing actual measurement results of a data transmission time according to a routing path selection method according to a preferred embodiment of the present invention.

1 is a diagram illustrating an example of a path between a source and a destination as described above, FIG. 4 is a diagram illustrating a conventional shortest path selection method and a preferred embodiment of the present invention, And comparing the data transmission time by the routing path selection method.

As described above, in the example of FIG. 1, the path from the source to the destination, that is, the routing path is A, B, and C, respectively.

In the example of FIG. 1, it is assumed that the routing path setting method according to the present invention is applied to transmit or receive data of 10 Mbytes or more with reference to a preset reference size, for example, FIG.

Also in this case, it is general to select the B path which is the shortest path in which the sum of the RTTs is the minimum in the prior art.

However, according to the present invention, since data of a certain size or more is transmitted or received, the B path which is the shortest path is unconditionally selected.

Next, the sum of the RTTs of the B path, which is the shortest path, is 190ms, and the sum of the RTTs of the A path and the C path is 210ms, so that the RTT sum of the shortest path and the RTT sum of the shortest path can be judged to fall within a predetermined range.

Next, the maximum value of the RTT on the three paths A, B, and C is 130 ms in the A path, 190 ms in the B path, and 90 ms in the C path.

Therefore, in this case, the C path is selected as the optimal routing path.

In addition, it is possible to further consider the deviation of the hop count or RTT.

In the case of the hop count, A and C have the largest hop count because they are 3 for A path, 1 for B path, and 3 for C path.

On the other hand, the minimum hop count among the valid paths A, B, and C is 20 ms, which is the RTT between the source and the node 1.

In the case of A, 10.5, 9.5, and 10.5, the minimum hop count is 9.5, which is the hop count for the shortest path. It is also possible to set the maximum value for the hop count.

Therefore, because A, B, and C path hop counts are 3, 1, and 3 within 9.5 hop counts, A and C are within the range of possible maximum hop count, It has a count.

In case of deviation of RTT, the maximum deviation of A path is 90ms, but the maximum deviation of C path is not more than 30ms.

As a result, according to the routing path selection method of the present invention, the C path is selected as the routing path instead of the B path as the shortest path.

On the other hand, it can be confirmed from the experimental result of FIG. 4 that the C path thus selected can transmit data faster than the B path which is the shortest path.

As shown in FIG. 4, in the case of the size of 1 Mbytes, it is impossible to know a great difference in the download time in all three paths A, B, and C. However, in the case where the data of 100 Mbytes, It can be seen that the download time through the C path is shorter than the B path known as the shortest path.

According to the conventional routing path selection method, in the case of the B path which is a path directly from the source to the destination, the RTT is 190 ms, which is the shortest path, so the B path is selected. However, in reality, will be.

There are various reasons for this phenomenon, but as the size of data increases, bottlenecks are one of the causes.

That is, if the size of the data is greater than or equal to a certain level, it can be seen that the shortest path is not necessarily the fastest path due to the bottleneck phenomenon.

The present invention grasps such a problem and does not necessarily select only the shortest path when selecting a routing path. By selecting the routing path considering the data size, the maximum value of RTT, the hop count and the deviation of RTT, And the like.

It will be apparent to those skilled in the relevant art that various modifications, additions and substitutions are possible, without departing from the spirit and scope of the invention as defined by the appended claims. The appended claims are to be considered as falling within the scope of the following claims.

300: Data size comparison unit 310: Routing path selection unit

Claims (13)

A method for selecting a routing path from a source for transmitting data to a destination for receiving data in a network constituted by a plurality of nodes,
Determining whether a size of data to be transmitted is greater than or equal to a preset reference size; And
If the size of the data to be transmitted is greater than or equal to a preset reference size, the maximum value of each round trip time (RTT) value between nodes located on the path for each possible routing path from the source to the destination Selecting a routing path having a small value.
The method according to claim 1,
If the size of the data to be transmitted is greater than or equal to a preset reference size, only a routing path that is within a predetermined range in comparison with a path having the smallest sum of RTTs for each possible routing path from the source to the destination is selected, Selecting a routing path having a smallest maximum value among RTT values among nodes located on a path only for each of the paths.
The method according to claim 1,
When the size of the data to be transmitted is greater than or equal to a preset reference size, a routing path having the smallest maximum value among the RTT values among the nodes located on the route for each possible routing path from the source to the destination is selected At this stage,
And selecting a routing path having a maximum hop count among routing paths available from the source to the destination when the routing path having the smallest maximum value is a plurality of routing paths.
The method of claim 3,
The maximum hop count is the sum of the RTTs of the paths with the smallest sum of the RTTs among the possible routing paths from the source to the destination to the RTT with the minimum RTT between each node among the possible routing paths from the source to the destination And a hop count only within a range of the valid hop count is selected.
The method according to claim 1,
When the size of the data to be transmitted is greater than or equal to a preset reference size, a routing path having the smallest maximum value among the RTT values among the nodes located on the route for each possible routing path from the source to the destination is selected At this stage,
And selects a routing path having a minimum deviation of RTT values between nodes located on a path for each possible routing path from the source to the destination when the plurality of routing paths having the smallest maximum value are selected. A routing path selection method.
The method according to claim 1,
And selecting a path having the smallest sum of RTTs among the possible routing paths from the source to the destination when the size of data to be transmitted is less than or less than a preset reference size.
An apparatus for selecting a routing path from a source to which data is to be transmitted to a destination for receiving data in a network composed of a plurality of nodes,
A data size comparing unit for determining whether a size of data to be transmitted is greater than or equal to a preset reference size; And
If the size of the data to be transmitted is greater than or equal to a preset reference size, the maximum value of Round Trip Time (RTT) values between nodes located on the path for each possible routing path from the source to the destination is the smallest value And a routing path selector for selecting a routing path of the routing path.
8. The method of claim 7,
Wherein the routing path selector selects one of the routing paths from the source to the destination when the size of the data to be transmitted is greater than or equal to a preset reference size, And selects a routing path having a smallest maximum value among RTT values among nodes located on a route only for each of the selected routes.
8. The method of claim 7,
The routing path selector may select,
When a plurality of routing paths having a smallest maximum value among RTT values between nodes located on a path for each possible routing path from the source to the destination are included in the hop count hop count of the routing path is the maximum.
10. The method of claim 9,
The maximum hop count is the sum of the RTTs of the paths with the smallest sum of the RTTs among the possible routing paths from the source to the destination to the RTT with the minimum RTT between each node among the possible routing paths from the source to the destination Wherein the hop count is set to a valid hop count and only a hop count within a range of the valid hop count is selected.
8. The method of claim 7,
The routing path selector may select,
When there are a plurality of routing paths having the smallest maximum value among the RTT values among the nodes located on the path for each possible routing path from the source to the destination, for each of the possible routing paths from the source to the destination, And selects a routing path with a minimum deviation of RTT values between nodes located on the routing path.
8. The method of claim 7,
When the size of the data to be transmitted is less than or equal to a preset reference size,
Wherein the routing path selection unit selects a path having the smallest sum of RTTs among routing paths available from the source to the destination.
1. A recording medium on which a program for implementing a routing path selection method from a source to which data is to be transmitted to a destination for receiving data in a network composed of a plurality of nodes,
Determining whether a size of data to be transmitted is greater than or equal to a preset reference size; And
If the size of the data to be transmitted is greater than or equal to a preset reference size, the maximum value of each round trip time (RTT) value between nodes located on the path for each possible routing path from the source to the destination And selecting a routing path having a small value as the routing path selection information.

Images