KR20140040948A - System and method for dynamic message routing - Google Patents

Abstract

A system and a method for dynamic message routing are disclosed. The system for dynamic message routing according to an embodiment of the present invention comprises a plurality of message servers forming one server group; a message routing server for receiving a message related to a specific terminal or a specific session, routing the message to a message server allocated to the terminal or the session among the message servers; and a directory server for generating one and more hash values for each message server by using the identification key of each message server, generating a logic server group arranging the message servers in a ring shape according to the generated hash value, and transmitting information on the message server allocated to the terminal or the session among the message servers included in the logic server group to the message routing server. [Reference numerals] (102) Message server; (104) Message routing server; (106) Directory server; (108) Monitoring server; (110) Network

Description

Dynamic Message Routing System and Method {SYSTEM AND METHOD FOR DYNAMIC MESSAGE ROUTING}

TECHNICAL FIELD The present invention relates to dynamic message routing systems and methods, and more particularly to techniques for efficiently delivering messages by dynamically establishing and routing associations between specific terminals or sessions and servers.

As the use of mobile terminals such as smartphones increases, the server-side structure for providing services to mobile terminals is also becoming larger and more complicated. In general, in order to send a message to a terminal or a session desired by an entity in a specific network, a query for information on a message server connected to the terminal or session is queried in a database that stores relevant connection information each time a message is transmitted, or a message It should include information of terminal or session in itself.

However, in the case of querying the information of the message server to the database every time the message is transmitted, access to the database also increases as the message increases, and there is a problem that a serious bottleneck occurs in this process. In addition, in order to solve this problem, when address information about all target terminals is added to the message itself, there is a problem in that an overhead of message transmission increases due to an increase in the capacity of the message.

Embodiments of the present invention are to provide a dynamic message routing technique that can improve the efficiency of message processing by dynamically establishing a connection relationship between a specific terminal or session and a message server and routing messages accordingly.

A dynamic message routing system according to an embodiment of the present invention receives a message related to a plurality of message servers, a specific terminal or a session forming one server group, and is assigned to the terminal or session among the plurality of message servers. A message routing server for routing the message to a message server, and one or more hash values for each message server are generated using identification keys of the plurality of message servers, and the plurality of message servers are generated according to the generated hash values. And a directory server for generating a group of logical servers arranged in a ring form, and allocating one message server among the message servers included in the logical server group to the terminal or the session.

On the other hand, in the dynamic message routing method according to an embodiment of the present invention, at least one hash value is generated for each message server by using the identification keys of each of the plurality of message servers forming one server group in the directory server. Generating a logical server group in which the plurality of message servers are arranged in a ring form according to the generated hash value, receiving a message related to a specific terminal or a session at a message routing server, and at the directory server, Assigning one message server among the message servers included in the server group to the terminal or session, and routing the message from the message routing server to the message server assigned to the terminal or session by the directory server. It includes.

Meanwhile, the directory server according to an embodiment of the present invention generates one or more hash values for each message server by using identification keys of each of the plurality of message servers, for a plurality of message servers forming one server group. And a logical server group generation module for generating a logical server group in which the plurality of message servers are arranged in a ring form according to the generated hash value, and one message server among the message servers included in the logical server group. Or a message server assignment module for allocating sessions.

According to embodiments of the present invention, since it is not necessary to access a separate database to know the information of the message server assigned to a specific terminal or session, it is possible to eliminate the bottleneck caused by the database access, thereby processing the entire system This has the advantage of improving performance.

In addition, according to embodiments of the present invention, when transmitting a message to the terminals belonging to a particular session, only the corresponding session ID is included in the message without including the network address of each target terminal in the corresponding message. Can be reduced. Accordingly, network bandwidth and server resources (CPU, memory I / O) for processing the message can also be significantly reduced compared to the prior art. This is particularly effective for processing between individual / group instant messaging or VoIP, where small messages are transmitted and received very frequently.

