KR101210926B1 - Server, apparatus and method for allocating cost of dynamic routing - Google Patents

Abstract

The dynamic routing cost allocation server according to the present invention includes a router information receiver for monitoring traffic volume of a router, a wireless link information receiver for receiving radio link state information from a baseband portion of a wireless terminal, and a network management server for managing a current network scenario. Network scenario determination unit for determining a scenario weighting factor using the policy information of the scenario received from the routing, Routing cost calculation unit for calculating the routing cost using the monitored traffic amount and the determined scenario weighting factor and the radio link state information And a router applying unit which generates and transmits a router control script message reflecting the calculated routing cost to the router, thereby reducing problems of deterioration of the quality of the radio link and deterioration of the quality of voice and data services in a limited bandwidth. The.

Description

Dynamic Routing Cost Allocation Servers, Devices, and Methods {SERVER, APPARATUS AND METHOD FOR ALLOCATING COST OF DYNAMIC ROUTING}

The present invention relates to a dynamic routing cost allocation server, apparatus, and method, and more particularly, to a dynamic routing cost allocation server, apparatus, and method for dynamically reflecting various wireless environment characteristics and network scenarios in routing of a routing algorithm. .

Opening Shortest Path First (OSPF) and Routing Information Protocol (RIP) are the most widely used routing algorithms in the backbone network. The routing algorithm considers the hop count or interface considering only the wired environment. The path cost is calculated by considering only bandwidth. However, in recent years, the network environment has been developed into a wired / wireless integrated network instead of a separate wired and wireless network due to the development of wireless communication technology. Have

Conventional routing algorithms do not reflect the radio link characteristics when calculating the routing path cost, and only consider the hop number and the interface bandwidth. Therefore, even though there is a radio link in a good reception state, a low-hop congested link or a high BER link may be used. Determination of the optimal path may cause a large amount of packet loss and transmission delay. In addition, since the weight value for the routing metric is fixed, an optimal routing path according to the characteristics of the traffic for each network scenario cannot be calculated.

The present invention provides a dynamic routing cost allocation server, apparatus and method that dynamically reflects various wireless environment characteristics and network scenarios in determining a routing algorithm.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory and are not intended to limit the invention to the precise forms disclosed. Other objects, which will be apparent to those skilled in the art, It will be possible.

Dynamic routing cost allocation server of the present invention for achieving the above object is a router information receiver for monitoring the traffic amount of the router, a radio link information receiver for receiving radio link status information from the baseband portion of the wireless terminal, the scenario of the current network Network scenario determination unit for determining a scenario weighting factor using the policy information of the scenario received from the network management server that manages the routing cost by using the monitored traffic amount, the determined scenario weighting factor and the radio link state information. The router may include a routing cost calculator for calculating and a router application script for generating a router control script message reflecting the calculated routing cost and transmitting the same to the router.

In this case, the radio link state information may include at least one of a radio link channel bandwidth, a bit error ratio (BER), and a link delay.

Meanwhile, the apparatus for allocating the dynamic routing cost according to the present invention includes an information acquisition unit for acquiring traffic information of a router, wireless link state information of a wireless terminal, and scenario policy information of a network management server, and a scenario weighting factor determined from the scenario policy information and the traffic. And a cost calculator configured to calculate a routing cost from the information and the radio link state information.

In this case, the routing cost may be calculated by the following equation.

Where TCV [t] is the final routing cost,

C _a , C _b , and C _c are the correction coefficients for each parameter,

M is the reflecting factor for link purpose,

이며,

Is,

이고,

ego,

이며,

Is,

CV _abw [t] is the routing cost for the available bandwidth,

CV _ber [t] is the routing cost for BER,

CV _latency [t] is the routing cost for _latency ,

S _abw is a scenario weighting factor for available bandwidth,

S _ber is the scenario weighting coefficient for BER,

S _latency is the scenario weighting factor for _latency ,

이고,

ego,

T _total [t] is the total delay time,

T _queue [t] is the queuing latency,

T _link [t] is the link delay time,

이고,

ego,

이며,

Is,

ABW [t] is the available bandwidth of the radio link,

BW _ch [t] is the radio link channel bandwidth,

BW _intf is the router interface bandwidth,

LU _avg [t] is the average link utilization,

t is the time slot.

In addition, a mapping unit for generating a topology map by mapping the network configuration information included in the scenario policy information, the interface connection address of the router included in the traffic information and the radio link state information, and an unsigned link from the radio link state information. The link identification unit may further include a bypass path determining unit configured to determine whether a bypass path of the identified non-good link exists from the topology map, and the cost calculator may calculate a routing cost of the bypass path.

