KR20170078425A - Method of load balancing in network - Google Patents

Abstract

The present invention includes a communication module for transmitting and receiving a packet, a memory for storing a load distribution program, and a processor for executing a program, the processor being capable of executing a load threshold value for each of a plurality of neighboring links through a communication module For each of a plurality of neighboring links based on a load threshold value, determines whether an overload link is established, receives a packet, and transmits the received packet according to a predetermined routing path corresponding to the received packet , Calculates a pheromone index for a plurality of neighboring links when the link determined to be an overload link is included in a preset routing path, calculates a pheromone index for the calculated plurality of neighboring links, Based on the load, a predetermined routing path is changed, and according to the changed routing path, It transmits.

Description

{METHOD OF LOADING BALANCING IN NETWORK}

The present invention relates to a load balancing method in a network.

Now, with the expansion of the Internet and the ever-increasing number of real-time online businesses, network collisions are increasing significantly. Therefore, load balancing such as network resources in a network environment is a very important issue.

In a network, unequal resource allocation causes resource increase and replacement of the network, and uneven flow distribution requires more advanced scheduling techniques and strategies.

However, most of the conventional routing control algorithms are aimed at finding a shortest path. Therefore, when the shortest path is set, the router always transmits traffic through the fixed shortest path. Therefore, if a large flow is introduced from the outside, collision within the network may occur, and drop of traffic may occur.

Therefore, finding an optimized path that can satisfy all the constraints in the network is very important for extending the life of the network and maintaining the performance.

In this regard, Korean Patent Laid-Open Publication No. 10-2015-0099372 (entitled "ecosystem-based routing system and method for wireless mesh network") uses a delay value and a link quality value, Based routing system and method for a wireless mesh network capable of improving the throughput of a wireless mesh backbone network.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems of the prior art and provides an efficient method for load balancing a network link.

It should be understood, however, that the technical scope of the present invention is not limited to the above-described technical problems, and other technical problems may exist.

As a technical means for achieving the above technical object, a router in a network according to the first aspect of the present invention includes a communication module for transmitting and receiving a packet, a memory for storing a load balancing program, and a processor for executing a program, The load threshold value for each of the plurality of neighboring links is received and stored through the communication module according to the execution of the program, the overload link is determined for each of the plurality of neighboring links based on the load threshold value, And transmits the received packet according to a predetermined routing path corresponding to the received packet. When a link determined to be an overload link is included in a predetermined routing path, a pheromone index is calculated for a plurality of neighboring links A pheromone index for a plurality of calculated neighboring links, and a plurality of neighboring links Based on the current load, change the pre-set routing path, and then, transmits a packet according to the changed routing path.

According to a second aspect of the present invention, there is provided a packet transmission method for a router, comprising: receiving a load threshold value for each of a plurality of neighboring links connected to a corresponding router that has received a packet; Determining whether an overload link is established for each link; And transmitting a packet by changing a predetermined routing path when a link determined as an overload link is included in the routing path corresponding to the received packet, wherein the step of changing the routing path to transmit the packet comprises: Calculates a pheromone index for one link, changes the routing path based on the calculated pheromone index and the current load, and transmits the packet according to the changed routing path.

When an overload link occurs in a network, the present invention can efficiently distribute the load by bypassing the link and transmitting the packet.

Further, the present invention can improve the stability of the network by calculating the pheromone index for each link and by preventing the link overload that may occur later by transmitting the packet by bypassing the link having the higher pheromone index and the overload link have.

1 is a diagram schematically showing a configuration of a router included in a network according to an embodiment of the present invention.
2 illustrates an example of load balancing using a packet transmission method according to an embodiment of the present invention.
3 is a flowchart illustrating a packet transmission method of a router in a network according to an embodiment of the present invention.
4 is a flowchart illustrating a method for determining an overload link of a router according to an exemplary embodiment of the present invention.
5 is a flowchart illustrating a method of reestablishing a path of a router according to an exemplary embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings, which will be readily apparent to those skilled in the art. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another part in between . Also, when a part is referred to as "including " an element, it does not exclude other elements unless specifically stated otherwise.

In a conventional network of ant colony behavior patterns, ants use a routing method that mimics the behavior of finding the shortest distance from the nest to the food. However, there is a problem in that, in the conventional ant colon cluster-based network, additional traffic is generated using a large amount of packets in order to find an optimal path to a destination when an event occurs.

In order to solve this problem, a router according to an embodiment of the present invention performs routing based on the behavior pattern of a pharaoh ant which moves in a network and intensively leaves pheromone in a certain area. That is, each router is set as a nest of ants, and a link connected to each router is set as a route of movement of a pharaoh ant traveling between the nests, thereby performing routing based on the behavior pattern of the pharaoh ants.

