The present disclosure relates to a method and a device for managing a network in a communication system.
In order to manage a network element, a network management server may be added for a set of network elements. In this case, it is necessary for a user to intervene in assigning a network management server for every network element. Particularly, when the number of base stations (which may be eNodeBs (eNBs)) is large, it is very important to configure a network management server in order to perform efficient communication. When a network management server is currently configured, every time the cell capacity of a network element is increased, it is required to configure a new network management server. A user is required to manually configure the new network management server, and particularly, data movement and effort are required to move a network element to be managed, from one network management server to another network management server.
As an example, when 10,000 base stations are managed by a single network management server and each base station has three cells, the total number of cells managed is 30,000. When the number of cells is increased to 9, capacity is increased to 300%. Therefore, it is further required to add two management servers. Current technology requires a user to intervene in extension according to an increase in capacity.
Since a user is required to manually configure a network management server according to an increase in cell capacity of a network element, it is necessary to automatically configure a network management server. Therefore, the present disclosure provides a method for automatically configuring a network management server by a network system without user intervention.
In order to solve the above-mentioned problems, in accordance with an aspect of the present disclosure, there is provided a method for managing a network management server by a load balancer. The method includes: receiving information on addition of a new base station to a network; transmitting information on the new base station to at least one network management server; receiving throughput time information for the new base station from the at least one network management server; and determining a network management server, to which the new base station is to be assigned, on the basis of the throughput time information. Also, the method further includes: receiving load balancing-related information from the at least one network management server; and determining whether load balancing is performed for the at least one network management server on the basis of the load balancing-related information.
Further, in accordance with another aspect of the present disclosure, there is provided a load balancer for managing a network management server. The load balancer includes: a transceiver configured to transmit or receive a signal to or from at least one network management server; a storage unit configured to store data; and a controller configured to control the transceiver to receive information on addition of a new base station to a network, transmit information on the new base station to at least one network management server, and receive throughput time information for the new base station from the at least one network management server, and configured to control such that a network management server, to which the new base station is to be assigned, is determined on the basis of the throughput time information. Also, the controller is configured to: control the transceiver to receive load balancing-related information from the at least one network management server; and further control such that whether load balancing is performed for the at least one network management server is determined on the basis of the load balancing-related information.
The method for configuring a network management server according to an embodiment of the present disclosure makes it possible to automatically and efficiently manage a network management server without user intervention.
Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings. Also, in the following description of the present disclosure, a detailed description of known functions and configurations incorporated herein will be omitted when it may unnecessarily obscure the subject matter of the present disclosure. Further, terms described below, which are defined considering functions in the present disclosure, may be different depending on user and operator's intention or practice, etc. Therefore, the terms should be defined based on the disclosure throughout this specification.
In addition, in a detailed description of the embodiments of the present disclosure, the main subject matter of the present disclosure may be applied even to other communication systems having the similar technical background and channel format, with a slight modification, without largely departing from the scope of the present disclosure, and this applicability will be understood based on the determination of those skilled in the art in the technical field of the present disclosure.
The advantages and features of the present disclosure and methods for achieving the same will become clear with reference to the embodiments described below in detail with the accompanying drawings. However, the present disclosure is not limited to the embodiments disclosed below, and may be implemented in various forms; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the disclosure to those having ordinary knowledge in the technical field to which the present disclosure pertains. The present disclosure is only defined by the following claims. Like reference numbers are used to refer to like elements throughout the specification.
Here, it will be understood that each block of the flowchart illustrations, and combinations of blocks in the flowchart illustrations, can be implemented by computer program instructions. These computer program instructions may be loaded onto a processor of a general-purpose computer, special-purpose computer, or other programmable data processing apparatuses and thus the instructions, which are executed by the processor of the computer or other programmable data processing apparatuses, create a means for implementing the functions specified in the flowchart block(s). These computer program instructions may also be stored in a computer-usable or computer-readable memory, which can direct a computer or other programmable data processing apparatuses, in order to implement function in a particular manner and thus the instructions stored in the computer-usable or computer-readable memory can produce an article of manufacture including an instruction means that implement the function specified in the flowchart block(s). Since the computer program instructions may also be loaded onto a computer or other programmable data processing apparatuses, a series of operational steps are performed on the computer or other programmable data processing apparatuses so as to produce a computer-executable process, so that the instructions executed on the computer or other programmable data processing apparatuses can provide steps for implementing the functions specified in the flowchart block(s).
Also, each block of the flowchart illustrations can represent a module, a segment, or a part of a code, which includes one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative embodiments, the functions specified in the blocks may occur out of the order. For example, two blocks shown in succession may in fact be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending on the functions in question.
Here, the term “unit” used in the embodiments refers to a software element or a hardware element, such as a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC), and the “unit” performs a certain function. However, the “unit” does not always have a meaning limited to software or hardware. The “unit” may be configured either to be stored in an addressable storage medium or to reproduce one or more processors. Accordingly, as an example, the “unit” includes elements (e.g., software elements, object-oriented software elements, class elements, and task elements), processors, functions, attributes, procedures, subroutines, segments of a program code, drivers, drivers, firmware, micro-codes, circuits, data, databases, data structures, tables, arrays, and variables. The elements and the functions provided by the “units” may be either combined into a smaller number of elements and “units”, or further divided into additional elements or “units”. Moreover, the elements or “units” may be implemented to reproduce one or more CPUs within a device or a security multimedia card.
According to the present disclosure, when new network elements or cell capacity is increased or decreased in a network, a new virtual management server may be automatically added to or removed from a background on the basis of a primary management server operational efficiency key performance indicator (KPI). The virtual management server may monitor a network without moving a network element to another server or reducing or increasing the number of base stations, and may replace a primary management server that a user can currently interact with or operate. Through the virtual management server, the cell capacity of a network may be increased without reducing or increasing the number of base stations in connection with another management server or moving a base station to another management server. User intervention is never required for management execution of the virtual management server, and a system automatically performs a management operation of the virtual management server on the basis of self-learning KPI-based operational efficiency.
Referring to
In the present example, when a new base station 110 is added to a network in operation S100, in operation S120, a user needs to select, in person, an MS and needs to add a required configuration. In operation S120, when the load of the MS becomes large, the user needs to manually move a particular base station from the MS, which currently manages the particular base station, to another MS.
Referring to
When a new base station 210 is added to a network in operation S200, in operation S210, operational efficiency KPI-based load balancing is performed. As a result, in operation S220, the virtual server may be registered in the network.
The features of the present disclosure according to a system of
According to the present disclosure, even when the user does not change a connection of a base station with a network management server, the system may always add a predetermined number of virtual servers. Accordingly, the system may assign work among management servers or virtual servers, which can support a service, as the need arises and may flexibly expand or manage a network management server and a work of a network management server, according to an operational efficiency KPI. The user does not need to change, in person, a configuration in order to increase or reduce the capacity.
In the following description, a specific network management method according to the present disclosure will be disclosed.
Firstly, a method for selecting a network management server (or a server node) which is optimal for a base station will be described.
When a base station is added to a network, a load balancer selects server nodes, which can monitor network performance statistical data of a server node, in such a manner as to check a communication time between the base station and the server node, locations of the base station and the server node, a current server load, and the like, and determines a server node optimal for the base station among the selected server nodes. The load balancer may store the order of server nodes related to the added base station. As an example, when a first server node has a sufficiently large load, a second server node may be assigned for the added base station. In order to achieve high operational efficiency, such information may be maintained by the load balancer.
When a new base station 330 is added to the network, in operation 400, the load balancer 300 is notified of the fact that the new base station is added to the network. In operation 410, in order to check a management work processing time (i.e., a time required for communication between a base station and a server node) of each base station, the load balancer 300 transmits information on the new base station to all neighboring server nodes. In operation 420, each server node receives the information, identifies a processing time, and transmits information on the checked processing time to the load balancer.
As an example, a network-specific processing time of each server node may be shown as follows.
When the new base station 330 is added to the network A 320, as a processing time required for the new base station per server node, the first server node has T, the second server node has 2T, and the third server node has 3T.
Then, in operation 430, on the basis of such processing time information, the load balancer selects an optimal server node and assigns the new base station to the optimal server node so as to manage the same, and stores the processing time information. In
When the optimal server node already has a sufficiently large load, the load balancer stores and maintains the order of server nodes related to each base station, and assigns the base station to a next optimal server node with reference to processing time values. Specifically, in
As an example, consideration is given to a case in which loads of networks are shown as in Table 2 below.
In the present example, load balancing distribution according to the present disclosure may be generated as shown in Table 3 below.
Processing time distribution in each server node is shown in Table 4 below.
When: a total time required for communication during each interval is denoted by CT; a parsing time of a file needed to manage one base station in each server node is denoted by P; and the total number of base stations per node is denoted by N, a total processing time S for performance statistical data in one interval period S may become a time obtained by adding a time required for communication with a base station and a parsing time of base station data. That is, the total processing time S may be defined by Equation 1 below.
S=N×P+CT Equation 1
As an example, when N is 10000, S may be 10,000 P+CT. A total processing time S for network A in the first server node is 10000 P+10000T.
In the present example, in the method for selecting a server node according to the present disclosure, compared with an existing scheme for managing, by a server node, a base station of each network regardless of a processing time (e.g., each server node may manage one third of base stations of networks A, B, and C), CT is improved by 50% compared with the existing scheme (CT=20000T) as to the first server node, CT is improved by 39% compared with the existing scheme (CT=16500T) as to the second server node, and CT is improved by 51% compared with the existing scheme (CT=20500T) as to the third server node.
Secondly, a method for calculating operational efficiency and managing a load will be described.
After a base station is added as a subject to be managed by a server node, the server node may calculate operational its own efficiency, and may transmit detailed information to a load balancer. On the basis of the detailed information, if necessary, the server node or a load balancer may determine load balancing and may perform load balancing.
Referring to
Also, the server node may perform the base station processing procedure, and when the load of at least one of a system CPU and memory of the server node becomes larger than a predetermined threshold, the server node may check the load of the memory or CPU of the server node, and then may reduce, by 5%, the number of base stations to be simultaneously processed. 5% is an example of a numerical value, and the server node may adjust a numerical value used to reduce the number of base stations to be simultaneously processed. Until a system becomes normal, that is, the load of the system CPU or memory becomes smaller than the predetermined threshold, the server node repeats this operation. When the system returns to a normal state, the server node proceeds to the next operation. This procedure may affect operational efficiency.
In operation 520, the server node calculates operational efficiency O, which needs to be achieved for a remaining time, by Equation 2 below.
O=N/R Equation 2
In the present example, R may be expressed in minutes. N represents the number of base stations which are not processed and thus remain, and which need to be monitored by the server node at the present time (i.e., may become the value of N2 in the time unit elapsed). Then, the server node calculates operational efficiency G, which has already been achieved in the elapsed time, by using Equation 3 below.
G=N1/E Equation 3
In the present example, E may be expressed in minutes. G is obtained by dividing the number of base stations, the processing of which has already been completed, by an elapsed time, and may be regarded as efficiency in the elapsed time.
Load balancing-related information including FI, E, R, N, N1, N2, N3, O, and G may be calculated by the server node and may be delivered to the load balancer, or some pieces of information may be delivered to the load balancer and the load balancing-related information may be calculated by the load balancer. In operation 530, the server node or the load balancer determines whether G is larger than O. When G representing achieved operational efficiency is larger than O representing operational efficiency which needs to be achieved, the server node or the load balancer does not need to perform load balancing. If not, the server node or the load balancer needs to perform load balancing as described below.
In operation 535, when load balancing needs to be performed, the server node or the load balancer calculates the number N4 of base stations required for load balancing, by using Equation 4 below.
N4=N_initial−(N1+(G×R))=N2−G×R Equation 4
N_initial represents the total number of base stations which need to be processed during this FI, N1+(G×R) represents the number of base stations, which have already been processed, and the number of base stations, which can be processed for a remaining time, and N4 represents the number of base stations which need to be processed by another server node in order to perform load balancing.
Then, the server node or the load balancer calculates a lacking operation degradation D by using Equation 5 below.
D=N4/N_initial×100 Equation 5
A lacking operation degradation D is calculated in percentages. In operation 544, the server node or the load balancer determines whether load balancing is performed, on the basis of a D value. Also, the server node or the load balancer may determine whether load balancing is performed, in consideration of D values in multiple FIs. This configuration can prevent undesired load balancing. As an example, when D values of multiple intervals are considered, a load exists in only one interval and the remaining intervals are normal, load balancing may not be performed. In operation 550, when a continuous load appears in an FI, the load balancer performs load balancing.
When load balancing is performed and thus D is adjusted, the server node observes the next FI, and updates the number of base stations, the processing of which has not been completed in the previous FI, to N2. The server node transmits, to the load balancer, information on the number N4 (the number of base stations for which load balancing is to be performed) of base stations which are not monitored in a base station list. In the present example, N4 base stations are excluded from a processing list of the server node, and then, another server node processes the N4 base stations. Accordingly, a value of N1+N2 is obtained by subtracting N4, for which load balancing is performed, from the value of N_initial (specifically, as many base stations as N4 can be subtracted from N1). Then, the server node may reconfigure 0's in a load balancing list having a size of N4.
The above operations are repeated in every interval during which the above-described procedure is configured. The configured interval is an interval existing in an FI, and may be one minute or any set value from 1 to S.
Hereinafter, in a specific embodiment, a method for calculating operational efficiency will be described.
At 10:15 o'clock 810, a fixed interval is terminated, but at this time, the number N2 812 of base stations, the processing of which is not completed, becomes 556. In the present example, N3 (the number of base stations in the previous fixed interval, the processing of which has not been completed in the previous fixed interval and is left to a current fixed interval) of a next fixed interval, becomes 556.
In a fixed interval 2850, N_initial becomes 10,000+556=10,556. Thereafter, as data of a base station is processed at every one minute, the number N1 of base stations, the processing of which has been completed, is increased, and the number N2 of base stations, the processing of which is not completed, is reduced, so that N1+N2 becomes 10,556. Then, by using the method of
Referring to
Referring to
Referring to
When a new base station is added to a network, the controller 1020 of the load balancer may be configured to control the transceiver 1010 to transmit information on the new base station to the network management server. Also, the controller 1020 of the load balancer may be configured to determine an optimal network management server for the base station, on the basis of a communication time between the base station and the network management server, the location of the network management server, the current load of a network management apparatus, and the like. Further, the controller 1020 of the load balancer may be configured to receive an operational efficiency-related value from the network management server and determine whether load balancing is to be performed, on the basis of the operational efficiency-related value. Specifically, the controller may be configured to directly perform calculation according to the embodiment of
According to the present disclosure, when a base station is added or the capacity of a network element is increased, user intervention is not required and a system is automatically processed, so that the loss of data can be prevented. Also, user intervention is not required, so that operational costs can be reduced and resources can be efficiently utilized due to self-elasticity.
Number | Date | Country | Kind |
---|---|---|---|
10-2017-0056833 | May 2017 | KR | national |
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/KR2017/004760 | 5/8/2017 | WO | 00 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2017/196040 | 11/16/2017 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
5828801 | Sakamoto | Oct 1998 | A |
8150413 | Aoyama | Apr 2012 | B2 |
8996699 | Jenkins | Mar 2015 | B2 |
9154557 | Lev-Ran | Oct 2015 | B2 |
9178789 | Zhang | Nov 2015 | B2 |
9531613 | Jenkins | Dec 2016 | B2 |
20030063594 | Li et al. | Apr 2003 | A1 |
20060189317 | Nakano | Aug 2006 | A1 |
20080225801 | Turk | Sep 2008 | A1 |
20090028045 | Stellenberg et al. | Jan 2009 | A1 |
20090280268 | Glukhoy | Nov 2009 | A1 |
20090284421 | Glukhoy | Nov 2009 | A1 |
20090323590 | Fujimoto | Dec 2009 | A1 |
20120106346 | Aguirre | May 2012 | A1 |
20120314710 | Shikano | Dec 2012 | A1 |
20130150056 | Yi et al. | Aug 2013 | A1 |
20140020113 | Shah | Jan 2014 | A1 |
20140185588 | Zhu et al. | Jul 2014 | A1 |
20140301347 | Nanri | Oct 2014 | A1 |
20150220129 | Miwa | Aug 2015 | A1 |
20150230123 | Kotecha | Aug 2015 | A1 |
20170005898 | Davis | Jan 2017 | A1 |
20170066322 | Dudar | Mar 2017 | A1 |
Entry |
---|
International Search Report dated Jul. 28, 2017, issued by the International Searching Authority in International Application No. PCT/KR2017/004750 (PCT/ISA/210). |
Number | Date | Country | |
---|---|---|---|
20190158578 A1 | May 2019 | US |
Number | Date | Country | |
---|---|---|---|
62333419 | May 2016 | US |