JP2967650B2 - Data link system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data link system in which data communication is performed on a ring communication path in which a plurality of data link units each having a station number set are connected in series.

[0002]

2. Description of the Related Art FIG. 15 is a system configuration diagram showing a conventional data link system , and FIG. 16 is a block diagram showing an internal configuration of a data link unit constituting the data link system. In Fig, (1) (1a) ~ (1e) data link module, (2) is connected between each data link module station cable, (3) Each data link module (1a) ~
(1e) Data processing means for performing data transmission / reception processing, etc., (4) an interface (hereinafter referred to as I / F) for receiving data from an adjacent station, and (5) for sending data to an adjacent station. I / F, (6) is I / F (4) and I / F (5)
A first opening / closing means for turning on / off between the data processing means (3) and the I / F (5); and a second opening / closing means for turning on / off the first opening / closing means (6) contrary to the first opening / closing means (6). Opening and closing means.

[0003] (8) CP that executes a data link operation
U and (9) are ROMs storing operation programs and the like, (1)
0) is a RAM for storing data, etc., (11) is a dual port RAM for exchanging data, (12) is an I / F for exchanging data with other units, and (13) is external information. (14) is a station number setting device that sets the station number manually, such as a dip switch, (15) is an output port for giving external information, and (16) is the station number content such as LED (17) other controllers such as DMA controller and interrupt controller, (18)
Is a communication path switching circuit, and (19) is an internal bus.

[0004] As shown in the figure, the data link unit (1a) ~
When (1e) is connected in series in a ring by a cable (2), a station number is assigned to each of the data link units (1a) to (1e), and the station number is assigned to the station number setting unit (1) of each unit.
Set manually in 4). This station number is read by the CPU (8) from the input port (13) by a program in the ROM (9), registered in the RAM (10), and output from the output port (1).
Output from 5) to the station number display (16) and displayed. This station number is used as an address of each station in data communication between the data link units (1a) to (1e). Therefore, the user has visually checked the station number indicators (16) of all data link units so as to avoid duplication or omission of station numbers.

[0005]

As described above, in the conventional data link system, it was necessary to visually determine whether or not there was a duplication or omission of the station number. Has to be checked, and there is a problem that it takes a long time to check or a malfunction may occur due to a check error.

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and has as its object to provide a data link system capable of easily checking for duplication and omission of station numbers.

[0007]

According to a first aspect of the present invention, there is provided a data link system which requests a predetermined data link unit (hereinafter referred to as a test execution station) to write a check frame having an area corresponding to each station number. A flag is set, and a write request check frame transmitting means for recording 0 in an area corresponding to the other station number and recording 1 in an area corresponding to the own station number and transmitting the same to the next station is provided by another data link unit (hereinafter referred to as "received station"). The write request check frame is transmitted to the next station by adding 1 to the record count of the area corresponding to the own station number of the check frame in which the write request flag sent from the previous station is set, and sending it to the next station. Means.

In a data link system according to a second aspect of the present invention, the test execution station has a total area for recording the total number of station checks, and a total number of bits equal to or greater than 0 or 1 and equal to or greater than the total number of connected stations. A write request flag is set in a check frame having an area corresponding to each station number in which a binary number is recorded, 1 is recorded in the total area, and the first bit of the area corresponding to the own station number is set to 1 or 0. The write request check frame transmitting means for updating and transmitting the write request check frame to the next station is updated by adding one to the recording count of the total area of the check frame in which the write request flag sent from the previous station is set. The bit number of the record count of the updated cumulative area of the record binary number of the area corresponding to the own station number is updated to 1 or 0 and transmitted to the next station. Only required checks frame transfer means those having respectively.

[0009]

In the data link system according to the first aspect of the present invention, the check frame sent from the test execution station adds 1 to the recording count of the area corresponding to the own station number of the check frame in each execution station. Is updated and transmitted to the next station. Therefore, in the check frame returned to the test execution station after making a round of the ring communication path, an area corresponding to the duplicated station number has a value of 2 or more, and the missing station number 0 is recorded in the corresponding area. Therefore, duplication and omission of the station number can be easily checked.