Specifically, according to an embodiment of the present invention, pheromone is concentrated at a place where pharaoh ants move along the route, and ants use the habit of moving along a path having high concentration of pheromone, The load that can be concentrated on any one of the links can be efficiently dispersed by calculating the pheromone index and transmitting the packet by bypassing the link having the higher pheromone index.

Hereinafter, a load balancing method in a network according to an embodiment of the present invention will be described in detail with reference to the drawings.

1 is a diagram schematically showing a configuration of a router included in a network according to an embodiment of the present invention.

Referring to FIG. 1, in a network according to an embodiment of the present invention, a router 100 includes a communication module 110, a memory 120, and a processor 130.

Here, the network means a connection structure in which information can be exchanged between each node such as a terminal and a server. An example of such a network is a 3rd generation partnership project (3GPP) network, a long term evolution (LTE) network, a WIMAX world interoperability for microwave access networks, internet, local area network (LAN), wireless local area network (WLAN), wide area network (WAN), personal area network (PAN), bluetooth network, Broadcast networks, analog broadcast networks, digital multimedia broadcasting (DMB) networks, and the like.

The processor 130 of the router 100 according to an embodiment of the present invention transmits and receives packets to and from a neighboring router through the communication module 110. [ In this case, the neighboring router means another router connected to transmit / receive a packet directly to / from the router 100 through a link on a predetermined topology of the network.

In addition, the router 100 can transmit the packet to the node through a link on a predetermined topology. The node may be, but is not limited to, a computing device, a communication device, and a sensor. The predetermined topology link may include both wireless and wired links.

Also, a load threshold value for a plurality of links neighboring the corresponding router is received from a network controller (not shown) through the communication module 110. At this time, the above-described load threshold value can be set and changed by a user such as a manager of the network according to the estimated load amount of each link. That is, the load threshold value may be set to have a high load threshold value for a link in which a load is overloaded.

The memory 120 may store a load distribution program and a load threshold value received through the communication module 110. [

The processor 130 transmits the packet received through the communication module 110 to one of the plurality of neighboring routers according to a predetermined routing path. At this time, as the processor executes the load distribution program stored in the memory 120, the processor calculates the current load amount for each of the neighbor links connected to the router, and if the current load amount exceeds the reference value, the processor can determine the link as an overload link have. At this time, the reference value may be 0.95, but the present invention is not limited thereto, and the reference value can be set and changed by the user.

Specifically, the processor 130 may calculate the current load by dividing the current traffic volume with neighboring links by a load threshold value for a neighboring link to the router. If for example, a router i receives a packet to send the packet to the router, j, the current load of the link connecting the router and the router i j (L _ij) is equal to the equation (1) below.

In Equation (1), CL _ij Represents the current traffic volume of the link between router i and router j , and THL _ij Represents the load threshold of the link between router i and router j . Therefore, the current load amount L _ij calculated by Equation (1) may have a value between 0 and 1. That is, when the predetermined reference value is 0.95 and the current load amount is 0.95 or more, the link can be determined as an overload link.

Accordingly, when the routing path of the received packet includes an overload link, the processor 130 can re-route the packet and distribute the load by transmitting the corresponding packet.

At this time, the processor 130 may select a plurality of transmittable routers among the neighboring routers connected to the corresponding router to form a set, and calculate the pheromone index for each network link between routable routers included in the set. Here, the pheromone index can indicate a high probability that the network load will increase. At this time, at time t , the pheromone index for the network link of the router i and the router j can be calculated by the following equation (2).

은 초기의 페로몬 지수값,

는 페로몬 감소 계수,

는 t-1에서 산출된 페로몬 지수를 나타낸다. 이때, 페로몬 감수 계수

의 범위는 0보다 크고, 1보다 작거나 같다. In Equation 2,

Is the initial pheromone index value,

Pheromone reduction coefficient,

Represents the pheromone index calculated at t-1. At this time, the pheromone sensitivity coefficient

Is greater than 0 and less than or equal to 1.

That is, the processor 130 may calculate the pheromone index using Equation (2), and update the calculated pheromone index in real time.

Accordingly, when the routing path of the packet received through the communication module includes an overload link, the processor 130 determines whether the routing path of the packet received through the communication module is a routing path based on the current load calculated by Equation 1 and the pheromone index calculated by Equation (2) So that the load can be dispersed.

At this time, the processor 130 concentrates the pheromone at a place where the route of the pharaonic ants is overlapped. By using the habit of moving the ants along the path of high concentration of the pheromone, the processor 130 bypasses the link having the high pheromone index and the overload link, Lt; / RTI > In other words, since a link including a redundant link in the routing path may have a high pheromone index, the processor 130 can transmit a packet by selecting a link having a low pheromone index and a current load. Specifically, the processor 130 may calculate a selection probability value for each link between routers that can be transmitted according to Equation (3) below.

는 패킷 k가 위치한 라우터 i와 직접적으로 연결된 라우터들의 집합을 나타낸다. 또한

는

로서, 라우터 i와 라우터 j 링크 간 거리 d에 반비례한다.In Equation (3), α and β denote the weights of pheromone and distance on the probability, which can be determined by the network administrator.

Represents a set of routers directly connected to router i where packet k is located. Also

The

, Which is inversely proportional to the distance d between the router i and the router j link.

Accordingly, the processor 130 can select a plurality of links having a high selection probability value among the neighbor links included in the transmittable set, and transmit the packets through the selected paths.

Hereinafter, a packet transmission method of a router in a network according to an embodiment of the present invention will be described in detail with reference to FIG. 2 to FIG.

2 illustrates an example of load balancing using a packet transmission method according to an embodiment of the present invention.

In a network according to an exemplary embodiment of the present invention, a router may receive a packet through a communication module and transmit the received and received packet according to a predetermined routing path.

2, a network according to an embodiment of the present invention includes a router C 100, a router D 200, a router F 300, and a router E 400, It can be assumed that a packet is transmitted to the node B 20.

Accordingly, the router C 100 can receive a packet from the node A 10 and transmit the received packet to any one or more of the neighboring router D 200, router F 300, and router E 400 To the node B (20). At this time, if it is assumed that the predetermined routing path of the packet received by the router C 100 is A-C-F-B, the router C 100 can transmit the received packet to the router F 300. However, if link CF 14 is an overloaded link, router C 100 is able to bypass the link CF 14 and forward the packet to node B 20.

3 is a flowchart illustrating a packet transmission method of a router in a network according to an embodiment of the present invention.

3, in a network according to an exemplary embodiment of the present invention, a packet transmission method of a router includes determining an overload link (S100), receiving a packet, and overloading a routing path of the received packet And if the link is included, resetting the routing path to transmit the packet (S200).

2, the router C 100 can calculate the current load for each of the neighboring links. If the current load is greater than or equal to the preset reference value 0.95, the router C 100 can determine the link as an overload link (S100).

4 is a flowchart illustrating a method for determining an overload link of a router according to an exemplary embodiment of the present invention.

More specifically, referring to FIG. 4, step S100 of determining an overload link of a router according to an embodiment of the present invention includes receiving and storing a load threshold value for each of neighboring links connected to the router S110); Calculating, for each of the neighboring links based on the load threshold, a current load amount (S120); And determining a neighboring link whose current load is equal to or greater than a reference value as an overload link (S130).

The router C 100 receiving the packet receives a load threshold value for each of the neighbor link CD 12, the link CF 14 and the link CE 16 connected to the router C 100 through the communication module (S110).

Subsequently, the router C 100 divides the current traffic volume of the link CD 12, the link CF 14 and the link CE 16 by the load threshold value of each link, and stores the link CD 12, the link CF 14 ) And the link CE 16 can be calculated by the above-described equation (1). At this time, the router C 100 may calculate and update the current load amount for each of the neighboring link CD 12, the link CF 14, and the link CE 16 in real time or at predetermined time intervals (S120) .

