JP2011049621A - Message transfer program, message transfer method and node - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a message transfer technique capable of transferring messages to all nodes even if a network dynamically changes without direct involvement of a transmission source. <P>SOLUTION: In the message transfer technique for transferring messages among connection nodes in a network consisting of a plurality of nodes, a transmission source node executes: a step of acquiring information of a transmission destination of message transfer from a transmission destination table registered in its own node in advance; a step of comparing the acquired transmission destination information with transfer route information included in a message received from another node; a step of updating the transfer route information by adding a node not included in the transfer route information; and a step of transferring the message having the updated transfer route information to the additional node. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a message transfer technique for transferring a message to a node that does not directly involve a transmission source node in a network composed of a plurality of nodes.

  Conventionally, in a network composed of a plurality of nodes, as a method for transmitting messages, there are a queue method for transmitting one message to one node and a topic method for transmitting to a plurality of nodes at a time.

  However, the conventional queue-type or topic-type message transmission technique has a problem that it is difficult to distribute a transmission message to all nodes when a failure occurs in the network.

  For example, in a network as shown in FIG. 1, when a message is transmitted from the node A to the node H, when a communication path from A to H becomes an error, a process for searching for another route becomes very complicated.

  As a solution when such a network failure occurs, transfer route information is included in the message so that a reply message after processing can follow the route in reverse (for example, refer to Patent Document 1), or there is a failure in the route. When it occurs, it has been proposed to set an alternative route by changing the original message transfer route (see, for example, Patent Document 2).

  However, each of the above prior arts performs message transmission / reception between predetermined nodes. Every time a change occurs in the network, such as registration or deletion of a connection node, all the nodes transmitting the message In this case, there is a trouble of resetting the transmission destination and the message transfer path. Further, in order to manage and control such message transmission, a separate device such as a host or a relay device is required.

JP 05-282173 A Japanese Patent Laid-Open No. 08-16532

  In order to solve the problems described above, the present invention does not require a special relay device for message transmission control, and even if there is a dynamic change of the network in which the transmission source is not directly involved, A message transfer technique that enables message transfer is provided.

  One aspect of the present invention is a message transfer program for transferring a message between connected nodes in a network composed of a plurality of nodes, the message transfer destination from the destination table registered in advance in the source node. A step of acquiring information, a step of comparing the acquired transmission destination information with the transfer route information included in the message received from another node, and adding the node not in the transfer route information to update the transfer route information And a step of transferring a message in which the transfer path information is updated to the additional node.

  According to the above aspect of the invention, when transfer path information of a message transmitted / received between connected nodes is compared with its own destination information, when there is a node that is not in the transfer path information, a message is sent to the node. By adopting a configuration for forwarding, a message can be forwarded to all the nodes in the network without requiring a special device for controlling message transmission.

  As a result, even if network changes such as node registration and deletion occur, it is possible to efficiently transfer messages to all nodes in the network, including nodes that are not directly involved in the source, simply by updating the information between the nodes. Can be done.

