Information processing system

Abstract

In an information processing system including a first node, a second node, and a third node, the first node calculates a first score for data transmission from the first node to the third node based on a rule stored in advance, and transmits the first score to the second node. The second node calculates a second score for data transmission from the second node to the third node based on the rule stored in advance, and transmits the second score to the first node. In a case where it is determined that the second score is lower than the first score, the first node transmits data whose destination is set to the third node to the second node. The second node transmits the data received from the first node to the third node.

Description

Technical Field

[0001] This disclosure relates to information processing systems. Background Technology

[0002] Japanese Patent Application Publication No. 2009-218626 discloses a path multiplexing communication system, which is configured such that: a sending node sends a path multiplexing request message to a relay node, and if the relay node replies with a path multiplexing clearance message to the sending node, the sending node sends data to the relay node.

[0003] In the technology described in Japanese Patent Application Publication No. 2009-218626, adjacent nodes send relay requests (path reuse request messages) to each other. Even when both parties grant permission for relaying, useless communication occurs between these nodes. As a result, unnecessary multi-hop paths are created, and the quality of end-to-end communication is reduced, making efficient communication impossible.

[0004] In addition, the relay's licensing benchmark varies depending on the computing program and settings installed on each node, so fairness between nodes cannot be guaranteed. The higher the licensing benchmark of a node, the less burden the relay bears, and efficient communication cannot be achieved. Summary of the Invention

[0005] This disclosure was made in view of the above circumstances, and its purpose is to provide an information processing system that enables more efficient communication between nodes.

[0006] The information processing system disclosed herein includes a first node, a second node, and a third node, wherein,

[0007] The first node mentioned above is composed of:

[0008] Based on pre-stored rules, a first score is calculated for the data sent from the first node to the third node.

[0009] Send the first score mentioned above to the second node mentioned above.

[0010] The second node mentioned above is composed of:

[0011] Based on the pre-stored rules described above, a second score is calculated for the data sent from the second node to the third node.

[0012] Send the second score mentioned above to the first node mentioned above.

[0013] If the second score is determined to be lower than the first score, the first node will send the communication traffic to the third node as a packet with the destination set to the third node to the second node.

[0014] The second node will send the packet received from the first node to the third node.

[0015] The information processing system disclosed herein includes a first node, a second node, and a third node, wherein,

[0016] The first node mentioned above is composed of:

[0017] Based on pre-stored rules, a first score is calculated for the data sent from the first node to the third node.

[0018] Send the first score mentioned above to the second node mentioned above.

[0019] The second node mentioned above is composed of:

[0020] Based on the pre-stored rules described above, a second score is calculated for the data sent from the second node to the third node.

[0021] Send the second score mentioned above to the first node mentioned above.

[0022] If the second score is determined to be lower than the first score, the first node sends data to the second node setting the destination to the third node.

[0023] The second node will send the data received from the first node to the third node.

[0024] In the information processing system disclosed herein,

[0025] The second node mentioned above is composed of:

[0026] In the case of receiving the aforementioned data from the first node mentioned above

[0027] Based on the pre-stored rules described above, the second score is calculated for the data transmitted from the second node to the third node.

[0028] If the second score is determined to be lower than the first score, the data will be sent to the third node.

[0029] In the information processing system disclosed herein, the communication link between the first node and the second node is WiFi communication.

[0030] In the information processing system disclosed herein, the first node and the second node calculate the amount of data to be sent that does not converge to a specified threshold based on the pre-stored rules, and use this as the first score or the second score.

[0031] In the information processing system disclosed herein, the first node, the second node, and the third node are defined with different priorities for communication traffic and with distinct queues and rules. The first node calculates a first score for each of the aforementioned levels based on pre-stored rules. The second node calculates a second score for each of the aforementioned levels based on pre-stored rules. When the second score is determined to be lower than the first score in a higher priority level, the first node sends data to the second node with the destination set to the third node.

[0032] According to this disclosure, an information processing system is capable of enabling more efficient communication between nodes. Attached Figure Description

[0033] The features, advantages, and technical and industrial significance of exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which the same reference numerals denote the same elements, wherein,