In the data link system according to the second aspect of the present invention, the check frame sent from the test execution station is updated by adding 1 to the recording count of the total area of the check frame in each execution station. Since the update bit of the record binary number in the area corresponding to the own station number is updated from 0 to 1 and transmitted to the next station, the circuit returns to the test station after making a round of the ring communication path. In the check frame, the total area includes the number of connected data link unit stations, the area corresponding to the duplicated station number has a binary number of 1 in two or more bits, and the area corresponding to the omitted station number has all the bits 0. Are recorded respectively. Therefore, it is possible to easily find the connection position of the station number where the number of connected stations is duplicated or missing.

[0011]

【Example】

Embodiment 1 FIG. An embodiment of the first invention will be described below with reference to the drawings. 1 to 9 show this embodiment, FIG. 1 is a schematic configuration diagram, FIG. 2 is a configuration diagram of a check frame, FIG. 3 is a flowchart showing a processing procedure in a test execution station, and FIGS. Flowchart showing the processing procedure in
7 is a system configuration diagram for explaining the operation of this embodiment, FIG. 8 is a configuration diagram of a check frame for explaining the operation of this embodiment, and FIG. 9 is a configuration of a check frame obtained by this embodiment. FIG. Since the hardware configuration of this embodiment is not different from that of the conventional example, FIG.
FIG. 16 also applies to this embodiment.

In FIG. 1, (1a) is a data link unit which is a test execution station, (1b) is a data link unit which is a test station, (2) is a cable connecting each data link unit station, (20) ) Is a write request check frame sending means described later, (21) is a read request check frame sending means described later, (22) is a write request check frame transfer means described later, and (23) is a read request check frame transfer means described later. is there.

In FIG. 2, (24) is a check frame,
(25) is an area (hereinafter referred to as a flag) in which information indicating only writing or reading to be written in the test execution station (1a) is set, and (26a) to (26f) ... (26n) are test execution stations (1a). And areas corresponding to the station numbers set in the executed stations (1b) to (1f)... (1n).

Next, the operation of this embodiment will be described with reference to the flowcharts of FIGS. First, the test bureau (1
In a), the first opening / closing means (6) is turned off and the second opening / closing means (7) is turned on, so-called internal disconnection is performed (step (27)). It is sent to the station (1b) (step (28)) and waits for a fixed time (step (28)). During this time, the internal disconnection request sent from the test execution station (1a) is issued when the first opening / closing means (6) of all the other executed stations (1b) to (1n) is turned on and the second opening / closing means is turned on. If (7) is turned off, so-called internal connection state, the circuit goes around the ring communication path as it is and is received again by the test execution station (1a). At that station, the internal disconnection request sent from the test execution station (1a) is stopped.

After waiting for a predetermined time in the test execution station (1a) (step (29)), it is determined whether the internal disconnection request sent from the test execution station (1a) has been re-received (step (30)). ), If it has been re-received, an internal disconnection request is transmitted again to confirm whether another implemented station exists in the ring communication path (step (3)
1)). At this time, in the other executed stations (1b) to (1n), as shown in FIG. 4, internal disconnection is performed in response to the internal disconnection request sent from the previous station (step (42)). If the internal connection is established before the request is received (step (4
3)), since the internal disconnection request is transmitted to the next station through the first opening / closing means (6) in the ON state, the processing is terminated as it is. If internal disconnection has already been performed (step (43)), an internal disconnection request is transmitted to the next station (step (44)). Therefore, in response to the transmission of the internal disconnection request from the test execution station (1a) again (step (31)), since all the executed stations (1b) to (1n) are in the internal disconnection state, Is transmitted (step (44)).

Next, in the test execution station (1a), it is confirmed whether or not an internal disconnection request from another station has been received (step (32)).
"Write request" is set in the flag (25) of the check frame (24) shown in FIG. 2, and "1" is set in the area (26a) corresponding to the station number A of the own station (step (33)). Area (26b)-(26n) corresponding to the station number of
This check frame (24) is transmitted to the next station (1b) (step (34)).

