The Message Queuing Method, System, And Computer-Readable Recording Medium For Actively Processing Multiple Messages

The message queuing system enhances processing efficiency by using shared and dedicated queues with priority-based message delivery, ensuring messages are processed efficiently even if a consumer fails, thereby improving system resilience and flexibility.

KR1020260161986APending Publication Date: 2026-11-10TMAXSOFT
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
KR1020250058022
Authority / Receiving Office
KR · KR
Patent Type
Applications
Current Assignee / Owner
Filing Date
2025-05-02
Publication Date
2026-11-10

AI Technical Summary

Technical Problem

Existing message queue systems face inefficiencies when a specific consumer fails, as messages assigned to that consumer cannot be processed by other consumers, leading to processing delays and inefficiencies.

Method used

A message queuing method that utilizes a shared queue and dedicated queue system, determining priority information for each message, and delivering messages to consumers based on this priority, allowing multiple consumers to access shared queues and ensuring messages are processed efficiently even if a specific consumer fails.

Benefits of technology

Improves message processing flexibility and efficiency by enabling multiple consumers to process messages simultaneously, preventing delays, and enhancing system resilience against consumer failures.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure PAT00001_ABST
    Figure PAT00001_ABST
Patent Text Reader

Abstract

The present invention relates to a message queuing method, system, and computer-readable recording medium for actively processing multiple messages, and more specifically, to a message queuing method, system, and computer-readable recording medium for actively processing multiple messages, wherein message queuing is performed between multiple producers who generate messages and multiple consumers who consume messages, and more specifically, by operating a shared queue and a dedicated queue, determining priority information for each message waiting in the multiple queues, and delivering the message to the consumer to consume each message according to the determined priority information, the message processing speed of the entire system is improved, and a situation occurs where a specific consumer is unable to process messages is flexibly handled.
Need to check novelty before this filing date? Find Prior Art

Description

Technology Field

[0001] The present invention relates to a message queuing method, system, and computer-readable recording medium for actively processing multiple messages, and more specifically, to a message queuing method, system, and computer-readable recording medium for actively processing multiple messages, wherein message queuing is performed between multiple producers who generate messages and multiple consumers who consume messages, and more specifically, by operating a shared queue and a dedicated queue, determining priority information for each message waiting in the multiple queues, and delivering the message to the consumer to consume each message according to the determined priority information, the message processing speed of the entire system is improved, and a situation occurs where a specific consumer is unable to process messages is flexibly handled. Background Technology

[0003] A message queue is an asynchronous communication method for exchanging data between processes or programs. It refers to a queue-type system that temporarily stores messages sent by a producer and acts as an intermediary for consumers to retrieve them. It is an asynchronous communication method where the message queue maintains and delivers data even when the producer and consumer are not operating simultaneously. It is characterized by its ability to reduce direct dependencies between applications and increase flexibility. Such message queue systems are used to guarantee the reliability of data delivery, distribute workloads and coordinate processing speeds, and support scalable and modular application architectures.

[0004] More specifically, a message is data that a producer intends to deliver to a consumer, and is composed in the form of JSON, XML, or Binary, and a queue is a data structure that temporarily stores messages and operates in a FIFO (First In, First Out) manner. A producer is an entity that creates messages and sends them to a queue, and examples of producers can be order creation systems and IoT sensors, while a consumer is an entity that retrieves messages from a queue and processes them, and examples of consumers can be payment processing systems and data analysis engines.

[0005] Such message queue systems are used in various technological fields, such as email services for password resets or sending membership confirmation emails; image processing technology that performs asynchronous optimization after uploading large images; financial transaction technology requiring high security and accuracy; and real-time reservation systems such as flight bookings.

[0006] Meanwhile, in such message queue systems, if the connection between a specific consumer and the message queue system is severed due to reasons such as a long computational operation or a failure, a problem arises where requests in the queue assigned to that consumer cannot be processed by other consumers. In other words, even though consumers other than the failed consumer are capable of handling the requests in the queue, they cannot be processed if requests have already been distributed to the queue of the failed consumer. Therefore, there is a need for technology to resolve this issue. The problem to be solved

[0008] The present invention aims to provide a message queuing method, system, and computer-readable recording medium for actively processing multiple messages, and more specifically, to perform message queuing between multiple producers who generate messages and multiple consumers who consume messages, and more specifically, to operate a shared queue and a dedicated queue, simultaneously determine priority information for each message waiting in the multiple queues, and deliver the message to the consumer to consume each message according to the determined priority information, thereby improving the message processing speed of the entire system and flexibly responding to a situation where a specific consumer becomes unable to process messages. means of solving the problem

[0010] In order to solve the above problems, an embodiment of the present invention provides a message queuing method for actively processing a plurality of messages, which is performed in a computing system comprising one or more memories and one or more processors, comprising: a message receiving step of receiving messages from a plurality of producers; a queue determination step of determining a queue to which a message is to be distributed according to destination information of each received message; a message distribution step of distributing messages to a queue determined for each message; a message selection step of determining priority information for each message waiting in a queue of each of a plurality of queues and selecting messages to be transmitted to consumers to consume each message in order of highest priority; and a message transmission step of transmitting the selected messages to consumers corresponding to each message; wherein the plurality of queues include a dedicated queue capable of transmitting messages to only a single consumer; and a shared queue capable of transmitting messages to a plurality of consumers; and wherein the message transmission step transmits a message to the consumer who transmitted the message reception request based on the priority information when a message reception request is received from a consumer.

[0011] In one embodiment of the present invention, the computing system mediates a plurality of messages received from a plurality of producers to a plurality of consumers, wherein each of the plurality of consumers may receive a message from one dedicated queue, receive a message from one shared queue, or receive a message from one or more dedicated queues and one or more shared queues.

[0012] In one embodiment of the present invention, the message selection step includes a priority determination step for determining priority information of each message waiting in two or more queues, and the priority determination step may determine priority information of each message by considering at least one of the time when each message arrived at the queue; a processing priority rule based on message information or message body content of each message; the size of the queue in which each message is waiting; the processing capacity of a consumer capable of receiving each message; and the current state of a consumer capable of receiving each message.

