JPS58210736A - Loop type data communication system - Google Patents

Abstract

PURPOSE:To reduce the total capacity of a signal buffer and to make a communication time shorter and shorter as a loop becomes shorter and shorter, by providing each station with a first-in first-out buffer as the buffer. CONSTITUTION:An initialized station 11 when taking the leadership in communication sends plural communication frames in series. Other stations each input received data in a buffer BUF or transmit the received data through the buffer by a transmitter T because the buffer is empty. The frames return to the station after taking a round in the loop and are stored in the buffer temporarily, and the contents of the buffer are transmitted once the final communication frame returns. A receiver R and a transmitter T have an equal operation speed, so an invariably constant amount of data is stored in the buffer and the amount never exceeds one communication frame.

Description

[Detailed Description of the Invention] The present invention provides a loop-type data communication m system improvement Qk: t
Jl There is something to do.

A loop-type data communication system forms a closed loop by connecting a plurality of messages in a circular manner, and during this loop, a communication (r * (r + b Noguru.This type of data is passed through system I.
Jj to mu (number 91.8, 1.j-sign is simply the next communication)--shi:ln (:convey number 8)
Since e is good, transmission M control is 411! There are advantages to becoming

In a loop type data communication system, some kind of communication is required to control the communication of the entire system. , II control device is required. In the conventional rule type data communication system, two internal control stations are installed, but in this case, the system control is relayed or concentrated in one place.46 C1 highly reliable systems It is not preferable to configure μ.

In addition, the conventional loop type f-ta communication system (GJ
, In order to increase the usage efficiency of communication lines, we arrange a quasi-several number of communication frames that circulate around the room in a row, and the sum a1 of the time quality of these communication frames is expressed as (f3' , j or ru 1
Set t1 longer than the time it takes to go around, and the part 1. L, J, Ushiotsu is housed in Hatno 7 on control stage 1. Part 1! 1 go,
The capacity of the buffer is adjusted according to the change in the tightness of the loop, but when the length of the loop is significantly shortened, the protruding portion becomes i% <<E, so the capacity of the buffer is adjusted accordingly. We need to increase the capacity of the
The control station must be controlled in order to achieve a significant reduction in loop quality.

In this case, the time it takes the communication data to go around loop 1, that is, the communication time, depends on how short the loop is (6 and 163). This makes it inefficient.

The purpose of the present invention is to have a control station with a special configuration and to solve the problem of f1 roots.
Provides a route 1 type data communication system that requires a smaller capacity and that the shorter the rule I, the more information the communication station can know.4
There are many things.

Inventor, in a rule-type data communication system 1 in which a plurality of communication stages are connected in a circular manner to a communication line, the plurality of communication stages are Substantive 7
111! i I, / At this time, the communication room is sent, and the communication frame that is being sent to Dosa and Glare is sent to Dosa and Glare. Complete number 4, -send i b ruru. 1. (return υ
(S1.: Buffer the communication room. As soon as the transmission of the communication frame being sent is finished, send the contents of the buffer. In the first stage, the contents of the buffer are sent to help initialize the communication...
Station yell right 4 acquisition 4HL/ < Niitosa buffs the communication frame signal for receipt and payment! This is a loop-type data communication system that is characterized by having a means for directly transmitting the output of Bagno I.

1!1., Example Toni J, -) C Detailed explanation of the present invention 1゜Figure 1, 1. Conceptual configuration diagram of the present embodiment of the present invention C
be.

In Figure 1, number 11 - 111, Ld number 111, Ld number 46 line 2 is connected to five ζ route I.
However, depending on the configuration number of the communication stations 11 to 1n, no single stage has a special configuration as a control station.

The input/output section of each stage is, for example, as shown in Figure 2, a receiver R for human signals, a transmitter I for output signals, a buffer B LJ F for transmitting and receiving Buddha names, and a Ruri controller. It consists of C. The signal on communication line 2 passes through receiver 1 to buffer 7.
= t3 LJ) - is taken in, Hatsuno!・131
The content number of +1= is sent to the C-48 line 2 through the transmitter 1. The contents of the buffer 'I' f3 tl F are controlled by Luli control l<:.

Buff No. 13LJ F.
A stored memory (FIFO) is used. The received data sent by the buffer l= 13 jJ F- is transferred to the output terminal of the buffer y 13 U F- as soon as it is input. . J's l-com, Bachno B LI F
When the receiver is empty, the receiving Y-ta reaches the end of the output horn directly. ;When there is no syllabary,
It is transmitted as soon as f-evening is completed before and after .
There is no difference between the receiver BR and the transmitter 1'4J.

The rule-18 structure of the rule f (I will be Buddha) is a general one T:, for example, as shown in Figure 3 (Jjsu, - flag F first!1111 Text ON
1 and f-ta statement INF. The controller has the following signal flag E and control statement based on N 0.1 - (initiate control, flag) - and control?; J,...) will be prohibited.The transmission of communication will be carried out in order between all communication station consoles.Information and flags related to the control of communication will be rotated between all (communication station consoles): or No., L 1lIII al1 sentence ON
Included in 1.

The communication line 21- has a plurality of 16 rooms serially connected to each other for the first time operation described later. II L/'(il.
/11(I =1 ・”n) is the circulating street (2
7 Raku I of 5 rooms: and control statement CN mouth J L, / Kogatsu (, taking in the [required]'-tar from the communication frame, and 6, and 1 guide go). (If you are there, insert the data for the other communication 1. Snow Sea 3 into the communication route.

In this way, the communication system of FIG.

(Because there is a communication 7 frame II゛ unit (J Rua), while the communication 7 frame is going around the There are no control strings throughout the system.Therefore, in normal communications, a special section is in direct contact with a small officer.

In this way, one communication stage of the fji system and eight communication stages have different time limits for initialization control. ”
The following functions are equally provided. 1 Its function is the smallest one of the time limit of tie 7 (1, stage 31-11 is explained as 6s J---shi)
As the time-up of GJ and Rin occurs, GJ and Y take control of the convex 1 line, and as shown in Figure i4, serially send out multiple 1j5' frames to the δ line 2.

For each other f6 station 1, 9, (mu〆...l
I received J's communication route -lX before l (-by which means,
To myself 4. I learned that I do not have the right to renew L1IIJ,
Input the firing IS data into buffer; 5BUF. Since this buffer l-[3(J f is empty, the received data is
It passes through the empty buffer node 1 and reaches the output end of the transmitter 1.
to five (sent. For this reason, other communication
C, who is J5 in 1st, has a delay due to buffer 71 [3U] (
The signal passes without any trouble.

In the same way, C sequentially passes through 6 snow lines (6 snow lines), and finally reaches communication station 11 (,
To send first, the communication room goes back through the rules and continues sending IJiG communication frames one after another until the communication 7 frame returns.
Insert multiple communication 7 frames into the loop i + 1 first sent (i = i L, then communication 7 frame 1 is returned CI While transmitting frame m
For now, store program 1 in buffer 7-BUF, and then use communication/
Buff 7-B tJ as soon as f6 of L/-mu invitation is finished
Send the contents of F. , these days, buff l-13LJ
Send the rest of M to F
However, the previous part of communication room 1 is stored between 11 and +1 of the device. Therefore, the buffer l' t (LJ l' K) −
cannot exceed λ for one communication rule -11.

Buffer, -131, 1F f-ta is sent [], and subsequent i-events send buffer /'t'l(I F
に人)）Saru. The movement fl of the receiver 1z device 1 and the sender 1b device 1゛
Since the speed 1 decay is 舊(・), the buffer B(1(-) always has a constant value of 72−.

If such communications are being interrupted, during initialization, the station controller 11 sends communications within one frame to buffer 7-BUF. Buffer the station to operate as a buffer I7 station, and all remaining communication stations
1. The buffer tJLlp does not work properly when it is empty. For this reason, the opening of communications was carried out by Kota L and Lou 1.
(J F's ill! 1. S +71 is added. The loop time is determined by the loop.
Since the maximum C between ks is 1 11] and only a part of it, 11 is the minimum possible value for the loop. Moreover, the root is 4.1, The number of passes (g
Immediately after a room is inserted, the rule l-[-( circulates between the communication data and the A<t IF, which improves the efficiency of communication.

Figure 5 shows the relationship between the loop length J, buffer, y Jj, and optimization time by comparing it with the conventional case. Figure 5 shows J, 1. What is the invention, 11. Time and buffer? It is clear that JJ is better than the conventional example.

In the following, the present invention will be described with reference to preferred embodiments; however, the present invention may have various embodiments within the scope of the claims.

4. Explanation FIG. 1 is a conceptual configuration diagram of an embodiment of the present invention, and FIG. 2 is a
1, configuration of the 5th I-Shi1 section, v4j31f
i c, through fg 7 L' lx (1) - example diagram, 4th
The figure is an explanatory diagram of the operation of the apparatus according to the embodiment of the present invention, and FIG. 5 shows the relationship between the quality of the loop I and the quality of the buffer no and the time of communication.

11・～・10... 8th L-shi, 1st, 2nd...
Communication line, R...receiver (g device, 1... transmitter, L3U
l... Baft, (:... Shiroi device, 1-...7
Blowfish, ONl...control statement, lNl-...)-゛-ta sentence agent patent attorney l Ozawa 1^ 11: base l
Row 3 Cap F CRT INF

Claims (1)

[Claims] A loop-type data communication system in which a plurality of communication channels are connected in a C ring shape by communication lines.
Multiple attendance 4. The switch is substantially <. ) 〆-Stoin--Non-t-Stored MessC゛Subba)・Fl/, and when communication initializes the right to become a buffer 'i・snow'' Send -11 1. When communication frame 11, which was first sent, returns after going around the roots, it is currently transmitting)l! J Yu7L
- To send the message completely, return to the communication frame [,
・It stores the contents of the buffer in a buffer and transmits the contents of the buffer as soon as the transmission of the currently transmitting communication room is completed, and the right to become the buffer station member at the time of communication initialization is set. 1. Is the fa number of the received communication frame buffered?
Buff with human power? The output of 1t', tk,
A patented router-type data communication system comprising a means for transmitting data.