JP2013038647A - Message transfer system, control device, message transfer node, message transfer method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To suppress delay in message transfer by reducing the hop number in transfer of a P2P type message.SOLUTION: The message transfer system comprises: a flow switch; a plurality of message transfer nodes each of which has a path table and transfers a message from a transfer source to a transfer destination by transferring the message by each of the message transfer nodes via the flow switch according to the path table; and a control device having a path management part which manages a path entry in which at least the message transfer nodes of the transfer source and the transfer destination are designated. The message transfer node registers a new path entry in the control device at the time of transfer of the message in accordance with the path table. The control device controls the message transfer nodes and the flow switch so as to transfer the message at a second transfer path having a fewer hop numbers than the message transfer path in accordance with the path table for the message to be transferred to the transfer destination from the transfer source registered in the path entry.

Description

  The present invention relates to a message transfer system, a control device, a message transfer node, a message transfer method, and a program, and more particularly, each message transfer node transfers a message from a source to a destination by transferring the message according to a routing table. The present invention relates to a message transfer system, a control device, a message transfer node, a message transfer method, and a program constituting a peer-to-peer network (hereinafter referred to as “P2P”).

  In P2P type message transfer using the Distributed Hash Table (DHT) technology, message transfer is performed using an identifier assigned to each message type.

  Non-Patent Document 1 discloses a Virtual Ring Routing method. In the Virtual Ring Routing method, as shown in FIG. 11, each message forwarding node (in FIG. 11, for simplification, the message forwarding node is referred to as “BR” (abbreviation of Broker), and only BR20 to BR29 are illustrated. ) Has node identifiers, and one ring is constructed in numerical order of the node identifiers. In the process of forming the ring, the message transfer node constructs a routing table for message transfer while exchanging node identifiers.

  For example, the BR 20 in FIG. 11 constructs a routing table with two message forwarding nodes at the front and rear as adjacent nodes. Similarly, other message forwarding nodes also construct routing tables with two message forwarding nodes at the front and rear as adjacent nodes. Here, for example, when a message is transferred from the BR 20 to the BR 28, the message is transferred by referring to the route table, following the node identifier, and following the route BR20, BR22, BR24, BR26, BR28. .

  Communication of the publish-subscribe type model can be realized by using such P2P type message transfer. In this case, the publisher transmitting the message connects to one of the message forwarding nodes and performs the advertisement process.

  FIG. 11 shows that the Publisher (PUB 10 in FIG. 11) is connected to the BR 20. Similarly, it is shown that the subscriber (SUB 30 in FIG. 11) is connected to the BR 29.

  In the publish-subscribe communication, a message transfer path is set by an advertisement process by a publisher and a subscription process by a subscriber. In this advertising process, one of the message forwarding nodes is selected as a Rendezvous Point (Rendezvous Point, RP 40 in FIG. 11). The control message for this advertisement processing follows the route of BR20, BR22, BR24, BR26, BR28, for example, thereby determining the message transfer route to PUB10 to BR20 to BR28 / RP40. On the other hand, the Subscriber performs reception registration with the Rendezvous Point through a subscription process. In the case of the subscription processing, the message transfer route BR28 / RP40 to BR29 to SUB30 is determined by the control message for reception registration following the route BR29, BR28, for example, and tracing the reverse route. Thus, Rendezvous Point provides an intermediary function in Publish-Subscribe communication.

  As described above, for example, when a message is distributed to the PUB 10 and the SUB 30, the message is transferred through a route of BR 20, BR 22, BR 24, BR 26, BR 28 / RP 40, BR 29, and SUB 30.

  In addition, Patent Document 1 describes a method for updating a skip table in a P2P overlay network. Non-Patent Documents 2 and 3 are white papers and specifications of a network having a centralized control device (controller) called open flow.

JP 2009-171156 A