[0013] In one embodiment of the present invention, the queue determination step may, if the received message includes destination information, transmit the message to a queue connected to a consumer according to the destination information, and if the received message does not include destination information, set the destination information of the message or the queue information of the message based on a pre-set distribution rule and message information included in the message, and transmit the message to a queue connected to a consumer according to the destination information or transmit the message to a queue corresponding to the queue information.

[0014] In one embodiment of the present invention, the plurality of queues includes a first dedicated queue, a first shared queue, and a second shared queue, and the plurality of consumers includes a first consumer capable of consuming messages transmitted from the first dedicated queue, the first shared queue, and the second shared queue, and the message transmission step transmits messages to the first consumer in order of highest priority among messages waiting in each of the first dedicated queue, the first shared queue, and the second shared queue, and messages transmitted from the first dedicated queue, the first shared queue, and the second shared queue can be processed in the order they arrive at the first consumer.

[0015] In one embodiment of the present invention, the message distribution step may not deliver the message to a queue connected only to the specific consumer, even if the destination information or queue information of the received message corresponds to the specific consumer, when the computing system receives a notification that message processing is impossible from the specific consumer or fails to receive a response signal for receiving a message from the specific consumer.

[0016] In one embodiment of the present invention, the plurality of queues includes a first shared queue and a second shared queue, and the plurality of consumers include a first consumer and a second consumer capable of receiving messages from the first shared queue and the second shared queue, and the message selection step 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 consumer and the second consumer according to the priority of each message, and if the determined priority information is the same, the message to be transmitted to each consumer can be determined by a round-robin scheduling method.

[0017] In order to solve the above problems, one embodiment of the present invention provides a message queuing system that includes one or more memories and one or more processes and actively processes a plurality of messages, comprising: a message receiving module that receives messages from a plurality of producers; a queue determining module that determines a queue to which a message is to be distributed according to destination information of each received message; a message distribution module that distributes messages to a queue determined for each message; a message selection module that determines priority information for each message waiting in a queue of each of a plurality of queues and selects messages to be transmitted to consumers to consume each message in order of highest priority; and a message transmission module that transmits the selected messages to consumers corresponding to each message; wherein the plurality of queues include a dedicated queue capable of transmitting messages to only a single consumer; and a shared queue capable of transmitting messages to a plurality of consumers; and wherein the message transmission module, when receiving a message reception request from a consumer, transmits a message to the consumer who transmitted the message reception request based on the priority information.

[0018] In one embodiment of the present invention, the message queuing system mediates a plurality of messages received from a plurality of producers to a plurality of consumers, wherein each of the plurality of consumers may receive a message from one dedicated queue, receive a message from one shared queue, or receive a message from one or more dedicated queues and one or more shared queues.

[0019] In one embodiment of the present invention, if the message distribution module receives a notification that message processing is impossible from a specific consumer in the message queuing system, or fails to receive a response signal for receiving a message from a specific consumer, it may not deliver the message to a queue connected only to the specific consumer, even if the destination information or queue information of the received message corresponds to the specific consumer.

[0020] To solve the above problems, in one embodiment of the present invention, a computer-readable recording medium for implementing a message queuing method for actively processing a plurality of messages, which is performed in a computing system comprising one or more processors and one or more memories, wherein the computer-readable recording medium comprises computer-executable instructions that cause the computing system to perform the following steps, the following steps comprising: a message receiving step of receiving messages from a plurality of producers; a queue determination step of determining a queue to which a message is to be distributed according to destination information of each received message; a message distribution step of distributing messages to the determined queue for each message; a message selection step of determining priority information for each message waiting in the queue of each of the plurality of queues and selecting messages to be transmitted to consumers to consume each message in order of highest priority; and a message transmission step of transmitting the selected messages to consumers corresponding to each message; wherein the plurality of queues comprises a dedicated queue capable of transmitting messages to only a single consumer; The computer-readable recording medium includes a shared queue capable of transmitting messages to multiple consumers, wherein the message transmission step transmits a message to the consumer who transmitted the message reception request based on the priority information when a message reception request is received from a consumer.

[0021] In one embodiment of the present invention, the computing system mediates a plurality of messages received from a plurality of producers to a plurality of consumers, wherein each of the plurality of consumers may receive a message from one dedicated queue, receive a message from one shared queue, or receive a message from one or more dedicated queues and one or more shared queues.

[0022] In one embodiment of the present invention, the message distribution step may not deliver the message to a queue connected only to the specific consumer, even if the destination information or queue information of the received message corresponds to the specific consumer, when the computing system receives a notification that message processing is impossible from the specific consumer or fails to receive a response signal for receiving a message from the specific consumer. Effects of the invention

[0024] According to one embodiment of the present invention, two or more different consumers can simultaneously access one or more shared queues, and by actively determining the order in which messages are processed in a message selection module, the effect of improving message processing flexibility and efficiency in a consumer group can be achieved.

[0025] According to one embodiment of the present invention, the effect of determining the message to be processed for the consumer who sent the message reception request based on message information without the producer being involved with the consumer can be achieved.

[0026] According to one embodiment of the present invention, the actual IP address and location of the consumer can be hidden, thereby providing the effect of preventing direct attacks from the outside.

[0027] According to one embodiment of the present invention, when destination information of a message transmitted by a generator is not specified, the destination information or queue information of the message is set based on a pre-configured distribution rule and 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

