JPS60219850A - Communication control system - Google Patents

Abstract

PURPOSE:To decrease data transfer time by providing a protocol layer reporting the state of the number of idle reception buffers of each station and another protocol layer controlling an opposite station of data transfer and its control. CONSTITUTION:Stations A, B consist of application CPUs 5, 5' and communication control sections 6, 6' and they are connected through cables 7, 7', transceivers 8, 8' and a coaxial cable 9. The protocol layer reporting the state of the idle reception buffer number of the stations A, B and the other protocol layer controlling the opposite station of data transfer and its content are provided and a data request message is made unnecessary in a data transfer sequence where one data message is a prescribed amount or blow.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a communication control system, and particularly to a communication control system using a protocol having a hierarchical structure.

2. Prior Art When data is transferred between two stages, each station operates as shown in FIG.

B is the main CPU 1゜1' that executes the user's job.
and communication control unit 2, 2' that controls communication and memo '73
．． 3', and a line 4 connects both communication control units. Both communication control units 2.2'a control data transfer according to the communication protocol.

FIG. 2 is a sequence chart of a conventional communication pulley, which is 7-ray control with one packet per message.

When data is transferred between stations A and B, receiving station B receives the sequence number 1 and flow count value (
1) with ■]) at, a R@1(1 (data request), ■ ACK (response) to this and ■
Receive Data.

Next, the received data]) is checked, and the result of this check, ■ACKS1, is transmitted.

At the transmitting station AIC, check the contents of 0 AC'.
In this case, K assumes that receiving f1 station B has correctly received the data, and the series of data transfer processing ends without retransmitting %1)ata. However, as the processing speed of systems increases,
There is a drawback that the processing time for data transfer becomes longer by the transmission period of ACKs 1 and 2.

Purpose The purpose of the present invention is to improve such conventional drawbacks, and to perform data transfer without providing a data request message by monitoring the receiving buffer empty state of the other station.
It is an object of the present invention to provide a communication control method that can shorten data transfer time.

I Hereinafter, the configuration of the present invention will be explained using examples.

6 is a sequence chart of a communication protocol showing an embodiment of the present invention, FIG. 4 is a block diagram of the configuration of a station, FIG. 5 is a diagram showing a layered structure of the protocol, and FIG. FIGS. 6(a) to 6(+1) are diagrams showing an example of the configuration of the Ic transmission format.

In Figure 4, 5.5' is the application CPU;
6.6' is the communication control unit, 7 and 7' are the cables, and 8.8'
is a transceiver, and 9 is a coaxial cable.

The application layer 10 in FIG. 5 is the top layer, and the session layer 11. Transport layer 12゜Network layer 16. Data link 114. This is a protocol layer that is a lower layer in the order of the physical HI 115.

In Figure 6, 20.21.22.22', 22"
, 26°26', 2s' is data information, 61.32.3
2', 32' are host level protocol control information;
41.41'.

41', 42.42', 42' are network level protocol control information, 51, 51', 51N are link level protocol k uJ phosphor i1 information, (I
L)I (b), (o), and (a) are data information only, data information with host-level protocol control information in the header, and data information with both network-level and host-level protocol control information in the header, respectively. ,
Transmission of data information with both link level and network level protocol control information in the header 7 Oh! This is an example of Tsuto.

The sequence chart in FIG. 6 shows the case where data is transferred between stations A and 8 in FIG. 4, and is 70-control with one packet per message. This data transfer is controlled by the application layer 10 protocol shown in FIG.
, 22', 26.23', 23''.