Matthew Caesar, Miguel Castro, Edmund B. Nightingale, Greg O'Shea, Antony Rowstron, “Virtual Ring Routing: Network Routing Inspired by DHTs”, SIGCOMM 2006 Nick McKeown and seven others, “OpenFlow: Enabling Innovation in Campus Networks”, [online], [Search May 26, 2011], Internet <URL: http://www.openflow.org/documents/ openflow-wp-latest.pdf> “OpenFlow Specification” Version 1.1.0 Implemented (Wire Protocol 0x02) [Search May 26, 2011], Internet <URL: http://www.openflow.org/documents/openflow-spec -v1.1.0.pdf>

  The following analysis is given by the present invention. The problem of the message transfer method represented by the above-mentioned Virtual Ring Routing method is that the number of hops, that is, the number of message transfer nodes (BR) through which a message passes when the ring constructed by the P2P technology becomes large-scale. Is to increase. This means that in publish-subscribe communication, the number of hops increases in message transfer from the publisher to the rendezvous point.

  The present invention has been made in view of the above circumstances, and its object is to reduce the number of hops in the above-described P2P type message transfer, and to suppress a message transfer delay, A control device, a message transfer method, and a program are provided.

  According to the first aspect of the present invention, a flow switch that performs message transfer in accordance with a processing rule that defines a matching rule that matches a message and a forwarding destination of a message that conforms to the matching rule, and holds a routing table, A plurality of message transfer nodes that transfer a message from a transmission source to a destination by each message transfer node transferring a message via the flow switch according to the routing table, and at least a message transfer node of the transmission source and the destination And a control device including a route management unit that manages a route entry that designates a route entry, and any one of the message transfer nodes registers a new route entry in the control device when the message is transferred according to the route table. The control device is transmitted from the transmission source registered in the route entry to the destination. For come message, the message transfer system for controlling the message transfer node and flow switch to forward the message in the second transfer path small number of hops is provided than the transfer path of the message according to the routing table.

  According to the second aspect of the present invention, a flow switch that performs message transfer according to a processing rule that defines a matching rule for matching a message and a forwarding destination of a message that conforms to the matching rule, and holds a routing table, respectively. Each message transfer node is connected to a plurality of message transfer nodes that transfer a message from a transmission source to a destination by transferring a message via the flow switch according to the routing table, and at least the transmission source and the destination A route management unit that manages a route entry that specifies a message forwarding node, and a message that should be transmitted from a transmission source registered in the route entry to a destination than a forwarding route of a message according to the routing table The message transfer node to transfer a message through a second transfer path having a small number Controller and a transfer control unit that controls the flow switch and is provided.

  According to the third aspect of the present invention, each message forwarding node forwards a message as the message forwarding node of a peer-to-peer network that forwards the message from the source to the destination by forwarding the message according to the routing table. When a message transfer unit, a new message is received, a route entry registration unit that registers a route entry including at least information of the own device in a predetermined control device, and the predetermined destination when the message reaches the destination There is provided a message forwarding node comprising a route entry update unit for adding information of the own device to the corresponding route entry of the control device.

  According to a fourth aspect of the present invention, a flow switch that performs message transfer according to a processing rule that defines a matching rule that matches a message and a forwarding destination of a message that conforms to the matching rule, and holds a routing table, A plurality of message transfer nodes that transfer a message from a transmission source to a destination by each message transfer node transferring a message via the flow switch according to the routing table, and at least a message transfer node of the transmission source and the destination A message transfer method in a message transfer system including a path management unit that manages a path entry that specifies a path entry, wherein the message transfer node sends a new path entry to the control apparatus when transferring a new message. And registering the route entry with the control device. The message transfer node to transfer a message on a second transfer route having a smaller number of hops than a message transfer route according to the route table, with respect to a message to be transmitted from a transmission source registered in Controlling a flow switch. The method is tied to a specific machine, a message transfer node for transferring messages and its controller.

  According to a fifth aspect of the present invention, each of the flow switches that performs message transfer according to a processing rule that defines a matching rule that matches a message and a forwarding destination of a message that conforms to the matching rule, and holds a routing table, A plurality of message transfer nodes that transfer a message from a transmission source to a destination by each message transfer node transferring a message via the flow switch according to the routing table, and at least a message transfer node of the transmission source and the destination At least from the message transfer node to the computer constituting the control device of the message transfer system including a route management unit that manages the route entry that designates the message entry when transferring a new message by the message transfer node Route entry with source and destination specified And a message to be transmitted from the transmission source registered in the route entry to the destination on the second transfer route having a smaller hop count than the message transfer route according to the route table. There is provided a program for executing a process for controlling the message transfer node and the flow switch to transfer. This program can be recorded on a computer-readable storage medium. That is, the present invention can be embodied as a computer program product.

  According to the present invention, a message having a common source and destination can be transferred with a smaller number of hops, and a message transfer delay can be suppressed.