[0029] FIG. 1 schematically illustrates the internal configuration of a message queuing system according to one embodiment of the present invention. FIG. 2 schematically illustrates the process of a message generated by a generator according to one embodiment of the present invention being delivered to a consumer through a message queuing system. FIG. 3 schematically illustrates the connection configuration of a plurality of queues included in a message queuing system according to one embodiment of the present invention. FIG. 4 schematically illustrates the connection configuration of a plurality of queues included in a message queuing system according to another embodiment of the present invention. FIG. 5 schematically illustrates a configuration using a single message queue according to an embodiment of the prior art. FIG. 6 schematically illustrates a configuration for distributing queues according to destination information in a message distribution module according to an embodiment of the present invention. FIG. 7 schematically illustrates a step of distributing queues based on whether there is destination information of a message received in a message distribution module according to an embodiment of the present invention. FIG. 8 schematically illustrates a process in which a message to be transmitted to each consumer is determined according to the arrival time of each message waiting in a plurality of shared queues by a message selection module according to an embodiment of the present invention. FIG. 9 schematically illustrates a process in which a message to be transmitted to each consumer 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. 10 schematically illustrates a process in which a message to be transmitted to each consumer 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. 11 schematically illustrates the internal configuration of a computing device according to one embodiment of the present invention. Specific details for implementing the invention

[0030] 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.

[0032] 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.

[0033] 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.

[0034] 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.

[0035] 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.

[0036] 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.

[0037] Meanwhile, the "generator" mentioned below may be implemented as a computer or portable terminal capable of connecting to a consumer or other terminal through 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 guarantee 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.

[0039] FIG. 1 schematically illustrates the internal configuration of a message queuing system (1000) according to one embodiment of the present invention, and FIG. 2 schematically illustrates the process of a message generated by a generator (100) according to one embodiment of the present invention being delivered to a consumer (200) through the message queuing system (1000).

[0041] As illustrated in FIGS. 1 and 2, a message queuing system (1000) that actively processes a plurality of messages, comprising one or more memories and one or more processes, comprises: a message receiving module (1100) that receives messages from a plurality of producers (100); a queue determination module (1200) that determines a queue to which a message will be distributed according to destination information of each received message; a message distribution module (1300) that distributes messages to the queue determined for each message; a message selection module (1500) that determines priority information for each message waiting in the queue of each of the plurality of queues and selects messages to be transmitted to consumers (200) to consume each message in order of highest priority; and a message transmission module (1600) that transmits the selected messages to consumers (200) corresponding to each message; wherein the plurality of queues includes a dedicated queue (1410) capable of transmitting messages to only a single consumer (200); and a shared queue (1420) capable of transmitting messages to multiple consumers (200); wherein the message transmission module (1600), when it receives a message reception request from a consumer (200), transmits a message to the consumer (200) who sent the message reception request based on the priority information.

[0042] In addition, the plurality of generators (100) and the message queuing system (1000) can be connected via a public internet network.

[0044] Specifically, as illustrated in FIG. 1, a message queuing system (1000) for performing the message queuing method of the present invention comprises a message receiving module (1100); a queue determination module (1200); a message distribution module (1300); a queue group (1400); a message selection module (1500); a message transmission module (1600); a control module (1700); and a memory (1800), and corresponds to a computing system comprising one or more processors and one or more memories (1800). The above message queuing system (1000) performs the role of mediating between N (N is a natural number greater than or equal to 1) producers (100) and M (M is a natural number greater than or equal to 1) consumers (200), each producer (100) creates a message containing a specific request or information and transmits it to the message queuing system (1000), and the message queuing system (1000) transmits the message to a consumer (200) capable of receiving and processing the message.

[0045] The above message queuing system (1000) corresponds to an asynchronous communication method in which, upon receiving a message from a producer (100), a consumer (200) consumes the message later. Each of the multiple messages waiting in the above message queuing system (1000) is processed only once by a single consumer (200), and the producer (100) and the consumer (200) are characterized by operating independently. The message referred to in this specification means data transmitted between the producer (100) and the consumer (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] The message receiving module (1100) performs a message receiving step of receiving messages from a plurality of generators (100). In one embodiment of the present invention, the generator (100) and the message queuing system (1000) may be directly connected, but in another embodiment of the present invention, a network may be located between the generator (100) and the message queuing system (1000), and each generator (100) may transmit a message to the message queuing system (1000) through the network. In a preferred embodiment, the network may correspond to a public network such as the Internet.

[0048] The above-mentioned queue determination module (1200) performs a queue determination step to determine the queue to which the message will be distributed according to the destination information of each message received from the message receiving module (1100), and the above-mentioned message distribution module (1300) performs a message distribution step to distribute the message to the queue determined for each message. For example, in the case of a message such as an email sending request, it is preferable to distribute it to a queue connected to a consumer (200) that processes email services, and in the case of a message such as a flight reservation request, it is preferable to distribute it to a queue connected to a consumer (200) that processes real-time reservation services.

[0049] If these various requests are in a single message queue and then identified at the back end of the queue and distributed to each consumer (200), the computational load applied to the back end increases, which leads to inefficiency in message processing. However, the message queuing system (1000) of the present invention determines the message queue to which each message will be transmitted in the queue determination module (1200) before distributing messages to the message queue, and distributes the message to the determined message queue in the message distribution module (1300). At this time, the queue determination module (1200) can determine the message queue to which the message will be distributed according to the message information of each message and a pre-set distribution rule. Further explanation regarding this will be provided later in the description of FIGS. 6 and FIGS. 7.

[0050] The above-mentioned queue group (1400) includes a plurality of queues, and the plurality of queues may correspond to either a dedicated queue (1410) or a shared queue (1420). That is, as one embodiment of the present invention, the above-mentioned queue group (1400) may include only one or more dedicated queues (1410), as another embodiment of the present invention, may include only one or more shared queues (1420), and as yet another embodiment of the present invention, may include both one or more dedicated queues (1410) and one or more shared queues (1420). In implementing many-to-many (N:M) communication, the above-mentioned message queuing system (1000) may connect only the dedicated queue (1410) with a specific consumer (200), and may connect both the dedicated queue (1410) and the shared queue (1420) with a specific consumer (200) to enable flexible message processing. Messages waiting in each queue are delivered to the consumer (200) in order, starting from the last one.

[0051] The message selection module (1500) determines priority information for each message waiting in each queue of a plurality of queues, performs a message selection step of selecting messages to be sent to consumers (200) to consume each message in order of highest priority, and transmits the messages with determined priority information to the message transmission module (1600). The message transmission module (1600) performs a message transmission step of transmitting to consumers (200) a message received directly from the queue group (1400); or a message received from the message selection module (1500).

