KR20110072073A - Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same - Google Patents

Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same Download PDF

Info

Publication number
KR20110072073A
KR20110072073A KR1020090128849A KR20090128849A KR20110072073A KR 20110072073 A KR20110072073 A KR 20110072073A KR 1020090128849 A KR1020090128849 A KR 1020090128849A KR 20090128849 A KR20090128849 A KR 20090128849A KR 20110072073 A KR20110072073 A KR 20110072073A
Authority
KR
South Korea
Prior art keywords
node
local survival
local
topology
central processing
Prior art date
Application number
KR1020090128849A
Other languages
Korean (ko)
Inventor
김인기
Original Assignee
엘지에릭슨 주식회사
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 엘지에릭슨 주식회사 filed Critical 엘지에릭슨 주식회사
Priority to KR1020090128849A priority Critical patent/KR20110072073A/en
Publication of KR20110072073A publication Critical patent/KR20110072073A/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/22—Arrangements for supervision, monitoring or testing
    • H04M3/2245—Management of the local loop plant
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/22—Arrangements for supervision, monitoring or testing
    • H04M3/2254—Arrangements for supervision, monitoring or testing in networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/22—Arrangements for supervision, monitoring or testing
    • H04M3/36—Statistical metering, e.g. recording occasions when traffic exceeds capacity of trunks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/42314—Systems providing special services or facilities to subscribers in private branch exchanges
    • H04M3/42323—PBX's with CTI arrangements

Abstract

PURPOSE: A local survivor node management method and a center processing node, and an IP- PBX(Internetwork Protocol-Private Branch Exchange) system therefore are provided to manage a plurality of local survivor nodes. CONSTITUTION: A connection manager(110) manages the connection of one or more local survivor node. A topology management unit(120) forms the node topology by sing the registered local survivor node is registered in the connection manager. A bearer controller(140) receives or transmits the data according to the node topology. A data management(150) manages the data transmitted and received.

Description

METHOD AND CENTRAL PROCESSING NODE FOR MANAGING OF LOCAL SURVIVAL NODE AND INTERNET PROTOCOL-PRIVATE BRANCH EXCHANGE SYSTEM FOR THE SAME}

TECHNICAL FIELD The present invention relates to the field of IP-PX systems, and more particularly, to a method for managing a plurality of local survival nodes and a central processing node and an IP-PX system therefor.

An IP-PBX (Internet Protocol-Private Branch Exchange) system is an exchange system that delivers voice or video between terminals through an IP network. Recently, with the increase of users such as the Internet, information transmission through the IP-PBX system is also active, and according to this trend, the IP-PBX system provides various implementation methods such as interworking with a public switched telephone network (PSTN). In general, an IP-PBX system includes a main processing node, which is a central processing server, and a local survival node in charge of each branch. In general, even if a local survivor node environment is constructed with simple gateway boards that are not capable of full call processing function or a local survivor node environment using a node with call processing function, the entire local survival node is managed by the main processing node. It is operated in a manner.

In the conventional method, when a DB value or a real time status message changed in a main processing node is transmitted to each local survival node, the main processing node transmits data to all local survival nodes. That is, the main processing node manages each node and sequentially transmits data in a round robin manner with each node during data transmission.

Therefore, as the number of local survival nodes increases, the number of nodes to be managed increases, and data must be transmitted to each node separately, so that the number of local survival nodes leads to an increase in load of the main processing node. Therefore, in the prior art, there is a limit to interworking a large number of local survival nodes.

The present invention provides a method for managing a plurality of local survival nodes and a central processing node and an IPP system therefor.

The central processing node of the present invention includes: a connection management unit managing a connection of at least one local survival node (hereinafter referred to as LSN); A topology manager configured to form a node topology using an LSN registered in the connection manager when a load ratio is greater than a predetermined load rate; A transmission manager for transmitting and receiving data according to the node topology; And a data management unit for managing the data transmitted and received.

In addition, the Internet Protocol-Private Branch Exchange (IP-PBX) system of the present invention includes the central processing node of any one of claims 1 to 5.

In addition, the local survival node management method of the present invention, a) registering at least one local survival node; b) determining whether the load factor of the central processing node is greater than or equal to a predetermined threshold; c) forming a node topology by clustering using the registered at least one local survival node when the load ratio is greater than or equal to a predetermined threshold value; And d) performing data transmission and reception using the node topology.

