JPH0542859B2 - - Google Patents
Info
- Publication number
- JPH0542859B2 JPH0542859B2 JP59171726A JP17172684A JPH0542859B2 JP H0542859 B2 JPH0542859 B2 JP H0542859B2 JP 59171726 A JP59171726 A JP 59171726A JP 17172684 A JP17172684 A JP 17172684A JP H0542859 B2 JPH0542859 B2 JP H0542859B2
- Authority
- JP
- Japan
- Prior art keywords
- data
- destination
- buffer
- terminal station
- buffers
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 239000000872 buffer Substances 0.000 claims description 46
- 230000005540 biological transmission Effects 0.000 claims description 22
- 230000015654 memory Effects 0.000 claims description 14
- 238000000034 method Methods 0.000 claims description 7
- 238000013500 data storage Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000003908 quality control method Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer And Data Communications (AREA)
- Small-Scale Networks (AREA)
Description
【発明の詳細な説明】
〔産業上の利用分野〕
本発明は、フアクトリー・オートメーシヨン等
の促進を図ることのできるローカルエリアネツト
ワークに関するものである。DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a local area network capable of promoting factory automation and the like.
工場における生産性向上のために近年フアクト
リー・オートメーシヨン（FA）化が叫ばれてお
り、機械や装置の自動化と同時に、その機械の稼
動状態や負荷の分配に始まり、生産結果の集計、
更には歩留りの分析まで、個々の機械単位に管理
できるシステムが要望されるようになつてきてい
る。
Factory automation (FA) has been gaining momentum in recent years to improve productivity in factories.At the same time as automating machines and equipment, it has become necessary to monitor the operating status and load distribution of the machines, aggregate production results, and
Furthermore, there is a growing demand for a system that can manage individual machine units, including yield analysis.
その一つとして、機械制御のマイクロコンピユ
ータと、生産管理や品質管理を行なうパーソナル
コンピユータとを結んで、生産現場のローカルエ
リアネツトワーク（以下「LAN」という。）を構
成できるような高信頼性の情報伝送システムが望
まれている。 One of these is a highly reliable network that can connect microcomputers for machine control and personal computers for production management and quality control to form a local area network (hereinafter referred to as "LAN") at the production site. An information transmission system is desired.
LANの一つに、マルチドロツプ方式というの
があり、これは第３図に示すように共通データバ
ス３１に各端末局３２〜３４をつなぎ、中央制御
局３５で各端末局からの情報や指令を制御すると
いうものであり、情報の記憶のために中央一個所
に共通メモリ３６を設置するのが、従来の構成で
あつた。 One type of LAN is the multi-drop method, in which each terminal station 32 to 34 is connected to a common data bus 31 as shown in Figure 3, and a central control station 35 receives information and commands from each terminal station. The conventional configuration was to install a common memory 36 in one central location for storing information.
しかしながら、従来のマルチドロツプ方式で
は、規模に応じて共通メモリ３６の容量を変えな
ければならず、小規模から大規模に容量変更する
場合には共通メモリを容量アツプする必要があ
り、また情報授受の途中に端末局に瞬時停電があ
つたときにはデータの内容が壊れてしまうという
問題があつた。 However, in the conventional multi-drop method, the capacity of the common memory 36 has to be changed depending on the scale, and when changing the capacity from a small scale to a large scale, it is necessary to increase the capacity of the common memory. There was a problem in that if there was a momentary power outage at the terminal station during the process, the data contents would be corrupted.
本発明者は、このような従来の問題を解消する
ため、第４図に示すような新方式のLANについ
て提案を行なつた（特願昭58−126534号、昭和58
年７月12日出願）。即ち、共通データバス４１で
制御局４２及び複数の端末局４３−１〜４３−Ｎ
をつなぐマルチドロツプ方式のLANにおいて、
共通メモリを設ける代わりに、各端末局４３−１
〜４３−Ｎに入出力データ記憶装置としての入力
データ記憶用不揮発バツフアメモリ４４−１〜４
４−２及び出力データ記憶用不揮発バツフアメモ
リ４５−１〜４５−Ｎを設け、端末機器としてパ
ソコン又はマイコン４６−１〜４６−２を接続し
たものである。 In order to solve these conventional problems, the present inventor proposed a new type of LAN as shown in Figure 4 (Japanese Patent Application No. 126534/1982).
(filed on July 12, 2016). That is, the common data bus 41 connects the control station 42 and the plurality of terminal stations 43-1 to 43-N.
In a multi-drop LAN that connects
Instead of providing a common memory, each terminal station 43-1
~43-N non-volatile buffer memories 44-1 to 4 for storing input data as input/output data storage devices
4-2 and nonvolatile buffer memories 45-1 to 45-N for storing output data are provided, and personal computers or microcomputers 46-1 to 46-2 are connected as terminal equipment.
異なるデータを複数局へ送信すると、待ち行列
バツフアからは、書き込まれた順番にしか送信で
きない。このため、相手局の内の一局でも受信で
きない状態（受信バツフアが満杯であるとか、電
源が投入されていない状態）にあると、それに続
く他局への送信が停滞状態となり送信できないと
いう問題点がある。
When different data is sent to multiple stations, it can only be sent from the queue buffer in the order in which it was written. Therefore, if even one of the partner stations is unable to receive data (the reception buffer is full or the power is not turned on), subsequent transmissions to other stations become stagnant and cannot be transmitted. There is a point.
本発明は、このような問題点を解消して、一部
に受信できない状態にある局が存在しても、他の
受信できる状態にある局への送信を逐次送信する
ことのできる構成のLANを提供することを目的
とするものである。 The present invention solves these problems and provides a LAN configured so that even if some stations are unable to receive data, transmissions can be sent sequentially to other stations that are able to receive data. The purpose is to provide the following.
本発明は、共通データバスに接続される各端末
局に送受信データ記憶装置としての不揮発バツフ
アメモリを備えたLANにおいて、前記不揮発バ
ツフアメモリをFIFOメモリ形式のデータバツフ
ア及びこのデータバツフアに登録されたデータと
対になる宛先を登録する宛先バツフアにより構成
し、宛先バツフアに登録された宛先の宛先別デー
タ数を計数する宛先別データ数計数部を設け、送
信時において、前記データバツフアの第１番目に
データがあるとき、そのデータに対応する宛先バ
ツフアの宛先が通信可能且つその宛先の受信バツ
フアに空きがあればその宛先に対して前記宛先別
データ数計数部に計数されている数のデータを送
信し、送信後に第１番目のデータを削除して新た
に第１番目となつたデータに対して前記の送信処
理を繰り返し、送るべきデータの宛先が通信不能
のとき、あるいは宛先の受信バツフアに空きがな
いときのいずれかの場合には、そのデータの送信
を保留して次のデータの宛先に対して前記送信処
理を行う手段を設けたことを特徴とする。
The present invention provides a LAN in which each terminal station connected to a common data bus is equipped with a nonvolatile buffer memory as a transmitting/receiving data storage device, in which the nonvolatile buffer memory is paired with a FIFO memory format data buffer and data registered in this data buffer. The method comprises a destination buffer for registering destinations, and includes a destination-by-destination data number counting section for counting the number of data for each destination of the destinations registered in the destination buffer, and when data is in the first position of the data buffer at the time of transmission, If the destination of the destination buffer corresponding to the data is communicable and there is space in the receiving buffer of that destination, the number of data counted in the data number counting unit for each destination is sent to that destination, and after sending, The first data is deleted and the above transmission process is repeated for the new first data, and either when the destination of the data to be sent is unable to communicate, or when there is no space in the destination's reception buffer. In such a case, the present invention is characterized by providing means for suspending transmission of the data and performing the transmission process to the destination of the next data.
本発明では、不揮発バツフアメモリとして、
FIFO（First In First Out：先入れ先出し）形式
のバツフアメモリを使用して端末側とネツトワー
ク側とのデータの授受を行なう場合、データは宛
先と対になつてデータバツフア、宛先バツフア
に、待ち行列形式で先着順に登録される。
In the present invention, as a nonvolatile buffer memory,
When data is exchanged between the terminal side and the network side using FIFO (First In First Out) format buffer memory, the data is paired with the destination and sent to the destination buffer in a queue format on a first-come, first-served basis. They are registered in order.
登録された宛先は、宛先別データ数計数部によ
り、宛先別のデータ数を計数する。これにより読
み出し側はデータの宛先別読み出しの制御を行な
い、書き込み側は待ち行列バツフアの空き状況お
よび読み出し状況を知ることができる。 For the registered destinations, the number of data for each destination is counted by the destination-specific data number counting section. As a result, the reading side can control the reading of data by destination, and the writing side can know the empty status of the queue buffer and the reading status.
読み出し側は、個々の宛先の書き込み順番を壊
さずに、宛先別読み出しが可能になる。これによ
り待ち行列が動的に多重化される。すなわち、見
掛け上、宛先別に送信用データバツフアを設けた
かのような動作をする。 On the reading side, it becomes possible to read by destination without destroying the writing order of each destination. This dynamically multiplexes the queues. That is, it appears to operate as if a transmission data buffer was provided for each destination.
その結果、一部に受信できない状態にある局へ
の送信は保留し、受信できる状態にある局への送
信を逐次行なうことができる。 As a result, it is possible to suspend transmissions to some stations that are unable to receive data, and to sequentially perform transmissions to stations that are able to receive signals.
以下、本発明を図面に示す実施例に基づいて説
明する。
Hereinafter, the present invention will be explained based on embodiments shown in the drawings.
第１図は、多重化待ち行列バツフアの構成例を
示すものであり、データは宛先と対になつてデー
タバツフアD1〜DN、宛先バツフアA1〜ANに、待
ち行列形式で先着順に登録される。 FIG. 1 shows an example of the configuration of a multiplexed queue buffer, in which data is registered in pairs with destinations in data buffers D 1 to D N and destination buffers A 1 to A N in a queue format on a first-come, first-served basis. be done.
第２図は、制御局２からのデータの送受信を２
本の伝送線１Ａ，１Ｂで行なう場合のブロツク図
であり、この図により信号の処理を説明する。 Figure 2 shows the transmission and reception of data from the control station 2.
This is a block diagram when processing is performed using real transmission lines 1A and 1B, and signal processing will be explained with reference to this diagram.
端末Ａに、端末Ｂ，Ｃへのデータが発生する
と、送信用待ち行列バツフアの空きを確認して
端末Ａから端末局３への書き込みが行なわれ
る。 When data to be sent to terminals B and C is generated at terminal A, the data is written from terminal A to terminal station 3 after confirming the availability of the transmission queue buffer.
制御局２から、端末局３が選択されると、端
末局３は送信待ち行列バツフアの宛先別データ
数を送る。 When the terminal station 3 is selected from the control station 2, the terminal station 3 sends the number of data for each destination in the transmission queue buffer.
制御局２は、項の宛先別データ数より端末
局４へのデータ書き込みが可能かどうか、端末
局４の受信用待ち行列バツフアの空き状態を確
認する。 The control station 2 checks whether data can be written to the terminal station 4 based on the number of data for each destination in the item, and confirms the empty state of the receiving queue buffer of the terminal station 4.
制御局２は項の情報により、端末局４の受
信用待ち行列バツフアに空きがあるならば、次
の項、項の処理により端末局３から端末局
４へのデータ転送を行なう。もし、空きがなけ
れば端末局５の処理′を行なう。端末局４へ
の通信が不能であるときも同様に端末局５の処
理′を行なう。 If there is space in the receiving queue buffer of the terminal station 4 according to the information in the section, the control station 2 transfers data from the terminal station 3 to the terminal station 4 by the processing in the next section and section. If there is no vacancy, the terminal station 5 performs the process '. Even when communication to the terminal station 4 is impossible, the processing for the terminal station 5' is similarly performed.
制御局２は、端末局３から端末局４へのデー
タを、端末局１の送信用待ち行列バツフアから
読み取る。 The control station 2 reads data from the terminal station 3 to the terminal station 4 from the transmission queue buffer of the terminal station 1.
項の処理により読み取られたデータは、制
御局２より端末局４の受信用待ち行列バツフア
へ書き込む。 The data read by the process described above is written from the control station 2 to the reception queue buffer of the terminal station 4.
′ これは項と同様に端末局５について調べ
る。′ This is checked for terminal station 5 in the same way as in the previous section.
ここで、端末局５の受信用待ち行列バツフア
が空でなければ、ここで端末局３の処理を中断
して、制御局２は別の端末局の処理を行なう。 Here, if the receiving queue buffer of the terminal station 5 is not empty, the processing of the terminal station 3 is interrupted here, and the control station 2 performs processing of another terminal station.
′ これは項と同様の処理を端末局５へ行な
うものである。′ This is to perform the same processing as in item 5 to the terminal station 5.
′ ′項の処理により読み取られたデータは、
制御局２より端末局５の受信用待ち行列バツフ
アへ書き込まれる。The data read by processing the term ′ ′ is
The data is written from the control station 2 to the receiving queue buffer of the terminal station 5.
，′ これは、端末Ｂ、端末Ｃが端末局４、
端末局５の受信用データバツフアを読み出すこ
とにより、端末Ａからのデータを知るものであ
る。,' This means that terminal B and terminal C are terminal station 4,
By reading the reception data buffer of the terminal station 5, the data from the terminal A is known.
上記したように本発明によれば、異なるデータ
を複数局へ送信する場合、一旦バツフアに書き込
んで、一部に受信できない状態にある局への送信
は保留し、他の受信できる状態にある局への送信
を逐次行ない、前記保留した局が受信できる状態
になつた場合に送信を行なうことができる。その
結果、見掛け上、宛先別に送信バツフアが設けら
れたような動作、すなわち複数列の可変長待ち行
列として機能する多重化待ち行列バツフアとな
り、しかも宛先別の送信バツフアは不要であるの
で、限られたバツフア容量を有効に機能させるこ
とができるという効果を奏するものである。
As described above, according to the present invention, when transmitting different data to multiple stations, the data is written to the buffer once, and transmission to some stations that are unable to receive data is suspended, and the data is sent to other stations that are able to receive data. The transmission can be performed sequentially, and the transmission can be performed when the station that has been put on hold becomes ready to receive. As a result, the operation appears to be as if a transmission buffer is provided for each destination, that is, a multiplexed queue buffer that functions as a variable-length queue with multiple queues, and since there is no need for a transmission buffer for each destination, there are limited This has the effect that the buffer capacity can be used effectively.
第１図は本発明に係る多重化待ち行列バツフア
の説明図、第２図は異なるデータを同時に複数局
へ送信するための機構の説明図、第３図は従来の
マルチドロツプ方式のローカルエリアネツトワー
クの構成を示すブロツク図、第４図は本発明を適
用するためのローカルエリアネツトワークの構成
を示すブロツク図である。
１Ａ，１Ｂ……データバス、２……制御局、３
〜５……端末局。
Fig. 1 is an explanatory diagram of a multiplexed queue buffer according to the present invention, Fig. 2 is an explanatory diagram of a mechanism for simultaneously transmitting different data to multiple stations, and Fig. 3 is an explanatory diagram of a conventional multi-drop type local area network. FIG. 4 is a block diagram showing the structure of a local area network to which the present invention is applied. 1A, 1B...Data bus, 2...Control station, 3
~5...Terminal station.
Claims (1)
３−１，４３−２，…に送受信データ記憶装置と
しての不揮発バツフアメモリ４４−１，４４−
２，…，４５−１，４５−２，…を備えたローカ
ルエリアネツトワークにおいて、前記不揮発バツ
フアメモリ４４−１，４４−２，…，４５−１，
４５−２，…をFIFOメモリ形式のデータバツフ
アD1〜DN及びこのデータバツフアに登録された
データと対になる宛先を登録する宛先バツフア
A1〜ANにより構成し、宛先バツフアA1〜ANに登
録された宛先の宛先別データ数を計数する宛先別
データ数計数部を設け、送信時において、前記デ
ータバツフアの第１番目にデータがあるとき、そ
のデータに対応する宛先バツフアの宛先が通信可
能且つその宛先の受信バツフアに空きがあればそ
の宛先に対して前記宛先別データ数計数部に計数
されている数のデータを送信し、送信後に第１番
目のデータを削除して新たに第１番目となつたデ
ータに対して前記の送信処理を繰り返し、送るべ
きデータの宛先が通信不能のとき、あるいは宛先
の受信バツフアに空きがないときのいずれかの場
合には、そのデータの送信を保留して次のデータ
の宛先に対して前記送信処理を行う手段を設けた
ことを特徴とするローカルエリアネツトワーク。1 Each terminal station 4 connected to the common data bus 41
3-1, 43-2, . . . non-volatile buffer memories 44-1, 44- as transmitting/receiving data storage devices.
2,..., 45-1, 45-2,..., the nonvolatile buffer memories 44-1, 44-2,..., 45-1,
45-2,... are FIFO memory format data buffers D 1 to D N and destination buffers for registering the destinations paired with the data registered in these data buffers.
A destination - specific data number counting unit is provided which counts the number of data for each destination of the destinations registered in the destination buffers A 1 to A N , and when transmitting, the first data in the data buffer is If the destination of the destination buffer corresponding to that data is communicable and there is space in the receiving buffer of that destination, the number of data counted in the data number counting unit for each destination is transmitted to that destination. After sending, the first data is deleted and the above sending process is repeated for the new first data. 1. A local area network characterized by comprising means for suspending transmission of the data and performing the transmission process to the destination of the next data in any of the cases when the data is not available.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP59171726A JPS60100850A (en) | 1984-08-17 | 1984-08-17 | Local area network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP59171726A JPS60100850A (en) | 1984-08-17 | 1984-08-17 | Local area network |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP58126534A Division JPS6018039A (en) | 1983-07-12 | 1983-07-12 | Local network system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPS60100850A JPS60100850A (en) | 1985-06-04 |
| JPH0542859B2 true JPH0542859B2 (en) | 1993-06-29 |
Family
ID=15928534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP59171726A Granted JPS60100850A (en) | 1984-08-17 | 1984-08-17 | Local area network |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS60100850A (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS6253046A (en) * | 1985-09-02 | 1987-03-07 | Matsushita Electric Ind Co Ltd | Communication equipment for data of industrial robot |
| US5559710A (en) * | 1993-02-05 | 1996-09-24 | Siemens Corporate Research, Inc. | Apparatus for control and evaluation of pending jobs in a factory |
-
1984
- 1984-08-17 JP JP59171726A patent/JPS60100850A/en active Granted
Also Published As
| Publication number | Publication date |
|---|---|
| JPS60100850A (en) | 1985-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4967288A (en) | Facsimile storage and exchange system | |
| US3839707A (en) | Fault-alarm and control for a microwave communication network | |
| US4887075A (en) | Local area network system with a multi-computer system coupled thereto and method for controlling the same | |
| US4692862A (en) | Rapid message transmission system between computers and method | |
| US5367646A (en) | Universal device for coupling a computer bus to a controller of a group of peripherals | |
| JPS58217069A (en) | Communicating system of multi-microcomputer | |
| JPH0526221B2 (en) | ||
| JPH0542859B2 (en) | ||
| EP0616450A2 (en) | Communication control device | |
| KR100302565B1 (en) | A method for data transfer and sharing between different types of PLC | |
| EP0028891B1 (en) | A data processing system | |
| JPS6018039A (en) | Local network system | |
| JPS62166634A (en) | System for setting address of terminal equipment in two-way catv system | |
| EP0226688B1 (en) | Serial link adapter for a communication controller | |
| JP2611388B2 (en) | Data processing device | |
| JPH0614379A (en) | Communication method for supervisory measurement and command control | |
| JPS6029987B2 (en) | Data transfer control method | |
| JPS5955507A (en) | Control system of parallel processing type programmable controller | |
| JP3336137B2 (en) | Software remote maintenance method | |
| SU736083A1 (en) | Device for interfacing input-output units with digital computer | |
| JPH0220027B2 (en) | ||
| JPH01276940A (en) | Data transfer controller | |
| JPS5816824B2 (en) | Store and forward method | |
| JPS5819061A (en) | Expanding method for control signal data | |
| JPH0531978B2 (en) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| LAPS | Cancellation because of no payment of annual fees |