[0052] The above message selection step includes a priority determination step for determining priority information of each message waiting in two or more queues, and the priority determination step determines priority information of each message by considering at least one of the following: the time each message arrived at the queue; a processing priority rule based on the message information or message body content of each message; the size of the queue in which each message is waiting; the processing capacity of the consumer (200) capable of receiving each message; and the current state of the consumer (200) capable of receiving each message.

[0053] Referring to FIG. 3, if the message selection module (1500) determines the priority information of message #1 waiting in shared queue #1 (1420.1) as number 1 and the priority information of message #2 waiting in shared queue #2 (1420.2) as number 2, the message selection module (1500) can first transmit message #1 to consumer #2 (200.2) and then transmit message #2 to consumer #3 (200.3).

[0054] The message transmission module (1600) transmits a message waiting in a queue connected to the message selection module (1500) to a consumer (200). More specifically, the message transmission module (1600) can receive a copy, address value (pointer), or reference, etc., of a message waiting at the end of the connected queue from the queue and perform the function of transmitting the message to the consumer (200) who sent the message reception request. The message transmission module (1600) may further include a communication module capable of communicating with the consumer (200) connected to the message selection module (1500).

[0055] At this time, when the message selection module (1500) receives a pull request corresponding to a message reception request from a specific consumer (200), messages waiting in a plurality of queues connected to the specific consumer (200) are delivered to the specific consumer (200) according to priority information determined by the message selection module (1500).