It is a figure which shows the basic composition of the message transfer system which becomes embodiment of this invention. It is a figure which shows the example of a data structure of the transmission destination table of each node which becomes embodiment of this invention. It is a figure which shows the example of a data structure of the transmission message which becomes embodiment of this invention. It is a figure which shows the example of a data structure of the process history table of the message managed in each node which becomes embodiment of this invention. It is a figure which shows the example of transfer path information transition of the message transfer by the queue system which becomes embodiment of this invention. It is a figure which shows the transfer route information transition example of the message transfer by the topic system which becomes embodiment of this invention. It is a figure which shows the transmission flow of the message by the queue system in the transmission source node which becomes embodiment of this invention. It is a figure which shows the message transfer flow by the queue system in the receiving node which becomes embodiment of this invention. It is a figure which shows the transmission flow of the message by the topic system in the transmission source node which becomes embodiment of this invention. It is a figure which shows the message transfer flow by the topic system in the receiving node which becomes embodiment of this invention.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 shows the basic configuration of the message transfer system of the present invention. The upper diagram of FIG. 1 shows a configuration example of a network to which the present invention is applied. A to H in the diagram represent node names, and are devices having the function of the node 1 in the lower diagram. The node 1 may be a device having a load distribution function such as a router or a hub (HUB). In particular, when a load distribution function is provided, the priority of the transfer destination can be determined by the load distribution function.

  Although not shown, each node 1 (A to H) is a computer having a memory and a CPU, and includes a message transfer program 10 stored in an auxiliary storage device (not shown). The message transfer program 10 is expanded in a memory and processed by a CPU (Central Processing Unit) at the time of activation. The program may be recorded on a portable recording medium such as a flexible disk, a CD (Compact Disk), or an MO (Magneto-Optical Disk) and read by a driver device corresponding to each medium.

  This message transfer program 10 includes a message transmission / reception unit 11 for transmitting / receiving a message, a message processing unit 12 for executing / processing a message content, and a communication history with other nodes 1 so far. When an error occurs in the load distribution unit 13 that stores information for determining whether processing can be performed at the minimum cost in the transmission destination table 101 of the data storage unit 100 and the actual communication processing (message transmission / reception processing), Referring to the transfer route information and the processing history table 102, the failure handling unit 14 constructs another transfer route and retransmits it.

  Further, the message transfer mechanism of the present invention will be described from the node connection configuration example in the network of FIG.

  First, the message transfer program 10 acquires the transmission destination information of the message transfer from the transmission destination table 101 in which the information of the transmission destination node 1 is registered in advance in the transmission source node 1, and provides the acquired transmission destination information in the message. The transfer route information field is written, and based on the transfer route information in the transfer route information field, the message is transmitted to all the destination nodes 1 including the node 1 not directly connected.

  Here, as the transmission destination information registered as the transmission destination table 101 in the data storage unit 100 of the node 1, it is only necessary that the node information of the node connected to the own node is registered.

  For example, node information of nodes B, C, and H is registered as a transmission destination in node A, and node information of nodes A, F, and G is registered as a transmission destination in node H. Thus, it is not necessary to register all the nodes 1 on the network in each node 1. For example, node A does not register node information on nodes D, E, F, and G.

  FIG. 2 shows an example of the data structure of the transmission destination table 101. Based on the transmission destination information in the transmission destination table 101, the transmission destination of the message is determined. The transmission destination table 101 includes a plurality of records including items of “priority”, “transfer destination”, “response time”, and “number of failure occurrences”.

  In the “response time” and the “number of failures”, numerical values measured as past results of message processing by the load balancer 13 or the failure handling unit are written, and “priority” is based on these results. Are ranked. Then, the message transmission / reception unit 11 determines the transmission destination of the message with reference to the transmission destination information.

  The transmission destination table 101 in FIG. 2 is transmission destination information registered in the node A. For example, the node A indicates that the message is preferentially transferred to the node B.

  The “transfer destination” stores the FQDN (Fully Qualified Domain Name) or IP address of the transfer destination device. Further, even if the load distribution unit 13 is not provided, it is possible to operate only with the information of “priority” and “transfer destination”. Further, registration between nodes and cancellation of registration may be performed manually or automatically. If necessary, security measures may be taken by introducing an authentication system for registration between nodes.

  FIG. 3 shows an example of the data structure of the message. A message transferred between the nodes 1 includes a header, a property, and a body. In the embodiment, a specific example in the case of using JMS (Java (registered trademark) Message Service) for transmitting and receiving data via a network is shown.

  The header includes field items of “message ID” (example: MSG00020), “reference message ID” (example: MSG00015) as a reference message that has been processed, and “priority” (example: 4).

  In the “reference message ID”, when a message transmitted from a transmission source causes a transmission error due to a communication path failure, the message ID is used as it is as a reference message ID, and a new message ID is assigned at the time of transmission again.

  The “priority” is input by the user when creating a message. For example, the “priority” is set to 10 levels, and the larger the value, the faster the processing is. If the priority is 5 or more, the topic method is automatically determined, and if it is 4 or less, the queue method is automatically determined. Data is stored in the “Transmission method” property.

  In addition, the property is composed of field items of “transmission method” (example: Queue) and “forwarding route information” (example: @ a.domain1 b.domain2 c.domain3) that determine whether the method is a queue method or a topic method. ing. Here, the “transfer route information” is updated with reference to the transmission destination table of the node 1 at the time of message transmission / reception.

  Further, the body includes content to be processed by each node 1. In the body, the processing content input by the user is stored.

  Note that “@” in the “forwarding path information” is a mark given before the FQDN (a.domain1) of the node A in order to identify the presence of another forwarding destination (nodes B and C). (You can also use characters (symbols) and character strings other than "@"). In the embodiment, the transmission source node A adds the FQDNs (b.domain2 c.domain3) of the nodes B and C to be transferred to the “transfer route information” and transfers them.

  Further, if there is a transfer destination that does not exist in the “transfer route information” at the reception destination, it is selected and transferred, and the transfer destination is added to the “transfer route information”. At this time, if another transfer destination exists at the reception source, the FQDN of the own node is marked. Then, when there is no other node to be transferred at the reception source, “forwarding path information” is searched from behind and transferred to the node with the mark first. At that time, the mark of the transfer destination node is deleted.

  FIG. 4 shows an example of the data structure of the message processing history table 102 managed by each node 1. The message processing history table 102 includes “message ID”, “reference message ID” for checking duplicate messages, and “processing status” indicating the processing status of the message (PROCESSED is processed, PROCESSING is processing, NOT PROCESSED is Unprocessed), it is composed of a plurality of records consisting of field items of “process ID”, “expiration date”, and “transfer path” associated with a message when processing in the node.

  For example, when an error occurs in the “Message ID” MSG00002 being processed, the “Message ID” MSG00003 is newly created at the transmission source, and MSG00002 is set to the “Reference Message ID”. .

  This table is used to determine whether a message has already been processed in order to prevent duplicate message transmission and respond to a network failure.

