JPS61273048A - Transmission control system - Google Patents

Abstract

PURPOSE:To send a data to a normal node without fail by sending a data to all output lines and allowing other nodes receiving the data except that from its own node to send a reception data to all output lines connected to its own node. CONSTITUTION:A node 1 hatched in figure sends a data as a data sender and let the serial number be 1. In sending the data in the path in thick solid lines, since the data is sent in the order or node numbers 1, 2, 3, 5, 6, 8, data arrival node identification numbers 2, 3, 5, 6, 8 are added in order. When a data where its own node identification number is included in the data arrival node identification number string is received, its own node erases the data. The path of data flowing includes all paths possible for sending the data. Thus, a detour for node fault of a transmission line fault is included. The thick solid lines correspond to the path when the node numbers 4, 7 are faulty. Thus, even when the faulty part is not detected in advance, the data is sent completely within the normal node and transmission line so long as there is no isolation node or line.

Description

[Detailed description of the invention] [Field of application of the invention] The present invention relates to a transmission control method for any transmission system.

The present invention relates to a transmission control method suitable for transmission in which the same control algorithm is used to transmit information to the maximum extent within the transmission system regardless of the presence or absence of a failure within the transmission system.

[Background of the invention]

Conventional transmission control methods for transmission systems require control algorithms to detect failures in the transmission system and configure detours, making transmission control more complex. There is. Regarding related control methods of this type, for example, see Computer Communications.
ions) Volume 2, No. 4 (August 1979), the paper "Survey of Computer Communications Loop Networks"
ComputerCo+mmunications
1oop networks)”.

[Purpose of the invention]

The purpose of the present invention is to solve the problem of node failure in any transmission system.
An object of the present invention is to provide a transmission control method that enables normal information transmission between nodes without changing the control method even if a transmission path failure occurs.

[Summary of the invention]

In conventional transmission systems, the route from one source to the destination is determined in advance, and if a failure occurs in a node or transmission path,
This involves changing the transmission route to bypass the failure location. In this case, transmission control differs depending on whether there is a failure or failure, and the control algorithm becomes complicated. Therefore,
The data source node transmits data to all its output lines, and each other node that receives data other than its own transmits the received data to all output lines from its own node. The present invention provides a data transmission method for transmitting data to By doing this, all data will be transmitted to fault-free nodes and transmission lines, unless they are isolated, and transmission control will not select the transmission line that should be output, but will Since the signal is sent to the output path, simple and easy control can be achieved.

[Embodiments of the invention]

An embodiment of the present invention will be described below.

An example of the overall configuration of the transmission system is shown in FIG. 1, 1o1.

A host computer 102 generates and processes data. A node 102 sends data to a transmission system and relays data. 103 is a transmission line, which is a data communication medium. In this transmission system, the flow of data based on the transmission control method of the present invention is shown in FIG. 2. 201 is a data source node, and the flow of data issued from this source node is as follows.
First, it will look like 202. In other words, data is transmitted on all output lines (two lines in this example) from the source node, and each node that receives these data,
Relay data to all output lines coming out of the own node. In FIG. 2, thick solid lines for each node indicate the flow of data during data relay.

The system configuration of a node that performs such data transmission is shown in FIG. 3. The operation of the node is as follows:
The signal transmitted by the input interface 3
02. It passes through the processing device 303 and is stored in the reception buffer 304 . The data stored in the reception buffer 304 is transferred to the host side signal line 311 by the processing device 303.
A determination is made as to whether the data should be sent to the computer, deleted, or relayed as-is, and processing is performed accordingly. When transferring data, the data is written in the transmission buffer 307 and transmitted to the output signal lines 309 and 310 through the output interface 308;
The timing of transmission to 310 is determined by timer 1 (
305), determined by timer 2 (306).

Also.

When data is generated from the host computer.

The data is stored in the transmission buffer 307 from the host side signal line 311 through the interface 312, and the subsequent transmission processing is the same as described above.

Next, FIG. 4 shows a data message of a signal inputted through the input signal line 301, with flags 401 and 408 indicating the beginning and end of data to be transmitted and received, respectively. 403 is the source address of the data, which can identify whether the data originates from the node. 404 is a serial number, which indicates how many pieces of data have been sent from the node indicated by the source address. 405 is a data content code, which is a code for identifying the content of the received data. . This data content code 405
406 is the content of the data itself, which is determined in advance within the system.

407 is a bit string of 0 or more for checking transmission errors, and a data arrival node identification number 402. This indicates the address of the node that received the data, and also includes the data arrival node identification number 402,
This will be referred to as data arrival node identification number string 409.