[0056] The above message reception request may correspond to information that a consumer (200) directly requests from the message queuing system (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 consumer (200) to an external source or to the message queuing system (1000) may correspond to the message reception request, and as yet another embodiment of the present invention, when status information of the consumer (200) is transmitted to the message queuing system (1000) from equipment or devices other than the consumer (200), the transmitted status information may correspond to the message reception request. In this case, examples of the status information of the consumer (200) may correspond to information indicating that a message can be processed or is currently operating, and examples of other equipment or devices may correspond to a system capable of monitoring the status information of the consumer (200). In this way, a message reception request can be transmitted directly or indirectly from a consumer (200) to a message queuing system (1000), and a message selection module (1500) of the message queuing system (1000) that receives it causes a message waiting in a plurality of queues to be delivered to the corresponding consumer (200).

[0057] If the message queuing system (1000) fails to receive the aforementioned message reception request (pull request) from a specific consumer (200), or fails to receive an acknowledgment (ack) signal for message reception transmitted to the specific consumer (200), or receives a notification of message processing failure directly or indirectly from the specific consumer (200), the message queuing system (1000), more preferably, the message distribution module (1300) of the message queuing system (1000), does not deliver the message to a queue connected only to the specific consumer (200), even if the destination information of the received message corresponds to the specific consumer (200), thereby preventing the message from being unnecessarily delayed.

[0059] In conventional message queue technology, messages accumulated in the message queue were delivered to the consumer (200) mechanically (e.g., in the order of input time). However, when receiving messages from multiple producers (100) in multiple message queues, it is not easy to input them into the message queue in chronological order, and if a failure occurs in a specific consumer (200), a problem arises in which messages waiting in the distributed queue are not processed efficiently. The present invention aims to overcome the aforementioned problems by adding a message selection module (1500). The message selection module (1500) can determine priority information for each message based on the information of the message and the state of the consumer (200), and further explanation regarding this will be provided later in the description of FIGS. 8 to 10.

[0060] Additionally, the message queuing system (1000) includes one or more memories (1800) and one or more processors, and messages waiting in the message queue may be stored in the memory (1800). The memory (1800) and the control module (1700) control the operation of the aforementioned message receiving module (1100), message distribution module (1300), queue determination module (1200), queue group (1400), message selection module (1500), and message transmission module (1600), and it is preferable to also control the operation of configurations not shown in FIGS. 1 and 2.

[0061] In addition, according to one embodiment of the present invention, the memory (1800) 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 consumer (200) by considering a plurality of factors in the message selection module (1500), 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 the corresponding message by comprehensively considering message information, etc. of each connected message.

[0063] FIG. 3 schematically illustrates the connection configuration of a plurality of queues included in a message queuing system (1000) according to one embodiment of the present invention, and FIG. 4 schematically illustrates the connection configuration of a plurality of queues included in a message queuing system according to another embodiment of the present invention.

[0065] In summary, the following drawings omit the illustration of the queue determination module (1200), message receiving module (1100), and message transmitting module (1600) unless special explanation is required.

[0066] Additionally, for ease of understanding, FIG. 3 illustrates an example mediating three generators (100) and three consumers (200), and FIG. 4 illustrates an example mediating three generators (100) and two consumers (200); however, as previously mentioned, the actual number of mediating generators (100) and consumers (200) in the present invention is not limited.

[0067] Additionally, FIGS. 3 and 4 illustrate an embodiment in which three queues (one dedicated queue (1410.1) and two shared queues (1420.1 to 1420.2)) are connected to multiple consumers (200); however, in the actual present invention, multiple queues (1400) and multiple consumers (200) may be connected directly or indirectly, and in this case, the number of queues and the number of consumers (200) may be the same or different. Furthermore, the number of dedicated queues (1410) and shared queues (1420) connected to multiple consumers (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 help understand the technical features of the present invention.

[0069] Specifically, the message queuing system (1000) of the present invention is characterized by the technical feature of including one or more dedicated queues (1410) and one or more shared queues (1420), as illustrated in FIG. 3. Meanwhile, as one embodiment of the present invention, the message queuing system (1000) may include only one or more dedicated queues (1410), and as another embodiment of the present invention, the message queuing system (1000) may include only one or more shared queues (1420). However, the above message queuing system (1000) is characterized in that, in implementing many-to-many communication, only a dedicated queue (1410) can be connected to a specific consumer (200), a shared queue (1420) and a message selection module (1500) can be connected to a specific consumer (200), and a dedicated queue (1410) and a shared queue (1420) can be simultaneously connected to a specific consumer (200) through the message selection module (1500) to enable flexible message processing.

[0070] More specifically, the dedicated queue (1410) is a message queue connected to a single consumer (200) and transmits messages only to that consumer (200). In FIG. 3, the queue (dedicated queue #1, 1410.1) connected to consumer #1 (200.1) corresponds to the dedicated queue (1410). That is, it is desirable for messages that can only be processed by the consumer (200) connected to it to be accumulated in the queue of the dedicated queue (1410), and this is done under the judgment of the queue determination module (1200) and the message distribution module (1300). Meanwhile, FIG. 3 illustrates an embodiment in which the message selection module (1500) is not connected to the dedicated queue #1 (1410.1), but according to another embodiment of the present invention, the dedicated queue #1 (1410.1) may also be connected directly or indirectly to the message selection module (1500).

[0071] The above shared queue (1420) is a message queue connected to two or more consumers (200) and capable of selectively transmitting messages to one or more of the connected consumers (200). In FIG. 3, it corresponds to a queue (shared queue #1 and shared queue #2, 1420.1 and 1420.2) connected to consumers #2 (200.2) and consumers #3 (200.3). That is, a message waiting in the shared queue (1420) can be transmitted to one or more of the one or more consumers (200) connected to the shared queue (1420), and the message to be transmitted to each consumer (200) is determined by the message selection module (1500).

[0073] As described above, the greatest technical feature of the present invention is that the message queuing system (1000) of the present invention, even if the creator (100) does not perform any communication with the consumer (200), allows messages transmitted from multiple creators (100) to be processed as quickly as possible. This is achieved by the queue determination module (1200) and the message distribution module (1300) actively distributing multiple messages to a specific queue, and by the message selection module (1500) actively determining that multiple messages can be transmitted to a specific consumer (200). Through this feature, security within the consumer group (200) can be enhanced by preventing contact between the consumer group (200) and the outside world. Furthermore, from the perspective of the operator running the message queuing system (1000), the ability to receive messages from an unspecified number of creators (100) can be achieved, thereby providing the effect of high business potential.

[0075] Meanwhile, FIG. 4 illustrates the internal configuration of a message queuing system (1000) according to an embodiment different from the embodiment mentioned in the description of FIG. 3.

[0076] Specifically, according to the embodiment, as illustrated in FIG. 4, the message selection module (1500) of the present invention does not directly receive a message from a dedicated queue (1410) or a shared queue (1420) and deliver it directly to a consumer (200), but rather, when connected to a plurality of consumers (200) and a plurality of queues (dedicated queue (1410) or shared queue (1420)), it can deliver messages from the corresponding queue to the specific consumer (200) in order of highest priority according to the priority information of the message at the end of each of the plurality of queues (1400) connected to the specific consumer (200).

[0077] In addition, as an embodiment of the present invention, the message queuing system (1000) may not include only one message selection module (1500) as shown in FIG. 3, but as shown in FIG. 4, each of two or more message selection modules (1500) may be positioned at the front of each of a plurality of consumers (200) connected to the message queuing system (1000), so that messages may be delivered to the corresponding consumers (200) according to priority from a plurality of queues (1400) connected to the corresponding consumers (200).

[0078] For example, Consumer #1 (200.1) illustrated in FIG. 4 is connected to a dedicated queue #1 (1410.1), a shared queue #1 (1420.1), and a shared queue #2 (1420.2). When Message Selection Module #1 (1500.1) receives a request to receive a message from Consumer #1 (200.1), messages waiting in the dedicated queue #1 (1410.1), the shared queue #1 (1420.1), and the shared queue #2 (1420.2) are delivered to Consumer #1 (200.1) according to priority information determined by Message Selection Module #1 (1500.1).

[0079] Additionally, Consumer #2 (200.2) illustrated in FIG. 4 is connected to Shared Queue #1 (1420.1) and Shared Queue #2 (1420.2), and when Message Selection Module #2 (1500.2) receives a request to receive a message from Consumer #2 (200.2), messages waiting in Shared Queue #1 (1420.1) and Shared Queue #2 (1420.2) are delivered to Consumer #2 (200.2) according to priority information determined by Message Selection Module #2 (1500.2).

[0080] As such, the message selection module (1500) of the present invention is characterized by the technical feature that a message waiting in a dedicated queue (1410) or a shared queue (1420) connected to the plurality of consumers (200) at the front end of each of the plurality of consumers (200) is delivered to the consumer (200) according to priority information. In addition, according to one embodiment of the present invention, as shown in FIG. 3, the message selection module (1500) may receive a message directly from the plurality of queues (1400) and deliver it to the consumer (200); however, according to another embodiment of the present invention, as shown in FIG. 4, the message selection module (1500) may be indirectly connected to the plurality of queues (1400) and the plurality of consumers (200) so that a message waiting in the plurality of queues (1400) can be appropriately delivered to the consumer (200).

[0082] FIG. 5 schematically illustrates a configuration using a single message queue according to an embodiment of the prior art.

[0084] Specifically, in a conventional message queue system, multiple creators (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 consumer (200). At this time, the message number shown in FIG. 5 represents the chronological order in which each creator (100) creates a message and sends it to the message queue. As shown in FIG. 5, creator #1 (100.1) first creates message #1 and sends it to the queue, and immediately after, creator #2 (100.2) creates message #2 and sends it to the queue, and the message queue receives it and stores it in a queue.

[0085] Meanwhile, in the case of this conventional technology, messages are accumulated in a message queue in the order in which multiple generators (100) transmit messages, and messages are transmitted sequentially to consumers (200). However, in most cases, as illustrated in FIG. 5, the order in which messages are accumulated in the message queue does not match the order in which each generator (100) transmits messages. This unintended situation worsens as the number of generators (100), message queues, and consumers (200) increases.

[0086] To prevent such a situation and to improve the efficiency of message processing, the inventor of the present invention uses a queue group (1400) including a dedicated queue (1410) and a shared queue (1420), and utilizes a queue determination module (1200), a message distribution module (1300), and a message selection module (1500) to appropriately distribute messages according to preset rules or conditions. Below, through various embodiments, the process of distributing messages to queues or selecting messages to be transmitted to consumers (200) will be described.

[0088] FIG. 6 schematically illustrates a configuration for distributing queues according to destination information in a message distribution module (1300) according to an embodiment of the present invention, and FIG. 7 schematically illustrates a step of distributing queues according to the presence or absence of destination information of a received message in a message distribution module (1300) according to an embodiment of the present invention.

[0090] In summary, for ease of understanding, the message numbers shown in FIGS. 6 to 10 represent the chronological order in which messages are transmitted to the queue from the message distribution module (1300). For example, MSG#1 represents the first message transmitted from the message distribution module (1300), and MSG#4 represents the fourth message transmitted from the message distribution module (1300). That is, messages with smaller sequence numbers are transmitted to the queue before messages with larger sequence numbers.

[0092] As illustrated in FIGS. 6 and 7, the queue determination step transmits the message to a queue connected to a consumer (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 connects the message to a queue connected to a consumer according to the destination information, or transmits the message to a queue corresponding to the queue information.

[0093] Additionally, the above queue determination step distributes the first message to the first queue included in the plurality of queues, and when a second message canceling the processing of the first message is received, distributes the second message to the first queue.

[0095] Schematically, FIG. 7 illustrates filter logic performed in the queue determination step of the present invention, and said filter logic may correspond to an algorithm that operates when the queue determination module (1200) is driven.

[0097] Specifically, the message distribution module (1300) distributes each message to a suitable queue according to the destination information of each message received from a plurality of producers (100). The destination information includes information related to a consumer (200) that processes the message. For example, when producer A (100) creates and transmits message A, the IP address of consumer A (200) that processes message A can be included in the header of message A and transmitted to the message receiving module (1100), and the message distribution module (1300) transmits message A to a specific message queue by referencing the IP address included in the header of message A.

[0098] Meanwhile, as another example, if Message A is a message requesting email transmission, then Message A must be processed by Consumer A (200) capable of transmitting email. That is, when Producer A (100) transmits Message A, even if information related to Consumer A (200) (e.g., the IP address of Consumer A (200)) is not specified, the queue determination module (1200) identifies that the message is an email transmission request message through the message information of Consumer A (200), checks the destination information of the message, and the message distribution module (1300) can distribute Message A to a message queue connected to Consumer A (200) capable of processing the message according to the confirmed destination information.

[0100] That is, the queue determination module (1200), with reference to FIG. 7, receives a message (S10) from an unspecified number of consumers (200) and determines whether the message contains destination information (S20). If, as a result of the determination, the message does not contain destination information, the queue determination module (1200) determines the destination information of the message based on the message information (S30) as described above. If the message distribution module (1300) determines that there is destination information in step S20 or generates destination information in step S30, it distributes the queue according to the destination information of the message (S100).

[0101] As an embodiment of the present invention, the queue determination module (1200) 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 queue determination module (1200) may determine destination information for the message by reading the body content of the message.

[0102] The above-mentioned queue determination module (1200) can determine the queue to which a message will 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 message distribution module (1300), but additionally, the above-mentioned queue determination module (1200) can determine destination information based on the history of the message. For example, if the above-mentioned message distribution module (1300) receives message B requesting the cancellation of message A after distributing message A, which includes a request to send a specific email, to shared queue #1 (1420.1), the above-mentioned queue determination module (1200) and the above-mentioned message distribution module (1300) distribute message B to shared queue #1 (1420.1). In other words, a message intended to cancel a message that has already been distributed must be distributed to the queue where the target message was distributed.

[0103] As in the present invention, when multiple queues are operated, the aforementioned message A may be distributed to shared queue #1 (1420.1), and message B, which cancels message A, may be distributed to shared queue #2 (1420.2). At this time, due to the processing of the message selection module (1500), message B may be processed before message A. That is, if consumer B (200), which is capable of processing message A and message B, receives message B before receiving message A, a failure may occur in consumer B (200) because there is no target for cancellation.

[0104] In this way, the queue determination module (1200) determines the queue to which each message will be transmitted according to message information and the distribution rule, and the weighting factor that the queue determination module (1200) must consider to distribute the queue corresponds to a configuration that can be modified at any time according to the inventor's intent.

[0106] FIG. 8 schematically illustrates a process in which a message to be transmitted to each consumer (200) is determined according to the arrival time of each message waiting in a plurality of shared queues (1420) by a message selection module (1500) according to an embodiment of the present invention, FIG. 9 schematically illustrates a process in which a message to be transmitted to each consumer (200) 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. 10 schematically illustrates a process in which a message to be transmitted to each consumer (200) 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.

[0108] As illustrated in FIGS. 8 to 10, the queue group (1400) includes a first shared queue (1420.1) and a second shared queue (1420.2), and the plurality of consumers (200) include a first consumer (200.1) and a second consumer (200.2) capable of receiving messages from the first shared queue (1420.1) and the second shared queue (1420.2), and the message selection module (1500) determines priority information for a plurality of messages waiting in the first shared queue (1420.1) and the second shared queue (1420.2), and transmits each message to the first consumer (200.1) and the second consumer (200.2) according to the priority of each message, and if the determined priority information is the same, the messages are to be transmitted to each consumer (200) using a round-robin scheduling method. Determines the message.

[0109] Additionally, the priority information can be determined by the message selection module (1500) 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.

[0111] As described above, the sequence number of the message (MSG) disclosed in the drawing represents the chronological order in which it was transmitted to the queue from the message distribution module (1300).

[0113] In summary, FIGS. 8 and 9 illustrate a configuration in which, as an embodiment of the present invention, a first shared queue (1420.1), a second shared queue (1420.2), and a third shared queue (1420.3) are connected to a message selection module (1500), and the message selection module (1500) is connected to a first consumer (200.1), a second consumer (200.2), and a third consumer (200.3).

[0114] As illustrated in FIG. 8, according to one embodiment of the present invention, the message selection module (1500) 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 transmitted to the consumer (200) as a first processing priority rule.

[0115] Specifically, when MSG#1 arrives at the first shared queue (1420.1) first, MSG#2 arrives at the second shared queue (1420.2) next, and MSG#3 arrives at the third shared queue (1420.3) next, the message selection module (1500), without considering other conditions (e.g., size of the queue, state of the consumer (200), etc.), sequentially transmits the messages waiting in each queue to the first consumer (200.1) to the third consumer (200.3) who sent the message reception request, according to the order in which they were stacked in the first shared queue (1420.1) to the third shared queue (1420.3).

[0116] That is, for each of MSG#1 to MSG#3 located at the rear end of the first shared queue (1420.1) to the third shared queue (1420.3), the message selection module (1500) first transmits MSG#1 to the first consumer (200.1), transmits MSG#2 to the second consumer (200.2), and transmits MSG#3 to the third consumer (200.3). When each of MSG#1 to MSG#3 is transmitted to the consumer, for each of MSG#4, MSG#5, and MSG#6 located thereafter, first transmits MSG#4 to the first consumer (200.1), transmits MSG#5 to the second consumer (200.2), and transmits MSG#6 to the third consumer (200.3). In this way, the message selection module (1500) transmits each message to the consumer (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 consumer (200) in the order entered into the queue.

[0117] Additionally, the message selection module (1500) can determine the message to be sent to each consumer (200) using a round-robin scheduling method when the state of the connected consumers (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 consumer (200) is the same. In other words, the message selection module (1500) receives a message reception request from the consumer (200), and when the message reception request is successfully received, it sequentially sends multiple messages to each consumer (200).

[0119] As illustrated in FIG. 9, according to one embodiment of the present invention, the message selection module (1500) determines priority information based on the size of each connected queue. That is, the more messages waiting in a queue, the more priority the messages waiting in that queue are sent to the consumer (200) as a second processing priority rule.

[0120] Specifically, MSG#1 arrived at the first shared queue (1420.1) first, followed by MSG#2 arriving at the third shared queue (1420.3), then MSG#3 and MSG#4 arriving in order at the second shared queue (1420.2), and subsequently MSG#5 through MSG#7 arriving in order at the first shared queue (1420.1). At this time, the message selection module (1500) 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.

[0121] That is, the message selection module (1500) can transmit messages to consumers (200) in order of the largest queue size from the end of each queue. As shown in FIG. 9, since the first shared queue (1420.1) has the largest size, MSG#1 is transmitted first to the first consumer (200.1), then MSG#5 of the first shared queue (1420.1), which has the next largest queue size, is transmitted to the second consumer (200.2) or the third consumer (200.3), and then MSG#6 of the first shared queue (1420.1) or MSG#3 of the second shared queue (1420.2) can be transmitted to the third consumer (200.3). FIG. 9 illustrates an embodiment in which MSG#6 is transmitted to the third consumer (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 consumer (200) before MSG#2.

[0123] As illustrated in FIG. 10, according to one embodiment of the present invention, the queue group (1400) may further include an emergency queue (1430). The emergency queue (1430) 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 (1430) may correspond to a dedicated queue (1410) or a shared queue (1420), and the emergency queue (1430) illustrated in FIG. 10 corresponds to a shared queue (1420).

[0124] Specifically, the above-mentioned queue determination module (1200) can distribute messages transmitted from a specific IP or messages containing specific message information to the emergency queue (1430). 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 (1430) to be processed with the highest priority. In the case of processing for the entire nation, the emergency queue (1430) can be operated as a shared queue (1420) so that the message can be transmitted to the consumer (200) and processed more quickly.

[0125] As illustrated in FIG. 10, when MSG#1 to #4 are sequentially waiting in the first shared queue (1420.1) and the second shared queue (1420.2) and MSG#5 and MSG#6 are waiting in the emergency queue (1430), the message selection module (1500) transmits MSG#5 to the first consumer (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 (1420.1), the second shared queue (1420.2), and the emergency queue (1430), and then transmits MSG#6, which is waiting in the emergency queue (1430), to the second consumer (200.2) or the third consumer (200.3) (in FIG. 10, an embodiment in which MSG#6 is transmitted to the second consumer (200.2) is shown), and then MSG#1 and MSG#2 are transmitted to the consumer (200) in the order they are entered into the queue. In this way, prioritizing the processing of messages with a specific IP or specific message information can be used as the third processing priority rule.

[0127] In the description of FIGS. 8 to 10 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.

[0129] FIG. 11 schematically illustrates the internal configuration of a computing device according to one embodiment of the present invention.

[0131] The message queuing system (1000) mentioned in the description of FIG. 1 may include components of the computing device (11000) illustrated in FIG. 11, which will be described later.

[0133] As illustrated in FIG. 11, 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).

[0135] 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).

[0137] 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.

[0139] 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).

[0141] 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).

[0143] 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.

[0145] 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.

[0147] The embodiment of FIG. 11 is merely an example of the computing device (11000), and the computing device (11000) may have some components shown in FIG. 11 omitted, additional components not shown in FIG. 11 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. 11, 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.

[0149] 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.

[0151] 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.

[0153] 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.

[0155] 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.

[0157] According to one embodiment of the present invention, two or more different consumers can simultaneously access one or more shared queues, and by actively determining the order in which messages are processed in a message selection module, the effect of improving message processing flexibility and efficiency in a consumer group can be achieved.

[0158] According to one embodiment of the present invention, the effect of determining the message to be processed for the consumer who sent the message reception request based on message information without the producer being involved with the consumer can be achieved.

[0159] According to one embodiment of the present invention, the actual IP address and location of the consumer can be hidden, thereby providing the effect of preventing direct attacks from the outside.

[0160] According to one embodiment of the present invention, when destination information of a message transmitted by a generator is not specified, the destination information or queue information of the message is set based on a pre-configured distribution rule and 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.

[0162] 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.

[0163] Therefore, other implementations, other embodiments, and equivalents to the claims also fall within the scope of the claims set forth below.

Claims

Claim 1 A message queuing method for actively processing a plurality of messages, performed in a computing system comprising one or more memories and one or more processors, comprising: a message receiving step of receiving messages from a plurality of producers; a queue determination step of determining a queue to which a message is to be distributed according to destination information of each received message; a message distribution step of distributing messages to a queue determined for each message; a message selection step of determining priority information for each message waiting in a queue of each of the plurality of queues and selecting messages to be transmitted to consumers to consume each message in order of highest priority; and a message transmission step of transmitting the selected messages to consumers corresponding to each message; wherein the plurality of queues include a dedicated queue capable of transmitting messages to only a single consumer; and a shared queue capable of transmitting messages to a plurality of consumers; and wherein the message transmission step, when a message reception request is received from a consumer, transmits a message to the consumer who transmitted the message reception request based on the priority information. Claim 2 A message queuing method according to claim 1, wherein the computing system mediates a plurality of messages received from a plurality of producers to a plurality of consumers, wherein each of the plurality of consumers can receive a message from one dedicated queue, receive a message from one shared queue, or receive a message from one or more dedicated queues and one or more shared queues. Claim 3 A message queuing method according to claim 1, wherein the message selection step comprises a priority determination step for determining priority information of each message waiting in two or more queues, and the priority determination step determines priority information of each message by considering at least one of: the time when each message arrived at the queue; a processing priority rule based on message information or message body content of each message; the size of the queue in which each message is waiting; the processing capacity of a consumer capable of receiving each message; and the current state of a consumer capable of receiving each message. Claim 4 A message queuing method according to claim 1, wherein the queue determination step, when the received message includes destination information, transmits the message to a queue connected to a consumer according to the destination information, and when the received message does not include destination information, sets the destination information of the message or the queue information of the message based on a pre-set distribution rule and message information included in the message, and transmits the message to a queue connected to a consumer according to the destination information or transmits the message to a queue corresponding to the queue information. Claim 5 A message queuing method according to claim 1, wherein the plurality of queues includes a first dedicated queue, a first shared queue, and a second shared queue, and the plurality of consumers includes a first consumer capable of consuming messages transmitted from the first dedicated queue, the first shared queue, and the second shared queue, and the message transmission step transmits messages to the first consumer in order of highest priority among messages waiting in each of the first dedicated queue, the first shared queue, and the second shared queue, and the messages transmitted from the first dedicated queue, the first shared queue, and the second shared queue are processed in the order they arrive at the first consumer. Claim 6 A message queuing method according to claim 1, wherein the message distribution step does not deliver the message to a queue connected only to the specific consumer, even if the destination information or queue information of the received message corresponds to the specific consumer, when the computing system receives a notification that message processing is impossible from the specific consumer or fails to receive a response signal for receiving a message from the specific consumer. Claim 7 A message queuing method according to claim 1, wherein the plurality of queues includes a first shared queue and a second shared queue, and the plurality of consumers include a first consumer and a second consumer capable of receiving messages from the first shared queue and the second shared queue, and the message selection step 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 consumer and the second consumer according to the priority of each message, and if the determined priority information is the same, determines the message to be transmitted to each consumer by round robin scheduling. Claim 8 A message queuing system comprising one or more memories and one or more processes, and actively processing multiple messages, comprising: a message receiving module that receives messages from multiple producers; a queue determination module that determines a queue to which a message is to be distributed according to destination information of each received message; a message distribution module that distributes messages to the determined queue for each message; a message selection module that determines priority information for each message waiting in the queue of each of the multiple queues and selects messages to be transmitted to consumers to consume each message in order of highest priority; and a message transmission module that transmits the selected messages to consumers corresponding to each message; wherein the multiple queues include a dedicated queue capable of transmitting messages to only a single consumer; and a shared queue capable of transmitting messages to multiple consumers; and wherein the message transmission module, upon receiving a message reception request from a consumer, transmits a message to the consumer who transmitted the message reception request based on the priority information. Claim 9 The message queuing system of claim 8, wherein the message queuing system mediates multiple messages received from multiple producers to multiple consumers, and each of the multiple consumers can receive a message from one dedicated queue, receive a message from one shared queue, or receive a message from one or more dedicated queues and one or more shared queues. Claim 10 A message queuing system according to claim 8, wherein the message distribution module, when receiving a notification that a message cannot be processed from a specific consumer in the message queuing system, or when failing to receive a response signal for receiving a message from a specific consumer, does not deliver the message to a queue connected only to the specific consumer, even if the destination information or queue information of the received message corresponds to the specific consumer. Claim 11 A computer-readable recording medium for implementing a message queuing method for actively processing a plurality of messages, performed in a computing system comprising one or more processors and one or more memories, wherein the computer-readable recording medium comprises computer-executable instructions that cause the computing system to perform the following steps, the following steps comprising: a message receiving step of receiving messages from a plurality of producers; a queue determination step of determining a queue to which a message is to be distributed according to destination information of each received message; a message distribution step of distributing messages to the determined queue for each message; a message selection step of determining priority information for each message waiting in the queue of each of the plurality of queues and selecting messages to be transmitted to consumers to consume each message in order of highest priority; and a message transmission step of transmitting the selected messages to consumers corresponding to each message; wherein the plurality of queues comprises a dedicated queue capable of transmitting messages to only a single consumer; A computer-readable recording medium comprising: a shared queue capable of transmitting messages to multiple consumers; wherein the message transmission step transmits a message to the consumer who transmitted the message reception request based on the priority information when a message reception request is received from a consumer. Claim 12 A computer-readable recording medium according to claim 11, wherein the computing system mediates a plurality of messages received from a plurality of producers to a plurality of consumers, each of the plurality of consumers being able to receive a message from one dedicated queue, receive a message from one shared queue, or receive a message from one or more dedicated queues and one or more shared queues. Claim 13 A computer-readable recording medium according to claim 11, wherein the message distribution step does not deliver the message to a queue connected only to the specific consumer, even if the destination information or queue information of the received message corresponds to the specific consumer, when the computing system receives a notification that message processing is impossible from the specific consumer or fails to receive a response signal for receiving a message from the specific consumer.