Here, in the stations to be executed (1b) to (1n),
When the check frame (24) is received, as shown in FIG. 5, it is determined whether or not the flag (25) is a "write request" (step (45)). Local station number corresponding area (26b) to (26n)
One is added to the middle recording count value and updated (step (46)). That is, if the recording count value is "0", it is incremented to "1", and if it is "1", it is incremented to "2". Then, the check frame (24) is transmitted to the next station (step (47)).

On the other hand, in the test execution station (1a), the check frame (24) goes around the ring communication path, and
It is determined in (1b) to (1n) whether the data has been updated and received (step (35)). When the check frame (24) is received, it is stored in the RAM (10) of the own station (FIG. 16). In addition to being recorded, each checked station (1b) to
The transmission process to (1n) is started. This reception check frame (2
By referring to the station number corresponding areas (26a) to (26n) of 4), it is possible to know the check result of duplication and omission of station numbers of all stations.

Check frame (2) at test execution station (1a)
After the reception of 4), “read request” is set to the flag (25) of the check frame (24) (step (36)), and the next station
It is transmitted to (1b) (step (37)). In this case, since the flag (25) of the check frame (24) is "read request" in the executed stations (1b) to (1n) (step (45)), the content of the check frame (24) cannot be changed. Is transmitted to the next station as it is (step (47)). This reception check frame
(24) is recorded in the RAM (10) of each of the stations to be executed (1b) to (1n),
In each of the implemented stations (1b) to (1n), it is possible to know the check result of duplication and omission of the station numbers of all the stations.

Next, at the test execution station (1a), each test station (1b)
When the check frame (24) passing through (1n) is received (step (38)), an internal connection request is transmitted (step (39)). On the other hand, when the internal stations (1b) to (1n) receive the internal connection request from the previous station, the internal stations transmit the internal connection request to the next station as shown in FIG. 6) is turned on, the second opening / closing means (6) is turned off, an internal connection is made (step (41)), and the check processing of the duplication and omission of the station number is completed.

In this embodiment, all the stations are finally terminated in the state of the internal connection. However, depending on the system, the stations may be terminated in the state of the internal disconnection or in the state where the internal connection and the disconnection are mixed by the station. You may.

The steps (33) to (3) in FIG.
Until 5), the write request check frame sending means of FIG.
Steps (36) to (38) constitute read request check frame transmitting means, and FIG. 5 constitutes write request check frame transfer means and read request check frame transfer means.

Next, as shown in FIG. 7, the station number is "A".
Check for duplication and omission when the data link units (1a) to (1f) of 6 stations of "B", "C", "A", "C", and "D" are connected in a ring by the cable (2) The processing will be described with specific examples. Now, data link unit
Assuming that (1a) is the test execution station, as shown in FIG. 2, the area (26a) of the check frame (24) is the station number "A", the area (26b) is the station number "B", and the area (26c) Is the station number "C"
The area (26d) corresponds to the station number "D".

First, in the data link unit (1a) of the test execution station, "write request" is set in the flag (25) of the check frame (24), and the data is written to the area (26a) corresponding to the own station number "A". When "1" is set, the check frame (24a) in FIG.
sent to b). When the data link unit (1b) receives the check frame (24a) from the data link unit (1a), since the flag (25) is "write request", the area corresponding to the own station number "B" ( 26b) is incremented and updated from "0" to "1", and the check frame (24b) is the data link unit (1c) as the next station.
Sent to This operation is repeated, and finally the check frame (24f) is received by the data link unit (1a) as the test execution station.

From the contents of the check frame (24f) returned to the test execution station (1a), the station numbers "A" and "C" overlap, and the station numbers "B" and "D" are only one station. Yes, the other stations can be informed by the data link unit (1a) that is the test execution station that they are not connected.

Next, in the data link unit (1a), which is the test execution station, the flag (25) is set to "read request", and the check frame (24g) shown in FIG. Sent to (1b). When the data link unit (1b) receives the check frame (24g) from the data link unit (1a), the flag (25)
Is a “read request”, the check frame (24
g) is not rewritten and the data link unit (1
sent to c). This operation is repeated and finally returns to the data link unit (1a) which is the test execution station. As a result, the check results can be known in all stations.

In the specific examples described with reference to FIGS. 7 to 9, the number of stations of the connected data link unit and the number of areas corresponding to the station number of the check frame are both set to 6, but the number of connected stations is unknown. When a check frame is designed at an appropriate stage, it is general to increase the number of areas corresponding to the station number.