Thereafter, when the current load value of the calculated link CD 12, link CF 14 and link CE 16 is 0.95 or more, the router C 100 can determine that link as an overload link. Taking FIG. 2 as an example, assuming that the current load amount of the link CD 12 calculated by the router C 100 is 0.46, the current load amount of the link CF 14 is 0.98, and the current load amount of the link CE 16 is 0.21 , The router C (100) can determine the link CE (14) having the current load amount of 0.98 exceeding the reference value 0.95 as an overload link.

Referring again to FIG. 3, if an overload link is included in the routing path of the packet, the load can be distributed by resetting the routing path to bypass the overload link and sending the packet to the node B20. At this time, according to the embodiment of the present invention, the router C (100) concentrates the pheromone at the overlapping route of the pharaoh ants and uses the habit of moving the ants along the path of high concentration of the pheromone, It is possible to reset the routing path considering the high link (S200).

5 is a flowchart illustrating a method of reestablishing a path of a router according to an exemplary embodiment of the present invention.

More specifically, referring to FIG. 5, a step S200 of transmitting a packet by resetting a routing path according to an embodiment of the present invention includes calculating a pheromone index for each neighbor link connected to the router (S210 ); Calculating a selection probability value based on the pheromone index and the current load amount (S220); And selecting a plurality of links having a high selection probability value, and transmitting the packets through the selected paths (S230).