The communication control unit of each station determines that the number of free spaces in the built-in receive buffer is the specified number (because the free receive buffer is busy,
(referred to as the BBC), and when it is below, it notifies all other stations. At the same time, since the status of 13BC in all stations other than 1 is constantly monitored from the reception of the broadcast message, stations below the BBC are stored as being in a "BUSY state" and no data is sent to that station. In addition, B
Since BCIC specifies the number of buffers required to receive one data message, it determines the optimal value from K, such as the number of stations in the system and the transmission traffic, and stores it in advance from the console to a file on a disk, etc. BB of the internal memory from the file when the power is turned on.
Set in area C.

Also, contrary to the above, the number of free spaces in the receive buffer is fixed (
It constantly monitors whether the number of ready-occurring free reception buffers (referred to as RBC) is greater than or equal to the number, and when the number is greater than the number, all other stations K11l are notified. Each station that receives this notification changes the BUSY stored when the BBC is below to the "ready state 1" so that data can be sent to that station at any time. In addition, R.B.C.
Set T to a larger value with a little margin (b) than the BBC.

RBC-BBC+α (1) Therefore, the communication control unit that receives the message sending command waits for the message if the transfer destination station in the HBC area of the internal memory is in a BUSY state, Execute sending after changing to ready state.

The above-mentioned simultaneous broadcast message is controlled by the data link layer 14 protocol shown in FIG. The level destination address has an individual station address and a broadcast address, and each receiving station receives the message when it detects a station address or a broadcast address addressed to its own station. Import into receive buffer.

Therefore, the complete address of the simultaneous broadcast message sent when the value changes to less than EBC or more than RBC becomes - simultaneous broadcast address.

When the transmitter executes the data transfer process, the session layer 11 protocol of FIG. 5 and FIG. 8146(b).

Using the host-level protocol control information of (0),
A data transfer request is notified to the other station (for example, station B). Thereafter, the communication control unit of the transmitting/receiving station is notified of the transfer command, the number of 1-transmission request packets, 5 RPC, and the received (a request packet number, RRPC), and data transfer between the two communication control units begins.

The above data transfer will be explained with reference to FIGS. 7 to 9 showing operation flowcharts and FIG. 10 showing main storage areas of the internal memory.

At the receiving station, as shown in FIG.
The RRPC from the PU is set in the RRPC area 204 of the internal memory 200 (Step 61), and compared with the NRPC (the number of packets that can omit data request messages, that is, the BBC≦NRPC (the RBC)) (Step 62) , if the number of RRPCs is small, no data request message is sent, and TIL data packet reception processing is performed (step 69).

On the other hand, if the RRPC is large, the self-station status area 202 that stores the BUSY/LETI status of each station is confirmed to be in the ready state (step 6), as in the conventional communication protocol.
5), RRPC and the number of free spaces in the reception buffer are compared (step 64), and 7. R.-count value n (number of free buffers that can be received) is determined (steps 65 and 66). Wait until the other station becomes ready (step 100).
), sends a data request message (step 69), and receives an ACK (step 68). Every time one packet of data is received, the received packet counter 210 increases by 1 (step 69), and when the flow count value nlc is reached (step 70), waits for the ready state of the partner station (step 1υ0), and then sends an ACK for 9 data.
At the same time as sending out (step 71), the reception bucket counter 209 is cleared and the amount received from RRPC is added to σ.
1 (step 72), and receives all RRPC data.
The operation is repeated until it is completed (step 76). Note that the ready status of the other station can be determined by pressing the button or button as shown in Figure 9.
Step 101) to read out the opponent's Kusunoki of the stage an database @ castle 202, if the BUSY status is traced (step 1)
02), enter the ready queue 205 (step 103), and wait for the ready status of the other station to change (mw-).
Steps 104, 105, 106), Ready Waiting 2
05 (step 107).