In the above description, only the test processing of the above embodiment has been described. However, when a test is performed during normal communication, a test execution notice is given from the test execution station to another station in advance. The test is performed after no data is present on the line, so that the test data does not collide with the normal data. After the test is completed, the test execution station notifies the other stations of the re-execution of the normal communication.

Embodiment 2 FIG. Hereinafter, an embodiment of the second invention will be described with reference to the drawings. 10 to 14 show this embodiment, FIG. 10 is a configuration diagram of a check frame, FIG. 11 is a flowchart showing a processing procedure in a test execution station, and FIG.
2 is a flowchart showing a processing procedure in the station to be implemented;
FIG. 13 is a configuration diagram of a check frame for explaining the operation of this embodiment, and FIG. 14 is a configuration diagram of a check frame obtained by this embodiment. 1 and 4,
6, 7, 15, and 16 also apply to this embodiment.

In FIG. 10, (24) is a check frame, (25) is a flag, (26a) to (26f)... (26n) are test execution stations (1a) and stations to be executed (1b) to (1f). ... Areas corresponding to the station numbers set in (1n), respectively, and (50) is a cumulative area in which the cumulative number of station checks is stored (hereinafter referred to as a cumulative station check). The same reference numerals as in FIGS. 1 to 8 denote the same or corresponding parts.

Next, the operation of this embodiment will be described with reference to FIGS.
This will be described with reference to the flowchart of FIG. First, the test execution office (1a) performs internal disconnection (step
(27)), an internal disconnection request is sent to the implemented station (1b) of the next station (step (28)), and a certain period of time is waited (step (2)
After 9)), it is determined whether the internal disconnection request sent from the test execution station (1a) is re-received (step (3)
0)), if it has been re-received, an internal disconnection request is transmitted again to confirm whether another implemented station exists in the ring communication path (step (31)). At this time, in the other implemented stations (1b) to (1n), internal disconnection is performed as shown in FIG. 4, and an internal disconnection request is transmitted from each implemented station (step (44)). .

Next, in the test execution station (1a), it is checked whether an internal disconnection request from another station has been received (step (32)).
"Write request" is set in the flag (25) of the check frame (24) shown in FIG. 10, "1" is set in the station check total (50), and the area (2) corresponding to the station number A of the own station is set.
The "1st bit" of the binary number in 6a) is updated to "1" (step (51)), and the areas (26b) to (26n) corresponding to other station numbers
The check frame (24) is transmitted to the next station (1b) while the binary number of the bit remains "0" (step (34)).

Here, in the stations to be executed (1b) to (1n),
When the check frame (24) is received, as shown in FIG. 12, it is determined whether or not the flag (25) is a "write request" (step (45)). Is updated by adding "1" to the station check total (50) in the table (step (52)), and the station check total (50) of the binary numbers in the local station number corresponding areas (26b) to (26n). , The second bit in the data link unit (1b) is updated to "1", and the third bit in the data link unit (1c) is updated to "1" (step (53)).
The check frame (24) is transmitted to the next station (step (47)).

On the other hand, in the test execution station (1a), the check frame (24) goes around the ring communication path, and
It is determined in (1b) to (1n) whether the data has been updated and received (step (35)). When the check frame (24) is received, it is stored in the RAM (10) of the own station (FIG. 16). In addition to being recorded, each checked station (1b) to
The transmission process to (1n) is started. This reception check frame (2
By referring to the station check total (50) in (4), the number of connected data link units can be changed to each station number area (2).
By referring to 6a) to (26n), it is possible to know the connection position and omission of the station whose station number is duplicated.

Check frame (2) at test execution station (1a)
After the reception of 4), “read request” is set to the flag (25) of the check frame (24) (step (36)), and the next station
It is transmitted to (1b) (step (37)). In this case, since the flag (25) of the check frame (24) is "read request" in the executed stations (1b) to (1n) (step (45)), the content of the check frame (24) cannot be changed. Is transmitted to the next station as it is (step (47)). This reception check frame
(24) is recorded in the RAM (10) of each of the stations to be executed (1b) to (1n),
In each of the implemented stations (1b) to (1n), it is possible to know the check result of duplication and omission of the station numbers of all the stations.