On the other hand, the dynamic routing cost allocation method of the present invention comprises the steps of obtaining the traffic information of the router, the radio link state information of the wireless terminal and the scenario policy information of the network management server, the scenario weighting coefficient and the traffic information determined from the scenario policy information and Calculating a routing cost from the radio link state information.

In this case, a topology map is generated between the information acquisition step and the routing cost calculation step by mapping the network configuration information included in the scenario policy information, the interface connection address of the router included in the traffic information, and the radio link state information. The method may further include identifying an unsigned link from the radio link state information, and determining whether a bypass path of the identified unsigned link exists from the topology map. If is present may be performed for the bypass route.

On the other hand, the dynamic routing cost allocation method of the present invention can be recorded as a program on a computer-readable recording medium.

As described above, the dynamic routing cost allocation server, apparatus and method according to the present invention calculate the routing cost by using the radio link characteristics and scenario policy information of the current network. Can be reflected.

As a result, the quality degradation of the radio link and the quality degradation of voice and data services in a limited bandwidth can be improved.

1 is a block diagram illustrating a dynamic routing cost allocation server of the present invention.
2 is a block diagram showing a dynamic routing cost allocation apparatus of the present invention.
Figure 3 is a schematic diagram showing a topology map generated in the mapping unit of the operation routing cost allocation apparatus of the present invention.
4 is a flow diagram illustrating a dynamic routing cost allocation method of the present invention.
FIG. 5 is a diagram illustrating pseudo codes for recognizing importance information included in scenario policy information and calculating scenario weighting factors. FIG.
6 is a schematic diagram showing setting of a simulation using OPNET.
FIG. 7 is a graph showing VO values of voice quality transmitted based on path assignment reflecting only radio link characteristics and voice quality transmitted based on conventional OSPF path assignment. FIG.
8 is a graph showing MOS values of voice quality transmitted based on a path assignment in which radio link characteristics and scenario policy information are reflected together.

Hereinafter, a dynamic routing cost allocation server, an apparatus, and a method according to the present invention will be described in detail with reference to the accompanying drawings.

1 is a block diagram illustrating a dynamic routing cost allocation server in accordance with the present invention.

The dynamic routing cost allocation server shown in FIG. 1 includes a router information receiver 110 for monitoring traffic volume of a router, a radio link information receiver 130 for receiving radio link state information from a baseband portion of a wireless terminal, and a current network. The network scenario determination unit 150 determines a scenario weighting factor using the policy information of the scenario received from the network management server managing the scenario, and uses the monitored traffic amount, the determined scenario weighting factor, and the radio link state information. Routing cost calculation unit 170 for calculating the routing cost and a router application unit 190 for generating a router control script message reflecting the calculated routing cost and transmits to the router.

The router information receiving unit 110 is a module for receiving status information of the router interface. The router information receiving unit 110 may periodically monitor the amount of traffic flowing from each router interface to recognize the average link utilization in the routing cost calculator. Make sure

The radio link information receiver 130 receives status information of a radio link connected to a corresponding interface from a base band unit of a wireless terminal (wireless transmission device). The radio link state information may include at least one of a radio link channel bandwidth (available bandwidth), a bit error ratio (BER), and a link delay (delay time).

The network scenario determination unit 150 is a module for recognizing the network status and the characteristics of the current important traffic. The network scenario determination unit 150 receives scenario policy information in an AS (Autonomous System) to which the network management server belongs and uses the scenario weighting factor, for example. For example, the scenario weighting factor for the available bandwidth, the scenario weighting factor for the BER, and the scenario weighting factor for the delay time are determined. The scenario weighting coefficient thus determined is used to calculate each routing cost as in Equation 1 below. For reference, the calculated routing costs CV _abw [t], CV _ber [t], and CV _latency [t] are used in Equation 2.

Where CV _abw [t] is the routing cost for the available bandwidth,

CV _ber [t] is the routing cost for BER,

CV _latency [t] is the routing cost for _latency ,

S _abw is a scenario weighting factor for available bandwidth,

S _ber is the scenario weighting coefficient for BER,

S _latency is the scenario weighting factor for _latency .

Scenario policy information includes the importance information that depends on the content of traffic of the scenario currently in operation. For example, in the case of audio data and video data, the importance of audio data is generally high, but the importance of video data may be high depending on a scenario. Conventionally, even in such a situation, the assignment of reliable paths to video data is limited because audio data is important. In order to solve such a problem, the network scenario determination unit may receive scenario policy information including importance information and analyze scenario policy information, for example, to analyze the importance between voice data and video data. The importance information should be able to identify at least what kind of data is more important. In order to apply weights to the data identified as a result of the analysis of scenario policy information, importance information should be digitized.