2, for example, router C 100 is connected to router C 100, except for overload link F 300, among neighboring router D 200, router F 300, and router E 400, A plurality of transmittable routers D 200 and E 400 can be selected. Thereafter, the router C 100 can calculate the pheromone index for each of the network link CD 12 and the link CE 16 between the routable D router 200 and the router E 400 (S210).

Then, in step S220 of calculating the selection probability value based on the pheromone index and the current load amount, the router C 100 calculates the selection probability value for the router D 200 and the router E (400) according to the above- (S220). ≪ / RTI >

Thereafter, a plurality of links having a high selection probability value may be selected, and the packet may be transmitted through the selected paths (S230).

According to an embodiment of the present invention, when an overload link occurs in a network, it is possible to distribute the load by bypassing the link and transmitting the packet. Further, by calculating the pheromone index for each link and by forwarding the packet by bypassing the link having the higher pheromone index and the overload link, it is possible to prevent the link overload that may occur in the future, thereby enhancing the stability of the network.

One embodiment of the present invention may also be embodied in the form of a recording medium including instructions executable by a computer, such as program modules, being executed by a computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, the computer-readable medium may include both computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Communication media typically includes any information delivery media, including computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transport mechanism.

While the methods and systems of the present invention have been described in connection with specific embodiments, some or all of those elements or operations may be implemented using a computer system having a general purpose hardware architecture.

It will be understood by those skilled in the art that the foregoing description of the present invention is for illustrative purposes only and that those of ordinary skill in the art can readily understand that various changes and modifications may be made without departing from the spirit or essential characteristics of the present invention. will be. It is therefore to be understood that the above-described embodiments are illustrative in all aspects and not restrictive. For example, each component described as a single entity may be distributed and implemented, and components described as being distributed may also be implemented in a combined form.

The scope of the present invention is defined by the appended claims rather than the detailed description and all changes or modifications derived from the meaning and scope of the claims and their equivalents are to be construed as being included within the scope of the present invention do.

100: Router
110: communication module
120: Memory
130: Processor

Claims (9)

In a router in a network,
A communication module for transmitting and receiving a packet,
The memory in which the load balancer is stored and
And a processor for executing the program,
Wherein the processor receives and stores a load threshold value for each of a plurality of neighboring links through the communication module in accordance with execution of the program and for each of the plurality of neighboring links based on the load threshold, Judges whether or not the link is established,
And transmitting the packet according to a predetermined routing path corresponding to the packet,
Calculating a pheromone index for the plurality of neighboring links when the link determined as the overload link is included in the preset routing path, calculating a pheromone index for the calculated plurality of neighboring links, Change the predetermined routing path based on the current load on the link,
And transmits the packet according to the changed routing path. The method according to claim 1,
Wherein the processor calculates, for each of the plurality of neighboring links, the current load amount based on a current traffic amount and the load threshold value,
And determines a link in which the calculated current load amount among the plurality of neighboring links exceeds a predetermined reference value as an overload link. 3. The method of claim 2,
Wherein the predetermined reference value is 0.95. 3. The method of claim 2,
Wherein the processor calculates a selection probability for each of the plurality of neighboring links and changes the predetermined routing path based on the calculated selection probability,
Wherein the selection probability is calculated based on a pheromone index for a link calculating the selection probability, a distance between routers corresponding to a link calculating the selection probability, and a current load on a link calculating the selection probability, . The method according to claim 1,
Wherein the processor recalculates and updates the pheromone index and the current load amount at predetermined time intervals for each of the plurality of neighboring links. In a packet transmission method of a router,
Receiving a load threshold value for each of a plurality of neighboring links connected to the router that has received the packet and determining whether an overload link is established for each of the plurality of neighboring links based on the load threshold value; And
And transmitting the packet by changing a predetermined routing path when a link determined as an overload link is included in the routing path corresponding to the received packet,
Wherein the step of changing the routing path and transmitting the packet comprises:
Calculating a pheromone index for the plurality of neighboring links, changing the routing path based on the calculated pheromone index and the current load amount, and transmitting the packet according to the changed routing path. Way. The method according to claim 6,
The step of determining whether the overload link is performed includes:
For each of the plurality of neighboring links, the current load amount based on the current traffic amount and the load threshold value,
Wherein the link determining unit determines that a link whose calculated current load amount among the plurality of neighboring links exceeds a predetermined reference value as an overload link. 8. The method of claim 7,
Wherein the predetermined reference value is 0.95. 9. A computer-readable recording medium recording a program for performing the method according to any one of claims 6 to 8 on a computer.

Images