The Adaptive Reverse Proxy Using Shared-Queues, The Method of Operating The Same, And The Computer-Readable Recording Medium For Implementing The Method Of Operating The Same
The adaptive reverse proxy system with a shared queue and priority-based selector ensures efficient message processing across multiple servers, addressing inefficiencies in conventional systems and enhancing security by hiding server identities.
Patent Information
- Application Number
- KR1020250058021
- Authority / Receiving Office
- KR · KR
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-05-02
- Publication Date
- 2026-11-10
AI Technical Summary
Conventional reverse proxies fail to efficiently process messages when a connection between a server and the proxy is severed, as requests in the queue allocated to that server cannot be processed by other servers, leading to inefficiencies and potential delays.
An adaptive reverse proxy system using a shared queue that allows multiple servers to access and process messages from a shared queue, with a selector determining priority for message processing to ensure efficient distribution and handling, even if a specific server fails.
Enhances message processing flexibility and efficiency by allowing multiple servers to access shared queues, ensuring messages are processed quickly and flexibly, while also providing security by hiding server IP addresses and preventing direct attacks.
Smart Images

Figure PAT00001_ABST
Abstract
Description
Technology Field
[0001] The present invention relates to an adaptive reverse proxy using a shared queue, a method of operating the same, and a computer-readable recording medium for implementing the method of operating the same. More specifically, it is positioned between a plurality of clients and a plurality of servers to receive requests from clients on their behalf and transmit them to servers, thereby enabling flexible processing of messages. Even more specifically, it allows a server receiving messages transmitted by a client to simultaneously access one or more shared queues together with other servers, and determines the priority for processing messages to flexibly process each message, thereby improving message processing efficiency at the server end. Background Technology
[0003] A reverse proxy is a server that acts as an intermediary between a client and a server, forwarding client requests to the server and sending the response back to the client. More specifically, as an example of reverse proxy operation, when a client sends a request to a domain, the DNS server responds by assigning the domain's IP address to the reverse proxy server's IP. The reverse proxy server then receives the request and forwards it to the backend server. Subsequently, the backend server processes the request and sends the response back to the reverse proxy, which then delivers that response to the client.
[0004] These reverse proxies are used for load balancing, which distributes client requests across multiple servers to reduce server load and improve performance; security enhancement, which prevents direct attacks by hiding the actual IP addresses and locations of backend servers and provides secure communication by handling SSL / TLS encryption; and caching, which shortens response times and reduces server load by storing frequently requested content; and are used for traffic management in modern large-scale websites and microservices architectures.
[0005] Meanwhile, in conventional network environments where such reverse proxies are deployed, if the connection between a specific server and the reverse proxy server is severed due to reasons such as the backend server taking a long time to operate or a failure, requests in the queue allocated to that specific server cannot be processed by other servers. In other words, even if other servers are capable of handling the requests in the queue, they cannot be processed if they are already allocated to the queue of the failed server. Therefore, there is a need for technology capable of resolving this issue. The problem to be solved
[0007] The present invention aims to provide an adaptive reverse proxy using a shared queue, a method of operating the same, and a computer-readable recording medium for implementing the method of operating the same. More specifically, it is positioned between a plurality of clients and a plurality of servers to receive requests from clients on their behalf and transmit them to servers, thereby enabling flexible processing of messages. Even more specifically, it allows a server receiving messages transmitted by a client to simultaneously access one or more shared queues together with other servers, and determines the priority for processing messages to flexibly process each message, thereby improving message processing efficiency at the server end. means of solving the problem
[0009] In order to solve the above problems, an adaptive reverse proxy using a shared queue connected to a plurality of clients and a plurality of servers is provided, comprising: a filter module that determines a queue to which a message is to be distributed according to destination information of a message received from a client; a queue group including a queue where a message received from a client is waiting; and a selector connected to two or more of the queues included in the queue group to ensure that a message waiting in the connected queue is delivered to a server; wherein the queue group includes a dedicated queue connected to a single server to transmit messages only to that server; and a shared queue connected to two or more servers to transmit messages to one or more of the connected servers; and wherein the selector determines priority information for each message located at the end of the queue of each of the two or more connected queues, and then transmits messages from the corresponding queue to the server in order of highest priority, and actively selects a message to be delivered to the server that sent a message reception request to the reverse proxy according to the priority information.
[0010] In one embodiment of the present invention, each server included in the plurality of servers may be connected to one dedicated queue, connected to one shared queue, or connected to one or more dedicated queues and one or more shared queues.
[0011] In one embodiment of the present invention, the filter module, when the received message includes destination information, transmits the message to a queue connected to a server corresponding to the destination information, and when the received message does not include destination information, sets the destination information or queue information of the message based on a pre-configured distribution rule and message information included in the message, and then transmits the message to a queue connected to a server corresponding to the destination information or transmits the message to a queue corresponding to the queue information.
[0012] In one embodiment of the present invention, the queue group includes a first dedicated queue, a first shared queue, and a second shared queue, and the plurality of servers includes a first server capable of receiving messages from the first dedicated queue, the first shared queue, and the second shared queue, and the selector is located between the first shared queue and the second shared queue and the first server, and transmits messages to the first server in order of highest priority among messages waiting in each of the first shared queue and the second shared queue, and the first server can receive messages transmitted from the selector or the first dedicated queue.
[0013] In one embodiment of the present invention, the priority information may be determined by the selector based on at least one of the time when each message arrives at the queue; a processing priority rule according to the message information of each message; and the size of the queue in which each message is waiting.
[0014] In one embodiment of the present invention, the priority information may be determined by the selector based on at least one of the processing time of a server capable of receiving each message; and the current state of a server capable of receiving each message.
[0015] In one embodiment of the present invention, if the filter module receives a notification that message processing is impossible from a specific server connected to the reverse proxy, or fails to receive a response signal for message reception from the specific server, it may not deliver the message to a queue connected only to the specific server, even if the destination information of the received message corresponds to the specific server.
[0016] In one embodiment of the present invention, the queue group includes a first shared queue and a second shared queue, and the plurality of servers includes a first server and a second server capable of receiving messages from the first shared queue and the second shared queue, and the selector determines priority information of a plurality of messages waiting in the first shared queue and the second shared queue, and transmits each message to the first server and the second server according to the priority of each message, and if the determined priority information is the same, the message to be transmitted to each server can be determined by a round-robin scheduling method.
[0017] In one embodiment of the present invention, the plurality of clients and the reverse proxy are connected via a public internet network, and the filter module distributes a first message to a first queue included in the queue group, and when it receives a second message canceling the processing of the first message, it can distribute the second message to the first queue.
[0018] In order to solve the above problems, an embodiment of the present invention provides a method for operating an adaptive reverse proxy using a shared queue, wherein the reverse proxy is connected to a plurality of clients and a plurality of servers, and in a filter module, a step of determining a queue to which a message is to be distributed according to destination information of a message received from the client; in a queue group, a step of receiving a message transmitted from the filter module; and in a selector, a step of ensuring that a message waiting in a queue connected to the selector is transmitted to a server; wherein the queue group includes a dedicated queue connected to a single server and transmitting messages only to that server; and a shared queue connected to two or more servers and capable of transmitting messages to one or more of the connected servers; and wherein the selector determines priority information for each message located at the end of the queue of each of the two or more connected queues, and transmits messages from the corresponding queue to the server in order of highest priority, and selects a message to be transmitted to the server that sent a message reception request to the reverse proxy according to the priority information.
[0019] In one embodiment of the present invention, each server included in the plurality of servers may be connected to one dedicated queue, connected to one shared queue, or connected to one or more dedicated queues and one or more shared queues.
[0020] In one embodiment of the present invention, if the filter module receives a notification that message processing is impossible from a specific server connected to the reverse proxy, or fails to receive a response signal for message reception from the specific server, it may not deliver the message to a queue connected only to the specific server, even if the destination information of the received message corresponds to the specific server.
[0021] To solve the above problems, in one embodiment of the present invention, a computer-readable recording medium for implementing a method of operating an adaptive reverse proxy using a shared queue, which is performed in a computing system comprising one or more processors and one or more memories, wherein the reverse proxy is connected to a plurality of clients and a plurality of servers and includes a filter module; a queue group; and a selector; and the computer-readable recording medium includes computer-executable instructions that cause the computing system to perform the following steps, wherein the following steps include: a step of determining a queue to which a message is to be distributed according to destination information of a message received from the client in the filter module; a step of receiving a message transmitted from the filter module in the queue group; and a step of causing a message waiting in a queue connected to the selector to be transmitted to a server in the selector; wherein the queue group includes a dedicated queue connected to a single server and transmitting messages only to that server; A computer-readable recording medium is provided that includes a shared queue connected to two or more servers and capable of transmitting a message to one or more of the connected servers, wherein the selector determines priority information for each message located at the end of the queue in each of the two or more connected queues, and transmits messages from the corresponding queue to the server in order of highest priority, and selects a message to be transmitted to the server that sent a message reception request to the reverse proxy according to the priority information.
[0022] In one embodiment of the present invention, each server included in the plurality of servers may be connected to one dedicated queue, connected to one shared queue, or connected to one or more dedicated queues and one or more shared queues.
[0023] In one embodiment of the present invention, if the filter module receives a notification that message processing is impossible from a specific server connected to the reverse proxy, or fails to receive a response signal for message reception from the specific server, it may not deliver the message to a queue connected only to the specific server, even if the destination information of the received message corresponds to the specific server. Effects of the invention
[0025] According to one embodiment of the present invention, two or more different servers can simultaneously access one or more shared queues, and the order in which messages are processed is actively determined by a selector, thereby enabling the effect of improving message processing flexibility and efficiency at the server end.
[0026] According to one embodiment of the present invention, the effect of determining the message to be processed by the server that sent the message reception request based on message information without the client being involved with the server can be achieved.
[0027] According to one embodiment of the present invention, the actual IP address and location of the server can be hidden, thereby providing the effect of preventing direct attacks from the outside.
[0028] According to one embodiment of the present invention, when destination information of a message transmitted by a client is not specified, the destination information or queue information of the message is set based on a pre-configured distribution rule and the message information of the message, and the message is connected to a queue connected to a consumer according to the destination information, or the message is delivered to a queue corresponding to the queue information, thereby enabling multiple messages to be processed quickly. Brief explanation of the drawing
[0030] FIGS. 1 and 2 schematically illustrate the connection configuration of a reverse proxy mediating a plurality of clients and a plurality of servers according to an embodiment of the present invention. FIG. 3 schematically illustrates the internal configuration of a reverse proxy according to one embodiment of the present invention. FIG. 4 schematically illustrates the internal configuration of a reverse proxy according to another embodiment of the present invention. FIG. 5 schematically illustrates the internal configuration of a selector according to one embodiment of the present invention. FIG. 6 schematically illustrates a configuration using a single message queue according to an embodiment of the prior art. FIG. 7 schematically illustrates a configuration for distributing queues according to destination information in a filter module according to one embodiment of the present invention. FIG. 8 schematically illustrates a step of distributing queues based on whether there is destination information of a message received in a filter module according to an embodiment of the present invention. FIG. 9 schematically illustrates a process in which a message to be transmitted to each server is determined according to the arrival time of each message waiting in a plurality of shared queues by a selector according to an embodiment of the present invention. FIG. 10 schematically illustrates a process in which a message to be transmitted to each server is determined according to the size of each of a plurality of queues in which a plurality of messages are waiting, according to an embodiment of the present invention. FIG. 11 schematically illustrates a process in which a message to be transmitted to each server is determined according to the urgency of a queue in which a plurality of messages are waiting, according to an embodiment of the present invention. FIG. 12 schematically illustrates the internal configuration of a computing device according to one embodiment of the present invention. Specific details for implementing the invention
[0031] Hereinafter, various embodiments and / or aspects are disclosed with reference to the drawings. For illustrative purposes, numerous specific details are disclosed in the following description to aid in a general understanding of one or more aspects. However, it will also be recognized by those skilled in the art that these aspects may be practiced without such specific details. The following description and the accompanying drawings describe specific exemplary aspects of one or more aspects in detail. However, these aspects are exemplary, and some of the various methods in the principles of the various aspects may be used, and the description is intended to include all such aspects and their equivalents.
[0033] In addition, various aspects and features will be presented by a system that may include multiple devices, components and / or modules, etc. It should also be understood and recognized that various systems may include additional devices, components and / or modules, etc., and / or may not include all of the devices, components, modules, etc. discussed in relation to the drawings.
[0034] Terms such as “embodiment,” “example,” “aspect,” “example,” etc. as used herein may not be interpreted as implying that any aspect or design described is superior or more advantageous than other aspects or designs. Terms used below, such as “part,” “component,” “module,” “system,” “interface,” etc., generally refer to computer-related entities and may, for example, refer to hardware, a combination of hardware and software, or software.
[0035] Additionally, the terms “comprising” and / or “comprising” should be understood to mean that the relevant feature and / or component is present, but not to exclude the presence or addition of one or more other features, components and / or groups thereof.
[0036] Additionally, terms including ordinal numbers, such as first, second, etc., may be used to describe various components, but said components are not limited by said terms. Such terms are used solely for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, the first component may be named the second component, and similarly, the second component may be named the first component. The term "and / or" includes a combination of a plurality of related described items or any of a plurality of related described items.
[0037] Furthermore, in the embodiments of the present invention, all terms used herein, including technical or scientific terms, unless otherwise defined, have the same meaning as generally understood by those skilled in the art to which the present invention pertains. Terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant technology, and should not be interpreted in an ideal or overly formal sense unless explicitly defined in the embodiments of the present invention.
[0038] Meanwhile, the "client" mentioned below may be implemented as a computer or portable terminal capable of connecting to a server or other terminal via a network. Here, the computer includes, for example, a notebook, desktop, or laptop equipped with a web browser, and the portable terminal may include, for example, all types of handheld-based wireless communication devices such as smartphones, tablet PCs, PCS (Personal Communication System), GSM (Global System for Mobile communications), PDC (Personal Digital Cellular), PHS (Personal Handyphone System), PDA (Personal Digital Assistant), IMT (International Mobile Telecommunication)-2000, CDMA (Code Division Multiple Access)-2000, W-CDMA (W-Code Division Multiple Access), and Wibro (Wireless Broadband Internet) terminals, as wireless communication devices that ensure portability and mobility. In addition, the “network” can be implemented as a wired network such as a Local Area Network (LAN), Wide Area Network (WAN), or Value Added Network (VAN), or as any type of wireless network such as a mobile radio communication network or a satellite communication network.
[0040] FIGS. 1 and 2 schematically illustrate the connection configuration of a reverse proxy (1000) mediating a plurality of clients (100) and a plurality of servers (200) according to one embodiment of the present invention.
[0042] As illustrated in FIGS. 1 and 2, an adaptive reverse proxy (1000) using a shared queue (1220) connected to a plurality of clients (100) and a plurality of servers (200) comprises: a filter module (1100) that determines a queue to which a message is to be distributed according to destination information of a message received from the client (100); a queue group (1200) that includes a queue where a message received from the client (100) is waiting; and a selector (1300) that is connected to two or more of the queues included in the queue group (1200) and causes a message waiting in the connected queue to be delivered to the server (200); wherein the queue group (1200) includes a dedicated queue (1210) that is connected to a single server (200) and transmits messages only to the server (200). It includes a shared queue (1220) connected to two or more servers (200) and capable of transmitting messages to one or more of the connected servers (200); and the selector (1300) determines priority information for each message located at the end of the queue of each of the two or more connected queues, and transmits messages from the corresponding queue to the server (200) in order of highest priority, and selects a message to be delivered to the server (200) that sent a message reception request to the reverse proxy (1000) according to the priority information.
[0043] In addition, the plurality of clients (100) and the reverse proxy (1000) can be connected via a public internet network.
[0045] Specifically, as illustrated in FIG. 1, the reverse proxy (1000) of the present invention includes a filter module (1100), a queue group (1200), and a selector (1300), and corresponds to a computing system including one or more processors and one or more memories. The reverse proxy (1000) performs the role of mediating between N (N is a natural number greater than or equal to 1) clients (100) and M (M is a natural number greater than or equal to 1) servers (200), and each client (100) generates a message containing a specific request or information and sends it to the reverse proxy (1000), and the reverse proxy (1000) transmits the message to a server (200) capable of receiving and processing the message.
[0046] Additionally, the reverse proxy (1000) supports a message queue system in which, upon receiving a message from the client (100), the server (200) processes the message later. Each of the multiple messages waiting at the reverse proxy (1000) is processed only once by a single server (200), and the client (100) and the server (200) are characterized by operating independently. The message referred to in this specification means data transmitted between the client (100) and the server (200). In one embodiment, the message may be a message that instructs a specific system to start processing a task, contains information about a completed task, or corresponds to a message such as an email, but the embodiments of the message referred to in this invention are not limited to those described above.
[0047] More specifically, multiple messages transmitted from multiple clients (100) are delivered to a filter module (1100). In one embodiment of the present invention, the reverse proxy (1000) may include a message receiving module (not shown) capable of receiving messages from the outside, and multiple messages received through the message receiving module are delivered to the filter module (1100). The filter module (1100) determines a message queue to which a message is to be delivered according to the destination information of each of the multiple messages, and delivers the message to the determined queue. Messages delivered to each of the multiple queues wait in the respective queue and are then delivered to the server (200) according to priority information determined by the selector (1300).
[0048] At this time, when the selector (1300) receives a pull request corresponding to a message reception request from a specific server (200), messages waiting in a plurality of queues connected to the specific server (200) are transmitted to the specific server (200) according to priority information determined by the selector (1300).
[0049] The above message reception request may correspond to information that the server (200) directly requests from the reverse proxy (1000) as one embodiment of the present invention, and as another embodiment of the present invention, the act of transmitting the result of processing HTML or HTTP, etc. from the server (200) to an external source or to the reverse proxy (1000) may correspond to the message reception request, and as yet another embodiment of the present invention, when status information of the server (200) is transmitted to the reverse proxy (1000) from equipment or devices other than the server (200), the transmitted status information may correspond to the message reception request. In this case, examples of the status information of the server (200) may correspond to information indicating that it is capable of processing messages or is currently operating, and examples of other equipment or devices may correspond to a system capable of monitoring the status information of the server (200). In this way, a message reception request can be transmitted directly or indirectly from the server (200) to the reverse proxy (1000), and the selector (1300) of the reverse proxy (1000) that receives it causes messages waiting in multiple queues to be transmitted to the corresponding server (200).
[0050] If the reverse proxy (1000) fails to receive the aforementioned message reception request (pull request) from the specific server (200), or fails to receive an acknowledgment (ack) signal for message reception transmitted to the specific server (200), or receives a notification of message processing failure directly or indirectly from the specific server (200), the reverse proxy (1000), more preferably, the filter module (1100) of the reverse proxy (1000) does not transmit the message to a queue connected only to the specific server (200), even if the destination information of the received message corresponds to the specific server (200), thereby preventing the message from being unnecessarily delayed.
[0051] Meanwhile, the queue (message queue) mentioned in this specification refers to a line of items waiting to be processed, and can be processed in order starting from the message located at the end of the queue (the first one to enter the queue), and may include a series of work objects.
[0052] As illustrated in FIG. 1, the reverse proxy (1000) includes a queue group (1200) comprising a plurality of queues. Although only one queue group (1200) is illustrated in FIG. 1, as an embodiment of the present invention, two or more queue groups (1200) may be included. Referring to FIG. 3, the queue group (1200) includes a dedicated queue (1210) that transmits messages to only one server (200); and a shared queue (1220) that transmits messages to two or more servers (200). A more detailed description thereof will be provided later in the description of FIG. 3.
[0054] As illustrated in FIG. 2, a network may be located between a plurality of clients (100) and the reverse proxy (1000), and each client (100) may transmit a message to the reverse proxy (1000) through the network. In a preferred embodiment, the network may correspond to a public network such as the Internet. The greatest technical feature of the present invention is that the client (100) does not interact with the server (200). In other words, the client (100) only generates a message and transmits it to the reverse proxy (1000), and does not get involved at all in how the transmitted message is processed at the server (200). Since the reverse proxy (1000) of the present invention actively handles the processing of the message at the server (200), the client (100) and the server (200) do not communicate directly, thereby preventing direct attacks from the outside to the server (200).
[0055] In such a reverse proxy (1000), unlike a conventional general message queue, the present invention allows the queue and the server (200) to form an N:M relationship, thereby enabling the effect that even if a specific server (200) becomes unable to process messages due to failure or other reasons, another server (200) can take its place. Below, the configuration, operation process, and technical features of the reverse proxy (1000) will be described in more detail.
[0057] FIG. 3 schematically illustrates the internal configuration of a reverse proxy (1000) according to one embodiment of the present invention, and FIG. 4 schematically illustrates the internal configuration of a reverse proxy (1000) according to another embodiment of the present invention.
[0059] As illustrated in FIGS. 3 and 4, the reverse proxy (1000) of the present invention is a computing system connected to a plurality of clients (100) and a plurality of servers (200), and comprises: a filter module (1100) that determines a queue to which a message is to be distributed according to destination information of a message received from the client (100); a queue group (1200) that includes a queue where a message received from the client (100) is waiting; and a selector (1300) that is connected to two or more of the queues included in the queue group (1200) and transmits a message waiting in the connected queue to the server (200). The queue group (1200) comprises: a dedicated queue (1210) that is connected to a single server (200) and transmits a message only to that server (200); and a shared queue (1220) that is connected to two or more servers (200) and can transmit a message to one or more of the connected servers (200).
[0060] Additionally, each server (200) included in the plurality of servers (200) may be connected to one dedicated queue (1210), connected to one shared queue (1220), or connected to one or more dedicated queues (1210) and one or more shared queues (1220).
[0062] In general, for convenience of understanding, FIG. 3 illustrates an embodiment in which a reverse proxy (1000) mediates between three clients (100) and three servers (200), and FIG. 4 illustrates an embodiment in which a reverse proxy (1000) mediates between three clients (100) and two servers (200); however, as previously mentioned, the actual number of clients (100) and servers (200) being mediated in the present invention is not limited.
[0063] Additionally, FIGS. 3 and 4 illustrate an embodiment in which three queues (one dedicated queue (1210.1) and two shared queues (1220.1 to 1220.2)) are connected to a plurality of servers (200). However, in the actual invention, a plurality of queues (1200) and a plurality of servers (200) may be connected directly or indirectly, and in this case, the number of queues and the number of servers (200) may be the same or different. Furthermore, the number of dedicated queues (1210) and shared queues (1220) connected to the plurality of servers (200), and the number of cases in which each is connected, are not limited to those described in this specification, and this specification describes only representative embodiments to facilitate understanding of the technical features of the invention.
[0065] Specifically, the reverse proxy (1000) of the present invention is characterized by including one or more dedicated queues (1210) and one or more shared queues (1220), as illustrated in FIG. 3. Meanwhile, as one embodiment of the present invention, the reverse proxy (1000) may include only one or more dedicated queues (1210), and as another embodiment of the present invention, the reverse proxy (1000) may include only one or more shared queues (1220). However, the above-mentioned reverse proxy (1000) is characterized in that, in implementing many-to-many communication, only a dedicated queue (1210) can be connected to a specific server (200), a shared queue (1220) and a selector (1300) can be connected to a specific server (200), and a dedicated queue (1210) and a shared queue (1220) can be simultaneously connected to a specific server (200) through the selector (1300) to enable flexible message processing.
[0066] More specifically, the dedicated queue (1210) is a message queue connected to a single server (200) and transmits messages only to that server (200). In FIG. 3, the queue (dedicated queue #1, 1210.1) connected to server #1 (200.1) corresponds to the dedicated queue (1210). That is, it is desirable for messages that can only be processed by the server (200) connected to it to be accumulated in the queue of the dedicated queue (1210), and this is done under the judgment of the filter module (1100). Meanwhile, FIG. 3 illustrates an embodiment in which the selector (1300) is not connected to the dedicated queue #1 (1210.1), but according to another embodiment of the present invention, the dedicated queue #1 (1210.1) may also be connected directly or indirectly to the selector (1300).
[0067] The above shared queue (1220) is a message queue connected to two or more servers (200) and capable of selectively transmitting messages to one or more of the connected servers (200). In FIG. 3, it corresponds to a queue (shared queue #1 and shared queue #2, 1220.1 and 1220.2) connected to server #2 (200.2) and server #3 (200.3). That is, messages waiting in the shared queue (1220) can be transmitted to one or more of the one or more servers (200) connected to the shared queue (1220), and the message to be transmitted to each server (200) is determined by the selector (1300).
[0069] As described above, the greatest technical feature of the present invention is that the reverse proxy (1000) of the present invention, even without any communication between the client (100) and the server (200), allows messages transmitted from multiple clients (100) to be processed as quickly as possible. This is achieved by the filter module (1100) actively distributing multiple messages to a specific queue and the selector (1300) actively determining which messages can be transmitted to a specific server (200). Through this feature, security within the server group (200) can be enhanced by preventing contact between the server group (200) and the outside world. Furthermore, from the perspective of the operator running the reverse proxy (1000), messages can be received from an unspecified number of clients (100), thereby enabling the effect of achieving high business potential.
[0071] Meanwhile, FIG. 4 illustrates the internal configuration of a reverse proxy (1000) according to an embodiment different from the embodiment mentioned in the description of FIG. 3.
[0072] Specifically, according to the embodiment, as illustrated in FIG. 4, the selector (1300) of the present invention does not directly receive a message from a dedicated queue (1210) or a shared queue (1220) and directly transmit it to a server (200), but rather, when connected to a plurality of servers (200) and a plurality of queues (dedicated queue (1210) or shared queue (1220)), it can transmit messages from the corresponding queue to the specific server (200) in order of highest priority according to the priority information of the message at the end of each of the plurality of queues (1200) connected to the specific server (200).
[0073] In addition, as an embodiment of the present invention, the reverse proxy (1000) may not include only one selector (1300) as shown in FIG. 1 and FIG. 3, but as shown in FIG. 4, each of two or more selectors (1300) may be located at the front of each of a plurality of servers (200) connected to the reverse proxy (1000), so that messages may be transmitted to the corresponding servers (200) according to priority from a plurality of queues (1200) connected to the corresponding servers (200).
[0074] For example, Server #1 (200.1) illustrated in FIG. 4 is connected to a private queue #1 (1210.1), a shared queue #1 (1220.1), and a shared queue #2 (1220.2). When Selector #1 (1300.1) receives a message reception request from Server #1 (200.1), messages waiting in the private queue #1 (1210.1), the shared queue #1 (1220.1), and the shared queue #2 (1220.2) are delivered to Server #1 (200.1) according to priority information determined by Selector #1 (1300.1).
[0075] Additionally, Server #2 (200.2) illustrated in FIG. 4 is connected to Shared Queue #1 (1220.1) and Shared Queue #2 (1220.2), and when Selector #2 (1300.2) receives a message reception request from Server #2 (200.2), messages waiting in Shared Queue #1 (1220.1) and Shared Queue #2 (1220.2) are transmitted to Server #2 (200.2) according to priority information determined by Selector #2 (1300.2).
[0076] As such, the selector (1300) of the present invention is characterized by the technical feature that a message waiting in a dedicated queue (1210) or a shared queue (1220) connected to the plurality of servers (200) at the front end of each of the plurality of servers (200) is transmitted to the server (200) according to priority information. In addition, according to one embodiment of the present invention, as shown in FIG. 3, the selector (1300) may receive a message directly from the plurality of queues (1200) and transmit it to the server (200), but according to another embodiment of the present invention, as shown in FIG. 4, the selector (1300) may be indirectly connected to the plurality of queues (1200) and the plurality of servers (200) so that a message waiting in the plurality of queues (1200) can be appropriately transmitted to the server (200).
[0078] FIG. 5 schematically illustrates the internal configuration of a selector (1300) according to one embodiment of the present invention.
[0080] As illustrated in FIG. 5, the selector (1300) includes a priority information judgment module (1310); a message delivery module (1320); a memory (1330); and a control module (1340).
[0082] Specifically, the selector (1300) determines priority information for each message waiting in one or more shared queues (1220) connected to it, and sends each message to the server (200) considering each priority information. For example, with reference to FIG. 3, if the selector (1300) determines the priority information of message #1 waiting in shared queue #1 (1220.1) as number 1 and the priority information of message #2 waiting in shared queue #2 (1220.2) as number 2, then when the selector (1300) receives a message reception request in the order of server #2 (200.2) and server #3 (200.3), message #1 can be sent to server #2 (200.2) first, and then message #2 can be sent to server #3 (200.3).
[0083] As described above, the priority information determination module (1310) performs a priority information determination step for determining priority information for each message located at the end of each queue connected to the corresponding selector (1300). Preferably, when the priority information determination module (1310) receives a message reception request from a server (200) connected to it, it can determine the priority information of each message to be delivered to the server (200) that sent the message reception request.
[0084] The message delivery module (1320) delivers a message waiting in a queue connected to the selector (1300) to the server (200). More specifically, the message delivery module (1320) receives a copy, address value (pointer), or reference, etc., of a message waiting at the end of the connected queue from the queue and performs the function of delivering the message to the server (200) that sent the message reception request. The message delivery module (1320) may further include a communication module capable of communicating with the server (200) connected to the selector (1300).
[0085] Meanwhile, in FIG. 3, the selector (1300) is shown as being connected only to the shared queue (1220), but as described above, as an embodiment of the present invention, the selector (1300) can also be connected to the dedicated queue (1210).
[0086] Meanwhile, in FIG. 5, the memory (1330) and the control module (1340) are shown as being included in the selector (1300), but this is merely one embodiment of the present invention, and according to another embodiment of the present invention, the memory (1330) and the control module (1340) may be included inside the reverse proxy (1000), and the memory (1330) and the control module (1340) may control the operation of the selector (1300). The control module (1340) may include one or more processors.
[0087] In addition, according to one embodiment of the present invention, the memory (1330) may include a learned artificial intelligence model, and the artificial intelligence model is an artificial intelligence model that has learned to select a message to be transmitted to a server (200) by considering a plurality of factors in the selector (1300), and may correspond to a known learning model such as an RNN, CNN, or DNN. The learned artificial intelligence model can determine priority information of a message by comprehensively considering message information, etc., of each connected message.
[0089] FIG. 6 schematically illustrates a configuration using a single message queue according to an embodiment of the prior art.
[0091] Specifically, in a conventional message queue system, multiple clients (100) send messages to a single message queue, and the message queue receives them, waits in a queue, and then sequentially sends each message to a server (200). At this time, the message number shown in FIG. 6 represents the chronological order in which each client (100) creates a message and sends it to the message queue. As shown in FIG. 6, client #1 (100.1) first creates message #1 and sends it to the queue, and immediately afterward, client #2 (100.2) creates message #2 and sends it to the queue, and the message queue receives it and stores it in a queue.
[0092] Meanwhile, in the case of this conventional technology, messages are accumulated in a message queue in the order in which multiple clients (100) send messages, and messages are sent sequentially to a server (200). However, in most cases, as shown in FIG. 6, the order in which messages are accumulated in the message queue does not match the order in which each client (100) sends messages. This unintended situation worsens as the number of clients (100), message queues, and servers (200) increases.
[0093] The inventor of the present invention improves the efficiency of message processing by improving the prior art having such problems, and uses a queue group (1200) including a dedicated queue (1210) and a shared queue (1220), and uses a filter module (1100) and a selector (1300) to appropriately distribute messages according to preset rules or conditions. Below, through various embodiments, the process of selecting messages to be distributed to queues or to be transmitted to a server (200) will be described.
[0095] FIG. 7 schematically illustrates a configuration for distributing queues according to destination information in a filter module (1100) according to an embodiment of the present invention, and FIG. 8 schematically illustrates a step of distributing queues according to the presence or absence of destination information of a message received in a filter module (1100) according to an embodiment of the present invention.
[0097] In summary, for ease of understanding, the message numbers shown in FIGS. 7 to 11 represent the chronological order in which messages are transmitted from the filter module (1100) to the queue. For example, MSG#1 represents the first message transmitted from the filter module (1100), and MSG#4 represents the fourth message transmitted from the filter module (1100). That is, messages with smaller sequence numbers are transmitted to the queue before messages with larger sequence numbers.
[0099] As illustrated in FIGS. 7 and 8, the filter module (1100) transmits the message to a queue connected to a server (200) according to the destination information when the received message contains destination information, and when the received message does not contain destination information, it sets the destination information or queue information of the message based on a pre-set distribution rule and message information included in the message, and then transmits the message to a queue connected to a server (200) according to the destination information or transmits the message to a queue corresponding to the queue information.
[0100] Additionally, the filter module (1100) distributes the first message to the first queue included in the queue group (1200), and when it receives a second message canceling the processing of the first message, it distributes the second message to the first queue.
[0102] Schematically, FIG. 8 illustrates filter logic performed in the filter module (1100) of the present invention, and said filter logic may correspond to an algorithm that operates when the filter module (1100) is driven.
[0104] Specifically, the filter module (1100) distributes each message to a suitable queue according to the destination information of each message received from a plurality of clients (100). The destination information includes information related to the server (200) that processes the message. For example, when client A (100) creates and transmits message A, the IP address of server A (200) that processes message A can be included in the header of message A and transmitted to the filter module (1100), and the filter module (1100) transmits message A to a specific message queue by referencing the IP address included in the header of message A.
[0105] Meanwhile, as another example, if message A is a message requesting email transmission, the message A must be processed by server A (200) capable of transmitting emails. That is, when client A (100) transmits the message A, even if information related to server A (200) (e.g., the IP address of server A (200)) is not specified, the filter module (1100) can identify that the message is an email transmission request message through the message information of server A (200) and distribute the message A to a message queue connected to server A (200) capable of processing the message.
[0107] That is, the filter module (1100), with reference to FIG. 8, receives a message (S10) from an unspecified number of clients (100) and determines whether the message contains destination information (S20). If, as a result of the determination, the message does not contain destination information, the filter module (1100) determines the destination information or queue information of the message based on the message information (S30), as described above. If the filter module (1100) determines in step S20 that there is destination information or queue information, or generates destination information or queue information in step S30, it distributes the queue according to the destination information or queue information of the message (S100).
[0108] As an embodiment of the present invention, the filter module (1100) may set destination information for a message based on a pre-set distribution rule and message information included in the message. The message information may include at least one of: IP information to which the message was transmitted; the type of the message; and the body content of the message. The type of message may be, for example, whether the message is a plain text message, a message requesting a specific website, or a message requesting a withdrawal from a specific account. Additionally, the filter module (1100) may determine the destination information of the message by reading the body content of the message.
[0109] The filter module (1100) can determine the queue to which a message is to be distributed according to a pre-set distribution rule. In principle, the distribution rule distributes the queues in the order in which they enter the filter module (1100), but additionally, the filter module (1100) can determine destination information based on the history of the message. For example, if the filter module (1100) receives a message B requesting the cancellation of message A (at the server end) after distributing message A, which includes a request to send a specific email, to shared queue #1 (1220.1), the filter module (1100) distributes message B to the shared queue #1 (1220.1) where message A was distributed. In other words, messages related to a previously distributed message, such as a message attempting to cancel a message that has already been distributed, must be distributed to the queue where the previously distributed message was distributed.
[0110] As in the present invention, when multiple queues are operated, the aforementioned message A may be distributed to shared queue #1 (1220.1), and message B, which cancels message A, may be distributed to shared queue #2 (1220.2). At this time, due to the processing of the selector (1300), message B may be processed before message A. That is, if server B (200), which is capable of processing message A and message B, receives message B before receiving message A, a failure may occur in server B (200) because there is no target for cancellation.
[0111] In this way, the filter module (1100) determines the queue to which each message will be transmitted according to the message information and the distribution rule, and the weighting factor that the filter module (1100) must consider to distribute the queue corresponds to a configuration that can be modified at any time according to the inventor's intent.
[0113] FIG. 9 schematically illustrates a process in which a message to be transmitted to each server (200) is determined according to the arrival time of each message waiting in a plurality of shared queues (1220) by a selector (1300) according to an embodiment of the present invention, FIG. 10 schematically illustrates a process in which a message to be transmitted to each server (200) is determined according to the size of each of the plurality of queues (1200) in which a plurality of messages are waiting according to an embodiment of the present invention, FIG. 11 schematically illustrates a process in which a message to be transmitted to each server (200) is determined according to the urgency of the queue in which a plurality of messages are waiting according to an embodiment of the present invention.
[0115] As illustrated in FIGS. 9 to 11, the queue group (1200) includes a first shared queue (1220.1) and a second shared queue (1220.2), and the plurality of servers (200) include a first server (200.1) and a second server (200.2) capable of receiving messages from the first shared queue (1220.1) and the second shared queue (1220.2), and the selector (1300) determines priority information for a plurality of messages waiting in the first shared queue (1220.1) and the second shared queue (1220.2), and transmits each message to the first server (200.1) and the second server (200.2) according to the priority of each message, and if the determined priority information is the same, determines the message to be transmitted to each server (200) using a round robin scheduling method.
[0116] Additionally, by the selector (1300), the priority information may be determined based on at least one of the time each message arrives at the queue; a processing priority rule according to the message information of each message; and the size of the queue in which each message is waiting.
[0118] As described above, the sequence number of the message (MSG) disclosed in the drawing represents the chronological order in which it was transmitted from the filter module (1100) to the queue.
[0120] Schematically, FIGS. 9 and 10 illustrate a configuration in which, as an embodiment of the present invention, a first shared queue (1220.1), a second shared queue (1220.2), and a third shared queue (1220.3) are connected to a selector (1300), and the selector (1300) is connected to a first server (200.1), a second server (200.2), and a third server (200.3).
[0121] As illustrated in FIG. 9, according to one embodiment of the present invention, the selector (1300) determines priority information in the order of the time each message arrives at the queue. That is, among the messages located at the end of each queue, the message that arrived at the queue first can be sent to the server (200) as a first processing priority rule.
[0122] Specifically, when MSG#1 arrives at the first shared queue (1220.1) first, MSG#2 arrives at the second shared queue (1220.2) next, and MSG#3 arrives at the third shared queue (1220.3) next, the selector (1300), without considering other conditions (e.g., size of the queue, state of the server (200), etc.), sequentially transmits messages waiting in each queue to the first server (200.1) to the third server (200.3) that sent the message reception request, according to the order in which they were stacked in the first shared queue (1220.1) to the third shared queue (1220.3).
[0123] That is, for each of MSG#1 to MSG#3 located at the rear end of the first shared queue (1220.1) to the third shared queue (1220.3), the selector (1300) first transmits MSG#1 to the first server (200.1), transmits MSG#2 to the second server (200.2), and transmits MSG#3 to the third server (200.3). Once each of MSG#1 to MSG#3 has been transmitted to the server, for each of MSG#4, MSG#5, and MSG#6 located thereafter, MSG#4 is first transmitted to the first server (200.1), MSG#5 is transmitted to the second server (200.2), and MSG#6 is transmitted to the third server (200.3). In this way, the selector (1300) transmits each message to the server (200) in the order of the messages transmitted first among the messages located at the end of each queue, and when a message at the end of each queue is transmitted, each message at the preceding end can be transmitted to the server (200) in the order entered into the queue.
[0124] Additionally, the selector (1300) can determine the message to be sent to each server (200) using a round-robin scheduling method when the state of the connected server (200) is the same or there is no significant difference, that is, when the determined priority information of each message to be sent to a specific server (200) is the same. In other words, the selector (1300) receives a message reception request from the server (200), and when the message reception request is successfully received, it sequentially sends multiple messages to each server (200).
[0126] As illustrated in FIG. 10, according to one embodiment of the present invention, the selector (1300) determines priority information based on the size of each connected queue. That is, the more messages waiting in a queue, the more messages waiting in that queue are sent to the server (200) as a second processing priority rule.
[0127] Specifically, MSG#1 arrived at the first shared queue (1220.1) first, followed by MSG#2 arriving at the third shared queue (1220.3), then MSG#3 and MSG#4 arriving in order at the second shared queue (1220.2), and subsequently MSG#5 through MSG#7 arriving in order at the first shared queue (1220.1). At this time, the selector (1300) can determine priority information in the order of arrival time as described above, but as another embodiment, priority information can be determined according to the size of the queue. Here, the size of the queue refers to the number of messages waiting in each queue.
[0128] That is, the selector (1300) can transmit messages to the server (200) in order of the largest queue size from the end of each queue. As shown in FIG. 10, since the first shared queue (1220.1) has the largest size, MSG#1 is transmitted first to the first server (200.1), then MSG#5 of the first shared queue (1220.1), which has the next largest queue size, is transmitted to the second server (200.2) or the third server (200.3), and then MSG#6 of the first shared queue (1220.1) or MSG#3 of the second shared queue (1220.2) can be transmitted to the third server (200.3). FIG. 10 illustrates an embodiment in which MSG#6 is transmitted to the third server (200.3). In this way, even though MSG#2 arrives at the queue before MSG#5, if priority information is determined according to the size of the queue, MSG#5 can be sent to the server (200) before MSG#2.
[0130] As illustrated in FIG. 11, according to one embodiment of the present invention, the queue group (1200) may further include an emergency queue (1230). The emergency queue (1230) is a queue where messages that must be processed with the highest priority are waiting, and messages such as emergency disaster text messages may be waiting. The emergency queue (1230) may correspond to a dedicated queue (1210) or a shared queue (1220), and the emergency queue (1230) illustrated in FIG. 11 corresponds to a shared queue (1220).
[0131] Specifically, the filter module (1100) can distribute messages transmitted from a specific IP or messages containing specific message information to the emergency queue (1230). For example, messages such as emergency messages transmitted by the Ministry of Public Administration and Security or air raid warnings transmitted by the Ministry of National Defense can be assigned to the emergency queue (1230) to be processed with the highest priority. In the case of processing for the entire nation, the emergency queue (1230) can be operated as a shared queue (1220) to allow the message to be transmitted to the server (200) and processed more quickly.
[0132] As illustrated in FIG. 11, when MSG#1 to #4 are sequentially waiting in the first shared queue (1220.1) and the second shared queue (1220.2) and MSG#5 and MSG#6 are waiting in the emergency queue (1230), the selector (1300) transmits MSG#5 to the first server (200.1) with the highest priority among MSG#1, MSG#2, and MSG#5 located at the rear end of each of the first shared queue (1220.1), the second shared queue (1220.2), and the emergency queue (1230), respectively, and then transmits MSG#6, which is waiting in the emergency queue (1230), to the second server (200.2) or the third server (200.3) (in FIG. 11, an embodiment in which MSG#6 is transmitted to the second server (200.2) is shown), and thereafter, in the order entered into the queue MSG#1 and MSG#2 are transmitted to the server (200). In this way, prioritizing the processing of messages with a specific IP or specific message information can be used as a third processing priority rule.
[0134] In the description of FIGS. 9 to 11 above, several embodiments in which priority information is determined by a single factor have been described for the sake of convenience of understanding, but the present invention is not limited to the above description. In the actual present invention, it is preferable to determine priority information by considering multiple factors in combination in addition to the above factor. As an embodiment of the present invention, priority information can be determined by effectively considering multiple factors using a learned artificial intelligence model.
[0136] FIG. 12 schematically illustrates the internal configuration of a computing device according to one embodiment of the present invention.
[0138] The reverse proxy (1000) mentioned in the description of FIG. 1 may include components of the computing device (11000) illustrated in FIG. 12, which will be described later.
[0140] As illustrated in FIG. 12, the computing device (11000) may include at least one processor (11100), memory (11200), peripheral interface (11300), input / output subsystem (I / O subsystem) (11400), power circuit (11500), and communication circuit (11600).
[0142] Specifically, the memory (11200) may include, for example, high-speed random access memory, magnetic disk, SRAM, DRAM, ROM, flash memory, or non-volatile memory. The memory (11200) may include software modules, instruction sets, or various other data required for the operation of the computing device (11000).
[0144] At this time, access to the memory (11200) from other components, such as the processor (11100) or the peripheral device interface (11300), can be controlled by the processor (11100). The processor (11100) may be composed of a single or multiple units and may include processors in the form of GPUs and TPUs to improve computational processing speed.
[0146] The above peripheral device interface (11300) can connect input and / or output peripheral devices of the computing device (11000) to the processor (11100) and the memory (11200). The processor (11100) can perform various functions for the computing device (11000) and process data by executing a software module or instruction set stored in the memory (11200).
[0148] The input / output subsystem (11400) may connect various input / output peripheral devices to the peripheral device interface (11300). For example, the input / output subsystem (11400) may include a controller for connecting peripheral devices such as a monitor, keyboard, mouse, printer, or, if necessary, a touchscreen or sensor to the peripheral device interface (11300). According to another aspect, the input / output peripheral devices may be connected to the peripheral device interface (11300) without passing through the input / output subsystem (11400).
[0150] The power circuit (11500) may supply power to all or part of the components of the terminal. For example, the power circuit (11500) may include one or more power sources such as a power management system, a battery or alternating current (AC), a charging system, a power failure detection circuit, a power converter or inverter, a power status indicator, or any other components for power generation, management, and distribution.
[0152] The communication circuit (11600) may enable communication with another computing device using at least one external port. Alternatively, as described above, the communication circuit (11600) may enable communication with another computing device by including an RF circuit and transmitting and receiving an RF signal, also known as an electromagnetic signal, as needed.
[0154] The embodiment of FIG. 12 is merely an example of the computing device (11000), and the computing device (11000) may have some components shown in FIG. 12 omitted, additional components not shown in FIG. 12 added, or a configuration or arrangement that combines two or more components. For example, a computing device for a communication terminal in a mobile environment may include a touchscreen or sensors in addition to the components shown in FIG. 12, and the communication circuit (11600) may include a circuit for RF communication of various communication methods (Wi-Fi, 3G, LTE, 5G, 6G, Bluetooth, NFC, Zigbee, etc.). The components that can be included in the computing device (11000) may be implemented as hardware, software, or a combination of both hardware and software, including one or more integrated circuits specialized for signal processing or applications.
[0156] Methods according to embodiments of the present invention may be implemented in the form of program instructions that can be executed through various computing devices and recorded on a computer-readable medium. In particular, the program according to the present embodiment may be configured as a PC-based program or an application dedicated to a mobile terminal. An application to which the present invention is applied may be installed on a user terminal through a file provided by a file distribution system. For example, the file distribution system may include a file transmission unit (not shown) that transmits the file upon a request from the user terminal.
[0158] The device described above may be implemented as a hardware component, a software component, and / or a combination of a hardware component and a software component. For example, the device and components described in the embodiments may be implemented using one or more general-purpose or special-purpose computers, such as, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA), a programmable logic unit (PLU), a microprocessor, or any other device capable of executing and responding to instructions. The processing unit may execute an operating system (OS) and one or more software applications executed on said operating system. Additionally, the processing unit may access, store, manipulate, process, and generate data in response to the execution of the software. For ease of understanding, the processing unit may be described as being used as a single unit, but those skilled in the art will understand that the processing unit may include multiple processing elements and / or multiple types of processing elements. For example, the processing unit may include multiple processors or one processor and one controller. In addition, other processing configurations, such as parallel processors, are also possible.
[0160] Software may include computer programs, code, instructions, or a combination of one or more of these, and may configure a processing unit to operate as desired or command the processing unit independently or collectively. Software and / or data may be permanently or temporarily embodied in any type of machine, component, physical device, virtual equipment, computer storage medium or device, or transmitted signal wave in order to be interpreted by the processing unit or to provide instructions or data to the processing unit. Software may be standardized and stored or executed in a standardized manner on a networked computing device. Software and data may be stored on one or more computer-readable recording media.
[0162] The method according to the embodiment may be implemented in the form of program instructions that can be executed through various computer means and recorded on a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, etc., either alone or in combination. The program instructions recorded on the medium may be those specifically designed and configured for the embodiment, or they may be those known and available to those skilled in the art of computer software. Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tapes; optical recording media such as CD-ROMs and DVDs; magneto-optical media such as floptical disks; and hardware devices specifically configured to store and execute program instructions, such as ROM, RAM, and flash memory. Examples of program instructions include machine code, such as that generated by a compiler, as well as high-level language code that can be executed by a computer using an interpreter, etc. The hardware devices described above may be configured to operate as one or more software modules to perform the operation of the embodiment, and vice versa.
[0164] According to one embodiment of the present invention, two or more different servers can simultaneously access one or more shared queues, and the order in which messages are processed is actively determined by a selector, thereby enabling the effect of improving message processing flexibility and efficiency at the server end.
[0165] According to one embodiment of the present invention, the effect of determining the message to be processed by the server that sent the message reception request based on message information without the client being involved with the server can be achieved.
[0166] According to one embodiment of the present invention, the actual IP address and location of the server can be hidden, thereby providing the effect of preventing direct attacks from the outside.
[0167] According to one embodiment of the present invention, when destination information of a message transmitted by a client is not specified, the destination information or queue information of the message is set based on a pre-configured distribution rule and the message information of the message, and the message is connected to a queue connected to a consumer according to the destination information, or the message is delivered to a queue corresponding to the queue information, thereby enabling multiple messages to be processed quickly.
[0169] Although the embodiments have been described above with reference to limited examples and drawings, those skilled in the art can make various modifications and variations from the description above. For example, suitable results can be achieved even if the described techniques are performed in a different order than described, and / or the components of the described system, structure, device, circuit, etc. are combined or assembled in a form different from described, or replaced or substituted by other components or equivalents.
[0170] Therefore, other implementations, other embodiments, and equivalents to the claims also fall within the scope of the claims set forth below.
Claims
Claim 1 An adaptive reverse proxy using a shared queue connected to multiple clients and multiple servers, comprising: a filter module that determines the queue to which a message is to be distributed according to destination information of a message received from the client; a queue group including a queue where a message received from the client is waiting; and a selector connected to two or more of the queues included in the queue group, which causes a message waiting in the connected queue to be delivered to a server; wherein the queue group includes a dedicated queue connected to a single server and transmitting messages only to that server; and a shared queue connected to two or more servers and capable of transmitting messages to one or more of the connected servers; and wherein the selector determines priority information for each message located at the end of the queue of each of the two or more connected queues, and causes messages to be delivered from the corresponding queue to the server in order of highest priority, and selects a message to be delivered to the server that sent a message reception request to the reverse proxy according to the priority information. Claim 2 In claim 1, each server included in the plurality of servers is an adaptive reverse proxy that can be connected to one dedicated queue, connected to one shared queue, or connected to one or more dedicated queues and one or more shared queues. Claim 3 An adaptive reverse proxy according to claim 1, wherein the filter module, when the received message includes destination information, transmits the message to a queue connected to a server according to the destination information, and when the received message does not include destination information, sets the destination information or queue information of the message based on a preset distribution rule and message information included in the message, and then transmits the message to a queue connected to a server according to the destination information or transmits the message to a queue corresponding to the queue information. Claim 4 An adaptive reverse proxy according to claim 1, wherein the queue group includes a first dedicated queue, a first shared queue, and a second shared queue, and the plurality of servers includes a first server capable of receiving messages from the first dedicated queue, the first shared queue, and the second shared queue, and the selector is located between the first shared queue and the second shared queue and the first server, and transmits messages to the first server in order of highest priority among messages waiting in each of the first shared queue and the second shared queue, and the first server is capable of receiving messages transmitted from the selector or the first dedicated queue. Claim 5 An adaptive reverse proxy according to claim 1, wherein the priority information is determined by the selector based on at least one of: the time each message arrives at the queue; a processing priority rule according to the message information of each message; and the size of the queue in which each message is waiting. Claim 6 An adaptive reverse proxy according to claim 1, wherein, by the selector, the priority information is determined based on at least one of: the processing time of a server capable of receiving each message; and the current state of a server capable of receiving each message. Claim 7 The adaptive reverse proxy of claim 1, wherein the filter module does not transmit the message to a queue connected only to the specific server, even if the destination information of the received message corresponds to the specific server, when it receives a notification that message processing is impossible from the specific server connected to the reverse proxy or fails to receive a response signal for message reception from the specific server. Claim 8 An adaptive reverse proxy according to claim 1, wherein the queue group includes a first shared queue and a second shared queue, and the plurality of servers include a first server and a second server capable of receiving messages from the first shared queue and the second shared queue, and the selector determines priority information of a plurality of messages waiting in the first shared queue and the second shared queue, and transmits each message to the first server and the second server according to the priority of each message, and if the determined priority information is the same, determines the message to be transmitted to each server using a round-robin scheduling method. Claim 9 An adaptive reverse proxy according to claim 1, wherein the plurality of clients and the reverse proxy are connected via a public internet network, and the filter module distributes a first message to a first queue included in the queue group, and then, upon receiving a second message canceling the processing of the first message, distributes the second message to the first queue. Claim 10 A method for operating an adaptive reverse proxy using a shared queue, wherein the reverse proxy is connected to a plurality of clients and a plurality of servers, and in a filter module, a step of determining a queue to which a message is to be distributed according to destination information of a message received from the client; in a queue group, a step of receiving a message transmitted from the filter module; and in a selector, a step of ensuring that a message waiting in a queue connected to the selector is delivered to a server; wherein the queue group includes a dedicated queue connected to a single server and transmitting messages only to that server; and a shared queue connected to two or more servers and capable of transmitting messages to one or more of the connected servers; and wherein the selector determines priority information for each message located at the end of the queue of each of the two or more connected queues, and then transmits messages from the corresponding queue to the server in order of highest priority, and selects a message to be delivered to the server that sent a message reception request to the reverse proxy according to the priority information. Claim 11 A method of operating an adaptive reverse proxy according to claim 10, wherein each server included in the plurality of servers may be connected to one dedicated queue, connected to one shared queue, or connected to one or more dedicated queues and one or more shared queues. Claim 12 A method of operating an adaptive reverse proxy according to claim 10, wherein the filter module does not transmit the message to a queue connected only to the specific server, even if the destination information of the received message corresponds to the specific server, when it receives a notification that message processing is impossible from a specific server connected to the reverse proxy or fails to receive a response signal for message reception from the specific server. Claim 13 A computer-readable recording medium for implementing a method of operating an adaptive reverse proxy using a shared queue, performed in a computing system comprising one or more processors and one or more memories, wherein the reverse proxy is connected to a plurality of clients and a plurality of servers and comprises a filter module; a queue group; and a selector; wherein the computer-readable recording medium comprises computer-executable instructions that cause the computing system to perform the following steps, the following steps include: a step in the filter module of determining a queue to which a message is to be distributed according to destination information of a message received from the client; a step in the queue group of receiving a message transmitted from the filter module; and a step in the selector of causing a message waiting in a queue connected to the selector to be transmitted to a server; wherein the queue group comprises a dedicated queue connected to a single server and transmitting messages only to that server; A computer-readable recording medium comprising: a shared queue connected to two or more servers and capable of transmitting messages to one or more of the connected servers; wherein the selector determines priority information for each message located at the end of the queue in each of the two or more connected queues, and transmits messages from the corresponding queue to the server in order of highest priority, and selects a message to be transmitted to the server that sent a message reception request to the reverse proxy according to the priority information. Claim 14 A computer-readable recording medium according to claim 13, wherein each server included in the plurality of servers may be connected to one dedicated queue, connected to one shared queue, or connected to one or more dedicated queues and one or more shared queues. Claim 15 A computer-readable recording medium according to claim 13, wherein the filter module does not transmit the message to a queue connected only to the specific server, even if the destination information of the received message corresponds to the specific server, when it receives a notification that message processing is impossible from the specific server connected to the reverse proxy or fails to receive a response signal for message reception from the specific server.