Next, at the test execution station (1a), each test station (1b)
When the check frame (24) passing through (1n) is received (step (38)), an internal connection request is transmitted (step (38)).
(39)) When the internal stations (1b) to (1n) receive the internal connection request from the previous station, the internal stations transmit the internal connection request to the next station as shown in FIG. Done (step (4
1)), the process of checking for overlapping and missing station numbers is completed.

It should be noted that the steps from step (51) in FIG.
(35) is the write request check frame sending means of FIG. 1, steps (36) to (38) are the read request check frame sending means, and FIG. 12 is the write request check frame transfer means and the read request check frame transfer. Each means is constituted.

Next, in a case where the data link units (1a) to (1f) are connected in a ring shape with the station numbers as shown in FIG. An example will be described. Now, suppose that the data link unit (1a) is the test execution station, and as shown in FIG. 10, the area (26a) of the check frame (24) becomes the station number "A" and the area (26b) becomes the station number "B". , Area (26c) corresponds to station number "C", and area (26d) corresponds to station number "D".

First, in the data link unit (1a) of the test execution station, "write request" is set in the flag (25) of the check frame (24), and "1" is set in the station check total (50). Area corresponding to own station number "A"
In accordance with “1” of the station check total of the binary number of (26a), “1”
The “bit” is updated to “1”, and the check frame (24h) in FIG. 13 is transmitted to the data link unit (1b) as the next station.

When the data link unit (1b) receives the check frame (24h) from the data link unit (1a), the flag (25) is "write request", so the station check total (50) is incremented. Is updated from "1" to "2", and the area corresponding to the own station number "B" (2
The “second bit” is updated to “1” in accordance with “2” of the station check total of the binary number of 6b), and the check frame (24i)
Is transmitted to the next station, the data link unit (1c).
Hereinafter, this operation is repeated, and finally the check frame (2) is sent to the data link unit (1a) which is the test execution station.
4m) will be received.

The number of connected stations is 6 based on the station check total (50) of the check frame (24m) returned to the test execution station (1a).
From the bit pattern in the area (26) corresponding to each station number, the station numbers "A" and "C" overlap, and the station numbers "B" and "D" are only one station. The stations are not connected and the first and fourth data link units (1a) and (1d) of the station number "A" are duplicated, and the data link units (1c) and (1e) of the station number "C" are duplicated. Are the third and fifth, and the missing station numbers are "E" and "F", indicating that the data link unit (1a) is the test execution station.
You can find out at.

Next, in the data link unit (1a) which is the test execution station, the flag (25) is set to "read request", and the check frame (24n) shown in FIG. Sent to (1b). When the data link unit (1b) receives the check frame (24n) from the data link unit (1a), the flag (2
Since 5) is a “read request”, the check frame (2
4n) is the data link unit that is the next station without rewriting
Sent to (1c). This operation is repeated and finally returns to the data link unit (1a) which is the test execution station. As a result, the check results can be known in all stations.

In the specific example described with reference to FIGS. 13 and 14,
The number of connected data link units, the number of areas corresponding to the check frame
If the number of bits of the decimal number matches, the number is set to 6. However, if the check frame is designed when the number of connected stations is unknown, increase the number of areas corresponding to the station number and the number of binary bits in the area. It is common to do. Also, the binary number in the area corresponding to the station number is initially updated to "1" as all bits "0", but may be updated to "0" as all bits "1" first.

[0044]

According to a first aspect of the present invention, a write request flag is set in a check frame having an area corresponding to each station number in a test execution station, and 0 is set in an area corresponding to another station number. The write request check frame sending means for recording 1 in the area corresponding to the station number and sending the write request check frame to the next station, Since the write request check frame transfer means for adding 1 to the recording count of the area corresponding to the station number and updating it and sending it to the next station is provided, the station numbers of all the connected stations are duplicated or missing. Is easily checked.

