JPS6286944A - Multiple address communication processing system - Google Patents

Abstract

PURPOSE:To improve the efficiency of information transfer in a multinode multiple address processing by providing an interface for transferring received information to the node of destination of relay and its own node at the same level in a node in which an address node duplicates with a relay node. CONSTITUTION:When plural address nodes pass through the same adjoining node, information to be transferred is one, and accordingly, transfer request connected to external pass queue to adjoining node is made to one. Number of transfer request connected to each pass queue is set to a counter 209. A communication layer 205 transfers the information of a relay file 211 on a corresponding pass. At every time transmission is made, the counter 209 is subtracted 209 with one by one. When the content of the counter 209 becomes '0', the relaying processing of multiple address communication is completed. The address of information transmitted on an internal pass 212 is its own node 21, and after receiving processed by a communication layer 201, it is judged by a routing layer 202 that there is no other node address, and stored in an internal file 210 through a reception informing layer 203.

Description

[Detailed Description of the Invention] [Summary] In multi-node relay processing, in a node where a destination node and a relay node overlap, an interface for transferring received information to the relay destination node and its own node is provided at the same level. , improve information transfer efficiency.

[Industrial application field]

The present invention relates to a data communication method between multi-nodes, and particularly to an information transfer processing method within a node in broadcast communication.

[Conventional technology]

In horizontally distributed information processing networks such as multi-host systems, there is no parent-child relationship between multiple nodes (multi-nodes) in the network.

Normally, any node is allowed to transmit/receive.

In such a multi-node network, if there are other nodes in between when a certain node transfers information to a destination node, they are made to function as relay nodes.

The information relay method by this relay node is as follows.

Even when the destination node is busy or unable to receive data, information can be transferred efficiently.
Asynchronous communication in which a relay file (or relay buffer) is provided in each node, and the relay node that receives a request from the source node autonomously executes information relay operations to the destination node using the information accumulated in the relay file. Conventionally, many methods have been used.

By the way, in such a multi-node network, when broadcast communication is performed to transmit the same information to multiple nodes, a certain relay node may be accompanied by a destination node.

The operation of a conventional multi-node network in such a case will be explained using the specific example shown in FIG. In FIG. 3, 31 to 34 represent nodes such as host computers, and 35 to 37 represent paths between the nodes.

Further, 311 and 312 are terminals belonging to the node 31.

Similarly, 321,322.33'l, 332,341°3
42 are terminals belonging to nodes 32, 33, and 34, respectively; 5. 320 specifically shows a relay file within the node 32 by way of example.

For example, when performing broadcast communication from node 31 to each terminal of nodes 32, 33, and 34, node 32
It serves as a relay node for terminals 3 and 34, respectively, and also serves as a destination node for terminals 321 and 322.

Therefore, the node 32 temporarily stores the information broadcasted from the node 31 in the relay file 320, and then transfers the broadcast information from the relay file 320 to the nodes 33 and 34 at the same time.

Processing is performed to import the information into the own system in order to transfer it to the terminals 321 and 322.

[Problem that the invention seeks to solve]

In the conventional multi-node network broadcast communication system as shown in Figure 3, in a node where the relay node and destination node overlap, the relay processing to other nodes and the input processing to the own node are performed separately. Since the control routines are different from each other, it is necessary to switch between these control routines to execute each process.

Therefore, there is a problem in that the overhead increases and the information transfer efficiency decreases.

[Means for solving problems]

In order to solve the above problems, the present invention makes the interface for sending information from a relay file to another node and the interface for importing information into the own node the same type, so that the own node can be treated as if it were a relay destination node. The control routines can be shared as if they were one of the following. Also, for this reason, an internal path to the own node is provided in parallel to the path to other nodes from the interface.

FIG. 1 shows the basic configuration of the present invention.

In the figure, 11, 12, 13, and 14 are nodes.

15.16.17 is the external path between nodes, 121°12
2 is a terminal belonging to node 12, 123 is a relay file,
124 is a communication interface 5125 is an internal path;
6 represents an internal file.

