KR101563457B1 - System and method for selecting neighbor node to guarantee service availability - Google Patents

Abstract

Disclosed are a system and a method for selecting a neighbor node to guarantee service availability. The neighbor node selecting method of a neighbor node selecting system implemented with a computer comprises the steps of: obtaining a required availability value of service; calculating a remaining service availability value in the current node; applying the required availability value of the service and the remaining service availability value in the current node to a predetermined availability guaranteeing function to calculate a value of the function; and determining whether availability of the current node with respect to a neighbor node is guaranteed based on the value of the function to add the neighbor node of the current node to a set of neighbor nodes where availability thereof can be guaranteed according to a result of the determination.

Description

[0001] SYSTEM AND METHOD FOR SELECTING NEIGHBOR NODE TO GUARANTEE SERVICE AVAILABILITY [0002]

Embodiments of the present invention are directed to a system and method for obtaining availability information of a current network through various measurement methods and selecting a neighbor node to ensure service availability in a wire / wireless router.

The network operation scheme according to the prior art protection recovery request is as follows.

In the case of the Internet, the provided service establishes a service level agreement (SLA) according to the service type provided by the network provider. One of the most common ways of ensuring availability among elements of an SLA is to use a redundant or 1: N protection recovery scheme.

In the prior art, networks are operated differently according to the type of service. For example, users with high protection recovery requirements provide services through the enterprise network, banks with the platinum network, and general users with the bronze network.

However, in the case of the conventional technology, since the defined availability based on the network provider can not be ensured, the various demands of the user are not reflected. In addition, Which makes it difficult to accommodate the user.

In addition, the availability guarantee technology based on the protection recovery method requires a large cost for the user because the facility investment cost (CPAEX) and the operation cost (OPEX) are consumed a lot, and in addition, A large amount of power is consumed.

Provided is a system and method for selecting a neighboring node capable of ensuring the availability of various service-specific needs and capable of providing smooth service as the availability can be corrected.

From a network operator's point of view, a neighboring node selection system and method that can reduce facility investment cost (CPAEX) and operational cost (OPEX) used for protecting and recovering network by using function only to guarantee availability to provide.

A system and method for selecting a neighboring node that can be utilized as a core availability guarantee technology capable of ensuring availability to various future services is provided.

The present invention provides a system and method for selecting a neighboring node that can be applied to any wired / wireless router equipment through a newly developed GA function and can easily guarantee service availability when applied.

A computer-implemented method of selecting a neighbor node of a neighbor node selection system, comprising: obtaining a request availability value of a service; Calculating a remaining service availability value at the current node; Calculating a function value by applying the service availability availability value and a service availability value remaining in the current node to a predetermined availability guarantee function; And determining whether availability of the current node to the neighboring node is guaranteed based on the function value and adding the neighboring node of the current node to the availability of the neighboring node set according to a result of the determination The method comprising the steps of:

A computer-implemented neighbor node selection system, comprising: a basic information unit for managing information on a received packet; And acquiring a service availability value from the packet related information unit through the information on the packet, calculating a service availability value remaining in the current node, setting the service availability value and the service availability value remaining in the current node The function value is calculated by applying the function value to the availability guarantee function, the availability of the current node to the neighbor node is guaranteed based on the function value, and the availability of the neighbor node of the current node is guaranteed And a availability guarantee function unit for adding the neighbor availability to the neighboring node set.

Availability of various service-specific needs can be guaranteed, and availability can be compensated to provide smooth services.

From a network operator's point of view, it can reduce capital expenditure (CPAEX) and operating expenditure (OPEX) used for protecting and recovering networks by using only function functions to ensure availability.

It can be used as a core availability guarantee technology that can guarantee availability for various future services.

The newly developed GA function can be applied to any wired / wireless router equipments and can guarantee the service availability when applying the GA function.

1 is a flowchart illustrating an example of a method of selecting a neighboring node that guarantees service availability based on a GA function in an embodiment of the present invention.
2 is a flowchart illustrating an internal configuration of a neighbor node selection system according to an embodiment of the present invention.
3 is a view for explaining a structure for storing statistical values in the network availability statistics modeling unit according to an embodiment of the present invention.
FIG. 4 is a diagram illustrating an example of a method of operating between a routing protocol (HWMP) of a wireless mesh network and a service availability module in a wireless mesh router according to an exemplary embodiment of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings.

Embodiments of the present invention are directed to a system and method for selecting a neighboring node that is capable of ensuring availability against a variety of service-specific needs.

The definitions of the terms used in the embodiments of the present invention are as follows.

▼ G = ( V , L ), v ∈ V , l ∈ L

If the network is represented by graph G , the network can be composed of a set V of nodes and a set L of links. In this case, v can denote a node and l can denote a link.

A _k ( k ∈ l )

A _k can mean the availability value of link k . For example, the value of A _k may be defined as Mean Time to Failure (MTTF).

▼ A _m

A _m represents the availability value remaining at the current node and can be calculated through the equation described below.

▼ A _f

A _f can represent the availability value of the service.

▼ A _in'd ~ ( μ _in'd , σ _in'd )

A _in'd ~ ( μ _in'd , σ _in'd ) can be a statistical model of the network availability value of the path from the current node i to the destination node d through the neighboring node n ' .

▼ μ _in'd

μ _in'd can mean the average network availability value of the path from the current node i to the destination node d through the neighbor node n ' .

▼ σ _in'd

σ _in'd may refer to the standard deviation of the network availability of the path from the current node i to the destination node d via the neighboring node n ' .

▼ ξ

ξ can be a weight value used in statistical update in the network availability statistics model.

▼ GA ( A _m , A _in'd )

GA ( A _m , A _in'd ) may refer to an availability assurance discriminant function.

The formulas used in the embodiments of the present invention are as follows.

Equation 1 may indicate that the network availability value (A = _{s → i)} of the starting node s to the current node i can be calculated as a product of availability value for each node.

Equation 2 may indicate that the availability value (= A _m ) remaining at the current node can be calculated by dividing the availability value (= A _f ) of the service by A _{s → i} calculated through Equation (1).

는 현재 노드 i에서 이웃 노드 n'을 거쳐 도착 노드 d까지 가는 경로의 망 가용성 평균값의 최대치를,

는 현재 노드 i에서 이웃 노드 n'을 거쳐 도착 노드 d까지 가는 경로의 망 가용성 평균값의 최소치를 의미할 수 있다. 그리고, c ₁, c ₂는 가중치를 나타낼 수 있으며, 수학식 3을 통해 z값은 계산이 가능하며, w는 샘플링 윈도우 사이즈(개수)를 나타낼 수 있다.The Guarantee Availability (GA) function, which is an availability guarantee function, is calculated by using the value of A _m calculated through Equation (2), the average value ( μ _in'd ) and the standard deviation value ( σ _in'd ) 3 < / RTI > At this time,

The maximum value of the network availability average value of the route from the current node i to the destination node d via the neighbor node n '

Can mean the minimum value of the network availability average of the path from the current node i to the destination node d via the neighboring node n ' . C ₁ , c ₂ can represent a weight, and z can be calculated through Equation (3), and w can represent a sampling window size (number).

The statistical model A _in'd ~ ( μ _in'd , σ _in'd ) for the network availability value may be updated via Equation (4). In this case, ξ can be a weight value used in statistical update in the network availability statistics model, and A _{i → n '} can represent the network availability value from the current node i to the neighbor node n' .

FIG. 1 is a flowchart illustrating an example of a method of selecting a neighboring node that guarantees service availability based on a GA function in an embodiment of the present invention. FIG. 2 is a flowchart illustrating an example of a method of selecting a neighboring node, And Fig.

The neighbor node selection system 200 according to the present embodiment may correspond to a wired or wireless routing apparatus and may include a processor 210, a bus 220, a network interface 230, and a memory 240 ). The memory 240 may include an operating system 241 and a neighbor node selection routine 242. The processor 210 may include a basic information unit 211, a service availability assurance unit 212, and a routing unit 213. The basic information 211 may include a routing related information unit 211a and a packet related information unit 211b and the service availability guarantee unit 212 may include a network availability statistics model unit 212a and a availability guarantee function unit 212b ). In other embodiments, the neighbor node selection system 200 may include more components than the components of FIG. However, there is no need to clearly illustrate most prior art components. For example, the neighbor node selection system 200 may further include other components such as a display or a transceiver.

The memory 240 may be a computer-readable recording medium and may include a permanent mass storage device such as a random access memory (RAM), a read only memory (ROM), and a disk drive. Also, the memory 240 may store program code for the operating system 241 and the neighbor node selection routine 242. These software components may be loaded from a computer readable recording medium separate from the memory 240 using a drive mechanism (not shown). Such a computer-readable recording medium may include a computer-readable recording medium (not shown) such as a floppy drive, a disk, a tape, a DVD / CD-ROM drive, or a memory card. In other embodiments, the software components may be loaded into the memory 240 via the network interface 230 rather than from a computer readable recording medium. For example, the neighbor node selection routine 242 may be loaded into the memory 240 based on a program installed by the developers through files provided by the network.

The bus 220 may enable communication and data transfer between the components of the neighbor node selection system 200. The bus 220 may be configured using a high-speed serial bus, a parallel bus, a Storage Area Network (SAN), and / or other suitable communication technology.

The network interface 230 may be a computer hardware component for connecting the neighbor node election system 200 to a computer network. The network interface 230 may connect the neighbor node election system 200 to the computer network via a wireless or wired connection.