According to a second aspect of the present invention, a test execution station records a total area for recording the total number of station checks and a binary number of bits equal to or greater than the total number of connected stations with all bits being 0 or 1. A write request flag is set in a check frame having an area corresponding to each station number, 1 is recorded in the cumulative area, the first bit of the area corresponding to the own station number is updated to 1 or 0, and the next station is updated. The write request check frame transmitting means to be transmitted to the executed station is updated by adding 1 to the recording count of the cumulative area of the check frame in which the write request flag sent from the previous station is set, and to the own station number. The bit of the recording count number of the updated cumulative area of the recording binary number of the corresponding area is updated to 1 or 0 and the write request check frame is transmitted to the next station. Having the means as provided respectively, outside the effects of the first aspect of the present invention, there is an advantage that also easily check the connection position of a station number number of stations connected with the duplication and omission.

[Brief description of the drawings]

FIG. 1 is a schematic configuration diagram showing one embodiment of a first invention and a second invention of the present invention.

FIG. 2 is a configuration diagram of a check frame in one embodiment of the first invention.

FIG. 3 is a flowchart showing a processing procedure in a test execution station in one embodiment of the first invention.

FIG. 4 is a flowchart showing a processing procedure in a station to be implemented in one embodiment of the first invention and the second invention;

FIG. 5 is a flowchart showing a processing procedure in a station to be executed in one embodiment of the first invention;

FIG. 6 is a flowchart showing a processing procedure in a station to be implemented in one embodiment of the first invention and the second invention;

FIG. 7 is a system configuration diagram for explaining the operation of one embodiment of the first invention and the second invention.

FIG. 8 is a configuration diagram of a check frame for explaining the operation of one embodiment of the first invention.

FIG. 9 is a configuration diagram of a check frame obtained by one embodiment of the first invention.

FIG. 10 is a configuration diagram of a check frame in one embodiment of the second invention.

FIG. 11 is a flowchart showing a processing procedure in a test execution station in one embodiment of the second invention.

FIG. 12 is a flowchart showing a processing procedure in a station to be executed in one embodiment of the second invention.

FIG. 13 is a configuration diagram of a check frame for explaining the operation of one embodiment of the second invention.

FIG. 14 is a configuration diagram of a check frame obtained by one embodiment of the second invention.

FIG. 15 is a system configuration diagram showing an example of a data link system according to the related art and the present invention.

FIG. 16 is a block diagram showing an internal configuration of a data link unit constituting a data link system according to the related art and the present invention.

[Explanation of symbols]

 Reference Signs List 1 data link unit 1a data link unit (test execution station) 1b to 1n data link unit (executed station) 14 station number setting device 16 station number display device 20 write request check frame sending means 22 write request check frame transfer means 24 check frame 25 Flags 26a to 26n Area corresponding to station number 50 station check total area

Continuation of the front page (58) Field surveyed (Int.Cl. ⁶ , DB name) H04L 12/42

Claims (2)

(57) [Claims] 1. A data link system in which data communication is performed through a ring communication path in which a plurality of data link units each having a station number set in series are connected to a predetermined data link unit. The write request flag is set in a check frame having an area to be written, 0 is written in the area corresponding to the other station number, 1 is recorded in the area corresponding to the own station number, and the write request check frame transmitting means for transmitting to the next station is provided. In the other data link unit, the write request flag transmitted from the previous station is set, and the write count is updated by adding 1 to the recording count of the area corresponding to the own station number of the check frame and transmitted to the next station. A data link system comprising a frame transfer unit. 2. A data link system in which a plurality of data link units each assigned a station number are connected in series to perform data communication through a ring communication path, a predetermined data link unit is provided with a station check number. A write request flag is set in a check frame having a cumulative area for recording the cumulative total and an area corresponding to each station number in which all bits are 0 or 1 and a binary number having a number of bits equal to or greater than the number of all connected stations is recorded. Record 1 in the cumulative area,
Set the first bit of the area corresponding to the own station number to 1 or 0
The write request check frame transmitting means for updating to the next station and sending it to the next station is added to another data link unit by adding 1 to the recording count of the total area of the check frame in which the write request flag sent from the previous station is set. A write request check frame transfer means for updating and updating the recording count number bit of the updated cumulative area of the area corresponding to the own station number to 1 or 0 and sending it to the next station. A data link system comprising: