KR20110132019A - Routing apparatus based on bio-inspired self-organic and method for setting up transmission route using the same - Google Patents

Abstract

PURPOSE: A routing apparatus based on an ecosystem and transmission path setting method using the same are provided to establish the transmission path of a service packet by acquiring pheromone information. CONSTITUTION: A pheromone table(102) stores pheromone information based on information collected by artificial ant from the network of pheromone data structure. The pheromone table stores the pheromone information of neighbor nodes in each QoS(Quality of Service) colony. A packet processing unit(130) inspects a service request delay quality value by analyzing the packet received from outside. The packet processing unit determines the transmission route of the packet based on the pheromone value based on the pheromone table and the service request delay quality value. The packet processing unit transmits the packet based on the determined transmission path.

Description

ROUTING APPARATUS BASED ON BIO-INSPIRED SELF-ORGANIC AND METHOD FOR SETTING UP TRANSMISSION ROUTE USING THE SAME}

The present invention relates to ecosystem-based routing, and more particularly, to establish a transmission path using an ecosystem-based routing device that can not only efficiently satisfy the delay quality required by the service but also improve scalability and robustness in terms of network. It is about a method.

With the rapid development of the Internet and the emergence of services requiring high quality, it is difficult to predict traffic characteristics and network conditions. Multimedia-based services, which will emerge in future networks, will further accelerate this network uncertainty. Accordingly, the study on QoS routing techniques that can efficiently and securely provide the service quality required by users by constructing network infrastructure efficiently Should be done in depth.

QoS routing, which will emerge in the future, must be able to efficiently satisfy the various qualities required by services even in an environment in which the state of the network is difficult to predict. Furthermore, it will be developed as a QoS routing scheme that can manage the network autonomously without quality control as well as to guarantee the scalability and robustness of the network.

Recently, a number of new ecosystem-based technologies have emerged that attempt to solve natural problems by following the natural ecosystem. AntNet is a representative ecosystem-based technology that integrates the knowledge gained from ant daily history observations into the network and can solve the shortest distance routing problem that is considered NP-hard problem. AntNet applies an artificial ant to the network to accumulate pheromone, and builds a routing table based on the ant's delay.

At this time, the closer the path through which the ant passes, the shorter the path, the more ants accumulate. Therefore, a path in which many pheromones are accumulated is recognized as a path closest to the shortest distance and is routed.

AntNet has the following advantages in that it is inspired by how ants get the shortest distance food: First, through the ants transmitted in real time, it is possible to proactively cope with the timely grasp of rapidly changing network conditions.

Second, the routing function can be performed seamlessly even in network instability due to unexpected network malfunction and failure. In addition, all such management functions are advantageously performed by ants without central control such as an administrator. These advantages are essential features for the future QoS routing schemes. The ant-based QoS routing that can take advantage of these advantages and up to QoS routing in recent years is configured as follows.

The routers needed to manage pheromone information in AntNet routing are largely local models that manage statistical information on the quality of delay experienced by ants, for example, average, standard deviation, and the minimum of delays measured by ants). It consists of a pheromone table that manages the pheromone information for each path updated by ants.

Routing in the extended AntNet-CoS routing capable of QoS routing proposed by the conventional papers consists of operating separate AntNet for each QoS to be provided.

However, the conventional QoS providing method has the following problems.

First, there is a significant load on the network. In the case of AntNet, the transmission period of ants is 1 second, whereas the conventionally proposed method has to transmit ants for each QoS, so the number of QoS multiples is applied to the network, and the load of the network is rapidly increased because the ants are applied to the network. In addition, each node has a disadvantage of wasting resources because it must maintain local model and pheromone table for each QoS.

Second, there is a limit to accommodating services requiring various materials. Existing services, as well as future services that will emerge in the future, will vary greatly in their requirements. Therefore, to provide such various qualities, there is a big disadvantage that each AntNet must be formed and operated for each QoS.

In order to solve the above problems, an object of the present invention is to apply an artificial ant capable of accumulating pheromones to the network to generate QoS colonies for each source-destination-delay, and to obtain the pheromone amount for each generated QoS colony. After that, it is to provide a transmission path setting method using an ecosystem-based routing device that can set the transmission path of the service packet based on the obtained pheromone information.

The objects of the present invention are not limited to the above-mentioned objects, and other objects not mentioned can be clearly understood by those skilled in the art from the following description.

