JPS59140745A - Data transfer system - Google Patents

Data transfer system

Info

Publication number
JPS59140745A
JPS59140745A JP58014098A JP1409883A JPS59140745A JP S59140745 A JPS59140745 A JP S59140745A JP 58014098 A JP58014098 A JP 58014098A JP 1409883 A JP1409883 A JP 1409883A JP S59140745 A JPS59140745 A JP S59140745A
Authority
JP
Japan
Prior art keywords
line
terminal
time
busy
detection circuit
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.)
Granted
Application number
JP58014098A
Other languages
Japanese (ja)
Other versions
JPH0244179B2 (en
Inventor
Yasuhiro Kunimoto
国本 康弘
Kenji Mizui
水井 賢司
Hideyuki Motoyama
英幸 元山
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP58014098A priority Critical patent/JPS59140745A/en
Publication of JPS59140745A publication Critical patent/JPS59140745A/en
Publication of JPH0244179B2 publication Critical patent/JPH0244179B2/ja
Granted legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867Arrangements specially adapted for the transmitter end
    • H04L1/1887Scheduling and prioritising arrangements

Abstract

PURPOSE:To uniform the opportunities for using a circuit by adding an ACK function and a priority control function and improving transmission efficiency, and varying the allotted time of each terminal. CONSTITUTION:None of terminals performs transmission a specific time (T1) after signal transmission. A station which receives a signal in a period of time T1 transmits an ACK signal. A terminal which is to make a request to send starts transmission in its allotted time after the time T1. In this case, a low-priority station (e.g. terminal N+1) has less opportunities for transmission. For this purpose, not T1, but T3 (>T1+T2XN) is allotted to the station as said constant time to evade its contention with terminals 1-N.

Description

【発明の詳細な説明】 (a)  発明の技術分野 本発明は同一の回線上に複数の端末が接続されコンテン
ション方式で各端末間でデータの授受を行なうデータ通
信システムに係シ、慣にζビル管理システムの残業管理
システムの如く、多数の残業通知端末は回線獲得する機
会が多く、この通知を受けて処理する処理端末は回線獲
得する機会は殆んどないが、複数の種類の処理を行って
お多処理効率を上げる必要があるデータ通信システムで
、簡単な回路と簡単なプログラム処理によりデータ通信
システムが栴成出来又処理端末の処理効率の良いデータ
転送方式に関する。
[Detailed Description of the Invention] (a) Technical Field of the Invention The present invention relates to a data communication system in which a plurality of terminals are connected to the same line and data is exchanged between each terminal using a contention method. ζ Like the overtime management system of a building management system, a large number of overtime notification terminals have many opportunities to acquire lines, and processing terminals that receive and process these notifications have almost no opportunity to acquire lines, but multiple types of processing The present invention relates to a data transfer system that can be constructed using a simple circuit and simple program processing in a data communication system in which it is necessary to improve multi-processing efficiency by performing multiple processing operations, and which also provides high processing efficiency for a processing terminal.

(b)  従来技術と問題点 向−の回線上に複数の端末が接続されコンテンジョン方
式で各娼末簡でデータの授受を行なうデータ通信システ
ムには簡単な回路と簡単なプログラム処理によシデータ
通伯システムが栴成出来る本出願人が58年出願した転
送方式がある。このデータ転送方式を以下説明する。
(b) Prior Art and Problems - A data communication system in which multiple terminals are connected on a line and data is sent and received using each packet using a contention method is capable of transmitting data using simple circuits and simple program processing. There is a transfer method that the present applicant applied for in 1958, which allows the establishment of the Tohaku system. This data transfer method will be explained below.

第1図はデータ通係回線の概念図で回縁10にコンテン
ション方式の各データ端末1〜Nが接続切 されている。鋲2図は従来例の端采珈部の回路構成を示
すブロック図で回線6よシの信号はレシーバ16を介し
ビジー検出回路15(内容は後で説明する)にて回線が
使用中かを判断し、直並列変換回路14にて直列信号を
並列信号とし、マイクロプロセッサ(以下1’!vlP
’Uと称す)12に過多処理後並直列変換器13にて並
列信号を直列信号に変換してドライバ17を介して回線
に送信している。この時命令格納ROMIIには各種の
命令のプログラムを格納しておシMPU12はこの命令
を読み出し処理を行なう、鮨3図は従来例のビジー検出
回路15のブロック図(イ)及びタイムチャート(B)
〜(6)で18i、iカウンタ、19はアンド回路、2
0はインバータを示し1、タイムチキード)〜■)はブ
ロック図(5)のb −e点に対応し、(B)は回縁の
信号のタイムチャートでカウンタ18のリセット信号と
なっており、(C)はクロック信号のタイムチャートで
(DJはビジー信号のタイムチキードで■)はカウンタ
18へのクロック信号のタイムチャートである。
FIG. 1 is a conceptual diagram of a data communication line, in which contention type data terminals 1 to N are disconnected from a line 10. Figure 2 is a block diagram showing the circuit configuration of a conventional end latch section.The signal from the line 6 is sent via a receiver 16 to a busy detection circuit 15 (the details of which will be explained later) to determine whether the line is in use. The serial signal is converted into a parallel signal by the serial/parallel conversion circuit 14, and the microprocessor (hereinafter referred to as 1'!vlP)
After the overload processing (referred to as 'U') 12, the parallel signal is converted into a serial signal by a parallel-to-serial converter 13 and transmitted to the line via a driver 17. At this time, various instruction programs are stored in the instruction storage ROM II, and the MPU 12 reads out and processes these instructions. )
In ~(6), 18i is the i counter, 19 is the AND circuit, and 2
0 indicates an inverter, 1, time signature) to ■) correspond to points b - e of the block diagram (5), and (B) is a time chart of the circuit signal, which is the reset signal for the counter 18, and ( C) is a time chart of a clock signal (DJ is a time chart of a busy signal, and ▪) is a time chart of a clock signal sent to the counter 18.