It is a figure showing the structure of the 1st Embodiment of this invention. It is a block diagram showing the detailed structure of each apparatus of the 1st Embodiment of this invention. It is an example of the path | route entry managed of the 1st Embodiment of this invention. It is a sequence diagram showing operation | movement of the 1st Embodiment of this invention. It is the figure which added the transfer path | route of an advertisement message and a delivery message to FIG. FIG. 4 is a diagram showing a state in which the route entry of FIG. 3 has been updated by the message forwarding node BR28. It is a block diagram showing the detailed structure of each apparatus of the 2nd Embodiment of this invention. It is a sequence diagram showing operation | movement of the 2nd Embodiment of this invention. It is an example of the route entry managed in the control apparatus of the 2nd Embodiment of this invention. It is a figure showing the structure of the 3rd Embodiment of this invention. It is a figure for demonstrating the message transfer method of a nonpatent literature 1. FIG.

  First, an outline of an embodiment of the present invention will be described with reference to the drawings. In the following, the reference numerals of the drawings attached to this summary are attached for convenience to each element as an example for facilitating understanding, and are not intended to limit the present invention to the illustrated embodiment.

  In the present invention, as shown in FIG. 1, each message forwarding node holds a routing table and forwards a message according to the routing table, thereby transferring a message from a transmission source to a destination. Forwarding switches BR20 to BR28, flow switches 50 to 53 that perform message forwarding according to a processing rule that defines a matching rule that matches a message and a forwarding destination of a message that matches the matching rule, and these message forwarding nodes BR20 to BR28, and This can be realized by a configuration including the control device 60 that controls the flow switches 50 to 53.

  More specifically, the control device 60 includes a route management unit that manages at least a route entry that specifies a message transfer node that is a transmission source and a destination. Each of the message transfer nodes BR20 to BR28 registers a new route entry in the control device when transferring a new message (for example, an advertisement message from a publisher node in a publishing subscription model). In such a new route entry, for example, the source message transfer node located at the origin registers a new entry including the identifier of the message and information of the own device, and the destination message transfer node is automatically registered in the corresponding entry. It can be created by adding device information. For the message to be transmitted from the same source as the new entry to the destination, the control device 60 uses the second transfer path (that is, the shortcut path) having a smaller hop count than the message transfer path according to the path table. ) To control the message transfer node and the flow switch to transfer the message (see FIG. 5).

  By doing so, it is possible to reduce the number of transfer hops of a message having a common source and destination, and to suppress a message transfer delay.

[First Embodiment]
Next, a first embodiment of the present invention will be described in detail with reference to the drawings. FIG. 1 is a diagram showing the configuration of the first exemplary embodiment of the present invention. Referring to FIG. 1, a plurality of message forwarding nodes (BR) 20 to 29, flow switches 50 to 53 interconnecting the plurality of message forwarding nodes (BR) 20 to 29, and these message forwarding nodes (BR) ) A message transfer network is shown that includes 20-29 and a controller 60 that controls the flow switches 50-53. In the following description, it is assumed that the publisher node PUB10 is connected to the message transfer node (BR) 20 and the subscriber node SUB30 is connected to the message transfer node (BR) 29 as shown in FIG. FIG. 1 shows a state where the message forwarding node BR 28 is selected as a Rendezvous Point (Rendezvous Point, hereinafter referred to as “RP”) 40.

  FIG. 2 is a block diagram showing a detailed configuration of each device shown in FIG. Referring to FIG. 2, message forwarding nodes (BR) 20 to 29, flow switches 50 to 53, and a control device 60 are shown (the publisher node PUB10, the subscriber nodes SUB30 and RP40 are omitted).

  The control device 60 centrally holds route entries for message transfer, and has a network topology including a route entry management unit 601 that responds to inquiries and registration / update requests from the message transfer nodes BR20 to BR29, and flow switches 50 to 53. The route calculation unit 602 that calculates a route from the transmission source to the destination indicated in the route entry with reference to the flow entry setting to the flow switches 50 to 53 required for the transfer on the calculated route, And a transfer control unit 603 that issues a message output instruction or the like. Note that the route calculation function and flow entry setting function of the control device 60 can also be realized using a mechanism equivalent to the OpenFlow controller that controls the OpenFlow switch of Non-Patent Documents 2 and 3.

  Further, instead of the route calculation unit 602, it is possible to adopt a configuration in which the control device 60 holds the shortest route information between any message forwarding nodes and the flow entry to be set in each flow switch when forwarding on the shortest route. It is.

  Message transfer nodes (hereinafter referred to as “BR”) 20 to 29 are set in the flow switches 50 to 52 in accordance with the transfer of messages using the routing table as shown in Non-Patent Document 1 or according to instructions from the control device 60. The message transfer unit 201 that transfers the message after rewriting the header area of the message so as to match the flow entry for shortcut transfer, and the path entry for the new message received by the message transfer unit 201 to the control device 60 The route entry inquiry unit 202 that inquires whether or not the device is registered, and the route entry registration that requests the control device 60 to register a new route entry when the route entry is not registered as a result of the route entry inquiry. When the device 203 and the advertisement message using the routing table are transferred, the own device reaches the destination If there is determined, it configured to include a path entry update unit 204 to request additional identifiers and addresses of its own device to the corresponding route entry to the controller 60.

  The flow switches 50 to 53 store a flow entry (processing rule) in which a matching rule (matching rule) for matching with header information of a received message is associated with processing contents (Instructions) to be executed on the message. The flow table 501 includes a flow processing unit 502 that searches the flow table 501 for a flow entry having a matching rule that matches the received message and executes a process defined for the corresponding flow entry. If no flow entry having a matching rule that matches the received message is found as a result of the search, the transfer processing unit 502 sets a flow entry having a matching rule that matches the received message to the control device 60. Request. Using the operations of the transfer processing unit 502 and the control device 60, information exchange between the BRs 20 to 29 and the control device 60 in FIG. 2 can be realized. Such flow switches 50 to 53 can also be configured by the open flow switches of Non-Patent Documents 2 and 3, or other equivalent communication devices.

  Each function of the above nodes (BR, publisher node, subscriber node, etc.) and the control device 60 is realized by a computer program that operates on a virtual virtual machine in addition to a physical computer. can do.

  The advertisement message in this embodiment includes at least a message type, a message identifier (MSG_ID), and a transmission source node identifier. Specifically, it is determined whether the message type is an advertisement message. MSG_ID can generate | occur | produce an identifier by hashing the name of the message provided for every message, such as weather information, traffic information, and failure information, for example. And the node identifier which BR has is used for a transmission source node identifier. As this node identifier, for example, a unique identifier can be generated by using the IP address of the BR or using the time when the BR is activated in addition to the IP address. In this embodiment, it is assumed that identifiers 20 to 29 are assigned to BRs 20 to 29, respectively.

  FIG. 3 is an example of a route entry held in the route entry management unit 601 of the control device 60. In the example of FIG. 3, a message identifier (MSG_ID), a source node identifier (src_ID), a source node address (src_address), a destination node identifier (dst_ID), and a destination node address (dst_address) ) Are associated with each other. In the following description, the identifier of the destination node is used as the message identifier (MSG_ID). As the source node address (src_address), it is assumed that both or at least one of the MAC address and the IP address is used. Note that the route entry held in the route entry management unit 601 is desirably deleted at a predetermined timing such as the passage of a certain time.

  Next, the operation of this embodiment will be described in detail with reference to the drawings. In the following description, an example will be described in which the BR 20 receives an advertisement message addressed to the BR 28 from the publisher node PUB 10 and transfers the subsequent delivery message to the BR 28 without going through the BR 22 to BR 26.

  FIG. 4 is a sequence diagram showing the operation of the first exemplary embodiment of the present invention. Referring to FIG. 4, first, when receiving an advertisement message in which the identifier of BR28, which is the identifier of the destination node, is set as the message identifier (MSG_ID) from the publisher node PUB10, the BR20 receives the advertisement message from the publisher node PUB10. An inquiry is made as to whether a route entry corresponding to the advertisement message has been created (S001).

  Here, since the entry in which the destination node identifier BR28 is set is not registered in the route entry management unit 601 of the control device 60, the control device 60 responds to the BR 20 that there is no corresponding entry.

  The BR 20 that has received the response transmits to the control device 60 the identifier (MSG_ID) of the BR 28 that is the identifier of the destination node set in the advertisement message, the identifier (20) of the own device that is the inquiry source, A registration of a route entry having a device address (src_address) is requested (S002). At this time, a route entry as shown in FIG. 3 is registered in the route entry management unit 601.

  Next, the BR 20 transfers the advertisement message according to the route table held in the message transfer unit 201 (S003). Specifically, the BR 20 refers to the route table and transfers the advertisement message to the BR 22. Then, since the flow switch 50 that has received the advertisement message does not hold a flow entry corresponding to the advertisement message, the flow switch 50 requests the control device 60 to set a flow entry necessary for forwarding the advertisement message. When receiving the request, the control device 60 instructs the flow switch 50 to transfer the advertisement message to the BR 22. Note that the packet-out message of Non-Patent Document 3 can be used as a message transfer instruction from the control device 60 to the flow switch 50.

  The BR 22 that made the advertisement message refers to the route table and transfers the advertisement message to the BR 24. The flow switch 50 that has received the advertisement message inquires the control device 60 and transfers the advertisement message to the flow switch 51 in the same manner as when the advertisement message is received from the previous BR 20. Similarly, the flow switch 51 that has received the advertisement message inquires the control device 60 and transfers the advertisement message to the BR 24. In this way, the advertisement message is transferred in the order of BR20 → BR22 → BR24 → BR26 → BR28 as indicated by the broken arrow in FIG. In BR28, since MSG_ID matches the node identifier (= 28) of BR28, BR28 is determined as RP40 (S004).

  Next, the BR 28 that has become the RP 40 inquires of the control device 60 whether or not a route entry (route entry with MSG_ID = 28, src_ID = 20) corresponding to the corresponding advertisement message has been created (S005). ).

  Here, since the corresponding route entry has been registered in S002, the control device 60 responds to the BR 28 with the contents of the corresponding entry (eg, MSG_ID = 28, src_ID = 20 in FIG. 3).

  The BR 28 that has received the response provides the control device 60 with 28 as its destination node identifier (dst_ID) and its own MAC address or IP address as the destination node address (dst_Address) in the route entry that has been responded to. Is requested to be added (S006). At this time, a route entry as shown in FIG. 6 is registered in the route entry management unit 601.

  Thereafter, the control device 60 calculates a transfer path for transferring the delivery message subsequent to the advertisement message from the BR 20 to the BR 28 via the flow switches 50 to 52 without passing through the BR 22 to the BR 26 (S007). Is set in the flow switches 50 to 52 (S008). For example, when the network topology as shown in FIG. 1 is configured, as indicated by the solid line arrows in FIG. 5, the flow switch 50 from the BR 20, the flow switch 51 from the flow switch 50, and the flow switch 51 from the flow switch 51. 52, a transfer path for transferring the delivery message from the flow switch 52 through the BR 28 is calculated. In this case, by using the address of BR20, 28 and the message identifier (MSG_ID) as the matching rule for the flow entry, each flow switch 50-52 can uniquely identify the target message.

  More specifically, as the addresses of the BRs 20 and 28, for example, if the lower network constituted by the BRs 20 to 29 and the flow switches 50 to 52 is a layer 2 (L2) network, the MAC addresses of the BR20 and BR28 are used. It is done. Further, if the lower network constituted by the flow switches 50 to 52 is an IP network, the IP addresses of BR20 and BR28 can be used as the addresses of BR20 and BR28. The MSG_ID can be identified by being included in the IP packet payload or added as a header option.

  The control device 60 transmits a shortcut transfer instruction for a message having MSG_ID (= 28) to the BR 20 (S009). This shortcut transfer instruction includes the identifier (= 28) of the BR 28 that is the destination, the MAC address and IP address of the BR 28, and the like.

  After receiving the delivery message from the publisher node PUB10 after the above processing, the BR 20 rewrites the header area of the message so as to conform to the shortcut transfer flow entry matching rule set in the flow switch 50. Transfer to the flow switch 50. The flow switch 50 transfers the message according to the flow entry that matches the received message. Here, the message received by the flow switch 50 is transferred to the flow switch 51. Similarly, the delivery message having MSG_ID (= 28) is transferred to the BR 28 via the flow switch 51 and the flow switch 52 (S010).

  As described above, according to the present embodiment, as shown in FIG. 5, after the first advertisement message is transferred according to the route table, the subsequent distribution messages are sent to the flow switches 50 to 50 without passing through the intermediate BR. It is possible to transfer shortcuts via 52.