[0034] Figure 1 This is a simplified structural diagram of the information processing system involved in the implementation method.

[0035] Figure 2 It is a sequence diagram representing the processing order of an information processing system.

[0036] Figure 3 This is a simplified structural diagram of the information processing system involved in Embodiment 1.

[0037] Figure 4 This is a diagram representing the information processing system when the second score is large.

[0038] Figure 5 This is a simplified structural diagram of the information processing system involved in Embodiment 2. Detailed Implementation

[0039] The information processing system according to the embodiments of this disclosure will be described with reference to the accompanying drawings. Furthermore, the constituent elements in the following embodiments include elements that can be substituted and are easily substituted by those skilled in the art, or elements that are substantially the same.

[0040] Implementation

[0041] Composition of information processing systems

[0042] Figure 1 This is a simplified structural diagram of the information processing system involved in the implementation method. For example... Figure 1 As shown, the information processing system 100 includes node 1, node 2, node 3 and server 4.

[0043] Node 1, Node 2, Node 3, and Server 4 all possess communication capabilities, enabling them to communicate with each other via a communication link to exchange various information. This communication link may consist of public line networks such as the Internet or mobile phone lines, but may also include wireless communications such as WiFi (registered trademark, Wireless Fidelity), BLE (registered trademark, Bluetooth Low Energy), or satellite lines via satellite.

[0044] Node 1 and Node 2 can be, for example, a DCM (Data Communication Module) comprising a processor such as a CPU (Central Processing Unit) and a memory such as ROM (Read Only Memory) and RAM (Random Access Memory), but can also be various terminals such as smartphones and personal computers. The communication link L1 between Node 1 and Node 2 is WiFi communication. Furthermore, the communication links L2 and L3 between Node 1 and Node 2 and Node 3 are cellular lines.

[0045] Node 3 can be implemented, for example, through a general-purpose computer such as a workstation or personal computer, which includes a processor consisting of a CPU and a memory consisting of ROM and RAM.

[0046] Server 4 is implemented, for example, through a general-purpose computer such as a workstation or personal computer, which includes a processor such as a CPU and a memory such as ROM and RAM. Server 4 generates scoring rules that determine the rules for calculating scores and distributes them to Node 1, Node 2, and Node 3. Furthermore, the rules are not limited to scoring rules for calculating scores; they can also be rules for calculating levels and priorities. Additionally, the rules can be pre-stored in the memory of each node.

[0047] Information processing system processing

[0048] Next, the processing performed by the information processing system 100 will be described. Specifically, the processing of sending data from node 1 (the first node) to node 2 (the second node) and then to node 3 (the third node) will be described.

[0049] Figure 2 It is a sequence diagram representing the processing order of an information processing system. For example... Figure 2 As shown, node 1 calculates the first score SC1 (S1) for data transmission from node 1 to node 3 based on the scoring rules pre-distributed from server 4 and stored in memory.

[0050] Next, node 1 sends the calculated first score SC1 to node 2 (S2).

[0051] If node 2 receives the first score SC1 from node 1, it calculates the second score SC2 (S3) for the data sent from node 2 to node 3 based on the scoring rules that were pre-distributed from server 4 and stored in memory.

[0052] In addition, node 2 sends the calculated second score SC2 to node 1 (S4).

[0053] If a second score SC2 is received from node 2, then node 1 compares the first score SC1 with the second score SC2 (S5).

[0054] If the second score SC2 is determined to be lower than the first score SC1, Node 1 will send the communication traffic to Node 3 as a packet destined for Node 3 to Node 2 (S6). Furthermore, if the second score SC2 is determined to be higher than the first score SC1, Node 1 can send packets directly to Node 3, but cannot relay packets from Node 2 to Node 3. In this case, if the relay from Node 2 to Node 3 is delegated, Node 1 will send packets to Node 3.

[0055] Then, upon receiving data from node 1, node 2 sends the packet received from node 1 to node 3 (S7). Furthermore, upon receiving data from node 1, node 2 can also recalculate a second score SC2 for the data transmission from node 2 to node 3 based on the scoring rules. If it is determined that the calculated second score SC2 is lower than the first score SC1, node 2 can also send the data to node 3.

[0056] According to the implementation described above, in addition to path R1, which sends data directly from node 1 to node 3, node 1 can also effectively utilize the relay path R2, which sends data from node 1 to node 3 via node 2. In this process, nodes 1, 2, and 3 calculate scores using the same scoring rules. Since relaying only from the higher-scoring node to the lower-scoring node is performed, useless communication between nodes can be prevented, thereby enabling more efficient communication between nodes.

[0057] In addition, according to the implementation method, nodes 1, 2 and 3 calculate scores using the same scoring rules, so the relay burden of each node will not be unbalanced, thereby enabling more efficient communication between nodes.

[0058] Furthermore, in this embodiment, an example is described where node 1 sends a first score to node 2, and node 2, upon receiving the first score, sends a second score to node 1; however, this is not a limitation. Nodes 1 and 2 may also recalculate the score and exchange the calculated scores after each relay communication is completed. Additionally, if a condition affecting the score is detected, nodes 1 and 2 may also recalculate the score and exchange the calculated scores. Conditions affecting the score include, for example, a decrease in the speed of communication link L2 or communication link L3, or the input of sudden traffic surges. Furthermore, nodes 1, 2, and 3 may calculate and send the score at predetermined intervals, with each node always maintaining the latest score of its neighboring nodes. In this case, a node with a higher score can delegate data relay to a neighboring node with a lower score.

[0059] Example 1

[0060] Composition of information processing systems

[0061] Figure 3 This is a simplified structural diagram of the information processing system according to the first embodiment. (As shown...) Figure 3 As shown, the information processing system 200 includes node 11, node 12 and node 13.

[0062] Nodes 11 and 12 are, for example, a DCM including a processor such as a CPU and a memory such as ROM and RAM, but can be various terminals such as smartphones and personal computers. The communication link L11 between Node 11 and Node 12 is WiFi communication. In addition, the communication links L12 and L13 between Node 11 and Node 12 and Node 13 are cellular lines.

[0063] Node 13 is implemented, for example, by a server that includes a processor consisting of a CPU and other components, and a memory consisting of ROM, RAM and other components.

[0064] The same scoring rules are pre-stored in the memory of nodes 11, 12, and 13. Additionally, data for objects to be sent is accumulated from application client 11a and application client 12a in the send queues of nodes 11 and 12, respectively. Similarly, data for objects to be sent is accumulated from application server 13a in the send queue of node 13.

[0065] Information processing system processing

[0066] Nodes 11 and 12 detect their proximity within the WiFi communication link L11 using beacons and Hello messages. Furthermore, Nodes 11 and 12 include neighboring node information in their beacons and Hello messages. Thus, Node 11 detects that Node 12 can connect to Node 13 via the cellular communication link L13. Similarly, Node 12 detects that Node 11 can connect to Node 13 via the cellular communication link L12.

[0067] Nodes 11 and 12 calculate, based on rules pre-stored in memory, the amount of data accumulated in the transmission queue that has not converged to a specified threshold as a first score or a second score. Specifically, Node 11 calculates the first score as the amount of data to be transmitted by Node 11 minus (estimated frequency band value of communication link L12 × specified delay value). Similarly, Node 12 calculates the second score as the amount of data to be transmitted by Node 12 minus (estimated frequency band value of communication link L13 × specified delay value).

[0068] Furthermore, if the time until the end of the data to be sent is close to or exceeds the specified delay value due to increased traffic, nodes 11 and 12 delegate the relay to node 13 to their neighboring nodes in order to reduce latency. Therefore, nodes 11 and 12 send the calculated score.

[0069] In addition, the calculation formula for the amount of relayable data can be specified in the scoring rules. For example, node 11 calculates the amount of relayable data as (first score - second score) × a predetermined margin ratio. The predetermined margin ratio is a pre-determined value of less than 1.

[0070] exist Figure 3 In the state shown, the amount of data accumulated in the queue to be sent by node 11 is greater than that in the queue to be sent by node 12. That is, the second score is lower than the first score. Therefore, in addition to path R11, which sends data directly from node 11 to node 13, node 11 can also effectively utilize the relay path, i.e., path R12, which sends data from node 11 to node 13 via node 12.