In order to quantify the importance information, it is possible to prepare a table that corresponds to a certain score for the corresponding data by analyzing parameters that have a sensitive influence on the identified data. For example, in the case of voice data, since the receiver receives data that cannot be recognized when there is an error in the transmission time, the transmission time is more important than the available bandwidth or the BER. Accordingly, weight 1 may be set for the transmission time, and a value smaller than weight 1 may be set for the available bandwidth and the BER as the weight. In this way, the weight information for each type of data is set in a table, and if necessary, the importance information can be digitized by extracting it from the network scenario determination unit.

The digitization may be performed in the routing cost calculation unit in addition to the network scenario determination unit. In this case, it is sufficient to transmit only the importance information to the routing cost calculation unit. Meanwhile, the determination and quantification of the importance information may be performed as shown in FIG. 5 described later by the QoS policy included in the weight of the non-good link and the scenario policy information.

The routing cost calculator 170 calculates the final routing cost through the information collected from the router information receiver 110, the network scenario determination unit 150, and the radio link information receiver 130.

In this case, the final routing cost TCV [t] is calculated by Equation 2 below.

Here, C _a , C _b , C _c is the correction coefficient for each parameter,

M is the reflecting factor for link purpose,

이고,

ego,

이며,

Is,

이고,

ego,

CV _abw [t] is the routing cost for available bandwidth.

CV _ber [t] is the routing cost for BER,

CV _latency [t] is the routing cost for _latency ,

S _abw is a scenario weighting factor for available bandwidth,

S _ber is the scenario weighting coefficient for BER,

S _latency is the scenario weighting factor for _latency ,

이며,

Is,

T _total [t] is the total delay time,

T _queue [t] is the queuing latency,

T _link [t] is the link delay time,

이며,

Is,

이고,

ego,

ABW [t] is the available bandwidth of the radio link,

BW _ch [t] is the radio link channel bandwidth,

BW _intf is the router interface bandwidth,

LU _avg [t] is the average link utilization,

Traffic _avg [t] is the average traffic volume.

t is the time slot.

The correction coefficients C _a , C _b , and C _c for each parameter are coefficients for standardizing each routing cost CV _abw [t], CV _ber [t], and CV _latency [t] in different units. This coefficient is based on the link protocol set according to the network operation policy. For example, even if the state of the A link is good, if the A link is used only by a specific wireless terminal according to a network operation policy, the link purpose may be set to a low reflection factor so that it cannot be used by other wireless terminals.

The higher the routing cost calculated by the routing cost calculator 170, the better the path suitable for communication. Therefore, by referring to the routing cost, the router can take appropriate measures for smooth communication. In this case, the router application may be used to refer to the routing cost.

The router application unit 190 is a module that reflects the final routing cost calculated by the routing cost calculator. The router application unit 190 generates and transmits a control script message for controlling the router according to the routing algorithm currently operated by the router. Will change.

2 is a block diagram showing a dynamic routing cost allocation apparatus according to the present invention.

The dynamic routing cost allocation apparatus shown in FIG. 2 may be a routing cost calculator in the dynamic routing cost allocation server shown in FIG. 1.

As described above, an information acquisition unit 171 for acquiring traffic information of a router, wireless link state information of a wireless terminal, scenario policy information of a network management server, and a scenario weighting factor determined from the scenario policy information, the traffic information, and the wireless link state A cost calculation unit 173 for calculating the routing cost from the information is included.

The information acquisition unit 171 obtains traffic information, radio link state information, and scenario policy information from a router, a wireless terminal, and a network management server, respectively. Acquisition of such information may be performed by directly receiving from a router, a wireless terminal, or a network management server, or may be performed through the router information receiver 110, the network scenario determination unit 150, and the wireless link information receiver 130 described with reference to FIG. 1. Can be. In the former case, a receiving unit for receiving the corresponding information from each device should be included. In addition, scenario policy information should be analyzed to identify materiality information.

In this case, the scenario weighting coefficient may be determined from the importance information and transmitted to the cost calculator, or only the importance information may be transmitted. In the latter case, the scenario weighting factor should also be determined by the cost calculator.

The cost calculator 173 calculates a routing cost by using scenario policy information, specifically, importance information, using a scenario weighting factor, traffic information, and radio link state information determined by the information acquirer or itself. The routing cost at this time is calculated by equation (2).