[Second Embodiment]
Next, a second embodiment obtained by changing the first embodiment will be described in detail with reference to the drawings. For example, there is a case where a sensor for observing weather information and temperature information is connected as a publisher node, and these observation values are collected in one BR. These sensors are arranged at different locations, but MSG_IDs indicating message destinations overlap. In this embodiment, the route entry can be reused in such a case.

  FIG. 7 is a diagram showing a detailed configuration of the second exemplary embodiment of the present invention. The difference from the first embodiment shown in FIG. 2 is that the operations of the route entry inquiry unit 202a, the route entry update unit 204a on the BR 20a to 29a side, and the route entry management unit 601a on the control device side are different. Is a point.

  In this embodiment, a certain publisher node (for example, a sensor) transmits an advertisement message to a certain destination node, the destination is determined by forwarding according to the route table, and the route entry has been registered and updated. If so, the route entry is used for message transfer to the same destination node.

  Specifically, the route entry inquiry unit 202a of the present embodiment inquires of the control device 60 whether or not the route entry corresponding to the new message has been registered. At this time, when a response indicating that a route entry having the same MSG_ID has already been registered is received from the control device 60, the route entry inquiry unit 202a notifies the route entry update unit 204a that the own device is connected to the route entry. Request additional registration of route entries for delivery of received messages.

  Thereafter, the route entry management unit 601a of the control device 60 performs route calculation, and generation and setting of a flow entry according to the added route entry. Thereby, the forwarding of the advertisement message according to the routing table of the first embodiment described above can be omitted.

  Next, the operation of this embodiment will be described. In the following description, as described in the first embodiment, a route entry for a message having BR20 as a transmission source and BR28 as a destination is created (see FIG. 6), and BR21 newly sets BR28. A description will be made assuming that an advertisement message as a destination is received.

  FIG. 8 is a sequence diagram showing the operation of the second exemplary embodiment of the present invention. Referring to FIG. 8, first, when receiving an advertisement message in which the identifier of BR28, which is the identifier of the destination node, is set as the message identifier (MSG_ID) from the publisher node PUB10, the BR 21 receives the advertisement message from the publisher node PUB10. An inquiry is made as to whether or not a route entry corresponding to the corresponding advertisement message has been created (S101).

  Here, since the route entry for the message having BR28 as the destination is already registered, the control device 60 responds to BR28 with the contents of the corresponding entry (MSG_ID = 28, src_ID = 20, etc. in FIG. 6).

  The BR 21 that has received the response sends the response to the control device 60 in the route entry in which the response has been received, as the node identifier (src_ID) of the second transmission source node 21, and the address of the second transmission source node (dst_Address). And requesting to add the MAC address and IP address of the own device (S102). At this time, as shown in FIG. 9, the information of the second transmission source node is added to the route entry.

  Thereafter, the control device 60 calculates a route for transferring a message from the BR 21 to the BR 28 (S103), and sets a flow entry for realizing the route in the flow switches 50 to 52 (S104). At this time, the control device 60 rewrites the flow entry already set in the flow switches 50 to 52, so that messages sent from BR 21 to BR 28 are added to the flow switches 50 to 52 in addition to messages sent from BR 20 to BR 28. May be transferred. In this case, a wild card shown in Non-Patent Document 3 may be set as a matching rule.

  Thereafter, the processing is the same as in the first embodiment, and the control device 60 transmits a shortcut transfer instruction for a message having the MSG_ID (= 28) received by the BR 21 to the BR 21 (S105). This shortcut transfer instruction includes the identifier 28 of the destination BR 28 = 28, the MAC address and IP address of the BR 28, and the like.

  When the delivery message is received from the publisher node PUB10 after the above processing, the BR 21 receives the message header so that the message addressed to the BR 28 conforms to the matching rule of the flow entry for shortcut transfer set in the flow switch 50. The area is rewritten and then transferred via the flow switch 50.

  The flow switch 50 transfers the message according to the flow entry that matches the received message. Here, the message received by the flow switch 50 is transferred to the flow switch 51. Similarly, the delivery message having MSG_ID (= 28) is transferred to the BR 28 via the flow switch 51 and the flow switch 52 (S105).

  As described above, according to the present embodiment, it is possible to omit the transfer of the advertisement message and perform the shortcut transfer using the existing route entry.

  Although the embodiments of the present invention have been described above, the present invention is not limited to the above-described embodiments, and further modifications, substitutions, and adjustments are possible without departing from the basic technical idea of the present invention. Can be added. For example, as shown in FIG. 10, it is also possible to separate the control device into an OpenFlow controller 61 and a control device 60 that responds to inquiry of route entries from each BR.

  In addition, although the description has been omitted in the above-described embodiment, by registering a route entry and setting the corresponding flow entry in the flow switch in the same procedure when other message forwarding nodes are the destinations, It is possible to reduce the number of hops during transfer.

  The present invention can be applied, for example, to a messaging system that performs a message exchange service between distributed enterprise servers. It can also be used as a messaging system that distributes network control information. In this form, network control information is distributed simultaneously to a plurality of networks. As described above, distributed systems generally cooperate with each other, and it is desirable that a message delivery delay is small. If the present invention is applied, message delivery can be performed with a small number of hops, and therefore message delivery delay can be minimized.