1 is a diagram illustrating a dynamic message routing system 100 according to an embodiment of the present invention.
2 is a diagram illustrating a logical server group created according to an embodiment of the present invention.
3 is a view for explaining an example in which some of the servers belonging to the plurality of message servers 102 are switched from the accessible state to the unreachable state according to an embodiment of the present invention.
4 is a view for explaining an example in which some of the servers belonging to the plurality of message servers 102 are switched from the accessible state to the accessible state according to an embodiment of the present invention.
5 is a diagram illustrating a dynamic message routing method 500 according to an embodiment of the present invention.
6 is a diagram showing the detailed configuration of the directory server 106 according to an embodiment of the present invention.

Hereinafter, specific embodiments of the present invention will be described with reference to the drawings. However, this is merely an example and the present invention is not limited thereto.

In the following description, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present invention rather unclear. The following terms are defined in consideration of the functions of the present invention, and may be changed according to the intention or custom of the user, the operator, and the like. Therefore, the definition should be based on the contents throughout this specification.

The technical idea of the present invention is determined by the claims, and the following embodiments are merely a means for effectively explaining the technical idea of the present invention to a person having ordinary skill in the art to which the present invention belongs.

1 is a diagram illustrating a dynamic message routing system 100 according to an embodiment of the present invention. As shown, the dynamic message routing system 100 according to an embodiment of the present invention includes a plurality of message servers 102, a message routing server 104, a directory server 106, and a monitoring server 108. Each of the above components is connected to each other through the wired / wireless network 110 to transmit and receive data.

The message server 102 is a server connected to a specific terminal (not shown) or session to process messages related to the terminal or session. For example, the message server 102 establishes a group chat room in which a plurality of terminals participate, and is a chat server for processing a group chat in the group chat room, or a voice chat between terminals, or between a plurality of terminals. It may be a server that relays a multi-party voice / video conference. However, the present invention is not limited thereto, and the server may be the message server 102 of the present invention without limitation as long as the server is connected to one or more terminals and processes a message received from the terminal. In the present invention, a plurality of message servers performing the same function are arranged in parallel to form one server group, and the message servers 102 belonging to the server group are assigned to specific terminals or sessions according to predetermined server assignment rules. do.

In this case, the terminal refers to a component in the network for receiving a message from the message server being connected or transmitting a message to the message server while maintaining a connection with one of the plurality of message servers 102. In an embodiment of the present invention, the terminal may include personal or portable user devices such as a mobile device such as a smartphone, a tablet PC, a cellular phone, a desktop or a notebook computer, and the like. Meanwhile, in the embodiment of the present invention, the terminal does not necessarily mean the client-side device, and the application server or another type of server may also be the terminal in the present invention when transmitting and receiving a message with the message server 102. In addition, the terminal may be directly connected to the message server 102, or may be connected to the message server 102 via a separate connection server.

On the other hand, when the terminal is assigned to each of the message server 102 as described above, the message server 102 may receive and store a message recipient list from the terminal assigned to it. In this case, the message recipient list is a list of terminals to receive a multicast message transmitted by the corresponding terminal, and may be, for example, a contact list stored in the terminal. As such, when the message receiver list is stored in the message server 102, the terminal may transmit a multicast message to the message server 102, and the message server 102 receiving the message may be a terminal included in the message receiver list. May transmit the multicast message received. When the message server 102 connected to the terminal stores the message recipient list for each terminal, it is not necessary to inquire the information of the terminal to receive the multicast message through a separate database lookup every time the message is multicasted. Can reduce the overhead. This can be effectively used when transferring a profile change of a specific terminal to another terminal, especially in instant messaging.