According to the present invention, a central processing node of the IP-PBX system may interwork more local survival nodes in a local survival environment. In addition, in the present invention, even if the number of local survival nodes is increased by using a topology manager and local local survival node clustering, the load on the main processing node is not significantly affected.

In addition, through regional clustering, as the head local survival node becomes a master node of a corresponding region, the number of local survival nodes increases because the local survival node performs a connection management function of the local survival node in its own region. Even if the connection amount is large, the influence on the load of the main processing node is small.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following description, well-known functions or constructions will not be described in detail if they obscure the subject matter of the present invention.

1 is a block diagram illustrating a central processing node (CPN) according to an embodiment of the present invention. The CPN 100 includes a connection manager 110, a topology manager 120, a sink manager 130, a transmission manager 140, and a data manager 150.

The connection manager 110 is in charge of managing a connection of a local survival node (LSN). When the LSN is driven, it is connected to the connection management unit 110 of the CPN 100, and the connection management unit 110 registers the corresponding LSN and updates the connection information. The access manager 110 transmits a polling message to each registered LSN to manage whether each LSN is active. If an acknowledgment message is not received from the LSN transmitting the polling message, the LSN recognizes that the service is not available due to a failure of the system or network, and deletes the corresponding LSN from the access management unit 110.

The topology manager 120 forms a node topology between the CPN 100 and the LSN by using the LSN registered in the connection manager 110. 2 is an exemplary view showing a node topology according to an embodiment of the present invention. The CPN 100 is connected to the head LSN 200a managing a plurality of clusters C to manage each cluster C. Each head LSN 200a is hierarchically configured to manage a plurality of sub LSNs 200b. The topology manager 120 forms a node topology when the system load ratio of the CPN 100, in particular, the CPU utilization rate is 50% or more. Before forming the node topology, a round robin algorithm is used. The node topology forming method will be described later.

When the LSN accesses the CPN 100, the sink manager 130 performs synchronization between the CPN 100 and the LSN. The sink manager 130 performs data sink and time sink.

The transmission manager 140 transmits data to each LSN according to the node topology formed by the topology manager 120, and receives and manages data received from each LSN. Data transmitted and received by the transmission manager 140 may include data in a file format, an access message, a DB update message, an event message, and the like.

The data manager 150 manages data received through the transmission manager 120 at the LSN. Table 1 below shows an example of a message used for an LSN and a CPN.

Message type Contents directional Connection message Contains messages used by the LSN to access the CPN, connection requests, and polling messages Bidirectional DB update message DBMS data real time update message Unidirectional (CPN-> LSN or Head LSN-> Sub LSN) Event message Except for access message and DB update message, it is a generic name of other types of messages and transmits event data necessary for interworking between CPN and LSN. Bidirectional

 3 is a block diagram showing the configuration of an LSN according to an embodiment of the present invention. The LSN 200 includes an upper node access unit 210, a lower node manager 220, a synchronization processor 230, a transmission manager 240, and a data processor 250.

 The upper node connection unit 210 manages a connection with a higher node on the node topology of the corresponding LSN. The upper node may be the CPN 100 or the head LSN 200a determined in the CPN on the characteristics of the LSN having a hierarchical structure such as a node topology.

The lower node manager 220 manages the sub LSNs 200b included in its area when the corresponding LSN is the head LSN 200a.

The synchronization processor 230 performs synchronization between the upper CPN 100, the head LSN 200a, and the sub LSN 200b.

The transmission manager 240 is a component for transmitting and receiving data between the upper CPN 100, the head LSN 200a, and the sub LSN 200b.

The data processor 250 processes data transmitted and received between the upper CPN 100, the head LSN 200a, and the sub LSN 200b.

4 is a flowchart showing a procedure for the LSN management method according to an embodiment of the present invention.