In order to achieve the object of the present invention, an ecosystem-based routing device according to an embodiment of the present invention may be configured as a local data structure for each destination with arrival nodes as destinations, and an artificial ant applied to a network in each of the local data structures. It consists of a local model that stores the statistical information values for each QoS calculated based on the information collected by the data, and a pheromone data structure for each destination, with destination nodes as destinations, each of which is applied to the network. The pheromone information for each QoS is stored based on information collected by artificial ants, and each QoS colony has a pheromone table that stores pheromone information of its neighbor nodes, and as packets arrive from the outside. Analyzing the packet to determine the service request delay quality value And determining a transmission path of the packet based on the service request delay quality value and the pheromone value in the pheromone table, and transmitting the packet based on the determined transmission path.

An ecosystem-based routing device according to an embodiment of the present invention generates a forward artificial ant for collecting the state of the network and applies it to the network, and the backward artificial ant arrives from an external node. An ant processing part which extracts the information in an ant is included.

In the ecosystem-based routing device according to an embodiment of the present invention, the ant processing unit may generate the forward artificial ants at predetermined time intervals and apply them to the network.

In the ecosystem-based routing device according to an embodiment of the present invention, the ant processing unit is extinguished after extracting the information collected from the forward artificial ants as the forwarding device receives the forward artificial ant as the arrival node through the network. And generate a backward artificial ant corresponding to the destroyed forward artificial ant and include the extracted information in the backward artificial ant to apply on the network in a reverse path to the transmission path of the destroyed forward artificial ant. Can be.

An ecosystem-based routing device according to an embodiment of the present invention includes an update unit for updating the local model and the pheromone table using information included in the backward artificial ant.

In the ecosystem-based routing device according to an embodiment of the present invention, the update unit uses the information included in the backward artificial ant as the backward artificial ant arrives to delay the delay value of the routing device and the scheduled arrival node. A local model updating unit configured to select a local data structure having a destination corresponding to the arrival node in the local data structure of the local model by calculating a difference value between the values, and then update the selected local data structure based on the difference value; .

In the ecosystem-based routing device according to an embodiment of the present invention, the update unit selects and updates one QoS colony that is close to the difference value and a preset range in the QoS colony list of the selected data structure or updates the selected data structure. QoS colony may be added to the difference value using the difference value.

In the ecosystem-based routing device according to an embodiment of the present invention, the update unit selects a pheromone data structure having a destination corresponding to the arrival node in the pheromone data structure for each destination, and selects the difference value from the pheromone data structure. It includes a pheromone update unit for updating the pheromone table reflected in.

In the ecosystem-based routing device according to an embodiment of the present invention, the pheromone updater selects one QoS colony from the QoS colony list of the selected pheromone data structure based on the difference value and then selects a QoS colony from the local data structure. The pheromone value for the neighbor node in the selected QoS colony is calculated using the degree of the relationship between the delay statistics value and the difference value, and the pheromone table can be updated using the calculated pheromone value of the neighbor node. have.

(

은 선택된 QoS 콜로니의 이웃 노드 j에 대한 페로몬 값,

는 선택된 QoS 콜로니의 지연 통계 값과 차이 값(t_i→j) 사이의 관계성 정도를 나타내는 척도))에 의해 상기 페로몬 테이블 내 페로몬 값을 업데이트할 수 있다.In the ecosystem-based routing device according to an embodiment of the present invention, the pheromone update unit,

(

Is the pheromone value for the neighbor node j of the selected QoS colony,

May update the pheromone value in the pheromone table by a delay statistics value of the selected QoS colony and a measure indicating a degree of relationship between the difference value (t _{i? J} ).

In the ecosystem-based routing device according to an embodiment of the present invention, the pheromone updater may update the pheromone value in the pheromone data structure for each destination at a predetermined period by updating an evaporation constant.

In the ecosystem-based routing device according to an embodiment of the present invention, the packet processing unit selects a pheromone data structure having a destination corresponding to a next arrival node of the packet from the pheromone table as the packet arrives, and selects the selected pheromone from the pheromone table. A relation calculating unit that calculates a scale indicating a degree of relation for each QoS colony present in the data structure, a pheromone value for each neighbor node in the selected QoS colony and each neighbor after selecting the largest QoS colony A probability calculator configured to calculate a routing probability to each neighbor node based on a congestion measure of a node; and setting one of the neighbor nodes as a transmission path of the packet based on a routing probability to each neighbor node It includes a transmission path setting unit.

In the ecosystem-based routing device according to an embodiment of the present invention, the relationship calculating unit may calculate a measure indicating a degree of relationship for each QoS colony using delay statistics values stored in each QoS colony of the selected local data structure. Can be.

According to another aspect of the present invention, a method for setting a transmission path using an ecosystem-based routing device is configured as a local data structure for each destination using reachable nodes as a destination, and each statistical data value for each QoS is stored in the local data structure. The pheromone data structure of each destination is made by using a local model and a destination node as a destination, wherein the pheromone information for each QoS is stored in each of the pheromone data structures, and each pheromone information of its neighbor nodes is stored in each QoS colony. A packet path setting method of an ecosystem-based QoS routing apparatus having a pheromone table, the pheromone table having a pheromone data structure and a local data structure having a destination corresponding to a next arrival node of the packet as the packet arrives. Choose from Calculating a scale indicating a degree of relationship for each QoS colony present in the selected local data structure, selecting a QoS colony having the largest scale, and then pheromone value for each neighbor node in the selected QoS colony and each neighbor Calculating a routing probability to each neighboring node based on a congestion measure of a node, and setting one of the neighboring nodes as a transmission path of the packet based on the routing probability for each neighboring node; Include.

(

는 패킷의 서비스 지연 요구 값,

는 k번째 QoS 콜로니의 평균 지연 값,

는 k번째 QoS 콜로니의 지연 값 표준편차,

와

는 각각 k번째 QoS 콜로니의 지연 통계값을 이용하여 계산된 최대 지원 가능 지연 값, 최소 지원 가능 지연 값,

,

는 가중치 상수로써 그 합이 1이며, 신뢰 구간 설정 상수 v와 샘플 윈도우 사이즈 w의 설정을 통해

와

을 구할 수 있음))을 통해 상기 각 QoS 콜로니에 대한 관계성 정도를 나타내는 척도를 계산할 수 있다.In the transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention, the step of calculating the measure,