The processor 210 may be configured to process instructions of a computer program by performing basic arithmetic, logic, and input / output operations of the neighbor node selection system 200. The instructions may be provided by the memory 240 or the network interface 230 and to the processor 210 via the bus 220. The processor 210 may be configured to execute program codes for the basic information unit 211, the service availability assurance unit 212 and the routing unit 213. [ Such program code may be stored in a recording device, such as memory 240 (e.g., a neighbor node computation routine 242).

At this time, the availability guarantee function unit 212b included in the service availability assurance unit 212 may be configured to perform the steps S110 to S180 of FIG.

Ensuring availability function unit at step (S110) (212b) can obtain the required availability of the service value (= A _f) via a packet-related information section (211b).

In step S120, the availability guarantee function unit 212b may calculate the remaining service request availability value (= A _m ). The service request availability value can be calculated through Equation (2).

In step S130, the availability function unit 212b may determine whether node j belongs to the current node i 's neighbor node set (= N _i ). Step S140 may be performed if node j belongs to the current node i 's neighbor node set, and step S180 may be performed if node j does not belong.

In step S140, the availability guarantee function unit 212b may calculate the GA function value. For example, the availability guarantee function unit 212b may calculate the GA function value by applying the remaining service request availability value and the service availability value at the neighbor node j to Equation (3).

In step S150, the availability function part 212b may determine whether the GA function value is less than or equal to one. The availability guarantee function unit 212b may perform step S160 if the GA function value is less than or equal to 1 and perform step S170 if the GA function value is greater than 1.

)에 추가할 수 있다.In step S160, the availability guarantee function unit 212b determines the neighbor node j as a neighbor node set (=

).