The fifth example shows an example of data message transmission as described above.
It is a diagram. However, as data messages, flags,
The data content code and frame check sequence are omitted. First, node 1 in the shaded area becomes a data source and emits data.

The serial number is 1. Let us take as an example a case where this data is transmitted along the route indicated by the thick solid line. This data includes node numbers 1, 2,
Data message 5 is transmitted in the order of 3, 5, 6, 8.
01 includes data arrival node identification numbers 2, 3, 5, 6, .
8 is added in sequence, and the data message becomes 502 just before returning to the source node 1. The data arrival node identification number assigned here is to prevent data from remaining in an infinite loop within the transmission path and from receiving the same data repeatedly. In other words, when receiving data whose own node identification number is included in the data arrival node identification number string, that node has previously received and relayed the data, so there is no need to relay that data anymore. Instead, the data will be erased (not sent) on its own node.

Further, there are several possible cases in which double reception of data occurs. This is a case where data that is new to the receiving node is transmitted through different routes.An example is shown in FIG. 5. This is a case of two routes, a thick solid line and a large broken line, from node numbers 1 to 3. Since the data originates from node number 1, node number 3 does not exist in the data arrival node identification number string just before reaching node 3 on both routes, and the data is duplicated if the data arrival node identification number string alone is used. If reception cannot be prevented and data is received for the first time for the node, each node registers the received data serial number management table, a table for registering the source node identification number and serial number of the received data. , the source node identification number and serial number of new data are registered to prevent double capture of the same data received later.

FIG. 6 shows a received data serial number management table.

601 is a source node identification number, and 602 is a serial number. Further, 603 is a serial number registration end symbol indicating the end of serial number registration of received data.

Next, when the node determines that data has been received for the first time, it determines whether or not to capture the data and send it to the host computer, and executes it.The decision is shown in Figure 7. This is done by referring to the data shown in the table below.

Each node has a data code table.

The content code of the data that each node should import is registered. Therefore, when new data is received, it is checked whether the data content code in the data message is registered in the data code table, and if it is registered, the data is imported into the host computer, and if it is not registered, it is checked. , only transfers data without importing it to the host computer.

FIG. 8 shows the transmission control algorithm of the nodes described above.

According to this embodiment, the paths through which data flows include all paths through which data can be transmitted. Therefore, it also includes a detour in case of node failure or transmission line failure.

To explain this in Figure 5, the thick solid line indicates that data transmission is possible without detecting the failure point in advance from 0 or more, which corresponds to the route when node number 4.7 fails. This can be carried out completely within the range of normal nodes and transmission paths, as long as there is no isolation, and the transmission control algorithm has the advantage that it can be the same regardless of whether there is a failure or not.

〔Effect of the invention〕

According to the present invention, each node transmits or transfers data to all output lines coming out from its own node, regardless of whether there is a failure such as a node failure or a transmission line failure in the transmission system. As long as the node is not isolated, data can always be transmitted to a normal node, and when transmitting data, all output lines can be used without being identified, which has the effect of simplifying transmission control. be.

[Brief explanation of the drawing]

FIG. 1 is a schematic diagram showing the overall configuration of an embodiment of the transmission control method of the present invention, FIG. 2 is an explanatory diagram of the data flow according to the present transmission control method, and FIG. Figure 4 is an explanatory diagram of data messages in this transmission control method.
FIG. 5 is an explanatory diagram of an example of data message transmission, FIG. 6 is a serial number management table for received data, FIG. 7 is a data code table, and FIG. 8 is a transmission control algorithm. 101...Host computer, 102...Node, 10
3...Transmission path, 201...Data source node, 2
02...Data flow from the source node, 301.
...Input signal line, 302...Input interface, 3
03... Processing device, 304... Reception buffer, 30
5...Timer 1.306...Timer 2.307...
- Transmission buffer, 308... Output interface, 3
09, 310... Output signal line, 311... Host side signal line, 312... Interface, 401... Flag, 402... Data arrival node identification number, 403
...Data source address, 404...Serial number, 40
5...Data content code, 406...Data content, 407...Frame check sequence, 408...
... Flag, 409 ... Data arrival node identification number string, 501, 502 ... Data message example, 601.
...Data source address, 602...Serial number, 603
...End of serial number registration Figure 3 Figure 5 Figure 7 Verbal threat/e9 Self-1-+ Monk

Claims (1)

[Claims] In any transmission system consisting of a transmission path between nodes that send and receive information, the identification number of the information source, the serial number of the information at the source, and the identification number of the node where the information has reached are added to the information as a data message. This transmission control method is characterized by transmitting and receiving from each node to all transmission paths that can output.