(

Is the service delay request value of the packet,

Is the average delay value of the kth QoS colony,

Is the standard deviation of the delay value of the kth QoS colony,

Wow

Are the maximum supportable delay values, the minimum supportable delay values, calculated using the delay statistics of the kth QoS colony, respectively.

,

Is a weighting constant whose sum is 1, and by setting the confidence interval setting constant v and the sample window size w

Wow

Can be obtained)) to calculate a measure indicating the degree of relationship for each QoS colony.

(

는 선택된 QoS(X_sel)에서 이웃 노드 j로 페로몬 값,

는 j의 혼잡성을 나타내는 척도,

는

의 가중치 상수))을 통해 계산할 수 있다.In the transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention, the step of calculating the probability, Equation (

(

Is the pheromone value from the selected QoS (X _sel ) to neighbor node j,

Is a measure of j's congestion,

Is

Can be calculated by

According to another aspect of the present invention, a method for establishing a transmission path using an ecosystem-based routing device generates a forward artificial ant for collecting state information of the network and applies it on the network, and a backward artificial ant from an external node. Extracting state information in the backward artificial ant as it arrives.

The transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention includes generating and forwarding the forward artificial ants at a predetermined time interval on the network.

According to another aspect of the present invention, there is provided a method for establishing a transmission path using an ecosystem-based routing device, in which a routing device receives a forward artificial ant as an arrival node through a network, and collects the received forward artificial ant. Extracting and extinguishing information, generating a backward artificial ant corresponding to the destroyed forward artificial ant, and including the extracted state information in the backward artificial ant to reverse the transmission path of the destroyed forward artificial ant; Applying on the network as a path.

A transmission path setting method using an ecosystem-based routing device according to another embodiment of the present invention includes updating the local model and the pheromone table using state information included in the backward artificial ant.

In the updating of the transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention, the delay value of the routing device and the expected arrival node of the routing device by using the state information included in the backward artificial ant Calculating a difference value between delay values, selecting a local data structure having a destination corresponding to the arrival node in a local data structure in the local model, and using the difference value to determine the selected local data structure; Updating.

The updating of the selected local data structure in the transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention may include: QoS close to a preset range in the QoS colony list of the selected data structure. Determining whether a colony exists, if the QoS colony exists, selecting a QoS colony close to the preset range, and updating the selected QoS colony using the difference value; and if the QoS colony does not exist Updating the local model by adding a QoS colony to the selected data structure using the difference value.

In accordance with another aspect of the present invention, there is provided a method for setting a transmission path using an ecosystem-based routing device, selecting a pheromone data structure having a destination corresponding to an expected arrival node from the pheromone data structure for each destination; Updating the pheromone table by reflecting the selected pheromone data structure.

The updating of the pheromone table in the transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention may include: one QoS colony in the QoS colony list of the selected pheromone data structure based on the difference value; Calculating a pheromone value for a neighbor node in the selected QoS colony using the degree of relationship between the delay statistics value of the selected QoS colony and the difference value in the local data structure; And updating the pheromone table using the pheromone values of neighbor nodes.

(

은 선택된 QoS 콜로니의 이웃 노드 j에 대한 페로몬 값,

는 선택된 QoS 콜로니의 지연 통계 값과 차이 값(t_i→j) 사이의 관계성 정도를 나타내는 척도))에 의해 상기 페로몬 테이블 내 페로몬 값을 업데이트할 수 있다.The updating of the pheromone table in the transmission path setting method using the ecosystem-based routing device according to another embodiment of the present invention,

(

Is the pheromone value for the neighbor node j of the selected QoS colony,

May update the pheromone value in the pheromone table by a delay statistics value of the selected QoS colony and a measure indicating a degree of relationship between the difference value (t _{i? J} ).

A transmission path setting method using an ecosystem-based routing device according to another embodiment of the present invention includes updating the pheromone table by reflecting an evaporation constant in a pheromone value in the pheromone data structure for each destination at a predetermined period.

The present invention generates QoS colonies for each source-destination-delay by applying artificial ants capable of accumulating pheromones to the network, and obtains the pheromone amount for each generated QoS colony based on the obtained pheromone information. By setting the transmission path, the delay quality required by the service can be efficiently satisfied, and the scalability and robustness can be improved in terms of the network.

1 is a block diagram showing the internal configuration of an ecosystem-based routing device according to an embodiment of the present invention,
2A is a diagram illustrating a data structure of a local model according to an embodiment of the present invention.
2B is a diagram illustrating a data structure of a pheromone table according to an embodiment of the present invention.
3 is a flowchart illustrating a process of updating a local model and a pheromone table by collecting network state information by artificial ants according to an embodiment of the present invention.
FIG. 4 is a flowchart specifically illustrating a process of applying local search and updating pheromone table through a backward artificial ant among methods of collecting network state information and data structure of AntQoS according to an embodiment of the present invention;
5 is a flowchart illustrating a process of setting a transmission path for transmitting a service packet based on pheromone information by a routing apparatus according to an embodiment of the present invention.

The objects and effects of the present invention and the technical configurations for achieving them will be apparent with reference to the embodiments described below in detail with the accompanying drawings. In the following description of the present invention, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear. The following terms are defined in consideration of the functions of the present invention, and may be changed according to the intentions or customs of the user, the operator, and the like.

The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. The present embodiments are merely provided to complete the disclosure of the present invention and to fully inform the scope of the invention to those skilled in the art, and the present invention is defined by the scope of the claims. It will be. Therefore, the definition should be based on the contents throughout this specification.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

FIG. 1 is a block diagram illustrating an internal configuration of an ecosystem-based routing device according to an embodiment of the present invention, and includes a local model 100, a pheromone table 102, an ant processor 120, an updater 110, and a packet. The processor 130 may be included.

The local model 100 manages statistical information of delays experienced by artificial ants, which is based on the information collected by the artificial ants as a starting point and local data structure for each node (destination) where the node can arrive. It consists of. Each local data structure stores statistical value information for each QoS, that is, for each delay. In other words, in the local model 100, QoS value information for each QoS is stored in a data structure of each source-destination, which will be described with reference to FIG. 2A.

As shown in FIG. 2A, each data structure includes M ⁱ⁰ , M ^{i (i-1)} , M ^{i (i + 1)} , for each node (destination node) that can arrive from a node whose origin (its node) is I. ....., M ^id . Each data structure stores QoS information for each QoS. For example, the local data structure (M ^{i (i-1)} ) of a node (destination node) I-1 that can arrive from a node of origin I stores statistical value information of QoS-specific delays (QoSk). Delay values from its own node to reachable node. Here, the statistical value information of the delay experienced by the artificial ants may include the average, the standard deviation, the minimum value of the delay measured by the ant, and the like.

The pheromone table 102 manages pheromone information for each path updated by artificial ants, and is a node (destination node) (0, ....., I-1,. It consists of pheromone data structure by ....., i + 1, ......., id). Each pheromone data structure stores pheromone information for each QoS. In other words, the pheromone table 102 stores pheromone information for each QoS in the pheromone data structure for each source-destination, which will be described with reference to FIG. 2B.

As shown in FIG. 2B, each pheromone data structure of the pheromone table 102 for each node of the source i and the destination node that can be reached is T ⁱ⁰ , T ^{i (i-1)} , T ^{i (i + 1)} ,... ..., T ^id , and each pheromone data structure stores pheromone information for each QoS (QoSk). In addition, the pheromone values for the neighbor nodes N0 and N1 are stored in each pheromone information for each QoS (QoSk).

The ant processing unit 120 generates artificial ants (forward artificial ants) to update the information stored in the local model 100 and the pheromone table 102 at random time intervals, and forward artificial ants as the artificial forward ants arrive. After extracting the collected information by using the extracted information to create a backward artificial ant and remove the forward artificial ants. The generated backward artificial ants are applied to the network and moved to the opposite path of the forward artificial ant.

The information stored in the backward artificial ants is provided to the updater 110, and the updater 110 updates the local model 100 and the pheromone table 102 by using the information included in the backward artificial ants. Local update unit 112 for updating the local data structure in the local model 100 based on the information contained in the backward artificial ant, and the pheromone in the pheromone table 102 based on the information included in the backward artificial ant Pheromone update unit 114 for updating the data structure.

A process of updating the local model 100 and the pheromone table 102 by the updater 110 having the above configuration will be described below with reference to FIG. 3.

3 is a flowchart illustrating a process of updating a local model and a pheromone table by collecting network state information by artificial ants according to an embodiment of the present invention.

Referring to FIG. 3, the ant processor 120 of the router, which is an arbitrary node, generates an artificial ant, that is, a forward artificial ant (S300). At this time, the generated artificial artificial ant is applied to the network, receives the delay value of the intermediate router (node) in the transmission path and moves while collecting network state information (S302).

Subsequently, the ant processing unit 120 of the arrival node that the forward artificial ant arrives extinguishes the forward artificial ant and generates a new artificial ant, that is, a backward artificial ant (S304), wherein the information of the forward artificial ant is a backward artificial ant. Is moved to. Here, the backward ant moves in a path opposite to the path through which the forward ant has passed, and every intermediate router in the path through which the forward ant is sent is based on the information in the backward ant based on the local model 100. The statistical value stored in the pheromone table 102 and the pheromone information of the pheromone table 102 are updated (S306).

FIG. 4 is a flowchart specifically illustrating a process of applying local search and updating pheromone table through a backward artificial ant among AntQoS network state information collection and data structure update method according to an embodiment of the present invention.

As shown in FIG. 4, first, the ant processing unit 120 provides the update unit 110 with information stored in the backward artificial ant as it arrives at the routing device of the I node where the backward artificial ant arrives. 110 calculates a delay value di from the destination node to its node (S400). Then, the expected arrival node j is set to a value larger than I (S402).

Then, comparing the expected arrival node j with the total number of nodes (n) on the network (S404), if the expected arrival node j is greater than the total number n of nodes as a result of the comparison of step S404, the backward artificial ant is selected from the current node. After applying local search through the pheromone table update, otherwise, calculates the difference between the delay value of _i (= d _i ) and the delay value of the scheduled node j (= d _j ), t _{i → j} (S406). ).

Thereafter, the updater 110 selects the local data structure M _ij corresponding to the arrival node j in the local data structure for each destination in the local model 100 (S408), and calculates the calculated difference value t _{i → j.} Selects QoS (X _sel ) from the QoS list of the selected local data structure (M _ij ), that is, determines whether there is a difference in the QoS list (t _{i → j} ) and the QoS is smaller than the preset range. (S410).

As a result of the determination of S410, when there is no QoS corresponding to the difference value t _{i → j} , adding a new QoS (X _sel ) having a delay value t _{i → j} to the data structure M _ij . Rough (S412). If there is a QoS corresponding to the difference value t _{i → j} , the delay statistic value is localized through Equation 1 below by reflecting the t _{i → j} value in the selected QoS (X _sel ) of the data structure M _ij . The delay statistics value of the model 100 is updated (S414).

는 선택된 QoS 콜로니의 평균 지연 값,

는 선택된 QoS 콜로니의 지연 값 편차,

는 가중치 상수로써 움직임 평균(Moving average) 사용 시 현재 샘플 값 개수의 가중치를 의미한다.In Equation 1 above,

Is the average delay value of the selected QoS colony,

Is the delay value deviation of the selected QoS colony,

Denotes the weight of the current number of sample values when using a moving average as a weight constant.

Next, in order to update the information of the pheromone table 102, the pheromone table 102 selects the pheromone data structure T _ij having a destination corresponding to j (S416). Then, it updates the pheromone table 102 through the equation (2) below, to reflect the value t _{i → j} from QoS (X _sel) to select the selected data structure (T _ij) (S420).

은 선택된 QoS 콜로니의 페로몬 테이블(102)에서 이웃 노드 j에 대한 페로몬 값,

는 선택된 QoS 콜로니의 지연 통계 값과 차이 값(t_i→j) 사이의 관계성 정도를 나타내는 척도를 의미한다. In Equation 2 above,

Is the pheromone value for neighbor node j in the pheromone table 102 of the selected QoS colony,

Denotes a measure indicating the degree of relationship between the delay statistics value of the selected QoS colony and the difference value t _{i-> j} .

는 0에서 1사이의 값을 가지며, 1에 가까울수록 관계성이 큼을 의미한다. 따라서, 관계성 정도를 구하기 위하여 아래의 수학식 3을 이용한다.In updating the pheromone value, it is a measure of the degree of relationship between the difference value (t _{i → j} ) and the delay statistics value of the selected QoS colony.

Has a value between 0 and 1, and the closer to 1, the greater the relationship. Therefore, Equation 3 below is used to obtain a degree of relationship.

는 서비스 지연 요구 값,

는 k번째 QoS 콜로니의 평균 지연 값,

는 k번째 QoS 콜로니의 지연 값 표준편차,

와

는 각각 k번째 QoS 콜로니의 지연 통계값을 이용하여 계산된 최대 지원 가능 지연 값, 최소 지원 가능 지연 값을 의미한다.

,

는 가중치 상수로써 그 합이 1이며, 신뢰 구간 설정 상수 v와 샘플 윈도우 사이즈 w의 설정을 통해

와

을 구할 수 있다. In Equation 3 above,

Is the service delay request value,

Is the average delay value of the kth QoS colony,

Is the standard deviation of the delay value of the kth QoS colony,

Wow

Denotes the maximum supportable delay value and the minimum supportable delay value calculated using the delay statistics of the kth QoS colony, respectively.

,

Is a weighting constant whose sum is 1, and by setting the confidence interval setting constant v and the sample window size w

Wow

Can be obtained.

On the other hand, the pheromone value stored in the pheromone table 102 has a characteristic that evaporates every predetermined period, in order to reflect this, the pheromone update unit 114 according to an embodiment of the present invention to the pheromone value through the following equation (4) Update periodically

는 증발 상수를 나타내며 0과 1사이의 값을 가진다.In Equation 4 above,

Represents the evaporation constant and has a value between 0 and 1.

As the packet arrives at the routing device, the packet processor 130 checks the service request delay quality value through the type of service (ToS) field in the IP header of the packet, and checks the checked service request delay quality value and the pheromone table 102. After determining the transmission path of the service packet based on the pheromone value stored in the), the service packet is transmitted to the neighbor node based on the determined transmission path. To this end, as the packet arrives, the packet processor 130 selects a pheromone data structure having a destination corresponding to a next arrival node of the packet from the pheromone table 102 and for each QoS colony present in the selected pheromone data structure. After selecting the QoS colonies having the largest relation degree and selecting the QoS colonies having the largest relation degree, each neighbor node based on the pheromone value of neighbor nodes in the selected QoS colony and the congestion measure of each neighbor node. Probability calculation unit 134 for calculating the routing probability of the network, and a transmission path setting unit 136 for setting any one of the neighbor nodes as a transmission path of the packet based on the routing probability for each neighboring node. Can be.