[0071] Figure 4 This is a diagram representing the information processing system when the second score is relatively large. Figure 4 In the state shown, the amount of data accumulated in the queue to be sent by node 11 is less than that in the queue to be sent by node 12. That is, the second score is higher than the first score. Therefore, in addition to the path of sending data directly from node 12 to node 13, node 12 can also effectively utilize the relay path of sending data from node 12 to node 13 via node 11.

[0072] Additionally, when sending data to node 11, such as Figure 4 As shown, in addition to path R13, which sends data directly from node 12 to node 11, node 12 can also effectively utilize the relay path R14, which sends data from node 12 to node 11 via node 13.

[0073] According to Embodiment 1 described above, in these processes, nodes 11, 12, and 13 calculate scores using the same scoring rules. Since relaying only from the higher-scoring node to the lower-scoring node is performed, useless communication between nodes can be prevented, thereby enabling more efficient communication between nodes.

[0074] In addition, according to Embodiment 1, nodes 11, 12 and 13 calculate scores using the same scoring rules, so the relay burden of each node will not be unbalanced, thereby enabling more efficient communication between nodes.

[0075] Furthermore, when the communication links from the transmitting node to the relay node and from the relay node to the destination node consume shared resources (e.g., when both communication links are WiFi on the same frequency band), it is preferable to use half of the frequency band estimation value measured in the absence of relaying for the scoring calculation. This is because relaying consumes the resources of two links.

[0076] Example 2

[0077] Composition of information processing systems

[0078] Figure 5 This is a simplified structural diagram of the information processing system according to the second embodiment. (Example) Figure 5 As shown, the information processing system 300 has nodes 21, 22 and 23.

[0079] Nodes 21 and 22 may be, for example, a DCM including a processor such as a CPU and a memory such as ROM and RAM, but can be various terminals such as smartphones and personal computers. The communication link L21 between nodes 21 and 22 is WiFi communication. Furthermore, the communication links L22 and L23 between nodes 21 and 22 and node 23 are cellular lines.

[0080] Node 23 can be implemented, for example, through a server that includes a processor consisting of a CPU and other components, and a memory consisting of ROM, RAM and other components.

[0081] Nodes 21, 22, and 23 define multiple levels with different priorities for communication traffic, and each has its own distinct queues and rules. Here, we will illustrate these levels with high priority and low priority as examples.

[0082] Specifically, nodes 21, 22, and 23 have high-priority queues and low-priority queues. Furthermore, the same scoring rules are pre-stored in the memory of nodes 21, 22, and 23. These scoring rules calculate scores based on different rules for high-priority and low-priority data.

[0083] In the high-priority send queues of nodes 21 and 22, data for the send objects is accumulated from application clients 21a and 22a, respectively. In the low-priority send-waiting queues of nodes 21 and 22, data for the send objects is accumulated from application clients 21b and 22b, respectively.

[0084] Similarly, in the high-priority send-waiting queue of node 23, data of the send object is accumulated from application server 23a, and in the low-priority send-waiting queue of node 23, data of the send object is accumulated from application server 23b.

[0085] Information processing system processing

[0086] Nodes 21 and 22 detect their proximity within the WiFi communication link L21 using beacons and Hello messages. Furthermore, both nodes 21 and 22 include neighboring node information in their beacons and Hello messages. Thus, node 21 detects that node 22 can connect to node 23 via the cellular communication link L23. Similarly, node 22 detects that node 21 can connect to node 23 via the cellular communication link L22.

[0087] Nodes 21 and 22 calculate the amount of data accumulated in the queue to be sent that has not converged to a specified threshold, based on scoring rules pre-stored in memory, as either a first score or a second score. Furthermore, node 21 calculates the first score for each level based on the scoring rules pre-stored in memory, and node 22 calculates the second score for each level based on the scoring rules pre-stored in memory.

