JPH0773274B2 - Address determination circuit for transmission device terminal - Google Patents
Address determination circuit for transmission device terminalInfo
- Publication number
- JPH0773274B2 JPH0773274B2 JP60119734A JP11973485A JPH0773274B2 JP H0773274 B2 JPH0773274 B2 JP H0773274B2 JP 60119734 A JP60119734 A JP 60119734A JP 11973485 A JP11973485 A JP 11973485A JP H0773274 B2 JPH0773274 B2 JP H0773274B2
- Authority
- JP
- Japan
- Prior art keywords
- address
- frame
- station
- circuit
- 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.)
- Expired - Lifetime
Links
Landscapes
- Small-Scale Networks (AREA)
Description
【発明の詳細な説明】 〔発明の利用分野〕 本発明は、伝送路に複数の局を接続した伝送システムに
おけるアドレス判定回路に関する。TECHNICAL FIELD The present invention relates to an address determination circuit in a transmission system in which a plurality of stations are connected to a transmission line.
構内における複数の端末間、又は複数の構内にまたがる
端末間のデータ伝送システムが存在する。例えば、LAN
(ローカル・エリア・ネツトワーク)はその一つであ
る。例えば、「データ通信ハンドブツク」(電子通学会
編、昭和59年10月30日発行、121頁参照)がある。There is a data transmission system between a plurality of terminals in a premises or between terminals across a plurality of premises. For example, LAN
(Local Area Network) is one of them. For example, there is a "data communication handbook" (edited by The Electronic Society of Japan, issued October 30, 1984, page 121).
伝送システムの一例を第3図に示す。第3図は、3つの
ループ状伝送路50,51,52を持ち、ループ状伝送路50には
計算機50A及び端末50B,50Cを接続する。計算機50Aも広
い意味での端末と考えてよい。ループ状伝送路51には端
末51A,51Bを接続し、且つ端末50Cを介して他のループ状
伝送路と結合した。ループ状伝送路52には端末52A,52B,
52Cを接続し且つ端末50Bを介してループ状伝送路50を結
合した。An example of the transmission system is shown in FIG. FIG. 3 has three loop-shaped transmission lines 50, 51, 52, and a computer 50A and terminals 50B, 50C are connected to the loop-shaped transmission line 50. The computer 50A may also be considered a terminal in a broad sense. Terminals 51A and 51B were connected to the loop-shaped transmission line 51, and were connected to other loop-shaped transmission lines via the terminal 50C. Terminals 52A, 52B,
52C is connected and the loop-shaped transmission line 50 is connected via the terminal 50B.
ループ状伝送路50,51,52はリングと呼ばれる。The loop transmission lines 50, 51, 52 are called rings.
この伝送システムのデータ伝送はフレーム単位で行わ
れ、その1フレームのデータフオーマツトを第4図に示
す。1フレームの先頭と最後には同期コードの役割を果
すデリミタDELを置き、次いで、宛先アドレス部DA,送信
元アドレス部SA,送信情報I,チエツクコードFCSを設け
た。Data transmission of this transmission system is performed in frame units, and the data format of one frame is shown in FIG. A delimiter DEL that plays the role of a synchronization code is placed at the beginning and the end of one frame, and then a destination address part DA, a source address part SA, transmission information I, and a check code FCS are provided.
このフレーム構成で、アドレス部DA,SAはそれぞれ数バ
イト構成より成る。この数バイトを必要とする理由は、
各リングがアドレスを持つこと、リング内に各ステーシ
ヨン(端末)アドレスを必要とすること、更に、グルー
プによるリングの指定、グループによるステーシヨン指
定を行うこと、等のためである。In this frame structure, the address parts DA and SA are each composed of several bytes. The reason we need these few bytes is
This is because each ring has an address, each station (terminal) address is required in the ring, the ring is designated by the group, and the station is designated by the group.
宛先アドレス部DAの具体的な細部構成を第5図に示す。
DAは、下記より成る。FIG. 5 shows a specific detailed configuration of the destination address part DA.
DA consists of:
送信フレームが単一局宛か全局宛か(又は単一局宛
か複数の局を指定するグループ指定宛か)を指定する局
種別アドレスIGA。Station type address IGA that specifies whether the transmission frame is addressed to a single station or all stations (or addressed to a single station or a group specification that specifies multiple stations).
相手局の所属するリングを指定するリング・ナンバ
ー・アドレスLA。Ring number address LA that specifies the ring to which the other station belongs.
送信相手局のステーシヨン・アドレスSTA。 Station address STA of the sending station.
更に、第6図に示すように、LAは単一リングか全リング
か、STAは個別かグループか全局かの指定を行う。Further, as shown in FIG. 6, LA designates a single ring or all rings, and STA designates individual, group or all stations.
このように、アドレスは、多種であるため、各端局で
は、アドレスの判定をいかに効率的に行うかが課題とな
る。As described above, since there are various kinds of addresses, how to efficiently determine the address is a problem at each terminal station.
従来でのアドレス判定手順を第7図で説明する。宛先ア
ドレスDAを自局宛であるか否か判定するため、DAそのも
のを、更に細かく分解し、DA1,DA2,…,DAnの如くする。
この分割は例えば、アドレス表示のための基本単位量で
ある1バイトをもつて分割する。各1バイトが、リング
やステーシヨン等を指示し、且つグループか個別かとい
つた内容を指示することになる。A conventional address determination procedure will be described with reference to FIG. In order to determine whether or not the destination address DA is addressed to the own station, the DA itself is further decomposed into DA1, DA2, ..., DAn.
This division is performed, for example, with 1 byte which is a basic unit amount for address display. Each 1 byte indicates a ring, a station, etc., and also indicates whether the group or individual.
一方、各端末にあつては、アドレス比較のための基準ア
ドレスMAを持つ。この基準アドレスMAとは、端末の自己
アドレス等を指示したものであり、端末固有の値であ
る。このMAに対しても、DAの分割対応にMA1,MA2,…,MAn
と分割する。On the other hand, each terminal has a reference address MA for address comparison. The reference address MA indicates a self address of the terminal and the like, and is a value unique to the terminal. Also for this MA, DA1, MA2,…, MAn
And split.
この分割したDA1〜DAnとMA1〜MAnとの間で、DA1とMA1→
DA2とMA2→…の如く順次にアドレス比較を行う。この分
割による比較は、比較手順が長くなること、及び各分割
した細分アドレスDAiとMAiにあつては、iが異なると比
較処理の内容も単一でなく多様であること、の特徴を持
つ。Between this divided DA1 to DAn and MA1 to MAn, DA1 and MA1 →
Address comparison is performed sequentially as DA2 and MA2 →. The comparison by this division is characterized in that the comparison procedure becomes long, and for each divided subdivision address DAi and MAi, the content of the comparison process is not single but different if i is different.
かかるアドレス判定の一連の処理を第8図に示す。IGA1
ビット,LA7ビット,STA16ビットで構成されるアドレスを
1バイト(8ビット)毎に分割し各分割単位に3回判定
する。図では、3つの判定処理を示す。この図の見方
は、1つのDAに対して、3分割したこと、及び各分割単
位(DA1,DA2,DA3:MA1,MA2,MA3)にそれぞれ異なるアド
レス判定処理がとられることを意味する。判定処理1
(DA1とMA1のアドレス比較)では、個々かグループかの
判定、自リングか否かの判定、オール1(all1)か否
か、オール0(all0)か否かの判定を行う。処理2(DA
2とMA2のアドレス比較)では自リング宛か否か、all1か
否か、all0か否か、処理3(DA3とMA3のアドレス比較)
では自ステーシヨン宛か否か、自ステーシヨン宛かの処
理を行う。FIG. 8 shows a series of processes for such address determination. IGA1
The address composed of 7 bits, LA 7 bits, and STA 16 bits is divided into 1 byte (8 bits), and determination is performed 3 times for each division unit. In the figure, three determination processes are shown. The view of this figure means that one DA is divided into three, and different division determination processing is performed for each division unit (DA1, DA2, DA3: MA1, MA2, MA3). Judgment process 1
In (address comparison of DA1 and MA1), it is determined whether individual or group, whether it is the own ring, whether all 1 (all1) or all 0 (all0). Process 2 (DA
2) and MA2 address comparison), whether or not it is addressed to the own ring, all1 whether it is all0, processing 3 (DA3 and MA3 address comparison)
Then, processing for whether or not it is addressed to its own station and whether it is addressed to its own station is performed.
リング・ナンバー・アドレスLAの処理において、オール
1,オール0は全リング宛を示し、それ以外のときはLAの
値に一致するアドレスのリング宛となる。アドレスを例
えば1バイト(8ビツト)単位に分割して各8ビット毎
にアドレス比較を行う場合、最初の1ビットがIGAを示
し、次の7ビットがリングアドレスを示すことになる。
この7ビットがオール1またはオール0のときは全リン
グ宛を示し、例えば“0001010"のときはそのアドレスで
指定されたリング宛となる。ステーシヨン・アドレスST
Aの場合も同様であり、オール1(またはオール0)の
ときは全ステーシヨン宛となり、それ以外はSTAの値で
指定されたアドレスのステーシヨン宛となる。All in ring number address LA processing
1, all 0 indicates all rings, and in all other cases, the ring has an address matching the LA value. When the address is divided into units of, for example, 1 byte (8 bits) and the addresses are compared every 8 bits, the first 1 bit indicates the IGA and the next 7 bits indicate the ring address.
When the 7 bits are all 1's or all 0's, all rings are addressed. For example, "0001010" is addressed to the ring designated by the address. Station address ST
The same applies to the case of A. When all 1 (or all 0) is set, all stations are addressed, and in other cases, the station is addressed to the address designated by the value of STA.
即ち、判定処理1では受信フレームが個別宛かグループ
宛か、個別宛の場合には受信局自身のアドレスと一致す
るか否か、あるいは放送フレームであるか否か、またグ
ループ宛の場合には、受信局の属するグループアドレス
と一致しているか否かの判定を行う必要があるが、判定
処理2〜3では、判定処理1の結果に基づき、個別宛で
あれば受信局自身のアドレスとの比較及び放送フレーム
か否かのチエツク、またグループ宛であれば受信局の属
するグループ宛か否かを判定すれば良いため、判定処理
1と比較すると少ない処理で判定でき、判定に要する時
間が短くなる。第9図に判定処理に要する時間を示す。
T0T1間は前述単位量毎のフレーム伝送に要する時間であ
る。即ち、フレームの受信局にはT0T1の間隔で単位量毎
のデータが入つてくることになり、T0T1の時間内に判定
処理を終了する必要があるが、判定処理1の様に、単位
量当りの処理量が多くなるとT0T1の時間内に判定できず
に時間枠を超える場合(T0T2)がある。よつて、アドレ
ス判定回路を構成する場合には以上の様な判定量の多少
による判定時間の差異を緩衝しかつ小形化する必要があ
る。That is, in the judgment processing 1, whether the received frame is addressed individually or to the group, if it is addressed individually, whether it matches the address of the receiving station itself, or whether it is a broadcast frame, and if it is addressed to the group, , It is necessary to judge whether or not it matches with the group address to which the receiving station belongs, but in the judgment processing 2-3, based on the result of the judgment processing 1, if it is an individual address, the address of the receiving station itself It is sufficient to compare and check whether the frame is a broadcast frame or not, and if it is a group, determine whether it is a group to which the receiving station belongs. Become. FIG. 9 shows the time required for the determination process.
The period between T 0 and T 1 is the time required for frame transmission for each unit amount described above. That is, the receiving station of the frame results in the data of the unit quantity for each at an interval of T 0 T 1 comes entering a port, it is necessary to terminate the determination process in the T 0 T 1 of time, the determination process 1 Similarly, if the amount of processing per unit amount increases, it may not be possible to make a judgment within the time T 0 T 1 and the time frame may be exceeded (T 0 T 2 ). Therefore, when configuring the address determination circuit, it is necessary to buffer and reduce the difference in determination time depending on the amount of determination as described above.
従来の方法1としては、第10図に示す様に受信したフレ
ームの宛先アドレスを単位量毎に全て格納できる記憶回
路を設ける方法がある。この方法であれば、宛先アドレ
ス全体を次フレームを受信するまで保持できるため、判
定量の多少による判定時間の差異は緩衝できるが、宛先
アドレスDAの総量の増大に伴い回路量が増大する欠点が
ある。As a conventional method 1, there is a method of providing a storage circuit capable of storing all the destination addresses of the received frame for each unit quantity as shown in FIG. With this method, the entire destination address can be held until the next frame is received, so the difference in the determination time due to the amount of determination can be buffered, but the drawback is that the circuit amount increases as the total amount of destination addresses DA increases. is there.
また従来の方法2としては、第11図に示す様に受信した
フレームの宛先アドレスを単位量毎に1つの記憶回路に
次々に格納していく方法がある。この方法であれば、ア
ドレス判定回路を小形化できるが、判定処理を一定時間
内に行う必要があるため、前述の様に、単位量当りの処
理量が多くなると宛先アドレスの単位量当りの保持時間
内に判定できなくなる欠点がある。Further, as the conventional method 2, there is a method of successively storing the destination address of the received frame in one storage circuit for each unit amount as shown in FIG. With this method, the address judgment circuit can be made smaller, but since the judgment process must be performed within a fixed time, as described above, if the processing amount per unit amount increases, the destination address is held per unit amount. There is a drawback that it cannot be judged in time.
本発明の目的は、上述の如き伝送フレームを受信した局
で、該フレームの宛先アドレスと自局のアドレスを比較
し、該フレームが自局宛であるか否かを判定する際に、
判定量の多少に関係なく、小形でかつ高速に処理できる
アドレス判定回路を提供することにある。An object of the present invention is to compare the destination address of the frame with the address of the own station at the station that has received the transmission frame as described above, and when determining whether the frame is addressed to the own station,
An object of the present invention is to provide an address determination circuit which is small and can be processed at high speed regardless of the amount of determination.
本発明は、フレームを受信した局が、該フレームが自局
宛であるか否かを判定する場合に、受信したフレームの
宛先アドレスを単位量毎に記憶する回路を複数個設け、
順次、格納することで、記憶回路毎のデータの保持時間
を延ばし、単位量毎に異なる判定時間を緩衝する。ま
た、記憶回路の個数を最小限に押えることで回路の小形
化を図る。The present invention provides a plurality of circuits that store a destination address of a received frame for each unit amount when a station that receives the frame determines whether the frame is addressed to itself.
By sequentially storing the data, the retention time of the data for each storage circuit is extended, and the determination time different for each unit amount is buffered. In addition, the number of memory circuits can be minimized to reduce the size of the circuits.
第1図は本発明の局受信装置の実施例を示す。この局受
信装置は、各局対応に個別に設けられる。局受信装置
は、直並列変換回路11,シフトレジスタ3,アドレス変換
回路14より成る。FIG. 1 shows an embodiment of the station receiver of the present invention. This station receiver is provided individually for each station. The station receiver comprises a serial / parallel conversion circuit 11, a shift register 3, and an address conversion circuit 14.
アドレス変換回路14は、変換検出回路15,選択回路16,イ
ンバータ17B,アンドゲート17A,17C,フラグレジスタ22,2
3,記憶回路18,19,比較回路20,受信局アドレス設定器
(レジスタ)21より成る。The address conversion circuit 14 includes a conversion detection circuit 15, a selection circuit 16, an inverter 17B, AND gates 17A and 17C, and flag registers 22 and 2.
3, Comprising storage circuits 18 and 19, comparison circuit 20, and receiving station address setter (register) 21.
フレームを受信した局では、シリアルデータ10である伝
送路のフレームを単位量毎にパラレルデータに変換する
直並列変換を行う。直並列変換回路11によりパラレルデ
ータ12に変換したデータはシフトレジスタ3,受信バツフ
アへと順次、転送するが、受信バツフアへ転送するか否
か、即ち、受信フレームが自局宛であるか否かを判定
し、受信バツフアへの転送許可信号23を出力するのはア
ドレス判定回路14である。パラレルデータ12に変換した
データのうち、宛先アドレスDAはシフトレジスタ3への
転送と同様に、アドレス判定回路14へも転送する。アド
レス判定回路14へ転送した宛先アドレスDA14は直並列変
換回路11によつて変換した単位量毎に、記憶回路18,記
憶回路19へ順次,交互に格納する。格納すべき記憶回路
の選択は、記憶回路選択信号17を生成、出力する選択回
路16である。即ち、選択回路16より出力する記憶回路選
択信号17の論理値を1あるいは0と変化させることによ
り、直並列変換回路11よりパラレルデータ12としてアド
レス判定回路14へ転送した、単位量当りの宛先アドレス
DA14を記憶回路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に対し、記
憶回路選択信号17の論理値を1から0へ変更するように
指令する。また、フラグクリア信号30を用いてフラグ22
をクリアし、記憶回路18に格納されたデータを読み込
み、受信局アドレス21のデータとの比較を行う。前述の
様に記憶回路選択信号17の論理値を1から0へ変更する
ことにより、前述の如く分割された次の宛先アドレスDA
は記憶回路19に格納される。この様に2ケの記憶回路に
交互に宛先アドレスDAを単位量毎に交互に記憶し、自局
アドレスとの比較を行う。比較の結果、受信したフレー
ムが自局宛であれば比較回路20より受信バツフアへの転
送許可信号23を出力する。ここでシフトレジスタ3を設
置したのは、受信したフレームが自局宛であるか否かを
判定し、受信バツフアへの転送許可信号23を出力するま
での時間をかせぎ、自局宛フレームだけを受信バツフア
へ転送するためである。The station receiving the frame performs serial-parallel conversion for converting the frame of the transmission line, which is the serial data 10, into parallel data for each unit amount. The data converted into the parallel data 12 by the serial-parallel conversion circuit 11 is sequentially transferred to the shift register 3 and the reception buffer.Whether the data is transferred to the reception buffer, that is, whether the reception frame is addressed to itself. It is the address determination circuit 14 that outputs the transfer permission signal 23 to the reception buffer. Of the data converted into the parallel data 12, the destination address DA is transferred to the address determination circuit 14 as well as the transfer to the shift register 3. The destination address DA14 transferred to the address determination circuit 14 is sequentially and alternately stored in the storage circuits 18 and 19 for each unit amount converted by the serial-parallel conversion circuit 11. The storage circuit to be stored is selected by the selection circuit 16 that generates and outputs the storage circuit selection signal 17. That is, by changing the logical value of the memory circuit selection signal 17 output from the selection circuit 16 to 1 or 0, the destination address per unit quantity transferred to the address determination circuit 14 as parallel data 12 from the serial-parallel conversion circuit 11
The DA 14 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 the memory circuit.
Selection circuit control signal 29 output from the comparison circuit 20 that compares the destination address DA for each unit amount stored in 18 or 19 with the receiving station address 21 that stores the address of the receiving station itself
Is. For example, if the storage circuit 18 is selected when the storage circuit selection signal 17 has a logical value of 1 and the storage circuit 19 is selected when the storage circuit selection signal 17 has a logical value of 0, the storage circuit selection signal 17 is divided into unit capacitors when the storage circuit selection signal 17 has a logical value of 1. The destination address DA14 is stored in the memory circuit 18, and at the same time, the flag register 22 indicating that the data is stored in the memory circuit 18 is set, and the flag set signal 24 indicating the set of the flag register 22 is output to the comparison circuit 20. . Comparing circuit 20 which detects the set of 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 17 from 1 to 0. Moreover, the flag 22 is set by using the flag clear signal 30.
Is cleared, the data stored in the memory circuit 18 is read, and the data at the receiving station address 21 is compared. By changing the logical value of the memory circuit selection signal 17 from 1 to 0 as described above, the next destination address DA divided as described above is generated.
Are stored in the memory circuit 19. In this way, the destination address DA is alternately stored in the two storage circuits for each unit amount and compared with the own station address. As a result of the comparison, if the received frame is addressed to the own station, the comparison circuit 20 outputs the transfer permission signal 23 to the reception buffer. Here, the shift register 3 is installed because it determines whether or not the received frame is addressed to the own station and outputs the transfer permission signal 23 to the reception buffer, and it saves only the frame addressed to the own station. This is to transfer to the reception buffer.
以上の様なアドレス判定回路を構成することで2つの利
点が生まれる。第1の利点は記憶回路を2ケ設置するこ
とで各記憶回路のデータの保持時間を2倍にできるため
に、宛先アドレスの単位量当りの処理量の多少による判
定時間の差異を緩衝し、かつ判定を低速にできること、
第2の利点は宛先アドレスの単位量当りのデータの記憶
回路を最少限に押えたことによる回路の小形化である。Two advantages are created by configuring the address determination circuit as described above. The first advantage is that the data retention time of each memory circuit can be doubled by installing two memory circuits, so that the difference in determination time due to the amount of processing per unit amount of destination address is buffered, And the judgment can be slow,
The second advantage is the miniaturization of the circuit by minimizing the storage circuit of the data per unit amount of the destination address.
まず、第1の利点である判定時間の差異の緩衝について
説明する。宛先アドレスDAは第5図に示す様に個別/グ
ループを示すアドレスIGA及びリングアドレスLA及びフ
レームを受信すべき局番を示すステーシヨンアドレスST
Aより構成され、ステーシヨンアドレスSTAは第6図に示
す様に、個別局宛アドレス、放送アドレスあるいはグル
ープアドレスの情報を含む。リングアドレスLAは単一リ
ングか全リングかの識別を含む。またアドレス判定を行
う場合には第7図に示す様に、宛先アドレスを先頭から
DA1,DA2,…DAnの様に分割して受信局自身のアドレスMA
と比較していくが、分割した単位量当りの処理量は、該
単位量に含まれる情報により異なる。First, the buffering of the difference in determination time, which is the first advantage, will be described. The destination address DA is, as shown in FIG. 5, an address IGA indicating individual / group, a ring address LA, and a station address ST indicating the station number to receive the frame.
As shown in FIG. 6, the station address STA is composed of A, and includes information such as an address addressed to an individual station, a broadcast address or a group address. The ring address LA contains the identification of a single ring or all rings. Also, when performing address determination, as shown in FIG.
Address MA of the receiving station itself divided into DA1, DA2, ... DAn
However, the processing amount per divided unit amount differs depending on the information contained in the unit amount.
即ち前述のDA1には個別宛かあるいはグループ宛かを示
すI/G,及び受信したフレームがどのリング宛かを示すリ
ングナンバーが含まれる。よつてDA1のアドレス判定を
行う際には第8図の判定処理1に示す様にまず受信フレ
ームが個別宛かグループ宛かを判定し、次にリングナン
バーの判定を行う。個別宛であることを認識したら次に
フレームの受信局が属するリング宛かどうかを判定する
個別リングナンバー判定を行う。個別リングナンバー判
定を行つた後、DA1に含まれるリングナンバーが受信局
の属するリングナンバーと一致であつても不一致であつ
ても受信したフレームが全リング宛か否か(all1または
all0か否か)即ち放送フレームであるか否かの判定を行
う。例えば、個別リングナンバー判定で受信局が属する
リング宛であると判定された場合には、該フレームが全
リング宛か否かを認識する必要がある。また、個別リン
グナンバー判定で受信局が属するリング宛でないと判定
された場合でも、全リング宛の場合には該フレームを受
信しなければならない。この様にDA1の判定では多種の
判定条件があるため、判定時間が長くなり、判定単位量
毎のフレームの伝送時間、即ち第9図におけるT0〜T1間
で判定処理ができなくなりT2まで延びるという事象が発
生する。それに反しDA2の判定では、DA1で既に受信した
フレームが個別リング宛かグループ宛かという判定が終
了しているため、第8図の判定処理2に示す様に個別リ
ングナンバー判定、全局リング宛か否かのチエツクを行
うだけでよいため、第9図の判定処理2の様にT0〜T1間
で判定処理が可能になる。この様に後になるに従い、第
8図の判定処理3に示す様に判定量が次第に減少してい
き、判定時間がフレームの単位当りの伝送時間、即ちT0
〜T1間におさまるようになる。That is, the above-mentioned DA1 includes an I / G indicating whether it is addressed individually or a group, and a ring number indicating which ring the received frame is addressed to. Therefore, when the address of DA1 is determined, it is first determined whether the received frame is addressed individually or to a group as shown in the determination processing 1 in FIG. 8, and then the ring number is determined. If it is recognized that the frame is addressed to the individual, then the individual ring number is judged to determine whether it is addressed to the ring to which the frame receiving station belongs. After performing the individual ring number determination, whether the received frame is addressed to all rings regardless of whether the ring number included in DA1 matches or does not match the ring number to which the receiving station belongs (all1 or
It is determined whether it is a broadcast frame or not). For example, when it is determined in the individual ring number determination that the frame is addressed to the ring to which the receiving station belongs, it is necessary to recognize whether or not the frame is addressed to all the rings. Even if it is determined by the individual ring number determination that the receiving station is not addressed to the ring to which the receiving station belongs, the frame must be received when the addresses are addressed to all the rings. Since the determination of such a DA1 there are a wide determination conditions, the determination time increases, the transmission time of a frame for each quantity determination unit, i.e. the determination process can be no longer between T 0 through T 1 in FIG. 9 T 2 The phenomenon that it extends to occurs. On the other hand, in the determination of DA2, since it has already been determined whether the frame already received by DA1 is addressed to the individual ring or the group, as shown in the determination processing 2 in FIG. Since it is only necessary to check whether or not the judgment is made, the judgment processing can be performed between T 0 and T 1 like the judgment processing 2 in FIG. As described later, the determination amount gradually decreases as shown in the determination process 3 in FIG. 8, and the determination time is the transmission time per unit of frame, that is, T 0.
It will settle between ~ T 1 .
ここで、第1図に示す様に宛先アドレスの単位量当りの
記憶回路を2ケ設置し、交互にデータを格納すれば1つ
の記憶回路当りのデータの保持時間は第2図に示す様に
1つの記憶回路の場合に比べ2倍になる。よつて判定処
理も2倍の時間枠で行うため、第9図の判定処理1の様
に単位量当りの処理時間枠を越える判定についても十分
に対応できる。ここで、T0〜T1,T1〜T2,T2〜T3,T3〜T4,
…は単位量毎のデータが入つてくる時間である。Here, as shown in FIG. 1, if two storage circuits per unit quantity of the destination address are installed and data is stored alternately, the data holding time per storage circuit is as shown in FIG. It is twice as large as that of one memory circuit. Therefore, since the determination process is also performed in the double time frame, it is possible to sufficiently deal with the determination exceeding the processing time frame per unit amount like the determination process 1 in FIG. Where T 0 to T 1 , T 1 to T 2 , T 2 to T 3 , T 3 to T 4 ,
... is the time when data for each unit amount comes in.
第2の利点について第10図及び第11図と比較して説明す
る。前述の様に宛先アドレスの単位量毎の処理量の多少
による判定時間の差異を緩衝するためには、第10図に示
す様に宛先アドレスを全て格納できる記憶回路を設ける
方法が考えられるが、この方法では、宛先アドレスの容
量の増大に伴い回路量も増大するため、回路の小形化に
は不利である。これに対し、第1図に示す様に記憶回路
を2ケ設置し、交互に格納すれば、前述の様に判定時間
の差異を緩衝した上で、宛先アドレス全格納方式に比べ
約50%小形化できる。The second advantage will be described in comparison with FIGS. 10 and 11. As described above, in order to buffer the difference in the determination time due to the processing amount per destination address unit amount, it is conceivable to provide a memory circuit capable of storing all destination addresses as shown in FIG. This method is disadvantageous in miniaturizing the circuit because the amount of the circuit increases as the capacity of the destination address increases. On the other hand, if two memory circuits are installed as shown in Fig. 1 and stored alternately, the difference in judgment time is buffered as described above, and it is about 50% smaller than the destination address full storage method. Can be converted.
なお、本発明の変形例として、受信データの宛先アドレ
スDAと受信局アドレスMAをソフトウエアで判定する方法
がある。As a modification of the present invention, there is a method of determining the destination address DA and the receiving station address MA of the received data by software.
本発明によれば、伝送路のフレームを受信し、該フレー
ムの宛先アドレスと受信局自身のアドレスの比較判定を
行う場合に、判定単位量当りの処理時間の差異を緩衝で
きる効果がある。According to the present invention, when receiving a frame on a transmission line and making a comparison judgment of the destination address of the frame and the address of the receiving station itself, there is an effect that the difference in processing time per judgment unit amount can be buffered.
また本発明によれば、アドレス判定回路を従来の約1/2
に小形化できる効果がある。Further, according to the present invention, the address judgment circuit is reduced to about half
There is an effect that can be miniaturized.
第1図は本発明の実施例図、第2図はその動作説明図、
第3図は本発明の対象例図、第4図,第5図,第6図は
データフオーマツト図、第7図は判定処理例図、第8図
は判定処理の手順を示す図、第9図は判定処理と時間と
の関係を示す図、第10図,第11図は従来例図である。 50,51,52……ループ状伝送路、50A,50B,50C,51A,51B,52
A,52B,52C……端末、14……アドレス判定回路。FIG. 1 is an embodiment diagram of the present invention, FIG. 2 is an operation explanatory diagram thereof,
FIG. 3 is an example of an object of the present invention, FIGS. 4, 5, and 6 are data format diagrams, FIG. 7 is an example of determination processing, and FIG. 8 is a diagram showing a procedure of determination processing. FIG. 9 is a diagram showing the relationship between the determination process and time, and FIGS. 10 and 11 are conventional examples. 50,51,52 …… Loop transmission line, 50A, 50B, 50C, 51A, 51B, 52
A, 52B, 52C ... Terminal, 14 ... Address judgment circuit.
───────────────────────────────────────────────────── フロントページの続き (72)発明者 稲田 俊司 茨城県日立市久慈町4026番地 株式会社日 立製作所日立研究所内 (56)参考文献 特開 昭59−105738(JP,A) 特開 昭57−201934(JP,A) ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Shunji Inada 4026 Kuji Town, Hitachi City, Ibaraki Prefecture Hitachi Research Laboratory, Hitachi, Ltd. (56) References JP-A-59-105738 (JP, A) JP-A-57 -201934 (JP, A)
Claims (1)
るネットワークの伝送装置端末間でのデータ伝送で各端
末が受信フレームの宛先アドレスの判定を行うアドレス
判定回路であって、受信フレームが少なくともリングア
ドレスと端末アドレスを有する宛先アドレスに送信情報
が付加されて構成され、前記宛先アドレスを複数に分割
し各分割部分毎に順にアドレス比較を行なうことで宛先
アドレスが自局を指定しているか否かを判定する伝送装
置端末のアドレス判定回路において、受信フレームを分
割単位量毎にパラレルデータに変換する直並列変換手段
と、2つの記憶手段と、パラレルデータに変換された受
信フレームのうち宛先アドレスを分割単位量毎に交互に
前記2つの記憶手段に振り分け格納する手段と、各記憶
手段の内容を対応する受信局分割アドレスと順に比較判
定する比較判定手段と、前記パラレルデータに変換され
た受信フレームを取り込み時間遅延を与えて出力する遅
延手段と、前記比較判定手段が1受信フレームの宛先ア
ドレス全てを判定して自局宛と判断した時のみ前記遅延
手段から出力される受信フレームを取り込む受信バッフ
ァとを備えることを特徴とする伝送装置端末のアドレス
判定回路。1. An address judgment circuit, wherein each terminal judges a destination address of a received frame in data transmission between terminals of a transmission device of a network configured by connecting a plurality of ring-shaped transmission lines, the received frame Is configured by adding transmission information to a destination address having at least a ring address and a terminal address, and the destination address specifies its own station by dividing the destination address into a plurality of addresses and sequentially performing address comparison for each divided portion. In the address determination circuit of the transmission device terminal that determines whether or not there is a serial-parallel conversion unit that converts a received frame into parallel data for each division unit amount, two storage units, and a received frame that is converted into parallel data. Correspondence between the means for storing the destination address alternately in each of the divided unit amounts in the two storage means and the content of each storage means Comparison determination means for sequentially comparing the received station division address with each other, delay means for outputting the reception frame converted into the parallel data with a time delay, and the comparison determination means for all destination addresses of one reception frame. An address determination circuit of a transmission device terminal, comprising: a reception buffer that takes in a reception frame output from the delay means only when it is determined that it is addressed to its own station.
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 JPS61278238A (en) | 1986-12-09 |
| JPH0773274B2 true 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) |
Family Cites Families (2)
| 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 |
-
1985
- 1985-06-04 JP JP60119734A patent/JPH0773274B2/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| JPS61278238A (en) | 1986-12-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7315550B2 (en) | Method and apparatus for shared buffer packet switching | |
| EP0029800B1 (en) | Digital information transfer system (dits) receiver and method | |
| US5537623A (en) | Multiple group address recognition | |
| US4647925A (en) | Circuit employing intercoupled state machines for transmitting and receiving multiformatted sequences of voice and data characters | |
| US4586162A (en) | Bit pattern check circuit | |
| JPH0773274B2 (en) | Address determination circuit for transmission device terminal | |
| CA1270960A (en) | Non coded information and companion data switching mechanism | |
| US6301264B1 (en) | Asynchronous data conversion circuit | |
| US7292607B2 (en) | Method and circuit for processing data in communication networks | |
| EP1095490B1 (en) | Bit stuffing for synchronous hdlc | |
| JPH01103341A (en) | Address detecting circuit | |
| US5428650A (en) | Method and device for selecting information usable by a local unit connected to a digital transmission system | |
| US6282203B1 (en) | Packet data transmitting apparatus, and method therefor | |
| JPH0738605A (en) | Digital data packet switching module | |
| JPH0642690B2 (en) | Packet signal transmission method | |
| US20030198233A1 (en) | Cross-connect switch and route monitoring assist apparatus | |
| US5426735A (en) | Data communication device capable of adding data identification code to each data byte | |
| JPH088544B2 (en) | Frame sync signal detection circuit | |
| JP3428238B2 (en) | Data processing device | |
| KR100228475B1 (en) | Frame data receiver | |
| JPS6083451A (en) | Synchronous data buffering system | |
| JPH0554316B2 (en) | ||
| JP3164996B2 (en) | Serial data receiving device | |
| JPH04290342A (en) | Information transfer system | |
| JP2003506813A (en) | Method and apparatus for writing to and reading from a buffer memory |