A process of transmitting the service packet based on the pheromone information by the packet processor 130 will be described with reference to FIG. 5.

5 is a flowchart illustrating a process of setting a transmission path for transmitting a service packet based on pheromone information by a routing apparatus according to an embodiment of the present invention.

Referring to FIG. 5, in order to determine a service packet transmission path based on pheromone information, the packet processor 130 first selects a pheromone data structure (= T _ij ) having an arrival node j from the pheromone table 102 (S500). ).

을 상기 수학식 3을 이용하여 계산하며(S502), 그 중 척도인

값이 가장 큰 QoS(X_sel)를 선택한다(S504). 다음으로, 선택된 QoS(X_sel)에서 이웃 노드 j로의 페로몬 값(=

)과 j의 혼잡성을 나타내는 척도 (=

)를 바탕으로 j로의 라우팅 확률 (=P_ij)을 아래의 수학식 5를 통해 계산한다(S506).Then, a measure of the degree of relationship in all QoS colonies present in the selected pheromone data structure (T _ij ).

Is calculated using the above Equation 3 (S502), the scale of which is

The highest QoS (X _sel ) is selected (S504). Next, the pheromone value from the selected QoS (X _sel ) to neighbor node j (=

) And a measure of the congestion of j (=

The routing probability (= P _ij ) to _j is calculated based on Equation 5 below (S506).

의 가중치 상수를 의미한다.here, Is

Means a weight constant.

In this way, the routing probability to j is calculated and the transmission path of the service packet through AntQoS is determined by setting j having the largest value among these values as the packet transmission path (S508).

The present invention has been described above with reference to specific embodiments of the present invention, but this is only illustrative and does not limit the scope of the present invention. Those skilled in the art can change or modify the described embodiments without departing from the scope of the present invention. Each of the functional blocks or means described in the present specification may be implemented in a program form, and may be implemented separately, or two or more may be integrated into one. Components such as modules described as separate in the specification and claims may be merely functionally distinct and may be physically implemented by one means, and components such as means described as a single element may be divided into several components. It can be made in combination. In addition, each method step described herein may be changed in order without departing from the scope of the present invention, and other steps may be added. In addition, the various embodiments described herein may be implemented independently as well as each other as appropriate. Therefore, the scope of the invention should be defined by the appended claims and their equivalents, rather than by the described embodiments.

100: local model
102: pheromone table
110: update unit
120: ant processing unit
130: packet processing unit

Claims (26)

A local model comprising a local data structure for each destination, with reachable nodes as destinations, in which each of the local data structures stores statistical information for each QoS calculated based on information collected by artificial ants applied to a network. and,
The pheromone data structure for each destination is made by using the reachable nodes as destinations, and each of the pheromone data structures stores the pheromone information for each QoS based on information collected by artificial ants applied to the network. A pheromone table storing pheromone information of its neighbor nodes in each QoS colony;
As the packet arrives from the outside, the service request delay quality value is examined through analysis of the packet, and then the transmission path of the packet is determined based on the service request delay quality value and the pheromone value in the pherom table. A packet processing unit for transmitting the packet based on a path;
Ecosystem based routing device.
The method of claim 1,
A ant processing unit which generates a forward artificial ant for collecting the state of the network and applies it on the network, and extracts information in the backward artificial ant as a backward artificial ant arrives from an external node.
Ecosystem based routing device.
The method of claim 2,
The ant processing unit,
The forward artificial ants are generated at predetermined time intervals and applied to the network.
Ecosystem based routing device.
The method of claim 3, wherein
The ant processing unit,
As the routing device receives a forward artificial ant that is an arrival node through the network, the information collected by the received forward artificial ant is extracted and then extinguished, and a backward artificial ant corresponding to the destroyed forward artificial ant is generated. The extracted information is included in the backward artificial ant and applied to the network using a path opposite to the transmission path of the destroyed forward artificial ant.
Ecosystem based routing device.
The method of claim 4, wherein
And an updater configured to update the local model and the pheromone table using information included in the backward artificial ant.
Ecosystem based routing device.
The method of claim 5, wherein
The update unit,
As the backward artificial ant arrives, the difference value between the delay value of the routing device and the delay value of the arrival node is calculated by using the information included in the backward artificial ant, and the arrival arrives at the local data structure in the local model. Selecting a local data structure having a destination corresponding to a predetermined node and including a local model updating unit to update the selected local data structure based on the difference value;
Ecosystem based routing device.
The method according to claim 6,
The updater selects and updates one QoS colony that is close to the difference value in a preset range from the QoS colony list of the selected data structure, or adds a QoS colony using the difference value to the selected data structure.
Ecosystem based routing device.
The method according to claim 6,
The update unit,
And a pheromone updater configured to select a pheromone data structure having a destination corresponding to the arrival node in the pheromone data structure for each destination, and update the pheromone table by reflecting the difference value to the selected pheromone data structure.
Ecosystem based routing device.
The method of claim 8,
The pheromone update unit,
Selecting one of the QoS colonies from the QoS colony list of the selected pheromone data structure based on the difference value and using the degree of the relationship between the delay statistics value of the selected QoS colonies in the local data structure and the difference value Computing a pheromone value for a neighbor node in a QoS colony and updating the pheromone table using the calculated pheromone value of the neighbor node.
Ecosystem based routing device.
The method of claim 9,
The pheromone updating unit updates a pheromone value in the pheromone table by the following equation.

(

Is the pheromone value for the neighbor node j of the selected QoS colony,

Is a measure of the degree of relationship between the delay statistics of the selected QoS colony and the difference value (t _{i → j} ).
Ecosystem based routing device.
The method of claim 9,
The pheromone updater updates the pheromone value in the pheromone data structure for each destination by a predetermined period to update the pheromone update.
Ecosystem based routing device.
The method of claim 1,
The packet processing unit,
As the packet arrives, a pheromone data structure having a destination corresponding to a next arrival node of the packet is selected from the pheromone table, and a measure indicating a degree of relation for each QoS colony present in the selected pheromone data structure is calculated. Relationship calculation section to do,
A probability calculator for selecting a QoS colony having the largest scale and calculating a routing probability to each neighbor node based on pheromone values of neighbor nodes in the selected QoS colony and a congestion measure of each neighbor node;
A transmission path setting unit configured to set any one of the neighbor nodes as a transmission path of the packet based on a routing probability for each neighbor node;
Ecosystem based routing device.
The method of claim 12,
The relationship calculating unit may calculate a measure indicating a degree of relationship for each QoS colony using delay statistics values stored in each QoS colony of the selected local data structure.
Ecosystem based routing device.
It consists of a local data structure for each destination with destination nodes as destinations, and each local data structure is composed of a local model for storing statistical information for each QoS and a pheromone data structure for each destination with destination nodes as destinations. And the pheromone information for each QoS is stored in each of the pheromone data structures, and each QoS colony has a pheromone table storing pheromone information of its neighbor nodes. As
Selecting from the pheromone table a pheromone data structure and a local data structure having a destination corresponding to a next arrival node of the packet as the packet arrives;
Calculating a measure indicating a degree of relationship for each QoS colony present in the selected local data structure;
Selecting a QoS colony having the largest scale and calculating a routing probability to each neighbor node based on pheromone values of neighbor nodes in the selected QoS colony and a congestion measure of each neighbor node;
Setting any one of the neighbor nodes as a transmission path of the packet based on a routing probability for each neighbor node;
Transmission path establishment method using ecosystem based routing device.
The method of claim 14,
The calculating of the scale may include calculating a scale indicating a degree of relation for each QoS colony through the following equation.

(

Is the service delay request value of the packet,

Is the average delay value of the kth QoS colony,

Is the standard deviation of the delay value of the kth QoS colony,

Wow

Are the maximum supportable delay values, the minimum supportable delay values, calculated using the delay statistics of the kth QoS colony, respectively.

,

Is a weighting constant whose sum is 1, and by setting the confidence interval setting constant v and the sample window size w

Wow

Available)
Transmission path establishment method using ecosystem based routing device.
The method of claim 14,
The calculating of the probability may be performed through the following equation.

(

Is the pheromone value from the selected QoS (X _sel ) to neighbor node j,

Is a measure of j's congestion,

Is

Weight constant of)
Transmission path establishment method using ecosystem based routing device.
The method of claim 14,
Generating and applying a forward artificial ant for collecting state information of the network, and extracting the state information in the backward artificial ant as the backward artificial ant arrives from an external node;
Transmission path establishment method using ecosystem based routing device.
The method of claim 17,
Generating and applying the forward artificial ants on the network at predetermined time intervals;
Transmission path establishment method using ecosystem based routing device.
The method of claim 17,
Receiving, by the routing device, a forward artificial ant via the network, which is an arrival node;
Extracting and extinguishing state information collected from the received forward artificial ants, and generating a backward artificial ant corresponding to the destroyed forward artificial ant;
Including the extracted state information in the backward artificial ant and applying the extracted state information on the network in a reverse path to the transmission path of the destroyed forward artificial ant;
Transmission path establishment method using ecosystem based routing device.
The method of claim 19,
Updating the local model and the pheromone table using state information included in the backward artificial ant;
Transmission path establishment method using ecosystem based routing device.
The method of claim 20,
The updating step,
Calculating a difference value between a delay value of the routing device and a delay value of an arrival node using state information included in the backward artificial ant;
Selecting a local data structure having a destination corresponding to the arrival node in a local data structure in the local model;
Updating the selected local data structure using the difference value
Transmission path establishment method using ecosystem based routing device.
The method of claim 21,
Updating the selected local data structure,
Determining whether there is a QoS colony adjacent to the difference value in a preset range in the QoS colony list of the selected data structure;
If the QoS colony exists, selecting a QoS colony close to the preset range and updating the selected QoS colony using the difference value;
If the QoS colony does not exist, updating the local model by adding a QoS colony using the difference value to the selected data structure.
Transmission path establishment method using ecosystem based routing device.
The method of claim 21,
Selecting a pheromone data structure having a destination corresponding to the arrival node in the destination pheromone data structure;
Updating the pheromone table by reflecting the difference value in the selected pheromone data structure.
Transmission path establishment method using ecosystem based routing device.
The method of claim 23,
Updating the pheromone table,
Selecting one QoS colony from the QoS colony list of the selected pheromone data structure based on the difference value;
Calculating a pheromone value for a neighbor node in the selected QoS colony using the degree of relationship between the delay statistics value of the selected QoS colony and the difference value in the local data structure;
Updating the pheromone table using the calculated pheromone values of the neighboring nodes;
Transmission path establishment method using ecosystem based routing device.
The method of claim 24,
The updating of the pheromone table may include updating a pheromone value in the pheromone table by the following equation.

(

Is the pheromone value for the neighbor node j of the selected QoS colony,

Is a measure of the degree of relationship between the delay statistics of the selected QoS colony and the difference value (t _{i → j} ).
Transmission path establishment method using ecosystem based routing device.
The method of claim 24,
Updating the pheromone table by reflecting an evaporation constant in a pheromone value in the pheromone data structure for each destination at a predetermined period;
Transmission path establishment method using ecosystem based routing device.

Images