JPS61278238A - Address deciding circuit for transmitter terminal equipment - Google Patents

Address deciding circuit for transmitter terminal equipment

Info

Publication number
JPS61278238A
JPS61278238A JP11973485A JP11973485A JPS61278238A JP S61278238 A JPS61278238 A JP S61278238A JP 11973485 A JP11973485 A JP 11973485A JP 11973485 A JP11973485 A JP 11973485A JP S61278238 A JPS61278238 A JP S61278238A
Authority
JP
Japan
Prior art keywords
address
circuit
frame
data
determination
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
JP11973485A
Other languages
Japanese (ja)
Other versions
JPH0773274B2 (en
Inventor
Kazuhisa Inada
和久 稲田
Norihiko Sugimoto
杉本 則彦
Shunji Inada
俊司 稲田
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.)
Hitachi Engineering Co Ltd
Hitachi Ltd
Original Assignee
Hitachi Engineering Co Ltd
Hitachi 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 Hitachi Engineering Co Ltd, Hitachi Ltd filed Critical Hitachi Engineering Co Ltd
Priority to JP60119734A priority Critical patent/JPH0773274B2/en
Publication of JPS61278238A publication Critical patent/JPS61278238A/en
Publication of JPH0773274B2 publication Critical patent/JPH0773274B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Landscapes

  • Small-Scale Networks (AREA)

Abstract

PURPOSE:To attain high speed processing with miniaturization independently of the quantity of decision by providing plural circuits storing a destination address of a received frame at each unit quantity. CONSTITUTION:A station receiving a frame applies serial/parallel conversion converting a frame of a transmission line being a serial data 10 into a parallel data at each unit quantity. A destination address DA in the data converted into the parallel data 12 is transferred into to an address discrimination circuit 14 and stored sequentially alternately to a storage circuit 18 and a storage circuit 19 at each unit quantity converted by a serial/parallel conversion circuit 11. Two storage circuits per unit quantity of the destination address are stored and data are stored alternately, then the holding time of data per one storage circuit is double in comparison with one storage circuit employed. Thus, the decision processing is applied in a double time range, then the decision exceeding the processing time range per unit quantity is processed sufficiently.

Description

【発明の詳細な説明】 〔発明の利用分野〕 本発明は、伝送路に複数の局を接続した伝送システムに
おけるアドレス判定回路に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Application of the Invention] The present invention relates to an address determination circuit in a transmission system in which a plurality of stations are connected to a transmission path.

〔従来の技術〕[Conventional technology]

構内における複数の端末間、又は複数の構内にまたがる
端末間のデータ伝送システムが存在する。
BACKGROUND OF THE INVENTION Data transmission systems exist between multiple terminals within a campus or between terminals across multiple campuses.