First, the LSN 200 transmits an access request message to the CPN 100 to be accessed (S10). Upon receiving the access request message, the CPN 100 determines whether the LSN 200 requesting the access is a valid LSN 200 (S20). As a method of determining whether it is a valid LSN (200), it is confirmed whether a corresponding node is registered in a DB (not shown) by using an IP address, and a connection request is made using an authentication key preset between the CPN 100 and the LSN 200. Judge whether or not. If at least one of DB registration and an authentication key is incorrect, the access request message of the corresponding LSN is discarded (S30). If the LSN 200 is valid, the CPN 100 transmits a DB file for initial operation to the corresponding LSN 200 (S40). The LSN 200 transmits an activation message to the CPN 100 to inform the normal operation after driving the system using the transmitted DB file (S50). The CPN 100 receiving the activation message transmits the real time message and the DB update message to the corresponding LSN 200 (S60). When the new LSN 200 accesses the CPN 100, the processes of steps S10 to S60 are repeated. As the number of LSNs 200 connected to the CPN 100 increases, the CPU load rate of the CPN 100 and data accumulated in the message queue to be transmitted to the LSN 200 increase. The CPN 100 determines whether the CPU load factor is 2 or more or the data accumulated in the message queue exceeds 80% of the total message queue size (S70), so that the CPU load factor is 2 or more or the data accumulated in the message queue is the entire message queue. If the size exceeds 80%, clustering (Clustering) of the LSN (200) is performed (S80). CPU load ratio is calculated using the following equation (1).

Figure 112009079306604-PAT00001

In order to cluster the LSN 200, first, an area in which the LSNs 200 exist is classified. Information about the region in which the LSNs 200 are included may be preset in the CPN 100. The CPN 100 determines the head LSN 200a among the LSNs 200 included in the specific region. 5 is an exemplary diagram for head LSN determination. Referring to FIG. 5, the Chungnam region may be classified into Daejeon, Cheonan, Gongju, Geumsan, Boryeong, and the budget LSN. Using the LSNs, the LSN 200 having the highest average value of each rank is determined by ordering the polling response time in the fastest order, the number of terminals or gateways to be managed by the LSN included in the region, and the largest network bandwidth. Head LSN 200a. In FIG. 5, the average value of each rank may be calculated as in Equation 2 below. For example, the Cheonan LSN is determined as the head LSN since the average value of each rank has the smallest value.

Rank [Battle LSN] = (3 + 6 + 1) / 3 = 3.3

Rank [Cheonan LSN] = (1 + 2 + 2) / 3 = 1.67

Rank [Princess LSN] = (5 + 5 + 5) / 3 = 5

Rank [Gumsan LSN] = (2 + 4 + 4) / 3 = 3.3

Rank [Born LSN] = (6 + 1 + 3) / 3 = 3.3

Rank [budget LSN] = (4 + 3 + 6) / 3 = 4.3

When the node topology is completed by clustering the LSN 200, the CPN 100 transmits data to the head LSN 200a of each region. Each head LSN 200a sends data to the sub LSN 200b in its area. In addition, the head LSN 200a of each region also has a connection maintenance authority using polling messages of the sub LSNs 200b of the region to manage the connection maintenance of the sub LSNs 200a in its region, When the update is made, the CPN 100 transmits a message to notify management information update.

Although the present invention has been described in detail with reference to exemplary embodiments, those skilled in the art to which the present invention pertains can make various modifications without departing from the scope of the present invention. I will understand. Therefore, the scope of the present invention should not be limited to the described embodiments, but should be defined by the claims below and equivalents thereof.

1 is a block diagram illustrating a central processing node in accordance with an embodiment of the invention.

2 is a block diagram illustrating a node topology according to an embodiment of the invention.

3 is a block diagram illustrating a local survival node in accordance with an embodiment of the invention.

4 is a flowchart illustrating a procedure of a method for managing a local survival node according to an embodiment of the present invention.

5 is an exemplary diagram for head local survival node determination in accordance with an embodiment of the present invention.

Claims (12)