[0088] Specifically, Node 21 calculates the first score as (the amount of data to be transmitted at Node 21's specified level + the amount of data to be transmitted at Node 21's higher priority level) - (the estimated frequency band value of communication link L22 × the specified delay value of Node 21 at that level). Similarly, Node 22 calculates the second score as (the amount of data to be transmitted at Node 22's specified level + the amount of data to be transmitted at Node 22's higher priority level) - (the estimated frequency band value of communication link L23 × the specified delay value of Node 22 at that level).

[0089] Furthermore, if the time until the end of the data to be sent is close to or exceeds the specified delay value due to increased traffic, in order to reduce the delay, nodes 21 and 22 delegate the relay to node 23 to their neighboring nodes, and thus send the calculated score.

[0090] In addition, the calculation formula for the amount of relayable data can be specified in the scoring rules. For example, node 21 calculates the amount of relayable data as (the first score of node 21 for the specified level - the second score of node 22 for the same level) × the predetermined margin ratio for that level. The predetermined margin ratio is a value less than 1 that is predetermined for each level.

[0091] Furthermore, if the second score is determined to be lower than the first score in a higher priority level, node 21 sends data to node 22 with the destination set to node 23.

[0092] exist Figure 5 In the state shown, the high-priority queue to be sent at node 21 has a larger accumulated amount of data compared to the high-priority queue to be sent at node 22. That is, the second score is lower than the first score. Therefore, in addition to path R21, which sends data directly from node 21 to node 23, node 21 can also effectively utilize path R22, which serves as a relay path for sending data from node 21 to node 23 via node 22.

[0093] According to Embodiment 2 described above, in these processes, nodes 21, 22, and 23 calculate scores using the same scoring rules, and relay is only performed from the node with the higher score to the node with the lower score. Therefore, useless communication between nodes can be prevented, thereby enabling more efficient communication between nodes.

[0094] In addition, according to Embodiment 2, nodes 21, 22 and 23 calculate scores using the same scoring rules, so the relay burden of each node will not be unbalanced, thereby enabling more efficient communication between nodes.

[0095] Further effects and modifications can be readily derived by those skilled in the art. Therefore, the invention is not limited to the specific detailed and representative embodiments shown and described above. Thus, various modifications can be made without departing from the spirit or scope of the general concept of the invention as defined by the additional technical solutions and their equivalents.

Claims

1. An information processing system, comprising a first node, a second node, and a third node, characterized in that, The first node is configured as follows: Based on pre-stored rules, a first score is calculated for the data sent from the first node to the third node. Send the first score to the second node. The second node is configured as follows: Based on the pre-stored rules, a second score is calculated for the data sent from the second node to the third node. Send the second score to the first node. If the second score is determined to be lower than the first score, the first node will send the communication traffic destined for the third node to the second node as a packet with the third node as the destination. The second node will send the packet received from the first node to the third node.

2. An information processing system, comprising a first node, a second node, and a third node, characterized in that, The first node is configured as follows: Based on pre-stored rules, a first score is calculated for the data sent from the first node to the third node. Send the first score to the second node. The second node is configured as follows: Based on the pre-stored rules, a second score is calculated for the data sent from the second node to the third node. Send the second score to the first node. If the second score is determined to be lower than the first score, the first node sends data to the second node setting the destination to the third node. The second node will send the data received from the first node to the third node.

3. The information processing system according to claim 2, characterized in that, The second node is configured as follows: In the case of receiving the data from the first node Based on the pre-stored rules, the second score is calculated for the data sent from the second node to the third node. If the second score is determined to be lower than the first score, the data is sent to the third node.

4. The information processing system according to claim 2, characterized in that, The communication link between the first node and the second node is WiFi communication.

5. The information processing system according to claim 2, characterized in that, The first node and the second node calculate the amount of data to be sent that has not converged to a specified threshold based on the pre-stored rules, and use this as the first score or the second score.

6. The information processing system according to claim 2, characterized in that, At the first node, the second node, and the third node Multiple levels are defined, each with different priorities for communication traffic and distinct queues and rules. The first node calculates the first score according to each of the pre-stored rules. The second node calculates the second score according to each of the pre-stored rules. If, in the higher priority level, the second score is determined to be lower than the first score, the first node sends data to the second node with the destination set to the third node.

Images