例えば、LAN (ローカル・エリア・ネットワーク)
はその一つである。例えば、「データ通信ハンドブック
」 (電子通学余線、昭和59年10月30日発行、1
21頁参照)がある。
For example, LAN (local area network)
is one of them. For example, ``Data Communication Handbook'' (Electronic School Yoshin, published October 30, 1980, 1
(See page 21).

伝送システムの一例を第3図に示す。第3図は、3つの
ループ状伝送路50,51.52を持ち、ループ状伝送
路50には計算機50A及び端末50B、50Gを接続
する。計算機50Aも広い意味での端末と考えてよい。
An example of a transmission system is shown in FIG. FIG. 3 has three loop-shaped transmission lines 50, 51, and 52, and the loop-shaped transmission line 50 is connected to a computer 50A and terminals 50B and 50G. The computer 50A may also be considered a terminal in a broad sense.

ループ状伝送路51には端末51A、、51Bを接続し
、且つ端末50Cを介して他のループ状伝送路と結合し
た。ループ状伝送路52には端末52A、52B、52
Cを接続し且つ端末50Bを介してループ状伝送路50
を結合した。
Terminals 51A, 51B were connected to the loop-shaped transmission line 51, and it was coupled to other loop-shaped transmission lines via the terminal 50C. The loop-shaped transmission line 52 has terminals 52A, 52B, 52
A loop-shaped transmission line 50 is connected to C and via a terminal 50B.
combined.

ループ状伝送路50,51.52はリングと呼ばれる。The loop-shaped transmission lines 50, 51, and 52 are called rings.

この伝送システムのデータ伝送はフレーム単位で行われ
、その1フレームのデータフォーマットを第4図に示す
。1フレームの先頭と最後には同期コードの役割を果す
デリミタDELを置き、次いで、宛先アドレス部DA、
送信元アドレス部SA、送信情報工、チェックコードF
CSを設けた。
Data transmission in this transmission system is performed in units of frames, and the data format of one frame is shown in FIG. A delimiter DEL serving as a synchronization code is placed at the beginning and end of one frame, and then a destination address section DA,
Sender address section SA, transmission information, check code F
A CS was established.

このフレーム構成で、アドレス部DA、SAはそれぞれ
数バイト構成より成る。この数バイトを必要とする理由
は、各リングがアドレスを持つこと、リング内に各ステ
ーション(端末)アドレスを必要とすること、更に、グ
ループによるリングの指定、グループによるステー・ジ
ョン指定を行うこと、等のためである。
In this frame structure, address parts DA and SA each consist of several bytes. The reason why these several bytes are required is that each ring has an address, each station (terminal) address is required within the ring, and the ring is specified by group and the stage is specified by group. , etc.

宛先アドレス部DAの具体的な細部構成を第5図に示す
。DAは、下記より成る。
A specific detailed configuration of the destination address section DA is shown in FIG. DA consists of the following:

0 送信フレームが単−局宛か全局宛か(又は単−局宛
か複数の局を指定するグループ指定先か)を指定する局
種別アドレスIGAゆ 0 相手局の所属するリングを指定するリング・ナンバ
ー・アドレスLA。
0 Station type address IGA that specifies whether the transmitted frame is addressed to a single station or all stations (or whether it is addressed to a single station or a group specification destination that specifies multiple stations) Ring address that specifies the ring to which the partner station belongs Number address LA.

0 送信相手局のステーション・アドレスSTA。0 Station address STA of the destination station.

更に、第6図に示すように、LAは単一リングか全リン
グか、STAは個別かグループか全局かの指定を行う。
Furthermore, as shown in FIG. 6, the LA specifies whether it is a single ring or all rings, and the STA specifies whether it is individual, group, or all stations.

このように、アドレスは、多種であるため、各端局では
、アドレスの判定をいかに効率的に行うかが課題となる
As described above, since there are many types of addresses, each terminal station has a problem with how to efficiently determine addresses.

従来でのアドレス判定手順を第7図で説明する。A conventional address determination procedure will be explained with reference to FIG.

宛先アドレスDAを自局宛であるか否か判定するため、
DAそのものを、更に細かく分割し、DAI、DA2.
・・・、DAnの如くする。この分割は例えば、アドレ
ス表示のための基本単位量であり、−例としては1バイ
トをもって分割する。
In order to determine whether the destination address DA is addressed to the local station,
DA itself is further divided into DAI, DA2.
..., like DAn. This division is, for example, a basic unit amount for address display, and is divided into one byte, for example.

各1バイトか、リングやステーション等を指示し、且つ
グループか個別かといった内容を指示することになる。
Each one byte indicates a ring, a station, etc., and also indicates whether it is a group or an individual.

一方、各端末にあっては、アドレス比較のための基準ア
ドレスMAを持つ。この基準アドレスMAとは、端末の
自己アドレス等を指示したものであり、端末個有の値で
ある。このMAに対しても、DAの分割対応にMAL、
MA2.・・・。
On the other hand, each terminal has a reference address MA for address comparison. This reference address MA indicates the terminal's own address, etc., and is a value unique to the terminal. For this MA, MAL,
MA2. ....

M A nと分割する。Divide into M A n.

この分割したD A 1〜D A nとM A 1〜M
 A nとの間で、DAIとMAL→DA2とMA2→
・・・の如く順次にアドレス比較を行う。この分割によ
る比較は、比較手順が長くなること、及び各分割した細
分アドレスD A iとM A iにあっては、iが異
なると比較処理の内容も単一でなく多様であること、の
特徴を持つ。
These divided D A 1 to D A n and M A 1 to M
Between A n, DAI and MAL → DA2 and MA2 →
Address comparisons are performed sequentially as follows. Comparison by this division requires a long comparison procedure, and if i is different for each divided subaddress D A i and M A i, the content of the comparison process is not uniform but diverse. have characteristics.

かかるアドレス判定の一連の処理を第8図に示す0図で
は、3つの判定処理を示す。この図の見方は、1つのD
Aに対して、3分割したこと、及び各分割単位にそれぞ
れ異なるアドレス判定処理がとられることを意味する。
FIG. 8 shows a series of processes for such address determination. In FIG. 8, three determination processes are shown. How to read this diagram is one D
This means that A is divided into three parts, and that different address determination processing is performed for each division unit.

判定処理1では1個別かグループかの判定、自リングか
否かの判定、オール(a 2 Q 1)か否か、オーツ
1zo(au120)か否かの判定を行う。処理2では
自すング宛か否か。anQlか否か、aQQoか否か、
処理3では自ステーション宛か否か、自ステーション宛
かの処理を行う。
In determination process 1, it is determined whether the ring is 1 individual or a group, whether it is the own ring, whether it is all (a 2 Q 1), and whether it is oats 1zo (au120) or not. In process 2, whether the message is addressed to the user or not. anQl or not, aQQo or not,
In process 3, processing is performed to determine whether or not the packet is addressed to the own station.

即ち、判定処理1では受信フレームが個別宛かグループ
宛か、個別宛の場合には受信局自身のアドレスと一致す
るか否か、あるいは放送フレームであるか否か、またグ
ループ宛の場合には、受信局の属するグループアドレス
と一致しているか否かの判定を行う必要があるが、判定
処理2〜4では、判定処理1の結果に基づき、個別宛で
あれば受信局自身のアドレスとの比較及び放送フレーム
か否かのチェック、またグループ宛であれば受信局の属
するグループ宛か否かを判定すれば良いため、判定処理
1と比較すると少ない処理で判定でき、判定に要する時
間が短くなる。第9図に判定処理に要する時間を示す。
That is, in determination processing 1, it is determined whether the received frame is addressed to an individual or a group, and if it is addressed to an individual, whether or not it matches the address of the receiving station itself, or whether it is a broadcast frame, and if it is addressed to a group, it is determined whether the received frame is addressed to an individual or a group. , it is necessary to judge whether the address matches the group address to which the receiving station belongs, but in judgment processes 2 to 4, based on the result of judgment process 1, if it is an individual address, it is necessary to judge whether the address matches the group address to which the receiving station belongs. Comparing and checking whether it is a broadcast frame or not, and if it is addressed to a group, it is only necessary to determine whether it is addressed to the group to which the receiving station belongs, so compared to determination process 1, the determination can be made with less processing and the time required for determination is shorter. Become. FIG. 9 shows the time required for the determination process.

T0T1間は前述単位量毎のフレーム伝送に要する時間
である。即ち、フレームの受信局にはT。Tiの間隔で
単位量毎のデータが入ってくることになり、T、T□の
時間内に判定処理を終了する必要があるが、判定処理1
の様に、単位量当りの処理量が多くなるとT。T1の時
間内に判定できずに時間枠を超える場合(T。
The interval T0T1 is the time required for frame transmission for each unit amount. That is, the frame receiving station receives T. Data for each unit amount will come in at intervals of Ti, and it is necessary to complete the judgment process within the time T, T□, but the judgment process 1
As in, when the amount of processing per unit amount increases, T. If it cannot be determined within the time T1 and the time frame is exceeded (T.

T、)がある。よって、アドレス判定回路を構成する場
合には以上の様な判定量の多少による判定時間の差異を
緩衝しかつ小形化する必要がある。
T,). Therefore, when configuring an address determination circuit, it is necessary to buffer the difference in determination time due to the amount of determination as described above and to reduce the size of the circuit.

従来の方法1としては、第10図に示す様に受信したフ
レームの宛先アドレスを単位量毎に全て格納できる記憶
回路を設ける方法がある。この方法であれば、宛先アド
レス全体を次フレームを受信するまで保持できるため、
判定量の多少による判定時間の差異は緩衝できるが、宛
先アドレスDAの騒量の増大に伴い回路量が増大する欠
点がある。
As a conventional method 1, as shown in FIG. 10, there is a method of providing a storage circuit capable of storing all the destination addresses of received frames in units of units. With this method, the entire destination address can be retained until the next frame is received, so
Although the difference in determination time due to the amount of determination can be buffered, there is a drawback that the amount of circuitry increases as the amount of noise of the destination address DA increases.

また従来の方法2としては、第11図に示す様に受信し
たフレームの宛先アドレスを単位量毎に1つの記憶回路
に次々に格納していく方法がある。
Further, as a conventional method 2, as shown in FIG. 11, there is a method in which destination addresses of received frames are successively stored in one storage circuit for each unit amount.

この方法であれば、アドレス判定回路を小形化できるが
1判定処理を一定時間内に行う必要があるため、前述の
様に、単位量当りの処理量が多くなると宛先アドレスの
単位量当りの保持時間内に判定できなくなる欠点がある
With this method, the address judgment circuit can be made smaller, but it is necessary to perform one judgment process within a certain amount of time. There is a drawback that it cannot be determined in time.

〔発明の目的〕[Purpose of the invention]

本発明の目的は、上述の如き伝送フレームを受信した局
で、該フレームの宛先アドレスと自局のアドレスを比較
し、該フレームが自局宛であるが否かを判定する際に1
判定量の多少に関係なく、小形でかつ高速に処理できる
アドレス判定回路を提供することにある。
An object of the present invention is to provide a station that receives a transmission frame as described above, compares the destination address of the frame with its own address, and determines whether or not the frame is addressed to its own station.
It is an object of the present invention to provide an address determination circuit that is small and capable of processing at high speed regardless of the amount of determination.

〔発明の概要〕[Summary of the invention]

本発明は、フレームを受信した局が、該フレームが自局
宛であるか否かを判定する場合に、受信したフレームの
宛先アドレスを単位量毎に記憶する回路を複数個設け、
順次、格納することで、記憶回路毎のデータの保持時間
を延ばし、単位量毎に異なる判定時間を緩衝する。また
、記憶回路の個数を最小限に押えることで回路の小形化
を図る。
The present invention provides a plurality of circuits for storing the destination address of the received frame in units of units when a station receiving a frame determines whether the frame is addressed to the station itself.
By sequentially storing data, the data retention time for each storage circuit is extended, and the determination time that differs for each unit quantity is buffered. Further, by minimizing the number of memory circuits, the size of the circuit is reduced.

〔発明の実施例〕[Embodiments of the invention]

第1図は本発明の局受信装置の実施例を示す。 FIG. 1 shows an embodiment of the station receiving apparatus of the present invention.

この局受信装置は、各局対応に個別に設けられる。This station receiving device is individually provided for each station.

局受信装置は、直並列変換回路11.シフトレジスタ1
3.アドレス変換回路14より成る。
The station receiving device includes a serial-to-parallel conversion circuit 11. shift register 1
3. It consists of an address conversion circuit 14.

アドレス変換回路14は、変換検出回路152選択回路
16.インバータ17B、アンドゲート17A、、17
C,フラグレジスタ22,23.記憶回路18,19.
比較回路20.受信局アドレス設定器(レジスタ)21
より成る。
The address conversion circuit 14 includes a conversion detection circuit 152, a selection circuit 16. Inverter 17B, AND gate 17A, 17
C, flag registers 22, 23. Memory circuits 18, 19.
Comparison circuit 20. Receiving station address setter (register) 21
Consists of.

フレームを受信した局では、シリアルデータ1oである
伝送路のフレームを単位量毎にパラレルデータに変換す
る直並列変換を行う。直並列変換回路11によりパラレ
ルデータ12に変換したデータはシフトレジスタ13.
受信バッファへと順次、転送するが、受信バッファへ転
送するか否か、即ち、受信フレームが自局宛であるか否
かを判定し、受信バッファへの転送許可信号23を出力
するのはアドレス判定回路14である。パラレルデータ
12に変換したデータのうち、宛先アドレスDAはシフ
トレジスタ13への転送と同様に。
The station that receives the frame performs serial-to-parallel conversion to convert the frame on the transmission line, which is serial data 1o, into parallel data unit by unit. The data converted into parallel data 12 by the serial/parallel conversion circuit 11 is sent to the shift register 13.
The address is sequentially transferred to the reception buffer, but it is the address that determines whether or not to transfer it to the reception buffer, that is, whether or not the received frame is addressed to the own station, and outputs the transfer permission signal 23 to the reception buffer. This is the determination circuit 14. Of the data converted to parallel data 12, destination address DA is transferred to shift register 13 in the same way.

アドレス判定回路14へも転送する。アドレス判定回路
14へ転送した宛先アドレスDA14は直並列変換回路
11によって変換した単位量毎に、記憶回路18.記憶
回路19へ順次、交互に格納する。格納すべき記憶回路
の選択は、記憶回路選択信号17を生成、出力する選択
回路16である。
It is also transferred to the address determination circuit 14. The destination address DA14 transferred to the address determination circuit 14 is converted by the serial-to-parallel conversion circuit 11 for each unit amount converted by the storage circuit 18. The data are sequentially and alternately stored in the memory circuit 19. The memory circuit to be stored is selected by the selection circuit 16 which generates and outputs the memory circuit selection signal 17.

即ち、選択回路16より出力する記憶回路選択信号17
の論理値を1あるいはOと変化させることにより、直並
列変換回路11よりパラレルデータ12としてアドレス
判定回路14へ転送した、単位量当りの宛先アドレスD
A14を記憶回路18あるいは記憶回路19へと分配す
る。記憶回路選択信号17の論理値を変化させるのは、
記憶回路18あるいは19に格納された単位量毎の宛先
アドレスDAと受信局自身のアドレスを格納した受信局
アドレス21との比較を行う比較回路20より出力する
選択回路制御信号29である。例えば、記憶回路選択信
号17の論理値が1の場合に記憶回路18、論理値0の
場合に記憶回路19が選択されるとすると、機憶回路選
択信号17が論理値1の時単位容量に分割した宛先アド
レスDA14は記憶回路18に格納され、同時に、記憶
回路18にデータを格納したことを示すフラグレジスタ
22がセットされ、フラグレジスタ22のセットを示す
フラグセット信号24が比較回路20へ出力される。フ
ラグレジスタ22のセットを検出した比較回路20は、
選択回路制御信号29により、選択回路16に対し、記
憶回路選択信号〕7の論理値を1から0へ変更するよう
に指令する。
That is, the memory circuit selection signal 17 output from the selection circuit 16
By changing the logical value of D to 1 or O, the destination address D per unit amount is transferred from the serial/parallel conversion circuit 11 to the address determination circuit 14 as parallel data 12.
A14 is distributed to the memory circuit 18 or the memory circuit 19. The logical value of the memory circuit selection signal 17 is changed by:
This is a selection circuit control signal 29 outputted from a comparison circuit 20 that compares the destination address DA for each unit quantity stored in the storage circuit 18 or 19 with the receiving station address 21 storing the address of the receiving station itself. For example, if the memory circuit 18 is selected when the logic value of the memory circuit selection signal 17 is 1, and the memory circuit 19 is selected when the logic value is 0, then the memory circuit selection signal 17 is set to the hourly capacity of the logic value 1. The divided destination address DA14 is stored in the memory circuit 18, and at the same time, a flag register 22 indicating that data has been stored in the memory circuit 18 is set, and a flag set signal 24 indicating that the flag register 22 is set is output to the comparator circuit 20. be done. The comparison circuit 20 detecting the setting of the flag register 22,
The selection circuit control signal 29 instructs the selection circuit 16 to change the logical value of the storage circuit selection signal 7 from 1 to 0.

また、フラグクリア信号30を用いてフラグ22をクリ
アし、記憶回路18に格納されたデータを読み込み、受
信局アドレス21のデータとの比較を行う。前述の様に
記憶回路選択信号17の論理値を1から1へ変更するこ
とにより、前述の如く分割された次の宛先アドレスDA
は記憶回路19に格納される。この様に2ケの記憶回路
に交互に宛先アドレスDAを単位量毎に交互に記憶し、
自局アドレスとの比較を行う。比較の結果、受信したフ
レームが自局宛であれば比較回路20より受信バッファ
への転送許可信号23を出力する。ここでシフトレジス
タ13を設置したのは、受信したフレームが自局宛であ
るか否かを判定し、受信バッファへの転送許可信号23
を出力するまでの時間をかせぎ、自局宛フレームだけを
受信バッファへ転送するためである。
Further, the flag 22 is cleared using the flag clear signal 30, the data stored in the storage circuit 18 is read, and the data is compared with the data of the receiving station address 21. By changing the logical value of the storage circuit selection signal 17 from 1 to 1 as described above, the next destination address DA divided as described above is
is stored in the memory circuit 19. In this way, the destination address DA is alternately stored in the two memory circuits for each unit amount,
Compare with own station address. As a result of the comparison, if the received frame is addressed to the local station, the comparison circuit 20 outputs a transfer permission signal 23 to the reception buffer. The reason for installing the shift register 13 here is to determine whether or not the received frame is addressed to the local station, and to send a transfer permission signal 23 to the reception buffer.
This is to save time until the frame is output, and to transfer only the frame addressed to the local station to the reception buffer.

以上の様なアドレス判定回路を構成することで2つの利
点が生まれる。第1の利点は記憶回路を2ケ設置するこ
とで各記憶回路のデータの保持時間を2倍にできるため
に、宛先アドレスの単位量当りの処理量の多少による判
定時間の差異を緩衝し、かつ判定を低速にできること、
第2の利点は宛先アドレスの単位量当りのデータの記憶
回路を最少限に押えたことによる回路の小形化である。
By configuring the address determination circuit as described above, two advantages arise. The first advantage is that by installing two memory circuits, the data retention time of each memory circuit can be doubled, which buffers the difference in determination time due to the amount of processing per unit amount of destination address. and that the judgment can be made at a low speed.
The second advantage is the miniaturization of the circuit by minimizing the number of data storage circuits per unit amount of destination address.

まず、第1の利点である判定時間の差異の緩衝について
説明する。宛先アドレスDAは第6図に示す様に個別/
グループを示すアドレスIOA及びリングアドレスLA
及びフレームを受信すべき局番を示すステーションアド
レスSAより構成され、ステーションアドレスSAは第
7図に示す様に、個別局宛アドレス、放送アドレスある
いはグループアドレスの情報を含む。リンクグアドレス
LAは単一リングか全リングかの識別を含む。またアド
レス判定を行う場合には第7図に示す様に、宛先アドレ
スを先頭からDAI、DA2.・・・DAnの様に分割
して受信局自身のアドレスMAと比較していくが、分割
した単位量当りの処理量は、該単位量に含まれる情報に
より異なる。
First, the buffering of the difference in determination time, which is the first advantage, will be explained. The destination address DA is individual/as shown in Figure 6.
Address IOA indicating group and ring address LA
and a station address SA indicating the station number from which the frame should be received, and the station address SA includes information on an individual station address, a broadcast address, or a group address, as shown in FIG. The linking address LA includes the identification of a single ring or all rings. Further, when performing address determination, as shown in FIG. 7, the destination address is determined from the beginning DAI, DA2, . ... DAn is divided and compared with the receiving station's own address MA, but the amount of processing per divided unit amount differs depending on the information contained in the unit amount.

即ち前述のDAIには個別宛かあるいはグループ宛かを
示すIlo、及び受信したフレームがどのリング宛かを
示すリングナンバーが含まれる。
That is, the above-mentioned DAI includes Ilo indicating whether the received frame is addressed to an individual or a group, and a ring number indicating which ring the received frame is addressed to.

よってDAIのアドレス判定を行う際には第8図の判定
処理1に示す様にまず受信フレームが個別宛かグループ
宛かを判定し、次にリングナンバーの判定を行う。個別
宛であることを認識したら次にフレームの受信局が属す
るリング宛かどうかを判定する個別リングナンバー判定
を行う。個別リングナンバー判定を行った後、DAIに
含まれるリングナンバーが受信局の属するリングナンバ
ーと一致であっても不一致であっても受信したフレーム
が全リング宛か否か(a Q Q 1か、及びaΩΩ0
か)即ち放送フレームであるか否かの判定を行う。例え
ば、個別リングナンバー判定で受信局が属するリング宛
であると判定された場合には、該フレームが全リング宛
か否かを認識する必要がある。また、個別リングナンバ
ー判定で受信局が属するリング宛でないと判定された場
合でも。
Therefore, when determining the DAI address, first it is determined whether the received frame is addressed to an individual or a group, and then the ring number is determined, as shown in determination process 1 in FIG. If it is recognized that the frame is addressed to an individual frame, then an individual ring number determination is performed to determine whether the frame is addressed to a ring to which the receiving station belongs. After performing individual ring number determination, it is determined whether the received frame is addressed to all rings (a Q Q 1 or and aΩΩ0
) That is, it is determined whether or not it is a broadcast frame. For example, if it is determined by individual ring number determination that the frame is addressed to the ring to which the receiving station belongs, it is necessary to recognize whether the frame is addressed to all rings. Also, even if it is determined by individual ring number determination that the destination is not the ring to which the receiving station belongs.

全リング宛の場合には該フレームを受信しなければなら
ない。この様にDAIの判定では多種の判定条件がある
ため、判定時間が長くなり、判定単位量毎のフレームの
伝送時間、即ち第9図におけるT。−T1間で判定処理
ができなくなりT2まで延びるという事象が発生する。
If the frame is addressed to all rings, the frame must be received. As described above, since there are various judgment conditions in DAI judgment, the judgment time becomes long, and the frame transmission time for each judgment unit amount, that is, T in FIG. 9, increases. An event occurs in which the determination process becomes impossible between -T1 and extends to T2.

それに反しDA2の判定では、DAIで既に受信したフ
レームが個別リング宛かグループ宛かという判定が終了
しているため、第8図の判定処理2に示す様に個別リン
グナンバー判定、全局リング宛か否かのチェックを行う
だけでよいため、第9図の判定処理2の様にT。−T□
間で判定処理が可能になる。この様に後になるに従い、
第8図の判定処理3に示す様に判定量が次第に減少して
いき1判定時間がフレームの単位当りの伝送時間、即ち
T0〜T□間におさまるようになる。
On the other hand, in the judgment of DA2, since the judgment as to whether the frame received by DAI is addressed to an individual ring or a group has already been completed, as shown in judgment process 2 in FIG. Since it is only necessary to check whether or not the answer is T, as in determination process 2 in FIG. -T□
Judgment processing becomes possible between In this way, later on,
As shown in determination process 3 in FIG. 8, the determination amount gradually decreases until one determination time falls within the transmission time per frame unit, that is, between T0 and T□.

ここで、第1図に示す様に宛先アドレスの単位量当りの
記憶回路を2ケ設置し、交互にデータを格納すれば1つ
の記憶回路当りのデータの保持時間は第2図に示す様に
1つの記憶回路の場合に比べ2倍になる。よって判定処
理も2倍の時間枠で行うため、第9図の判定処理1の様
に単位量当りの処理時間枠を越える判定についても十分
に対応できる。ここで、T o ” T x 、T 1
〜T2.T2〜TfflT、〜T4.・・は単位量毎の
データが入ってくる時間である。
Here, if two memory circuits are installed per unit amount of destination address as shown in Figure 1, and data is stored alternately, the data retention time per memory circuit will be as shown in Figure 2. This is twice as much as in the case of one memory circuit. Therefore, since the determination process is also performed in twice the time frame, it is possible to sufficiently handle determinations that exceed the processing time frame per unit amount, as in determination process 1 in FIG. 9. Here, T o ” T x , T 1
~T2. T2~TfflT,~T4. ... is the time at which data for each unit amount comes in.

第2の利点について第10図及び第11図と比較して説
明する。前述の様に宛先アドレスの単位量毎の処理量の
多少による判定時間の差異を緩衝するためには、第10
図に示す様に宛先アドレスを全て格納できる記憶回路を
設ける方法が考えられるが、この方法では、宛先アドレ
スの容量の増大に伴い回路量も増大するため、回路の小
形化には不利である。これに対し、第1図に示す様に記
憶回路を2ケ設置し、交互に格納すれば、前述の様に判
定時間の差異を緩衝した上で、宛先アドレス全格納方式
に比べ約50%小形化できる。
The second advantage will be explained in comparison with FIGS. 10 and 11. As mentioned above, in order to buffer the difference in determination time due to the amount of processing per unit amount of destination addresses, the 10th
As shown in the figure, a method of providing a memory circuit that can store all destination addresses can be considered, but this method is disadvantageous in reducing the size of the circuit because the amount of circuitry increases as the capacity of the destination address increases. On the other hand, if two memory circuits are installed and stored alternately as shown in Figure 1, the size will be approximately 50% smaller than the method of storing all destination addresses, while buffering the difference in determination time as described above. can be converted into

なお、本発明の変形例として、受信データの宛先アドレ
スD Aと受信局アドレスMAをソフトウェアで判定す
る方法がある。
As a modification of the present invention, there is a method of determining the destination address DA and receiving station address MA of received data using software.

〔発明の効果〕〔Effect of the invention〕

本発明によれば、伝送路のフレームを受信し、該フレー
ムの宛先アドレスと受信局自身のアドレスの比較判定を
行う場合に、判定単位量当りの処理時間の差異を緩衝で
きる効果がある。
According to the present invention, when receiving a frame on a transmission path and comparing and determining the destination address of the frame and the receiving station's own address, it is possible to buffer the difference in processing time per unit amount of determination.

また本発明によれば、アドレス判定回路を従来の約1/
2に小形化できる効果がある。
Further, according to the present invention, the address determination circuit can be reduced to about 1/2 of the conventional one.
2. It has the effect of being able to be made smaller.

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

第1図は本発明の実施例図、第2図はその動作説明図、
第3図は本発明の対象側図、第4図、第5図、第6図は
データフォーマット図、第7図は判定処理側図、第8図
は判定処理の手順を示す図、第9図は判定処理と時間と
の関係を示す図、第10図、第11図は従来例図である
。 50.51.52・・・ループ状伝送路、50A。 50B、50C,51A、51B、52A。 52B、52C・・・端末、14・・・アドレス判定回
路。
FIG. 1 is an embodiment of the present invention, FIG. 2 is an explanatory diagram of its operation,
FIG. 3 is a diagram of the object side of the present invention, FIGS. 4, 5, and 6 are data format diagrams, FIG. 7 is a diagram of the determination processing side, FIG. 8 is a diagram showing the procedure of determination processing, and FIG. The figure shows the relationship between determination processing and time, and FIGS. 10 and 11 are diagrams of conventional examples. 50.51.52...Loop-shaped transmission line, 50A. 50B, 50C, 51A, 51B, 52A. 52B, 52C...terminal, 14...address determination circuit.

Claims (1)

【特許請求の範囲】[Claims] 1、複数のループ状伝送路と、各リング状伝送路間を結
合する端末と、各リング状伝送路単位に結合された複数
個の端末と、各端末に設けられフレーム単位にループ状
伝送路を介して送られてくる複数個のアドレスを判定す
るアドレス判定回路とより成り、該アドレス判定結果に
基づき所定の処理を各端末が行つてなる伝送装置におい
て、上記アドレス判定は回路は、フレーム内の各アドレ
スを交互に分配する第1、第2の記憶回路と、該分配し
た第1、第2の記憶回路内のアドレスと各端末毎に持つ
アドレスとを次々に比較する比較回路と、該比較結果に
従つて自己の所属する端末へのフレーム情報の取り込み
を制御し所定の処理を行わせるべく制御する手段と、よ
り成ることを特徴とする伝送装置のアドレス判定回路。
1. A plurality of loop-shaped transmission paths, a terminal that connects each ring-shaped transmission path, a plurality of terminals that are connected to each ring-shaped transmission path, and a loop-shaped transmission path provided in each terminal in units of frames. In a transmission device, the circuit comprises an address determination circuit that determines multiple addresses sent via a frame, and each terminal performs a predetermined process based on the address determination result. first and second memory circuits that alternately distribute the respective addresses of the first and second memory circuits; a comparison circuit that successively compares the distributed addresses in the first and second memory circuits with the addresses of each terminal; 1. An address determination circuit for a transmission device, comprising: means for controlling the incorporation of frame information into a terminal to which it belongs in accordance with a comparison result so as to perform predetermined processing.
JP60119734A 1985-06-04 1985-06-04 Address determination circuit for transmission device terminal Expired - Lifetime JPH0773274B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP60119734A JPH0773274B2 (en) 1985-06-04 1985-06-04 Address determination circuit for transmission device terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP60119734A JPH0773274B2 (en) 1985-06-04 1985-06-04 Address determination circuit for transmission device terminal

Publications (2)

Publication Number Publication Date
JPS61278238A true JPS61278238A (en) 1986-12-09
JPH0773274B2 JPH0773274B2 (en) 1995-08-02

Family

ID=14768802

Family Applications (1)

Application Number Title Priority Date Filing Date
JP60119734A Expired - Lifetime JPH0773274B2 (en) 1985-06-04 1985-06-04 Address determination circuit for transmission device terminal

Country Status (1)

Country Link
JP (1) JPH0773274B2 (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS57201934A (en) * 1981-06-05 1982-12-10 Oki Electric Ind Co Ltd Memory switching system of buffer circuit
JPS5962245A (en) * 1982-10-01 1984-04-09 Canon Inc Local area network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS57201934A (en) * 1981-06-05 1982-12-10 Oki Electric Ind Co Ltd Memory switching system of buffer circuit
JPS5962245A (en) * 1982-10-01 1984-04-09 Canon Inc Local area network

Also Published As

Publication number Publication date
JPH0773274B2 (en) 1995-08-02

Similar Documents

Publication Publication Date Title
US7315550B2 (en) Method and apparatus for shared buffer packet switching
US4332027A (en) Local area contention network data communication system
US4930122A (en) Message transfer system and method
US4901313A (en) A-point to multi-points communication system
JPH0691538B2 (en) Packet end signal generator
JPH10327190A (en) Network traffic priority determining method
JPH03234134A (en) Csma system communication system
US4612541A (en) Data transmission system having high-speed transmission procedures
US4550401A (en) Delivery information packet switching system
JPH05260060A (en) Communication equipment
JPS61278238A (en) Address deciding circuit for transmitter terminal equipment
JP3179123B2 (en) Digital data packet switching module
US6178177B1 (en) Data-processing network having non-deterministic access, but having deterministic access time
US4959843A (en) Content induced transaction overlap (CITO) block transmitter
US5504749A (en) Apparatus for reading out address information
KR0171005B1 (en) Node buffer control apparatus of high speed packet router
JPH0319742B2 (en)
JPS61264833A (en) Data transfer and control system
JPH04503597A (en) Packet/high speed packet switch for voice and data
JPH08179893A (en) Information processor
JPH11146019A (en) Data transfer device
JPS5974745A (en) Unified transmission control method of loop communication system
JPH05316131A (en) Loop atm communication node
JPH08249257A (en) Serial data receiver
JPH08223192A (en) Transmission equipment