The calculated routing cost should be referenced by the router. For this purpose, the routing cost further includes an allocation requesting unit (not shown) for requesting an element that provides or controls information to the router such as a routing application unit to allocate the calculated routing cost to the router. can do.

According to the above configuration, the routing cost can be allocated by reflecting not only the radio link characteristic information but also the scenario policy information. However, when the network structure becomes complicated, network resources may be wasted because the routing cost allocated afterwards is frequently changed by the newly allocated routing cost. For example, if the route A is allocated according to the calculated routing cost, and the route A is assigned to a large number of routes, the route B is allocated. Can occur.

In order to prevent such a phenomenon, the dynamic routing cost allocation apparatus generates a topology map by mapping the network configuration information included in the scenario policy information, the interface connection address of the router included in the traffic information, and the radio link state information. 175, a link identification unit 177 for identifying an un good link from the radio link state information, and a bypass path determination unit 179 for determining whether a bypass path of the identified un good link is present from the topology map. In this case, the cost calculator 173 may calculate the routing cost of the bypass path.

The mapping unit 175 may express a network configuration as a topology map as shown in FIG. 3 by using a BER, a link delay (delay time), an available bandwidth, and a router interface connection address. In Figure 3, each AS 1000, AS 1001, AS 1002 means an independent communication network.

 If a queuing delay is required for generating the topology map, the information acquisition unit may request to obtain a queuing delay from the wireless terminal.

The link identification unit 177 identifies whether the link is an unhealthy link using the radio link state information. An unfavorable link is a link that does not meet the minimum required capability of the transmission link for data communication. For example, if the available bandwidth: 110kbps or more, BER: 10E ^ 4 or more, and delay time: 300ms or less are the thresholds in the VoIP (Voice over IP) communication standard using the G.711 codec, the unsatisfactory link is unsatisfactory. Becomes

The bypass path determining unit 179 refers to the topology map to determine whether there is a bypass path available for the unfavorable link. Even if a detour route exists, there is no guarantee that the detour route is better than the current route, so the cost calculator can be used to verify this.

According to the above configuration, if there is no application of the cost calculator for the good link that is opposite to the non-good link, there is an application of the cost calculator for only the non-good link. As a result, unnecessary path assignment is prevented.

4 is a flowchart illustrating a dynamic routing cost allocation method associated with the present invention.

The dynamic routing cost allocation method shown in FIG. 4 may be described as the operation of the dynamic routing cost allocation apparatus shown in FIG.

First, traffic information of a router, wireless link state information of a wireless terminal, and scenario policy information of a network management server are obtained (S510). The operation is performed by the information acquisition unit 171.

A routing cost is calculated from the scenario weighting factor determined from the scenario policy information, the traffic information, and the radio link state information (S550). The operation performed by the cost calculator 173 performs routing cost allocation, that is, dynamic routing cost allocation, reflecting radio link characteristics and scenario policy information of the current network.

However, if a routing cost calculated by the cost calculation unit is newly allocated to a path having no abnormality in the current communication, there may be confusion, so the following step may be added between the information acquisition step and the routing cost calculation step. .

A topology map is generated by mapping the network configuration information included in the scenario policy information, the interface connection address of the router included in the traffic information, and the radio link state information (S520). The topology map generated by the operation performed by the mapping unit 175 is used later to determine the bypass path.

In operation S530, an unfavorable link is identified from the radio link state information. In FIG. 4, when the current path is identified as a good link as an identification result, the process ends in step S510. This continually monitors for unhealthy links on the current path.

From the topology map, it is determined whether there is a bypass path of the identified ungood link (S540). The operation of the bypass path determining unit 179 determines driving of the cost calculator according to the determination result of the bypass path determining unit. That is, the routing cost calculating step S 550 may be performed for the bypass path when the bypass path exists. In summary, the cost calculator can only be driven if the current path is an ungood link and a bypass path exists.

The routing cost calculated by the cost calculator is applied to the router by the router application unit 190 or the like that receives the request of the allocation requester.

FIG. 5 is a diagram illustrating a pseudo code for recognizing importance information included in scenario policy information and calculating a scenario weighting factor.

The recognition process of importance information is as follows. First, the weight of the link that does not satisfy the good criterion for each radio link characteristic is counted to recognize the weight of the ungood link. This process identifies which characteristics of the radio link have a major impact on the quality of service degradation. The following is a process to reflect the QoS factor in the calculated result, and to set each QoS factor value for each wireless link based on the QoS policy of the current network and to reflect the importance according to the characteristics of the traffic. Failure to satisfy the respective conditions for VoIP _latency Q> _ber Q> Q _abw) is multiplied by a weight w in the scenario weight factor, and to reflect on the final cost of the routing metric calculation.