10 Publisher node (PUB)
20-29 Message Transfer Node (BR)
30 Subscriber Node (SUB)
40 Rendezvous Point (RP)
50 to 53 Flow switch 60 Control device 61 Open flow controller 201 Message transfer unit 202, 202a Route entry inquiry unit 203 Route entry registration unit 204, 204a Route entry update unit 501 Flow table 502 Transfer processing unit 601, 601a Route entry management unit 602 Route calculation unit 603 Transfer control unit

Claims (9)

A flow switch that forwards a message in accordance with a processing rule that defines a matching rule that matches the message and a forwarding destination of a message that conforms to the matching rule;
A plurality of message transfer nodes each holding a routing table, wherein each message forwarding node forwards a message from the source to the destination by forwarding the message via the flow switch according to the routing table;
A control device including a route management unit that manages a route entry that specifies at least a source and a destination message transfer node, and
When one of the message transfer nodes transfers a message according to the routing table, it registers a new route entry in the control device,
The controller is
For the message to be transmitted from the transmission source registered in the route entry to the destination, the message transfer is performed so that the message is transferred through the second transfer route having a smaller hop count than the message transfer route according to the route table. Controlling nodes and flow switches,
A message transfer system. The controller is
The message transfer system according to claim 1, wherein the flow switch is controlled by setting a processing rule for realizing the second transfer path in a flow switch on the second transfer path. The route entry is
The message transfer node of the transmission source that has received the new message registers a new entry having the identifier of the message, the identifier of the own device, and the address with respect to the path management unit of the control device,
The message transfer system according to claim 1 or 2, wherein the message transfer node to which the new message reaches is registered by registering an identifier and an address of its own device as the destination of the new entry. A plurality of message forwarding nodes can be registered as the source of the route entry,
The message forwarding node that has received the new message inquires of the control device whether or not the route entry with the common destination is registered,
When the route entry with the common destination has already been registered, the control device adds the message transfer node as a route entry transmission source, and passes the flow switch from the added transmission source. The message transfer system according to any one of claims 1 to 3, wherein the message transfer node and the flow switch are controlled so as to transfer a message through a third transfer path that reaches the destination. The source message forwarding node is connected to a publisher node in a publishing subscription model;
The message transfer system according to any one of claims 1 to 4, wherein a message transfer node to which the message reaches functions as a rendezvous point in a publish / subscribe model. A flow switch that forwards a message in accordance with a processing rule that defines a matching rule that matches the message and a forwarding destination of a message that conforms to the matching rule;
Each message transfer node holds a routing table, and each message transfer node is connected to a plurality of message transfer nodes that transfer a message from a transmission source to a destination by transferring a message via the flow switch according to the routing table. ,
A route management unit that manages a route entry that specifies at least a source and a destination message forwarding node;
For the message to be transmitted from the transmission source registered in the route entry to the destination, the message transfer is performed so that the message is transferred through the second transfer route having a smaller hop count than the message transfer route according to the route table. A transfer control unit for controlling the node and the flow switch,
A control device characterized by. A message transfer unit for transferring a message as the message transfer node of a peer-to-peer network in which each message transfer node transfers a message from a source to a destination by transferring the message according to a routing table;
When a new message is received, a route entry registration unit that registers a route entry including at least information of the own device in a predetermined control device;
When the destination of the message is reached, a route entry update unit that adds information of the own device to a corresponding route entry of the predetermined control device;
A message forwarding node with A flow switch that forwards a message in accordance with a processing rule that defines a matching rule that matches the message and a forwarding destination of a message that conforms to the matching rule;
A plurality of message transfer nodes each holding a routing table, wherein each message forwarding node forwards a message from the source to the destination by forwarding the message via the flow switch according to the routing table;
A message transfer method in a message transfer system, comprising: a control device including a route management unit that manages a route entry that specifies at least a source and a destination message transfer node;
The message forwarding node registering a new route entry in the control device when forwarding a new message;
For the message to be transmitted from the transmission source registered in the route entry to the destination, the control device transfers the message through the second transfer route having a smaller hop count than the message transfer route according to the route table. Controlling the message forwarding node and the flow switch to do so. A flow switch that forwards a message in accordance with a processing rule that defines a matching rule that matches the message and a forwarding destination of a message that conforms to the matching rule;
A plurality of message transfer nodes each holding a routing table, wherein each message forwarding node forwards a message from the source to the destination by forwarding the message via the flow switch according to the routing table;
A computer comprising the control device of the message transfer system, comprising:
A process of accepting registration of a route entry specifying at least a transmission source and a destination from the message transfer node when transferring a new message by the message transfer node;
For the message to be transmitted from the transmission source registered in the route entry to the destination, the message transfer is performed so that the message is transferred through the second transfer route having a smaller hop count than the message transfer route according to the route table. A program that executes processing for controlling nodes and flow switches.