As a central processing node, A connection manager configured to manage access of at least one local survival node; A topology manager configured to form a node topology using a local survival node registered in the connection manager when a load ratio is greater than a predetermined load rate; A transmission manager for transmitting and receiving data according to the node topology; And Central processing node including a data management unit for managing the data transmitted and received. The method of claim 1, wherein the connection management unit, Sending a polling message to each registered local survival node to manage the operation of each local survival node, and if the acknowledgment message is not received from each local survival node that has transmitted the polling message. And deleting the corresponding local survival node from the connection manager. The method of claim 2, wherein the node topology, A head local survival node connected to the central processing node to transmit and receive data; And And a sub-local survival node connected to the head local survival node to perform data transmission and reception. The method of claim 3, wherein the topology management unit, And forming the node topology in consideration of a polling response time for transmitting the operation of the local survival node, the number of terminals or gateways to be managed by the local survival node, and a network bandwidth. The method of claim 4, wherein the topology management unit, A central processing node that forms the node topology when the load ratio of the central processing node is greater than or equal to a predetermined threshold. As an Internet Protocol-Private Branch Exchange (IP-PBX) system, An IP-PBX system comprising the central processing node of any one of claims 1 to 5. The method of claim 6, An upper node connection unit managing a connection with an upper node in the node topology; A lower node manager that manages a sub-local survival node when the local survival node is a head local survival node; A transmission manager for transmitting and receiving the data with the connected nodes; And IP-PBX system further comprising a local survival node including a data processing unit for processing the data. As a method of managing local survival nodes, a) registering at least one local survival node; b) determining whether the load factor of the central processing node is greater than or equal to a predetermined threshold; c) forming a node topology by clustering using the registered at least one local survival node when the load ratio is greater than or equal to a predetermined threshold value; And d) performing data transmission and reception using the node topology; Local survival node management method comprising a. The method of claim 8, wherein step a) a1) transmitting a connection request message by the local survival node; a2) determining whether the local survival node is a valid local survival node; a3) transmitting a DB file for initial startup in the case of a valid local survival node; a4) transmitting an activation message for informing of normal operation after the initial driving; And a5) when receiving the activation message, transmitting a real time message and a DB update message to the local survival node Local survival node management method comprising a. The method of claim 8, wherein step c) Local survival node management to form the node topology in consideration of a polling response time for transmitting the operation of the local survival node, the number of terminals or gateways that must be managed by the local survival node, and a network bandwidth. Way. The method of claim 8, wherein the load factor, Local survival node management method calculated using the following equation (3).
Figure 112009079306604-PAT00002
 The method of claim 11, wherein the node topology comprises: A head local survival node connected to the central processing node to transmit and receive data; And And a sub-local survival node connected to the head local survival node to perform data transmission and reception.
KR1020090128849A 2009-12-22 2009-12-22 Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same KR20110072073A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020090128849A KR20110072073A (en) 2009-12-22 2009-12-22 Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020090128849A KR20110072073A (en) 2009-12-22 2009-12-22 Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same

Publications (1)

Publication Number Publication Date
KR20110072073A true KR20110072073A (en) 2011-06-29

Family

ID=44403048

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020090128849A KR20110072073A (en) 2009-12-22 2009-12-22 Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same

Country Status (1)

Country Link
KR (1) KR20110072073A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20160010033A (en) * 2014-07-18 2016-01-27 삼성전자주식회사 Layered detection method and apparatus for qam-fbmc system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20160010033A (en) * 2014-07-18 2016-01-27 삼성전자주식회사 Layered detection method and apparatus for qam-fbmc system

Similar Documents

Publication Publication Date Title
US10834049B2 (en) Systems and methods for dynamically registering endpoints in a network
US7742421B2 (en) Systems, methods, and computer program products for distributing application or higher layer communications network signaling entity operational status information among session initiation protocol (SIP) entities
US9426116B1 (en) Multiple-master DNS system
EP2461536A1 (en) Method and system for data synchronization in content delivery network
CN102177690B (en) Methods, systems, and computer readable media for providing sedation service in a telecommunications network
EP2566107A1 (en) Apparatus and method for achieving the function of domain name resolution agent
US8731181B2 (en) Computer telephony integration device and resource management method and incoming call control method
WO2018090386A1 (en) Method, device and system for processing abnormities of nf modules
WO2015021905A1 (en) Software updating method, system, and device
JP2007156569A (en) Cluster system, load balancer, method of transferring node, and node transfer program
US20110196837A1 (en) Enhanced data access for information systems
EP2597818A1 (en) Cluster management system and method
WO2010127625A2 (en) Seats processing method, exchange and call center
CN114338063A (en) Message queue system, service processing method, and computer-readable storage medium
CN110324262A (en) A kind of method and device that resource is seized
CN113326100A (en) Cluster management method, device and equipment and computer storage medium
EP2071764A1 (en) A method, device and communication system thereof of electing local master
US8359354B1 (en) Methods for providing a status to devices in a distributed system
KR20110072073A (en) Method and central processing node for managing of local survival node and internet protocol-private branch exchange system for the same
CN108270876B (en) Method for realizing proxy server in signal system
JP2008028455A (en) Service control apparatus
TWI397296B (en) Server system and method for user registeration
CN108093147B (en) Distributed multi-stage scheduling method and equipment
CN103222255A (en) Method for automatic start up of a communication terminal configured for voice communication on a communication terminal configured for text communication
CN108156002B (en) Information processing method, device and system

Legal Events

Date Code Title Description
N231 Notification of change of applicant
WITN Withdrawal due to no request for examination