この第3図(5)のビジー検出回路は調歩同期式でベー
スバンド転送を行なう時の回路であり、回線の使用の有
無をカウンタ18のリセット端子に入力するデータの廟
無にて判定する。調歩同期の手順では通常はルベルにホ
ールドされ、キャラクタ送出時は、1キヤラクタに1回
心らず0が出現するのでキャラクタ送出毎にカウンタ1
8−、リセットされカウンタ18のQ6の出力はOにな
シ回線がビジーであることを第2図のM P U 1’
 2に通知する。回線の使用が終了し、回線信号がI 
L/ベベルホールドされるとカウンタ18のQ6の出力
は最後にOが送出された後第3図■)に示す如<TI時
間後ルベルとカリ回線のビジー解除が第2図のMP[1
12に通知される。又このルベルとなった信号によυカ
ウンタ18のクロック端子へのクロックは第3図■)に
示す如くOレベルにホールドされる。各端末は信号を受
信すると第2図のMPU12の制御によシ必ず応答信号
を返すことにしであるので、このようにして受信端末よ
りの応答信号を返送する時間の間は回線使用後も各端末
は回線がビジーと認識するようにして(へる。其の他の
方式でもほぼ第3図と同様表回路でビジー検出回路は実
現出来る。
The busy detection circuit shown in FIG. 3(5) is a circuit for performing baseband transfer in an asynchronous manner, and determines whether or not the line is in use based on the presence of data input to the reset terminal of the counter 18. In the start-stop synchronization procedure, it is normally held at the level, and when sending out a character, 0 appears randomly once for each character, so the counter is set to 1 every time a character is sent out.
8-, the output of Q6 of the counter 18 is reset to O, indicating that the line is busy.
Notify 2. When the line is no longer in use and the line signal is
When the L/bevel hold is applied, the output of Q6 of the counter 18 is as shown in FIG.
12 will be notified. Also, due to this level signal, the clock to the clock terminal of the υ counter 18 is held at O level as shown in FIG. 3 (3). When each terminal receives a signal, it is determined that it always returns a response signal under the control of the MPU 12 shown in FIG. The terminal recognizes that the line is busy.In other methods, the busy detection circuit can be implemented using a front circuit similar to that shown in Fig. 3.

第4図は従来例の回線を獲保する時のタイムチャートで
第5図は従来例の送信子IflL’Lのフローチャトで
、この送信平原のプログラム1l−i第z図のROM1
1に格納されてお、QMPU12の制御によシ下記に説
明する如き手順にて送信を行なう。
Fig. 4 is a time chart when securing a line in the conventional example, and Fig. 5 is a flow chart of the transmitter IflL'L in the conventional example.
1, and is transmitted under the control of the QMPU 12 according to the procedure described below.

まづ端末は第2図のビジー検出回路15により回線がビ
ジーであるかを確める。ビジーでなかつfc場合にはビ
ジニ直後の各端末割当て時間T 2 X、N(Ttは1
ケの端末への送信機を得る為の割当て時間、Nは端末の
数)を赴ける為比4図(C)に示す如くT2×N時間待
ってから再度回線がビジーでないことを確認し送信を行
なう。各端末は第4図囚に示す妬く、回線使用終了後時
間T、は先に脱税せる如くビジー検出回路15によフビ
ジーとなるようにしてあり又ビジー解除後は、第1図に
示この時間送信機を各端末に与えるようにT2×Nの時
間は各端末への割当て時間としである。例えばM番目の
アドレスの端末が送信しようとした時ビジーであったと
すると、第4図(B)に示す如くビジー解除を待ち、さ
らにT2xM時間伎っで再度回線がビジーでないことを
確認し送信を行なう。ビジーであった場合は以上の動作
を繰返す。
First, the terminal checks whether the line is busy using the busy detection circuit 15 shown in FIG. If not busy and fc, each terminal is allocated time T 2 X, N (Tt is 1
(where N is the number of terminals), wait for T2 x N time as shown in Figure 4 (C), check again that the line is not busy, and then transmit. Do the following. Each terminal is set to become busy by the busy detection circuit 15 during the time T shown in FIG. 4 after the line is used, so that tax evasion can be avoided first, and after the busy state is released, the time T shown in FIG. The time T2×N is the time allocated to each terminal so that the transmitter is provided to each terminal. For example, if the terminal with the Mth address is busy when attempting to send a message, it will wait until the busy state is released as shown in Figure 4 (B), and then confirm that the line is not busy again after T2xM time and try sending again. Let's do it. If it is busy, repeat the above operation.

送イ#動作に送りたら必らず応答を受信端末より帰すシ
ェークハンドで行ない、受信端末は上記ビジ一時間内に
応答を返す。応答が返送されればこれで終結する。送信
端末は送信後回線ビジーが解除される迄に応答が返って
とない篩は衝突が起きたものと判断し以上の手順に従っ
て再送信を行う。
When a message is sent to the Send I# operation, a response is always sent back from the receiving terminal using a shake hand, and the receiving terminal returns the response within the above-mentioned one-hour bus time. If a response is returned, this is the end. If the sending terminal does not receive a response until the line busy is released after sending, it determines that a collision has occurred, and retransmits according to the above procedure.

又応答があってもエラー信号であれば再送信を行ない、
例えば31再送佃を行っても応答が返らない又は信号が
エラーであれば臀報信号を発し終結する。このようにカ
ウンタ1個とインハニタ付アンド回路1個の簡単な回路
のビジー検出回路と比較的簡単な送信手順(フログラム
)によシデータ通信回線が構成出来一旦衝突が起きても
其の後は各端末に衝突が起きないよう送信時刻が割g当
てられ効率のよいデータ伝送が行、なわれる。
Also, even if there is a response, if it is an error signal, it will be retransmitted,
For example, if a response is not returned even if 31 retransmission is performed, or if the signal is an error, a final notification signal is issued and the process is terminated. In this way, a data communication line can be constructed using a simple busy detection circuit consisting of one counter and one AND circuit with an in-hanitor, and a relatively simple transmission procedure (program). Transmission times are assigned to prevent collisions between terminals, and efficient data transmission is performed.

しかし、例えば第1図の端末Nは回線を獲得する機会は
殆んど外いが複数の種類の処理を行っている場合は、こ
の端末Nも送信をする場合は、ビジー検出回路15がビ
ジー検出後自局が送信機を得る迄待たねばならずこの間
処理が伺も出来なく効率が悪く、又ビジー解除を割込み
にした場合は前記の場合程の効率の悪さはなくなるが各
端末にて回線を使用しビジーが解除される度に割込みが
入シ処理が一旦中断され処理が繁雑になる欠点が有る。
However, for example, if terminal N in FIG. 1 has little chance of acquiring a line but is performing multiple types of processing, if this terminal N also transmits, the busy detection circuit 15 indicates that it is busy. After detection, you have to wait until your own station acquires a transmitter, and during this time the processing cannot be done, which is inefficient.Also, if you use an interrupt to clear the busy state, the inefficiency will not be as bad as in the above case, but the line This has the disadvantage that an interrupt is generated each time the busy state is released, and the processing is temporarily interrupted, making the processing complicated.

(C)  発明の目的 本発明の目的は上記の欠点に鑑み、簡単な回路と簡単表
70グラム処理によシデータ通信システムが構成出来又
回線の獲得する機会に殆んど々いが複数の処理を行って
いる処理端末の処理効率が良く又処理が簡単なデータ転
送方式の提供にある。
(C) Object of the Invention In view of the above-mentioned drawbacks, the object of the present invention is to configure a data communication system using a simple circuit and simple table 70-gram processing, and to perform multiple processing in most cases when a line is acquired. The purpose of the present invention is to provide a data transfer method that has good processing efficiency and simple processing for processing terminals.

(d)  発明の構成 本発明は上記の目的を達成するために、各端末よりの送
信に対しては受信端末に、必ず応答信号を返送すること
とし、回線を獲得する機会の多い第1鶏の端末には、回
線使用後肢応答信号を返送する時間も回線を使用中とす
る店−1のビジー検出回路を持ち、かつ回線使用解除後
は各端末のアドレス1−に送信様を持つ手段及び各端末
が回線使用中で々い時送信する時は上記一番順番の遅い
アドレスの端末が送信横を持つ時間待って再び回線が使
用中で々い時回恐を独得する手段及び各局端末がデータ
を送信し回線使用解除後に応答が返送されない時は上記
手順に従って再送を行う手段を持たせ、回線を獲得する
機会の殆んど力い第2類の端末には該第1類の端末のビ
ジー検出時間にアドレスが一番大きい端末が送信機を得
るために待つ時間を加えた時間より大きい時間を回線使
用中とする第2のビジー検出回路及び該第2のビジー検
出回路がビジーでない特待たずに送信する手段を持たせ
たことを特徴とするデータ転送方式である。
(d) Structure of the Invention In order to achieve the above object, the present invention always returns a response signal to the receiving terminal in response to transmission from each terminal, and the first terminal that has the most opportunity to acquire the line is The terminal has a busy detection circuit for store-1 which determines that the line is in use during the time when the line-use hind limb response signal is returned, and after the line is released from use, a means for sending the message to address 1- of each terminal; When each terminal transmits from time to time while the line is in use, the terminal with the last address in the above order waits for a period of time to transmit, and then the line is in use again. If a response is not returned after transmitting data and canceling the use of the line, provide a means to retransmit data according to the above procedure, so that the second category of terminals, which have the most opportunities to acquire the line, are given the same method as the first category of terminals. A second busy detection circuit that keeps the line in use for a time longer than the busy detection time plus the time the terminal with the largest address waits to obtain a transmitter, and special treatment in which the second busy detection circuit is not busy. This data transfer method is characterized by having a means for transmitting data without any data transmission.

(e)  発明の実施例 以下本発明の1実施例につき図に従って説明する0 第1図において1〜Nを回線を獲得する橡会の多い端末
とし、図示してないがN+1を回線を獲得する機会は殆
んどない端末として説明する。端末1〜Nは従来例で説
明した通シの構成とする。
(e) Embodiment of the Invention An embodiment of the present invention will be described below with reference to the drawings. In FIG. 1, 1 to N are terminals with many parties that acquire a line, and N+1 (not shown) is a terminal that acquires a line. I will explain it as a terminal that has almost no opportunities. Terminals 1 to N have the same configuration as described in the conventional example.

従って以下は端末N+1について説明する。Therefore, terminal N+1 will be explained below.

′ 第6図は本発明の実施例の回線を獲得する場合のタ
イムチャート、第7図に本発明の実施例の送信手段のフ
ローチャート、第8図は本発明の実施例のビジー検出回
路のブロック図である。
' Fig. 6 is a time chart when acquiring a line according to the embodiment of the present invention, Fig. 7 is a flowchart of the transmitting means according to the embodiment of the present invention, and Fig. 8 is a block diagram of the busy detection circuit according to the embodiment of the present invention. It is a diagram.

第8図中第3図と同一機能のものは同一記号で示す。1
8′はカウンタを示す。端末N+1の構成も要部は第2
図に示す通シであるがビジー検出回路15は端末1〜N
とは以下に説明する通〕多少異なり、又ROMIIに格
納する送信手段のプログラムも端末1〜Nとは以下に説
明する通ヤ異なる。
Components in FIG. 8 that have the same functions as those in FIG. 3 are indicated by the same symbols. 1
8' indicates a counter. The main part of the configuration of terminal N+1 is the second one.
As shown in the figure, the busy detection circuit 15 is connected to terminals 1 to N.
The program of the transmitting means stored in the ROMII is also different from that of terminals 1 to N, as will be explained below.

尚この端末は、図示してないがRAM等も用いて、一般
的には複@fの処理A、 B、 C・・曲Mをザイクリ
ックル行っている。端末N+1のビジー検出回路をあ8
図を用いて説明すると、第8図で第3図とツなる点は回
線!がビジーであることを第2図のMPU12に通知す
る信号線を、第3図の場合はカウンタ18のQ、の出力
よシとっていたものを、同じカウンタ18′のQ7の出
力よシとっている点である。こうすることにより第6図
に示す如く、回線使用終了点より回線がビジーとしてい
る時間はT。
Although not shown, this terminal also uses a RAM and the like to generally perform multi-@f processing A, B, C, . . . song M in parallel. A8 the busy detection circuit of terminal N+1
To explain using a diagram, the point in Figure 8 that is different from Figure 3 is the line! The signal line that notifies the MPU 12 of FIG. 2 that it is busy is replaced by the output of counter 18 Q in FIG. The point is that By doing this, as shown in FIG. 6, the time that the line is busy from the end of line usage is T.

となり、アドレスが一番大きい端末Nが送信(冶を得る
時間816図ではT+ +T2 X Nよシ大きい時間
を回線ビジーとしている。このようにすればビジー検出
回路が回線空きを検出すれば他端末1〜Nと競合するこ
となく送信することが出来る。そこで送信キ厭としては
第7図に示す如く同店が空いていれば直ちに信号を送出
するようにしている。
Then, the terminal N with the largest address sends a message (time to obtain a signal) In Figure 816, the line is busy for a time greater than T+ + T2 It is possible to transmit the signal without competing with signals 1 to N. Therefore, as shown in FIG. 7, the signal is transmitted immediately if the store is vacant, as shown in FIG.

このようにすれば端末N+1は回線が空いてぃれは直ち
に送信出来るので他の処理を中断することもなく処理効
率は良くなシス処理も繁雑になることはない。尚回線ビ
ジーを検出するタイミングを例えば処理Mが完了した時
点で検出するように定めておけば、尚更処理を中断する
ことはなくなる。
In this way, terminal N+1 can transmit immediately when the line is free, so other processing is not interrupted, processing efficiency is high, and system processing does not become complicated. If the timing for detecting the line busy is determined to be detected, for example, at the time when processing M is completed, the processing will not be interrupted any further.

従って端末N+1も簡単な回路と簡単な送信処理手順に
よりs成出来かつ他の処理は簡単表処理手順で効率よく
行なうことが出来る。
Therefore, the terminal N+1 can also perform the s operation using a simple circuit and a simple transmission processing procedure, and other processing can be performed efficiently using a simple table processing procedure.

(f)  発明の効果 以上詳細に説明せる如く本発明によれば簡単な回路と簡
単な送信処理手順によシコンテンショア方式のデータ通
信システムが構成出来かつ回線を獲得する機会は殆んど
ないが複数の処理を行なつなうことが出来る効果がある
(f) Effects of the Invention As explained in detail above, according to the present invention, a data communication system of the tensile type can be constructed using a simple circuit and a simple transmission processing procedure, and there is almost no chance of acquiring a line. This has the effect of allowing multiple processes to be performed.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図はデータ通信回線の概念図、第2図は従来例の端
末の要部の回路梅成を示すブロック図、第3図は従来例
のビジー検出回路のブロック図及び各部の信号のタイム
チャート、第4図は従来例の回線を獲得する時のタイム
チャート、卯、5図は従来例の送信手順のフローチャー
1−1fit+6図、第7図、aE8図は本発明の実施
例の回線を獲得する機会の殆んどない端末の回線を獲得
する場合のタイムチャート、送信手段のフローチャート
、ビジー検出回路のブロック図である。 図中1〜Nは端末、10は回線、11はROM。 12はマイクロプロセッサ、13け並直列変換器、14
は直並列変換器、15はビジー検出回路、16はレシー
バ、17はドライバ、18.18’はカランタ、19は
アンド回路、20Uインバータを示す。 拳 1 目 〉 2 図 年 3 口 (B $4 回 Bデー2              665第 52 7A RT 葉 6 口 寥 7 口 峯 8 口
Figure 1 is a conceptual diagram of a data communication line, Figure 2 is a block diagram showing the circuit structure of the main parts of a conventional terminal, and Figure 3 is a block diagram of a conventional busy detection circuit and the signal times of each part. Figure 4 is a time chart when acquiring a line in the conventional example, Figure 5 is a flowchart of the transmission procedure in the conventional example 1-1fit+6, Figure 7, and Figure aE8 are the lines in the embodiment of the present invention. FIG. 2 is a time chart, a flowchart of a transmitting means, and a block diagram of a busy detection circuit when acquiring a line for a terminal that has almost no chance of acquiring a line. FIG. In the figure, 1 to N are terminals, 10 is a line, and 11 is a ROM. 12 is a microprocessor, 13-digit parallel-to-serial converter, 14
15 is a serial/parallel converter, 15 is a busy detection circuit, 16 is a receiver, 17 is a driver, 18.18' is a qualifier, 19 is an AND circuit, and a 20U inverter. Fist 1 〉 2 Year 3 Kuchi (B $4 B Day 2 665th 52 7A RT Leaf 6 Kuchi 7 Kuchimine 8 Kuchi

Claims (1)

【特許請求の範囲】[Claims] 同一の回線上に複数の端末が接続され、コンテンション
方式で各端末間でデータの授受を行なうデータ通信シス
テムにおいて、各端末よシの送信に対しては受信端末は
、必ず応答信号を返送することとし、回線を獲得する機
会の多い第1類の端末には、回線使用後肢応答係号を返
送する時間も回線を使用中とする第1のビジー検出回路
を持ち、かつ回線使用解除後は各端末のアドレス順に送
信機を持つ手段及び各端末が回縁使用中でない時送信す
る時は上記一番順番の遅いアドレスの端末が送信機を持
つ時間待って再び回線が使用中でない時回線を獲得する
手段譬び各端末がデータを送信し回線使用解除後に応答
が返送されない時は上記手順に従って再送を行う手段を
持たせ、回線を獲得する機会の殆んどない第2類の端末
には、該第1類の端末のビジー検出時間にアドレスが一
番大きい端末が送信機を得るために待つ時間を加えた時
間よシ大きい時間を口約使用中とする第2のビジー検出
回路及び該第2のビジー検出回路がビジーでない特待た
ずに送信する手段を持たせたことをI$j徴とするデー
タ転送方式。
In a data communication system where multiple terminals are connected to the same line and data is exchanged between each terminal using a contention method, the receiving terminal always returns a response signal in response to a transmission from each terminal. In this year, the first type of terminals that have many chances to acquire the line are equipped with a first busy detection circuit that determines that the line is in use even during the time when the line use hind limb response code is returned, and after the line is released, Means to have a transmitter in the order of the address of each terminal, and when each terminal is transmitting when the line is not in use, wait for the terminal with the last address in the above order to have a transmitter, and then turn the line again when the line is not in use. Means for acquiring the lineFor example, if each terminal sends data and no response is returned after the line is released, the second type of terminals, which have little chance of acquiring the line, should have a means to retransmit data according to the above procedure. , a second busy detection circuit configured to be in use for a time longer than the busy detection time of the first class terminal plus the time for which the terminal with the largest address waits to obtain a transmitter; A data transfer method in which the I$j feature is that the second busy detection circuit has a means for transmitting data without waiting for special requests when the second busy detection circuit is not busy.
JP58014098A 1983-01-31 1983-01-31 Data transfer system Granted JPS59140745A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58014098A JPS59140745A (en) 1983-01-31 1983-01-31 Data transfer system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58014098A JPS59140745A (en) 1983-01-31 1983-01-31 Data transfer system

Publications (2)

Publication Number Publication Date
JPS59140745A true JPS59140745A (en) 1984-08-13
JPH0244179B2 JPH0244179B2 (en) 1990-10-03

Family

ID=11851636

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58014098A Granted JPS59140745A (en) 1983-01-31 1983-01-31 Data transfer system

Country Status (1)

Country Link
JP (1) JPS59140745A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01119145A (en) * 1987-10-31 1989-05-11 Nec Corp Remote control transmission equipment

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5439504A (en) * 1977-09-02 1979-03-27 Fujitsu Ltd Information communication system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5439504A (en) * 1977-09-02 1979-03-27 Fujitsu Ltd Information communication system

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01119145A (en) * 1987-10-31 1989-05-11 Nec Corp Remote control transmission equipment

Also Published As

Publication number Publication date
JPH0244179B2 (en) 1990-10-03

Similar Documents

Publication Publication Date Title
US4430651A (en) Expandable and contractible local area network system
EP0074864B1 (en) System and method for name-lookup in a local area network data communication system
EP0073698A2 (en) System and method for synchronizing variable-length messages in a local area network data communication system
EP0042988B1 (en) Communication system
JPS59147563A (en) Communication terminal station apparatus with bidirectional communication line
JPS59172877A (en) Communication terminal station with bidirectional communication line
JPS601788B2 (en) ARQ communication method
JPS59140745A (en) Data transfer system
CN115941382A (en) Flow control method and device for SPI communication, terminal equipment and storage medium
JPS59140746A (en) Data transfer system
JPH0476256B2 (en)
JPH09130382A (en) Polling communication method
JPS63155249A (en) Inter-equipment communication system
JP2957361B2 (en) Polling method
JPH04505993A (en) hybrid data communication system
CA1213016A (en) Expandable and contractible local area network system
CA1208736A (en) System and method for name-lookup in a local area network data communication system
JPH03204065A (en) Data transfer contention evading system in inter-processor communication
JPS61228749A (en) Error control system in multiple address communication system
JPS6380359A (en) Common resource managing method
JPS61112454A (en) Data transmission method
JPS62299139A (en) Multiple address communication system
JPS63169149A (en) Dynamic transmission schedule system
JPS60180350A (en) Data communication method
JPS59148448A (en) Priority system of branched type network