In step S170, the availability guarantee function unit 212b may increment the value of j by one. Increasing the value of j by one may mean setting node j to the next neighbor, and step S130 may be repeated for the next neighbor.

)을 라우팅부(213)로 전송할 수 있다.In step S180, the availability function unit 212b determines whether the set of selected neighboring nodes (=

To the routing unit 213. [

The basic information unit 211 and the routing unit 213 can operate according to the type of wired or wireless router and the routing protocol used in the corresponding equipment.

First, the basic information unit 211 may include a routing-related information unit 211a and a packet-related information unit 211b. At this time, the routing-related information unit 211a has information obtained through the routing protocol of the current equipment, and this information can be provided to the service availability guarantee unit 212 at the request of the service availability guarantee unit 212. [ The packet related information unit 211b has information on a packet arriving at the present equipment and this information may also be provided to the service availability guarantee unit 212 at the request of the service availability guarantee unit 212. [

Next, the service availability assurance unit 212 may include a network availability statistics model unit 212a and a availability assurance function unit 212b. At this time, the network availability statistical model unit 212a stores statistical values of the network availability information collected through the network state measurement, and the structure of the network availability statistical model unit 212a is shown in FIG. 3 to be described later. In addition, the network availability statistical modeling unit 212a may request network availability information to the routing-related information unit 212a, and update statistical values of the network availability information through the obtained information. The availability guarantee function unit 212b is a module configured to operate as a service availability determination function. In this case, the formula of the function is expressed by Equation (3). The availability guarantee function unit 212b can request and obtain a request availability value of the service in the packet related information unit 211b. The network availability statistical model unit 212a obtains the network availability statistics value and uses Equation 3 It is possible to select neighboring nodes capable of ensuring service availability.

Lastly, the routing unit 213 may be configured as a module for determining the next hop of the packet, and may be configured as a neighboring neighboring node capable of ensuring service availability through the availability guarantee function unit 212b of the service availability guaranteeing unit 212 Information about the nodes can be acquired, and the next hop can be determined through the routing protocol of the present equipment.

3 is a view for explaining a structure for storing statistical values in the network availability statistics modeling unit according to an embodiment of the present invention. FIG. 3 shows an example of storing statistical values of network availability for each destination-neighbor node in the network availability statistics modeling unit 212a.

FIG. 4 is a diagram illustrating an example of a method of operating between a Hybrid Wireless Mesh Protocol (HWMP) and a service availability module in a wireless mesh router according to an exemplary embodiment of the present invention.

4 is a block diagram illustrating the HWMP routing unit 410 including the HWMP information collecting unit 411 and the HWMP module 411. The HWMP routing unit 410 includes a HWMP routing unit 410 that can correspond to the routing unit 213, (412).

The HWMP routing unit 410 may acquire the network availability information from the network through the routing protocol, and then transmit the obtained information to the network availability statistical model unit 212a. The network availability statistics modeling unit 212a can update the network availability statistical information using the acquired information.

When a packet arrives, the availability guarantee function unit 212b can obtain network availability statistical information from the network availability statistical model unit 212a by requesting service availability information from the basic information unit 211. [

At this time, the availability guarantee function unit 114 may apply the availability statistical information and the service availability information to Equation (3) to select neighboring nodes that guarantee service availability, and may transmit the selected neighbor node information to the HWMP module 412 .

Thereafter, the HWMP routing unit 410 selects the next hop among the transmitted neighbor nodes, and transmits the packet to the next hop.

As described above, according to the embodiments of the present invention, it is possible to guarantee the availability of various usability requirements for each service, and it is possible to provide a smooth service as the availability can be corrected. From the viewpoint of the network operator, By using only function functions, it is possible to reduce capital expenditure (CPAEX) and operating expenditure (OPEX) used in the protecting and recovering network. In addition, it can be utilized as a core availability guarantee technology that can guarantee availability for various future services. It can be applied to any wired / wireless router equipment through a newly developed GA function, It is possible to facilitate the guarantee of availability.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented within a computer system, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA) , A programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

Claims (15)

A computer-implemented method of selecting a neighbor node of a neighbor node selection system,
Obtaining a request availability value of the service;
Calculating a remaining service availability value at the current node;
Calculating a function value by applying the service availability availability value and a service availability value remaining in the current node to a predetermined availability guarantee function; And
Determining whether availability of the current node to the neighboring node is guaranteed based on the function value, and adding the neighboring node of the current node to the availability of the neighboring node set according to a result of the determination
Wherein the neighboring node selection step comprises the steps of: The method according to claim 1,
The step of obtaining the request availability value of the service comprises:
Wherein the service request availability value is obtained from information on a received packet. The method according to claim 1,
Wherein calculating the remaining service availability value at the current node comprises:
Calculating a network availability value from a starting node of the received packet to the current node by using statistical information on the network availability information collected through the network status measurement and comparing the calculated network availability value and the availability demand value Wherein the service availability value remaining in the current node is calculated using the current service availability value. The method according to claim 1,
Wherein the step of calculating the function value comprises:
The maximum value and the minimum value of the network availability average value of the route from the current node to the destination node through the current node to the destination node and the service availability value remaining in the current node are applied to the predetermined availability guarantee function to calculate the function value Lt; RTI ID = 0.0 > a < / RTI > neighbor node. 5. The method of claim 4,
Wherein the step of calculating the function value comprises:
Wherein the maximum value and the minimum value are calculated using an average value and a standard deviation value of statistical information on network availability information collected through network state measurement. The method according to claim 3 or 5,
Wherein the statistical information is updated based on a network availability value from a current node to a neighboring node and a maximum value and a minimum value of the network availability average value of the route from the current node to the destination node through the neighboring node, A method for selecting a node. The method according to claim 1,
Determining a next hop of the received packet using the neighbor node set, and transmitting the packet to the next hop
Further comprising the step of: A computer-readable recording medium storing a program for executing the method according to any one of claims 1 to 5 or 7. A computer-implemented neighbor node selection system,
A basic information section for managing information on a received packet; And
Acquiring a service availability value from the packet related information unit based on information on the packet, calculating a service availability value remaining in the current node, and comparing the service availability value and the service availability value remaining in the current node with a predetermined availability And determining whether or not the availability of the current node to the neighboring node is guaranteed based on the function value, and determining availability of the neighboring node of the current node according to a result of the determination, Availability availability function to add to the set of possible neighbor nodes
The neighbor node selection system comprising: 10. The method of claim 9,
The availability guarantee function unit,
And obtains the service request availability value from information on the received packet through the basic information unit. 10. The method of claim 9,
A network availability statistical model unit that manages statistical information on network availability information collected through network status measurement
Further comprising:
The availability guarantee function includes:
Calculating a network availability value from a starting node of the received packet to the current node by using the statistical information, calculating a service availability value remaining in the current node based on the calculated network availability value and a request availability value of the service, The neighbor node selection system comprising: 10. The method of claim 9,
The availability guarantee function includes:
The maximum value and the minimum value of the network availability average value of the route from the current node to the destination node through the current node to the destination node and the service availability value remaining in the current node are applied to the predetermined availability guarantee function to calculate the function value Lt; RTI ID = 0.0 > node < / RTI > 13. The method of claim 12,
The availability guarantee function includes:
Wherein the maximum value and the minimum value of the average value are calculated using an average value and a standard deviation value of statistical information on the network availability information collected through the network state measurement. 14. The method according to claim 11 or 13,
Wherein the statistical information is updated based on a network availability value from a current node to a neighboring node and a maximum value and a minimum value of the network availability average value of the route from the current node to the destination node through the neighboring node, Node selection system. 10. The method of claim 9,
A routing unit for determining a next hop of the received packet using the neighbor node set and transmitting the packet to the next hop,
Wherein the neighbor node selection system further comprises:

Images