On the other hand, when the message server 102 connected to the terminal is changed due to a failure in the message server 102 connected to the terminal or a new message server 102 is added, the terminal may change the message server ( 102 may retransmit the message recipient list.

Meanwhile, the session refers to a series of interactive communication dialogs between two or more terminals (or terminals and servers). For example, the session may be 1: 1 or group chat. That is, the message server 102 may be configured to process messages related to the chat group by being assigned to a specific chat group in which a plurality of terminals participate.

The message routing server 104 receives a message related to a specific terminal or session, and routes the message to a message server assigned to the terminal or session among the plurality of message servers 102. The message may be received from a network entity residing in a network, which may be, for example, a particular server or other terminal in the network. Specifically, the message routing server 104 receives a message related to the specific terminal or session, and queries the directory server 106 which will be described later which message server 102 is assigned to the terminal or session. The message routing server 104 then receives the information of the message server 102 from the directory server 106 in response to the query and routes the received message using the received information. In addition, the message routing server 104 may not receive and route a message from another entity in the network, but may generate a message to be transmitted directly to a specific terminal and route it to the message server 102.

The directory server 106 generates one or more hash values for each message server 102 by using identification keys of the plurality of message servers 102, and arranges the plurality of message servers in a ring form according to the generated hash values. Create a set of logical servers. In addition, the directory server 106 receives a query for the message server 102 assigned to a specific terminal or session from the message routing server 104, and thus the terminal among the message servers 102 belonging to the logical server group. Or provide information about the message server 102 assigned to the session to the message routing server 104. Details related to the logical server group generation and the allocation of each message server will be described later.

Meanwhile, in the illustrated embodiment, the message routing server 104 and the directory server 106 are illustrated as being separate from the plurality of message servers 102, but this is merely a functional classification. That is, the message routing server 104 and directory server 106 may be physically implemented as a separate computer device from the plurality of message servers 102, or each of the plurality of message servers 102 is a message routing server 104. And directory server 106 may serve as at least one, and both cases fall within the scope of the present invention. If each of the plurality of message servers 102 is configured to act as a message routing server 104 and a directory server 106, the message routing server 104 and the directory server 106 may be configured to operate the message server 102. In this case, a message related to a specific terminal or session is first delivered to one message server randomly selected among the plurality of message servers 102, and then another message assigned to the terminal or session. Can be routed to a server.

An example of this is as follows. First, assume that a specific terminal (transmitting terminal) in a network delivers a message to another terminal (receiving terminal) in the network. In this case, the transmitting terminal transmits the message to the message server 102 assigned thereto, and the message includes the network address of the receiving terminal. The message server 102 receiving the message transmits the message to the message routing server 104, and the message routing server 104 uses the network address of the receiving terminal included in the message to the directory server 106. Request to allocate the message server 102 connected to the receiving terminal. The directory server 106 then returns the message server information assigned to the receiving terminal to the transmitting message server 102 in response to the request. Thereafter, the message routing server 104 transmits the message to the message server 102 connected to the receiving terminal according to the returned message server information, and the receiving message server 102 transmits the received message to the receiving terminal. To send. That is, in this case, the message may be delivered through the following path.

Sending terminal-> Message server connected with sending terminal-> Message routing server-> Message server connected with receiving terminal-> Receiving terminal

Meanwhile, according to an embodiment, the transmitting terminal may transmit a message directly to the message routing server 104 without passing through the message server 102 connected thereto. In this case, the message may be transmitted through the following path. .

Sending terminal-> Message routing server-> Message server connected with receiving terminal-> Receiving terminal

In addition, according to an embodiment, the message routing server 104 does not exist in the network in a separate hardware configuration, but each message server 102 may function as the message routing server 104. In this case, the path may be configured as follows.

Sending terminal-> Message server connected with sending terminal-> Message server connected with receiving terminal-> Receiving terminal

That is, in this case, the message server 102 connected to the sending terminal can find out the message server connected to the receiving terminal by using a preset server assignment rule and transfer the message directly to the corresponding message server.

In addition, the message routing server 104 may receive a message from not only other terminals but also other servers (application servers, etc.) in the network, and transmit the message to the terminal. In this case, the message transmission path is as follows.

Other servers in the network-> Message routing server-> Message server connected to receiving terminal-> Receiving terminal

In addition, as described above, when each message server 102 also functions as the message routing server 104, the message may be delivered to any message server 102 rather than to the message routing server 104. have. That is, the message may be transmitted as follows.

Other servers in the network-> Any message server-> Message server connected to the receiving terminal-> Receiving terminal

On the other hand, it is also possible to generate a message directly from the message routing server 104 and transmit it to the terminal, in this case, the message transmission path is as follows.

Message routing server-> Message server connected with receiving terminal-> receiving terminal

Next, the monitoring server 108 may also be referred to as a zookeeper, and monitors an operation state of the plurality of message servers 102, and an operation state of at least one message server of the plurality of message servers 102 may change. If so, it notifies other message servers and directory servers 106 belonging to the server group. For example, the monitoring server 108 may be disconnected when the operation of any one of the plurality of message servers 102 is disabled, and when the server where the operation is stopped is operated again (that is, the connection is available). If the operation state of the message server changes due to the reason (for example, if the change is changed to) or when a new message server is added, etc., the plurality of message servers 102 and the directory server 106 are notified. Accordingly, the directory server 106 may receive in real time information of which server is currently alive or dead, and use this to generate the logical server group to include only the currently active (live) server. Directory server 106 also receives from the monitoring server 108 a change in the operational state of at least one of the plurality of message servers 102 (ie, when a particular server is dead or alive or a new server is added). The logical server group is regenerated (updated) by reflecting the above change in the generated logical server group.

2 is a diagram illustrating a logical server group created according to an embodiment of the present invention. In the drawings, an example in which the plurality of message servers 102 includes four servers A, B, C, and D is illustrated, but the number of message servers included in the plurality of message servers 102 is not limited. You can have as many message servers as you need.

The process of creating a logical server group in the directory server 106 is as follows. First, the directory server 106 generates N hash values (N is an integer of 1 or more) for each message server using identification keys of the plurality of message servers 102. At this time, the identification key of each of the plurality of message servers 102 may be, for example, the IP or MAC address of each message server. In addition, the N hash values generated for each message server are configured to have different values.

For example, if a hash value is generated using the IP of each message server, the hash value can be generated using the following equation.

[Equation 1]

Hash value = hash function (server's IP address + I, I = 1, ..., N)

That is, N hash values can be generated by hashing each message server's IP address by adding an integer from 1 to N in turn using a hash function. However, the above-described hash value generating method is just one example, and it is apparent that the hash value may be generated by any method satisfying the above conditions.

When N hash values are generated for each message server through the above method, the directory server 106 arranges the plurality of message servers 102 in a ring form according to the generated hash values. For example, directory server 106 may create a logical server group such that the plurality of message servers 102 are arranged in a ring in ascending or descending order according to the calculated hash value. In this case, each of the plurality of message servers 102 is arranged in the loop by the number N of generated hash values.

Suppose that the results of calculating four hash values for message servers A, B, C, and D (N = 4) are as follows.

Server A: 0, 54, 20, 72

Server B: 37, 65, 7, 86

Server C: 94, 51, 13, 25

Server D: 16, 46, 61, 82

If four message servers are arranged in an ascending order according to hash values in a ring using the hash values, the message servers are shown in FIG. 2 (the numbers in parentheses in the figure mean calculated hash values). As shown, since four hash values are calculated for each message server, the same server is duplicated four times according to the hash value in the logical server group.

After the logical server group is generated as described above, the directory server 106 receives a message server assignment request for routing of a message related to a specific terminal or session from the message routing server 104, and from the identification key of the terminal or session. One of the plurality of message servers included in the logical server group is allocated to the terminal by using the generated hash value and a preset server allocation rule.

For example, the directory server 106 hashes an identification key (such as the IP address or MAC address of the terminal) of the terminal or an identification key (session ID, etc.) of the session by using a predetermined hash function. Query hash).

In addition, the server assignment rule is configured to allocate, for example, a message server having the smallest hash value among the message servers having a hash value larger than the query hash value to the terminal, or a hash value smaller than the query hash value. The branch may be configured to allocate a message server having the largest hash value among the message servers to the terminal. However, the above-described server allocation rule is merely an example, and other types of rules for allocating a message server according to an identification key of a terminal or a session may also be applied without limitation.

An example of this is as follows. Assume that the query hash value generated from the IP address of a specific terminal is as follows.

Hash Function (Client IP Address) = 22

If the server assignment rule is configured to assign a server having the smallest hash value among the message servers having a hash value larger than the query hash value to the terminal, the smallest hash among the message servers having a hash value greater than 22 in FIG. 2. Since the message server having a value is a server C having a hash value of 25, the directory server 106 assigns the server C to the terminal and transmits the server assignment message to the terminal. Then, the terminal receiving the terminal accesses the server C.

3 is a diagram illustrating an example in which some of the message servers belonging to the plurality of message servers 102 are switched from the accessible state to the unreachable state according to an embodiment of the present invention. In the illustrated embodiment, an example is shown in which the server C is converted into an unreachable state. In the illustrated embodiment, only one message server of the plurality of message servers 102 is shown in an unreachable state. However, the same algorithm is applied to two or more message servers.

When server C is switched to the unreachable state as in the illustrated embodiment, the message transmission server 104 assigned server C from directory server 106 first attempts to connect to server C. However, since server C cannot be contacted due to a current failure or the like, the message transmission server 104 receives the information of the spare server to replace the server C from the directory server 106 and sends the message to the spare server according to the received information. Can transmit

The spare server may be, for example, a server that is assumed to have been allocated to the corresponding terminal or session when it is assumed that there is no main server (server selected according to the message server allocation algorithm) among servers belonging to the logical server group. For example, in the above-described embodiment, if the hash value of the terminal 102 is 22, the server B having the hash value 37 would have been allocated, assuming that there was no server C, the directory server 106 is a server as the main server. You can assign C to server B as a spare server. However, it is noted that such a reserved server allocation algorithm is exemplary, and the present invention is not limited to a specific reserved server allocation algorithm.

As such, when the main server and the spare server are allocated together, the message transmission server 104 first attempts to transmit a message to the main server, and transmits a message to the spare server when it is determined that the connection to the main server is impossible. For example, if the hash value of the terminal is 47, the terminal is assigned a server C (hash value 51) as a main server and a server A (hash value 54) as a main server, according to the algorithm described above. You are connected to A.

Then, as time passes, the directory server 106 also regenerates the logical server group by reflecting the connection state of the server C, so that the server A naturally becomes the main server and not the spare server for the terminal or session. That is, the directory server 106 is configured to regenerate the logical server group by reflecting the state of each message server at predetermined intervals, and when the period elapses, the server C is excluded from the regenerated logical server group. It becomes the main server for the terminal or session. The period may be appropriately determined in consideration of characteristics of the message server.

4 is a view for explaining an example in which some of the servers belonging to the plurality of message servers 102 are switched from the unreachable state to the accessible state or a new message server is added according to an embodiment of the present invention. In the illustrated embodiment, an example is shown in which the server C is switched from an unreachable state to a connectable state. Although the illustrated embodiment shows an example in which only one message server of the plurality of message servers 102 is switched or added, the same may be true even when two or more message servers are switched or added. The same algorithm applies.

As shown in the illustrated embodiment, when the server C is switched from the unreachable state to the accessible state, there may be terminals to be connected to the server C among terminals connected to other servers. For example, a terminal or session with a hash value of 11 should be handled by server D (hash value 16) in an environment where server C does not exist, but should be handled by server C when server C (hash value 13) is accessible. . Therefore, in this case, each message server sends a connection change request to the terminal assigned to it or the message server added to the session or the terminal determined to be connected to the newly added message server among the sessions, so that each terminal accesses the normal main server. To be possible.

On the other hand, in this case, when each message server simultaneously transmits a connection change request to a terminal or a session allocated to it, a connection request to a new server may occur temporarily, and network traffic may explode momentarily. Therefore, in order to prevent this, each message server may be configured to transmit a connection change request to the main server after waiting for a randomly selected delay time within a preset maximum delay time. For example, in the illustrated embodiment, when the maximum delay time is 1 minute, server A waits for 13 seconds, server B for 32 seconds, and server D waits for 52 seconds, and then transmits a connection change request to a terminal connected to the terminal. In this way, the traffic can be distributed according to time slots.

In addition, even before transmitting the connection change request, each message server may transmit connection information about a client determined to be connected to a newly added message server among terminals connected to the message server. When the message server is configured in this way, the added message server should be connected with itself, but when it receives a message transmitted from the message routing server 104 to the terminal or session that is not actually connected, it receives information received from the message server connected with the actual terminal. Forward messages received by the message server.

For example, in the case of the terminal connected to the server D in the drawing, it may occur when the connection to the server C rather than the server D due to the addition of the server C. In this case, the server D requests the terminal to reconnect to the server C after a predetermined time elapses. However, if there is a message to be transmitted from the message routing server 104 to the terminal before performing the reconnection, the message is transmitted to the server C according to the updated logical server group information. In order to efficiently handle such a case, the server D transmits information to the server C that the terminal is connected to the terminal C until the terminal reconnects, so that the server C sends the message received from the message routing server 104 to the server D. FIG. To be delivered to the terminal.

5 is a flowchart illustrating a dynamic message routing method 500 according to an embodiment of the present invention.

First, for the plurality of message servers 102 forming one server group in the directory server 106, one or more hash values are generated for each message server by using identification keys of the message servers 102, and are generated. According to the hash value, the plurality of message servers 102 generates a logical server group arranged in a ring form (502). As described above, this step may generate the logical server group such that a plurality of message servers 102 are arranged in the ring in ascending or descending order according to the calculated hash value, in which case each message server 102 The logical server group may be generated such that the plurality of message servers are arranged in the loop by the number of generated hash values.

Next, the message routing server 104 receives a message related to a specific terminal or session (504), and information of the message server corresponding to the terminal or session among the plurality of message servers 102 included in the logical server group. Request 506 to directory server 106.

Next, the directory server 106 uses one of the message servers included in the logical server group using the hash value generated from the terminal identification key or the session identification key and a preset server assignment rule. It is assigned to the session (508) and provides information about it to the message routing server 104 (510).

The message routing server 104 then routes 512 the message using the message server information provided from the directory server 106.

6 is a diagram showing the detailed configuration of the directory server 106 according to an embodiment of the present invention. As shown, the directory server 106 according to an embodiment of the present invention includes a logical server group generation module 600 and a message server assignment module 602.

The logical server group generation module 600 uses one or more hashes for each message server 102 using the identification key of each of the plurality of message servers 102 for the plurality of message servers 102 forming one server group. A value is generated, and a group of logical servers in which a plurality of message servers 102 are arranged in a ring form is generated according to the generated hash value. In this case, the logical server group generation module 600 may generate the logical server group such that the plurality of message servers 102 are arranged in the ring in ascending or descending order according to the calculated hash value. In addition, the logical server group generation module 600 may generate the logical server group such that the plurality of message servers 102 are arranged in the loop by the number of hash values generated for each message server 102.

The message server assignment module 602 assigns one message server 102 of the message servers 102 included in the logical server group to a specific terminal or session.

On the other hand, an embodiment of the present invention may include a computer-readable recording medium including a program for performing the methods described herein on a computer. The computer-readable recording medium may include a program command, a local data file, a local data structure, or the like, alone or in combination. The media may be those specially designed and constructed for the present invention or may be known and available to those of ordinary skill in the computer software arts. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape, optical recording media such as CD-ROMs and DVDs, magneto-optical media such as floppy disks, and magnetic media such as ROMs, And hardware devices specifically configured to store and execute program instructions. Examples of program instructions may include machine language code such as those generated by a compiler, as well as high-level language code that may be executed by a computer using an interpreter or the like.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is clearly understood that the same is by way of illustration and example only and is not to be construed as limiting the scope of the present invention. I will understand.

Therefore, the scope of the present invention should not be limited to the above-described embodiments, but should be determined by equivalents to the appended claims, as well as the appended claims.

100: dynamic message routing system
102: message server
104: Message Routing Server
106: directory server
108: watchdog server
110: network
600: logical server group generation module
602: Message Server Allocation Module

Claims (21)

A plurality of message servers forming one server group;
A message routing server that receives a message related to a specific terminal or session and routes the message to a message server assigned to the terminal or session among the plurality of message servers; And
Generating one or more hash values for each message server by using identification keys of each of the plurality of message servers, and generating a logical server group in which the plurality of message servers are arranged in a ring form according to the generated hash values; And a directory server which assigns one message server among the message servers included in the logical server group to the terminal or the session.
The method according to claim 1,
And the directory server provides the message routing server with message server information assigned to the terminal or session in response to a request of the message routing server.
The method according to claim 1,
And the directory server creates the logical server group such that the plurality of message servers are arranged in the ring in ascending or descending order according to a calculated hash value.
The method of claim 3,
And the directory server generates the logical server group such that the plurality of message servers are arranged in the loop by the number of hash values generated for each message server.
The method according to claim 1,
And the directory server assigns one of the message servers included in the logical server group to the terminal or session using the query hash value generated from the terminal identification key or the session identification key.
The method of claim 5,
The directory server may assign a message server having the smallest hash value among the message servers having a hash value larger than the query hash value to the terminal or the session, or the message server having a hash value smaller than the query hash value. And a message server having a large hash value for the terminal or session.
The method according to claim 1,
A monitoring server that monitors an operation state of the plurality of message servers and notifies other message servers belonging to the server group and the directory server when an operation state of at least one message server of the plurality of message servers changes. Further comprising, a message routing system.
The method of claim 7,
And the directory server updates the logical server group according to operation state change information of the message servers received from the monitoring server.
The method of claim 8,
The plurality of message servers detect a change in the operation state of other message servers through the monitoring server, and there is a terminal or a session to be connected to another message server according to the change of the operation state among terminals or sessions connected to the plurality of message servers. If so, sending a connection change request to the terminal or session.
The method of claim 9,
And the plurality of message servers transmits the connection change request after waiting for a randomly selected delay time within a preset maximum delay time range.
The method according to claim 1,
The message server assigned to the specific terminal receives and stores a message recipient list from the specific terminal, and when receiving the multicast message from the specific terminal, transmits the multicast message to another terminal included in the message recipient list. Message routing system.
In the directory server, one or more hash values are generated for each message server by using identification keys of each of the plurality of message servers forming one server group, and the plurality of message servers are looped according to the generated hash value. Creating an array of logical server groups;
At a message routing server, receiving a message associated with a particular terminal or session;
Assigning, at the directory server, one message server among the message servers included in the logical server group to the terminal or session; And
In the message routing server, routing the message by the directory server to a message server assigned to the terminal or session.
The method of claim 12,
After the step of assigning the message server to the terminal or session, providing the message routing server with message server information assigned to the terminal or session at the request of the message routing server. Message routing method.
The method of claim 12,
The generating of the logical server group comprises: generating the logical server group such that the plurality of message servers are arranged in the ring in ascending or descending order according to a calculated hash value.
15. The method of claim 14,
The generating of the logical server group may include generating the logical server group such that the plurality of message servers are arranged in the loop by the number of hash values generated for each message server.
The method of claim 12,
The step of allocating the message server to the terminal or the session may include selecting one of the message servers included in the logical server group using the query hash value generated from the identification key of the terminal or the identification key of the session. To the message routing method.
18. The method of claim 16,
The step of allocating the message server to the terminal or the session may include assigning a message server having the smallest hash value among the message servers having a hash value greater than the query hash value to the terminal or the session, or more than the query hash value. The message routing method of allocating a message server having the largest hash value among the message server having a small hash value to the terminal or the session.
A computer-readable recording medium having recorded thereon a program for performing the method according to any one of claims 12 to 17 on a computer.
For a plurality of message servers forming one server group, one or more hash values are generated for each message server using identification keys of each of the plurality of message servers, and the plurality of message servers are generated according to the generated hash values. A logical server group generation module for generating a logical server group in which they are arranged in a ring form; And
And a message server assignment module for allocating one message server among the message servers included in the logical server group to a specific terminal or session.
The method of claim 19,
And the logical server group generation module generates the logical server group such that the plurality of message servers are arranged in the ring in ascending or descending order according to a calculated hash value.
The method of claim 19,
The logical server group generating module generates the logical server group such that the plurality of message servers are arranged in the loop by the number of hash values generated for each message server.

Images