At the transmitting station, as shown in FIG.
The 5RPC from the PU is set in the 5RPC area 206 (step 81) and compared with the NRPC (step 82). If the number of 5RPCs is small, skip the data request/message reception and directly send data until the data packet reaches n[ of 5PRCs.Step 8
6-8B, IDO), and time to receive ACK (step 89). On the other hand, if 5RPC is large, similar to the conventional communication protocol, after sending an ACK in response to the reception of the data request message (step 86,
Steps 85, 87, 100.88 When the received flow count value reaches n[, the data should be sent.
), the reception of the human CK is timed (step 89). When the partner station is in the ready state, since the flow count value n is secured, it is possible to send data without a data request or message from the second time onwards. The operation is repeated until reaching f3, that is, until all data of 5 RPCs are sent f3 (steps 90 to 94\) In this way, the monitoring of the number of free reception buffers at each station is controlled by a versatile data link layer protocol. This is done using a broadcast message, while the other station for data transfer and its procedure are processed using a session layer protocol that has versatility, such as being able to target several stations. In the transfer,
The transfer time can be reduced by the amount of the data request message and the corresponding ACK of the conventional protocol shown in FIG. The effect of reducing the required time will vary depending on the ratio of data messages that can be transferred without data requests or messages, but for example, if the number of packets per data message is one as shown in Figures 2 and 6, Since the number is halved, the time required will also be approximately 1,000 minutes.

Note that if the number of packets per data message is two or more, it is necessary to provide a large number of BBCs when the data is transferred without a data request message.

In this case, even though there is no request for reception from the actual iK application side, it may be wasteful to permanently install a relatively large BC, so if speed is important in the system, use a large reception buffer and Increase the number of data message packets in a way that does not require request messages. On the other hand, if cost is your priority,
To reduce the number of data message packets by using a small company's reception buffer and using a method without data request messages.

Further, in the explanation so far, the number of packets of a data message has been assumed to be 1, but the present invention can be implemented with the number of packets of 2 or more depending on the settings of the NRPC.

Effects As explained above, according to the present invention, there is no need to provide a data request message in a protocol having a hierarchical structure. And it is shortened by that person's CK.

[Brief explanation of the drawing]

Figure 1 is a configuration diagram of each station in data communication.
FIG. 2 is a sequence chart of a conventional communication protocol, FIG. 6 is a sequence chart of a communication protocol showing an embodiment of the present invention, and FIG. 4 is a configuration diagram of each station showing an embodiment of the present invention. FIG. 5 is a hierarchical configuration diagram of a communication protocol, FIGS. It is a diagram for explaining the main areas of memory. 1.1': Main CPU, 2.2', 6.6':
A communication control unit, 3.3', 200: Memory, 4, 9
: Communication line, 5.5x application CI'U, 7.
7': Cable, 8.8': Transceiver, 10-15
: Communication protocol, 20, 21. 22-22', 23-
26#: Data information, 61.62-62: Host level protocol control information, 41-41', 42-42
: Net; 7-Freppel ProtocolttAm if Report, 51-51':! J Think Bell Protocol Control Information, 201-212: Various areas. Figure 1 B Figure 2 Figure 3 Figure 4 Figure A B Figure 5 Figure 6 Figure 8 Figure 9 Figure 10 [t159 Patent 1fl jl107.638i No. 2
, Title of the invention Communication control system 3 Relationship with the case of the person making the amendment Patent applicant 4, agent/artisan Number of inventions increased by amendment None (1) "Patent" on page 1, lines 3 to 11 of the specification "Scope of Claims" shall be amended as follows. [In a data communication system having a layered communication protocol including an application layer protocol, a protocol layer that reports the status of the number of free reception buffers at each station, and a data message sent from the above application layer protocol.] It has an additional protocol layer that is different from 1' to 1'. 1. A communication control method characterized in that a data request message is not required for a data transfer sequence in which the amount of data messages is less than a certain amount. ” (2) Meitan, page 3, lines 17 to 18 [... is a diagram showing the configuration, and the 6th page
Figures (,) to (d) are diagrams showing configuration examples of transmission formats. " is corrected to "It is a diagram showing the configuration." (3) Ia9, page 4, lines 7 to 19 [In Fig. 6, . . . is an example of a transmission format. ” to be deleted. (4) Data information 20, 20, 21, 22', 22' in Figure 6, ``Controlled by...'' on page 5, lines 4 to 6 of the specification.
. 23. It is transferred in the 23' and 23' parts. "of"·
Controlled by... ”. (5) From page 6, line 18 to page 7, line 2 of the specification, ``-Broadcast messages are controlled by the data link layer 14 protocol in Figure 5, and are controlled by the link level protocol in Figure 6(d). Protocol control information 5]', 51', and 51'.The above-mentioned link-level destinations are controlled by the data link layer layer 4 protocol shown in FIG. The destination of the data link layer 14 is corrected. (6) On page 7, line 9 of the specification, "... will be an address." will be replaced with "... will be an address." It will also monitor the free reception buffer of its own station and inform other stations of its status. The report is carried out by the route work layer 13.6 (7) "Session layer 11 protocol in FIG. 5 and FIGS. 6(b) and (c) Using the host-level protocol control information of , " is corrected to J using the transport layer 12 protocol. (8) Change "Figure 7" to "Figure 6" on page 7, line 19, page 8, line I, and page 13, line 5 of the specification. (9) Specification page 7, line 19, page 9, line IO, page 13, line 6
Change "Figure 9" in the row to "Figure 8". (lO) “No. 10” on page 7, line 20 of the specification, and page 13, line 7.
"Fig. 9" should be changed to "Fig. 9". (11) Change "(Step 69)" on page 8, line 19 of the specification to "(Step 67)". (12) "Figure 8" on page 9, line 17 of the specification as [Figure 7]
Change to (13) On page 10 of the specification, lines 19 and 20, "Monitoring is performed by broadcast messages controlled by a versatile data link layer protocol" has been changed to "monitoring is performed by network layer 13
It is transmitted using a broadcast message specified by the data link layer protocol, and amended to ``. (14) On page 11, lines 1 to 3 of the specification, ``The partner station for data transfer and its procedure are based on a session layer protocol that has versatility, such as being able to target multiple stations.'' [Regarding the data transfer procedure, use the transport layer protocol]. (15) “Page 6 (,) ~” on page 13, lines 4 to 5 of the specification
(d) is a diagram showing..." is deleted. (16) On page 13 of the specification, lines 5 to 7, "Figs. 7 to 9 are from the present invention......Fig. 10 is from the present invention." The operation flowchart in Figure 9 is as follows.
Correct to. (17) “20°21” on page 13, lines 13 to 17 of the specification
．． 22 to 22', 23 to 23': . . . link level protocol control information," are deleted. (I8) Figures 7 and 8 are obtained by deleting the drawing in Figure 6. FIG. 9 and FIG. 1O are respectively FIG. 6 and FIG. Changes to Figures 8 and 9. (19) Correct (replace) Figure 4 as shown in the attached sheet.
. Figure T - Red Figure

Claims (1)

[Claims] In a data communication system that has an M Jlt communication protocol that includes an application layer protocol, there is a protocol layer that reports the number of free reception buffers at each station, and another that controls the destination station for data transfer and its contents. A communication control method that includes one protocol layer and eliminates the need for data request messages in a data transfer sequence in which one data message is less than a certain amount.