FIG. 5 shows an example of transition of transfer path information when a message is transferred by the queue method taking the network of FIG. 1 as an example. In this example, data is transferred in the order of node A → node B → node D → node F → node H → node G → node E → node C → node F → node D → node B → node A.
(1) In the transfer from A to B, the transfer path information is “@AB (@ is a mark)”, and A indicates that transfer destinations C and H are included in addition to B.
(2) In the transfer from B to D, the transfer path information is “@ A @ BD”, and B has a transfer destination G in addition to D, and therefore a mark is added.
(3) In the transfer of D → F → H → G, since H has no other transfer destination, the transfer path information is “@ A @ B @ D @ FHG”.
(4) In the transfer of G → E → C, the transfer route information is “@ A @ B @ D @ FHGEC”.
(5) In the transfer from C to F, since C has no other transfer destination, the transfer path information is searched from behind and transferred to F of the device having the mark first. Then, the transfer path information is “@ A @ B @ DFHGEC”, and the mark F is deleted.
(6) In the transfer from F to D, F has no other transfer destination and transfers to D. The transfer path information is “@ A @ BDFHGEC”.
(7) In the transfer of D → B → A, the transfer path information is “ABDFHGEC”, and since A has no transfer destination, the transfer ends here.

FIG. 6 shows an example of the transfer route information transition of the message transfer by the topic method taking the network of FIG. 1 as an example. In this example, there are a route for simultaneous transmission from node A to nodes B, C, and H, a route for simultaneous transmission from node B to nodes D and G, and a route for simultaneous transmission from node D to nodes E and F. .
(1) In the transfer of A → B, C, H, the transfer route information of all messages is “ABCH”. Hereinafter, the following processing flow is shown assuming that the transfer processing is delayed between the C and H nodes, and the message transferred to B is transferred first.
(2) In the transfer of B → D, G, the transfer route information of the message is “ABCHDG”.
(3) In the transfer from D to E and F, the transfer path of the message is “ABCHDGEF”, and in F there is no transfer destination, so transfer processing is not performed.

  A processing flow for the message transfer described above will be described with reference to FIGS.

  FIG. 7 is a flowchart showing a procedure performed in the transmission source node in the case of the queue method.

  First, in step S10, a priority is input by the user at the time of creating the message, and the message processing content data is acquired. In step S11, the transmission source node transmits messages one by one from the acquired priority. The transmission method is determined according to, and the data is stored in the message property.

  Next, in step S12, the transmission destination table 101 is referred to and it is determined whether there are a plurality of transmission destinations. If there are a plurality of transmission destinations, in step S14, the own node is marked and stored at the beginning of the message transfer path information. If there are not a plurality of transmission destinations, in step S13, the local node is stored at the beginning of the message transfer route information without a mark.

  In step S15, one transmission destination is determined based on the priority of the transmission destination table 101. In step S16, the transmission destination is added to the end of the transfer path information. In step S17, the message in which the transfer path information is thus written is transmitted to the transmission destination.

  FIG. 8 is a flowchart showing a procedure of processing in a receiving node that receives a message in the case of the queue method.

  In step S21, the receiving node that has received the message refers to the processing history table 102 and determines whether or not a message ID identical to the received message ID exists. In step S22, it is determined whether the received message is the same as the reference message ID in the processing history table 102 and has been transferred.

  If the same message ID does not exist and the same reference message ID exists and is not yet transferred, in step S23, the queue priority is determined with reference to the message priority. If the message IDs correspond to the same message ID in step S21, or if the message has already been transferred in step S22, the process proceeds to step S27, the message is added to the processing history table 102, and the process ends.

  Next, in step S24, it is determined whether there is a transfer destination that is not included in the message transfer path information. If there is no transfer destination not included in the transfer path information, in step S25, it is searched from the end whether there is a transfer destination marked in the transfer path information of the message.

  If there is no transfer destination with a mark, in step S26, the message is transferred to the first transmission destination, and in step S27, the message is added to the message processing history table 102.

  On the other hand, if there is a transfer destination that is not included in the transfer route information in step S24, one transfer destination is determined based on the priority of the destination table 101 in step S29, and the transfer destination is determined as a transfer route in step S30. Add to the end of the information.

  Next, in step S31, it is determined whether there is another transfer destination in the own node. If there is another transfer destination as a result of the determination, a mark is added to the own node in the transfer path information in step S32. In step S33, the message is transferred to the transfer destination. If there is no other destination in step S31, the message is transferred in step S31, the process for adding to the message processing history in step S27 is performed, and this flow is ended.

  If there is a transfer destination marked in the transfer path information in step S25, the transfer destination mark in the transfer path information is removed in step S28, the transfer destination is determined, and the process proceeds to step S31. Process.

  FIG. 9 is a flowchart showing a procedure of processing at the transmission source in the case of the topic method (messages are transmitted all at once).

  First, in step S40, the priority inputted by the user and the processing contents of the message are acquired. In step S41, the transmission source node determines a topic method as a method for transmitting the message, and stores the data in the message property. To do. Next, in step S42, a plurality of transmission destinations are determined with reference to the transmission destination table 101.

  In step S43, a plurality of destinations are added to the message transfer path information, and in step S44, the message is transmitted. In step S45, the transmission result is added to the message processing history table 102.

  FIG. 10 is a flowchart showing a procedure of processing at the reception destination in the case of the topic method (messages are transmitted all at once).

  First, in step S51, the processing history table 102 is referred to and it is determined from the message ID whether there is the same message. If there is no identical message, it is determined in step S52 whether the same reference message exists in the message processing history table 102 and has been transferred. If it has not been transferred, in step S53, the message priority is referred to, and topic-based transfer is determined.

  If there is the same message in step S51 and the same reference message has been transferred in step S52, this flow ends.

  Next, in step S54, it is determined whether or not there is a transfer destination not included in the message transfer path information. If there is a transfer destination not included in the transfer route information, all the transfer destinations are added to the transfer destination list in step S55, and the transfer destination is added to the end of the transfer route information in step S56.

  In step S57, it is determined whether there is a transfer destination marked in the transfer path information. If there is a marked transfer destination, the transfer destination mark in the transfer path information is deleted and added to the transfer destination list in step S58.

  In step S59, it is determined whether or not there is a corresponding transfer destination in the transfer destination list. If there is a transfer destination, the message is transferred in step S60, added to the processing history table 102 in step S61, and this flow ends.

  On the other hand, if there is no transfer destination in step S59, the message is transferred to the first transmission source node in step S62, and additional processing is added to the processing history table 102 in step S61.

  A message processing system that forwards messages without omission to nodes on which a transmission source node is not directly involved on a computer network.