FIG. 6 is a schematic diagram illustrating a simulation setup using OPNET, in which a characteristic of a radio link having the greatest influence on the quality of a voice service transmitted after generating a congestion section in a specific network is available bandwidth (actually, delay time). It is assumed. In this state, in the case of applying the dynamic routing cost allocation apparatus according to the present invention, the results of applying the pseudo code of FIG. 5 are shown in FIGS. 7 and 8.

FIG. 7 is a graph showing MOS values (measures of voice quality) of voice quality transmitted based on a path assignment reflecting only voice quality and radio link characteristics based on a path assignment using a conventional OSPF. As a result, when the conventional OSPF is applied, the MOS value appears as 1, which is the lowest level, whereas the MOS value when the radio link characteristic is applied is improved to 1.5 to 2.7. FIG. 8 is a graph showing the voice quality transmitted as the MOS value based on the path assignment reflecting the radio link characteristics and the scenario policy information. The MOS value is improved to 2 to 3.2.

Accordingly, the dynamic routing cost allocation server / device / method of the present invention solves the problem of not recognizing the radio link characteristics and network scenarios (scenario policy information) in the conventional routing algorithm, thereby providing a bypass path having a good link state, and providing a voice. And quality of service of the data packet.

On the other hand, the above-described dynamic routing cost allocation method can be recorded as a program on a computer-readable recording medium.

It will be understood by those skilled in the art that the present invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. It is therefore to be understood that the embodiments described above are to be considered in all respects only as illustrative and not restrictive. 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.

It can be applied to a system that allocates a routing path in a communication network.

110 ... Router information receiver 130 ... Wireless link information receiver
150 ... network scenario determination unit 170 ... routing cost calculator
190 ... Router application unit 171 ... Information acquisition unit
173 Cost calculation unit 175 Mapping unit
177 Link identification unit 179 Bypass path determination unit

Claims (8)

A router information receiver for monitoring a traffic amount of the router;
A radio link information receiver for receiving radio link state information from a baseband unit of the radio terminal;
A network scenario determination unit configured to determine a scenario weighting factor using policy information of the scenario received from a network management server managing a scenario of a current network;
A routing cost calculator configured to calculate a routing cost using the monitored traffic amount, the determined scenario weighting factor, and the radio link state information; And
A router application unit generating a router control script message reflecting the calculated routing cost and transmitting the generated router control script message to the router;
Including;
Dynamic routing cost allocation server, characterized in that the calculation of the routing cost is calculated by the following equation.

Where TCV [t] is the final routing cost,
C _a , C _b , and C _c are the correction coefficients for each parameter,
M is the reflecting factor for link purpose,

Is,

ego,

Is,
CV _abw [t] is the routing cost for the available bandwidth,
CV _ber [t] is the routing cost for BER,
CV _latency [t] is the routing cost for _latency ,
S _abw is a scenario weighting factor for available bandwidth,
S _ber is the scenario weighting coefficient for BER,
S _latency is the scenario weighting factor for _latency ,

ego,
T _total [t] is the total delay time,
T _queue [t] is the queuing latency,
T _link [t] is the link delay time,

ego,

Is,
ABW [t] is the available bandwidth of the radio link,
BW _ch [t] is the radio link channel bandwidth,
BW _intf is the router interface bandwidth,
LU _avg [t] is the average link utilization,
Traffic _avg [t] is the average amount of traffic,
t is the time slot.
The method of claim 1,
The wireless link state information includes at least one of a radio link channel bandwidth, a bit error ratio (BER), and a link delay.
delete delete The method of claim 1,
The routing cost calculation unit,
An information obtaining unit obtaining traffic information of the router, wireless link state information of the wireless terminal, and scenario policy information of the network management server;
A cost calculator configured to calculate a routing cost from the scenario weight coefficient determined from the scenario policy information, the traffic information, and the radio link state information;
A mapping unit generating a topology map by mapping the network configuration information included in the scenario policy information, the interface connection address of the router included in the traffic information, and the radio link state information;
A link identification unit for identifying an uncompliant link from the radio link state information; And
And a bypass path determining unit that determines whether a bypass path of the identified ungood link exists from the topology map.
And the cost calculator calculates a routing cost of the bypass path.

delete delete delete

Images