When a relay communication is sent from node 12 to nodes 12, 13, and 14 as destinations, node 12...

When the information received from the node 12 is analyzed and it is identified as broadcast information destined for, for example, the nodes 12, 13, and 14, the information is stored in the relay file 123.

The communication interface 124 includes an external path 16 . External path 17 to node 14. Internal paths 125 to the own node 12 are connected to each node.

The node 12 primarily controls the communication interface 124, specifies destinations for adjacent nodes that can receive data and its own node, and causes the information stored in the relay file 123 to be sequentially transmitted.

The information sent by the communication interface 124 to the internal path 125 is treated in the same way as information received from an adjacent host, the destination node is identified as the own node, and the information is stored in the internal file 126 for processing.

[Effect]

The method of the present invention allows a node in which a relay node and a destination node overlap, to transmit information without being aware of its own node and other nodes.
Since information transfer processing for relaying and internal import can be performed, control is simplified and processing is made more efficient.

〔Example〕

FIG. 2 shows the configuration of one embodiment of the present invention.

In the figure, 21 is one node in the multi-node network, and adjacent nodes and other nodes are omitted for simplicity. 22°23.24 are external paths to those adjacent nodes.

201 to 205 are hierarchical representations of communication control functions within the node.

Communication layers 201 and 205 perform line control and information transfer processing for paths, respectively.

202 is a routing layer, which identifies the destination of the received information, and determines the destination route of the information depending on whether the destination is only the own node or includes other nodes, the reception notification layer 203 or 204
relay layer.

The reception notification layer 203 stores the information in an internal file 210 when only the own node is the destination.

Request processing.

A relay layer 204 stores the information in a relay file 211 when the destination of the information is only other nodes or includes other nodes and the own node, and at the same time, depending on the destination node, external path queues 206 and 207, Or 20
The transfer request is connected to the internal path queue of 8.

When multiple destination nodes go through the same adjacent node,
Since only one piece of information is required to be transferred, only one transfer request is connected to the external path queue for the adjacent node.

The number of transfer requests connected to each path queue is set in a counter of 209.

The communication layer 205 refers to the contents of each path queue.

Information about the relay file failure 211 is transmitted on the corresponding path. Each time a transmission is performed, one is subtracted from the counter 209. When the content of the counter 209 becomes "0", the broadcast communication relay process ends.

The destination of the information sent on the internal path of 212 is the own node 21, and after being received and processed in the 2nd communication layer 201, it is determined in the routing layer 202 that there is no other node destination, and the internal file is sent via the reception notification layer 203. 210.

In this way, when both other nodes and the own node are included in the destinations, the same transfer control as for the other nodes is applied to the own node, and information is taken in at the same level.

〔Effect of the invention〕

According to the present invention, the control within the relay node is unified, and each node can be viewed and processed in parallel without the need to identify the destination node, which simplifies programming and reduces overhead. Due to this reduction, processing time can be shortened.

[Brief explanation of drawings]

FIG. 1 is a basic configuration diagram of the present invention, FIG. 2 is a configuration diagram of an embodiment of the present invention, and FIG. 3 is an explanatory diagram of a broadcast communication processing method in a conventional system. In Figure 1. 11-14: Nodes 15-17: External path 121.122: Terminal 123; Relay file 124: Communication interface 125: Internal path

Claims (1)

[Claims] In a multi-node network having a node (12) having an information relay function and a broadcast communication function between nodes, the node (12) having the information relay function and a broadcast communication function
2) comprises a relay file (123) that temporarily holds information to be relayed and a communication interface (124) that transmits the information held in the relay file (123) over multiple paths, The multiple paths include external paths (16
, 17) and the internal path (
125), and when the node (12) is instructed to operate as a relay node and destination node during broadcast communication, the information held in the relay file (123) is transferred to the communication interface (124). ) to an external path (16, 17) related to a predetermined relay destination node and an internal path (125) to the own node.