DESCRIPTION OF SYMBOLS 1 Node 2 Communication path 10 Message transfer program 11 Message transmission / reception part 12 Message processing part 13 Load distribution part 14 Failure handling part 100 Data storage part 101 Transmission destination table 102 Processing history table

Claims (5)

A message transfer program for transferring a message between connected nodes in a network composed of a plurality of nodes,
To the source node,
Obtaining message transfer destination information from a destination table registered in advance in the own node;
Comparing the acquired destination information with transfer path information included in a message received from another node, adding a node not in the transfer path information and updating the transfer path information;
Forwarding the message with the forwarding path information updated to the additional node;
A message transfer program that executes   The message transfer program according to claim 1, wherein, in the update step of the transfer route information, when there is a node that can be transmitted by the own node and has not been transmitted, a mark indicating the presence is added.   3. The message transfer program according to claim 1, wherein, in the transfer step, when there is no transfer destination, the message is transferred to a node to which a mark is added to the transfer path information. A message transfer method for transferring a message between connecting nodes in a network composed of a plurality of nodes,
To the source node,
Obtaining message transfer destination information from a destination table registered in advance in the own node;
Comparing the acquired destination information with transfer path information included in a message received from another node, adding a node not in the transfer path information and updating the transfer path information;
Forwarding the message with the forwarding path information updated to the additional node;
A message transfer method characterized by causing a message to be executed. A node for transferring a message between connected nodes in a network composed of a plurality of nodes,
Means for acquiring destination information for message transfer from a destination table registered in advance in the own node;
Means for comparing the acquired transmission destination information with transfer path information included in a message received from another node, adding a node not in the transfer path information and updating the transfer path information;
Means for forwarding a message with the forwarding path information updated to the additional node;
A node characterized by comprising:

Images