JPS62117437A - Initialization control system for loop transmission system - Google Patents

Initialization control system for loop transmission system

Info

Publication number
JPS62117437A
JPS62117437A JP60257411A JP25741185A JPS62117437A JP S62117437 A JPS62117437 A JP S62117437A JP 60257411 A JP60257411 A JP 60257411A JP 25741185 A JP25741185 A JP 25741185A JP S62117437 A JPS62117437 A JP S62117437A
Authority
JP
Japan
Prior art keywords
station
stations
transmission
data transmission
data
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.)
Pending
Application number
JP60257411A
Other languages
Japanese (ja)
Inventor
Toshimi Kiyohara
清原 敏視
Yasuo Nakamura
康夫 中村
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.)
Sharp Corp
Original Assignee
Sharp Corp
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 Sharp Corp filed Critical Sharp Corp
Priority to JP60257411A priority Critical patent/JPS62117437A/en
Publication of JPS62117437A publication Critical patent/JPS62117437A/en
Pending legal-status Critical Current

Links

Landscapes

  • Small-Scale Networks (AREA)

Abstract

PURPOSE:To eliminate the necessity of a monitoring station, by initializing a looped transmission system by fixing a logic ring table composed of the addresses of a preceding station, its own station, and succeeding station in accordance with a forward or reverse packet received by a data transmission station. CONSTITUTION:Physical synchronism is taken at the moment when all of A-E stations become operable and synchronous initialization is completed. When a timer started from the synchronous initialization exceeds a set time determined by (office number X basic initialization time), the A-station firstly sends a forward initial packet FIP. At this time, each station knows its own address only and, by the arrival of the FIP, that the preceding station is A-station. The station sending the FIP further sends a free token and gives the next station in the downstream the transmission right. The station which has received the free token fixes the preceding station of a logic rink table LRT and a forward number. The same procedure is performed on the B-E stations and the preceding stations and forward numbers are determined.

Description

【発明の詳細な説明】 〈産業−にの利用分野〉 本発明し[、データの送受を行なう複数のデータ伝送ス
テーションが伝送路により環状に接続され、伝送路上を
周回する1・−クンを受信したデータ伝送ステーション
がデータの送信権を取得する]・−クンパッシング方式
を用いたループ伝送システムを初期化するイニシャライ
ズ制御方式に関する。
[Detailed Description of the Invention] <Industrial Field of Application> The present invention provides a system in which a plurality of data transmission stations for transmitting and receiving data are connected in a ring through a transmission path, and receive 1-kun circulating on the transmission path. The data transmission station acquired the right to transmit data]--Relates to an initialization control method for initializing a loop transmission system using a Kunpassing method.

〈従来の技術〉 ループ伝送システムに用いられるアクセス方式のひとつ
であるトークンパッシング方式は、たとえば第7図に示
すように、データ伝送ステーションA局、B局、−、E
局を環状に接続した伝送路をトークンが周回し、送信要
求のあるデータ伝送ステーションがトークンを受信する
とデータの送信権を取得する。このとき、送信要求のあ
るデータ伝送ステーションは、補槽したフリート−クン
をビジートークンに変換して送信権を得る。
<Prior Art> The token passing method, which is one of the access methods used in the loop transmission system, is based on data transmission stations A, B, -, and E, as shown in FIG.
A token circulates around a transmission path connecting stations in a ring, and when a data transmission station requesting transmission receives the token, it acquires the right to transmit data. At this time, the data transmission station with the transmission request converts the reserved fleet tokens into busy tokens and obtains the transmission right.

〈発明が解決しようとする問題点〉 従来のトークンパッシング方式におけるネットワークの
監視及び管理は、ネットワーク上の高機能処理を行なう
固定の監視局が集中して実行する。
<Problems to be Solved by the Invention> Network monitoring and management in the conventional token passing system is centrally performed by a fixed monitoring station that performs high-performance processing on the network.

この場合、 1)監視局が故障すると、ネットワークの全体がダウン
する。すなわち、危険集中システムになる。
In this case: 1) If the monitoring station fails, the entire network will go down. In other words, it becomes a danger concentration system.

ii)監視局が他の局と同様にデータ伝送の機能を有す
る場合には、ネットワーク障害の検知が他の処理のため
に遅れる可能性がある。
ii) If the monitoring station has a data transmission function like other stations, detection of a network failure may be delayed due to other processing.

という欠点がある。There is a drawback.

このため、ネットワークの初期化において各データ伝送
ステージ9ンが先行局、自局、後続局のアドレスを記憶
し、障害発生時にこれらの情報に基づいて対策を早く進
めるとともに、ネットワークの監視機能の分散化を図る
ようにした手法が提案されている。
Therefore, during network initialization, each data transmission stage 9 memorizes the addresses of the preceding station, its own station, and the succeeding station, and when a failure occurs, countermeasures can be quickly taken based on this information, and the network monitoring function can be distributed. A method has been proposed that aims to achieve this.

従来、このネットワークのイニシャライズ方式として、
分散制御の思想に基づいて論理リングを構築する方法が
考えられている。すなわち、パストポロジーにおける論
理リングの構築方式について、応答ウィンド等の手法が
すでに標準化されている(TREE 802.4)。し
かしながら、この手法では、まずクレームトークンを発
生してフリート−クン発生局の決定を行ない、次にアド
レスの比較による応答ウィンドを用いた競合プロセスを
通して論理リングを構成するため、処理が複雑化し■つ
長時間を要するという欠+Mがある。
Traditionally, the initialization method for this network was
A method of constructing a logical ring based on the idea of distributed control has been considered. That is, regarding the construction method of logical rings in path topology, methods such as response windows have already been standardized (TREE 802.4). However, in this method, a claim token is first generated to determine the fleet originating station, and then a logical ring is constructed through a contention process using a response window based on address comparison, which makes the process complicated. There is a drawback that it takes a long time.

〈問題点を解決する為の・1段〉 本発明のループ伝送システムにおけるイニシャライズ制
御方式は、データの送受を行なう複数のデータ伝送ステ
ーションを環状に接続しζなる伝送路上を周回する]・
−クンを受信したデータ伝送ステーションがデータの送
信権を取得するトークンパッシング方式を用いたループ
伝iXシステムにおいて、ト記データ伝送ステーション
が先行局。
[First step to solve the problem] The initialization control method in the loop transmission system of the present invention connects a plurality of data transmission stations that send and receive data in a ring and circulates on a transmission path ζ]
- In the loop transmission iX system using the token passing method in which the data transmission station that receives the message acquires the right to transmit data, the data transmission station mentioned above is the leading station.

自局、接続局のアドレスデータをもつ順方向パケットと
逆方向パケットを送信し、この順方向パケットと逆方向
パケットを受信Z7たデータ伝送ステーションが1−記
順方向バケソ]・と逆方向パケ・ノ1−に応じて先行局
、自局、後続局のアドレスからなる論理リングテーブル
を固定化することを特徴とする。
The data transmission station Z7 transmits forward packets and reverse packets containing address data of its own station and the connected station, and receives these forward packets and reverse packets. The present invention is characterized in that a logical ring table consisting of the addresses of the preceding station, the own station, and the succeeding station is fixed in accordance with No. 1-.

〈実施例〉 第1図は本発明を通用したループ伝送システムの基本構
成を示し、データの送受を行なう5つのデータ伝送ステ
ーションA局、B局、0局、D局。
Embodiment FIG. 1 shows the basic configuration of a loop transmission system according to the present invention, and includes five data transmission stations A, B, 0, and D that transmit and receive data.

fE局が伝送路RINGにより環状に接続され、隣接す
るデータ伝送ステーションを介してデータの伝送が行な
われる。このループ伝送システムでは、1−−クンパッ
シング方式をアクセスプロトコルとし、初期化での論理
リングの構築が必要条件となる。l・−クンは伝送路R
ING上を周回しており、送信要求のあるデータ伝送ス
テーションがトークンを受信すると送信権を得る。5つ
のデータ伝送ステーションA局、B局、−、E局には予
め局番号が設定され、A局はl、B局は2、−、  E
局は5である。
The fE stations are connected in a ring by a transmission path RING, and data is transmitted via adjacent data transmission stations. In this loop transmission system, the 1--Kun passing method is used as the access protocol, and the construction of a logical ring at initialization is a necessary condition. l・-kun is the transmission path R
The station orbits on the ING, and when a data transmission station requesting transmission receives a token, it obtains the right to transmit. Station numbers are set in advance for the five data transmission stations A, B, -, and E, with station A being 1 and B being 2, -, and E.
The station is 5.

第2図fatは初期化において送信する順方向イニシャ
ルパケットのフレーム構成を示し、同図山)は同じく逆
方向イニシャルパケットのフレーム構成を示し、同図(
C1はフリート−クンパケットのフレーム構成を示す。
Figure 2 fat shows the frame structure of the forward direction initial packet transmitted during initialization, the figure 2) also shows the frame structure of the reverse direction initial packet, and figure 2 (fat) shows the frame structure of the reverse direction initial packet.
C1 indicates the frame structure of a free token packet.

順方向イニシャルパケット及び逆方向イニシャルパケッ
トにおけるp、s、は先行局のアドレス、T、S、は自
局のアドレス、N。
In the forward direction initial packet and reverse direction initial packet, p and s are the address of the preceding station, T and S are the address of the own station, and N.

S、は接続局のアドレスである。また、DBS。S is the address of the connected station. Also, DBS.

ADD、は送信先アドレス、SOU、ADD、は発信元
アドレス、CRCは循環冗長検査である。
ADD is a destination address, SOU, ADD is a source address, and CRC is a cyclic redundancy check.

第3図は各データ伝送ステーションが保持する論理リン
グテーブルの構成を示し、順方向番号。
FIG. 3 shows the structure of a logical ring table held by each data transmission station, and shows forward direction numbers.

先行局アドレス、自局アドレス、1&続局アドレスから
なる。この論理リングテーブルは、ネットワーク障害に
対応するため、論理リングの構築に利用される。すなわ
ち、各データ伝送ステーションが、先行局、自局、後続
局の情報を記iaシ、この前後関係から論理的なリング
を構成する。この場合、一般的なリングトポロジーをと
らなくても、また、物理的な信号が流れるシーケンスに
論理リングが一致しなくても、自由に構築できる。つま
り、パストポロジーやリングネットワークにおける障害
発生時に利用できる。
It consists of the preceding station address, own station address, 1&following station address. This logical ring table is used to construct logical rings in order to cope with network failures. That is, each data transmission station records information about the preceding station, its own station, and the succeeding station, and forms a logical ring based on this context. In this case, it can be constructed freely without using a general ring topology or even if the logical ring does not match the sequence in which physical signals flow. In other words, it can be used when a failure occurs in the path topology or ring network.

以下、このループ伝送システムにおいてトークンの周回
によりシステムを初期化する手順について説明する。
Below, a procedure for initializing the system by circulating tokens in this loop transmission system will be explained.

第4図は各データ伝送ステーションにおいて先行局を認
知するシーケンスを示す。
FIG. 4 shows a sequence for recognizing a preceding station at each data transmission station.

i)全局が動作可能となった時点で物理的な同期がとれ
、同期イニシャルが終了する。
i) Physical synchronization is achieved when all stations become operational, and the synchronization initialization ends.

+1)次に同期イニシャルからスタートしたタイマが局
番号×イニシャル基本時間により定められる設定時間を
越えると、たとえばこの場合A局の局番号が最も小さい
ので、まずA局のタイマTAtが設定時間]゛△4をタ
イムオーバし、A局は順方向イニシャルバケソ1−FI
Pを送出する。このとき、各局は自局のアドレスしか判
らず、この順方向イニシャルバケy L F I Pの
到着により、上流の局つまり先行局がA局であることを
知る。ただし、ブロードキャスl−(−斉同報)するた
め、論理リングテーブルL RTの他の局の先行局と順
方向番号は総て入れ代わる。
+1) Next, when the timer started from the synchronization initial exceeds the set time determined by station number x initial basic time, for example, in this case, since the station number of station A is the smallest, the timer TAt of station A is first set for the set time] △4 timeout, A station forward initial bakeso 1-FI
Send P. At this time, each station knows only its own address, and upon arrival of this forward direction initial packet YLF I P, it learns that the upstream station, that is, the preceding station, is station A. However, in order to perform broadcast l- (simultaneous broadcast), the forward direction numbers of other stations in the logical ring table LRT are all interchanged with those of the preceding station.

山)願力゛向イニシャルパケットFIPを送出した局は
、さらにフリート−クンを送出し、次の下流の局に送信
権を与える。
The station that sent out the initial packet FIP for requesting further sends out a free token to give the next downstream station the right to transmit.

■)フリート−クンを受は取った局は、論理リングテー
ブルL R′rの先行局と順方向番号を固定する。
(2) The station that receives the free token fixes the forward direction number with the preceding station in the logical ring table LR'r.

v) ii) 、  1ii) 、  iv)の手順を
A局と同様に13局〜E局について行ない、全局の先行
局と順方向番号が決定する。
v) The procedures of ii), 1ii), and iv) are performed for stations 13 to E in the same way as for station A, and the preceding stations and forward direction numbers of all stations are determined.

第5図は上述の先行局の認知に続く後続部の認知のシー
ケンスを示す。
FIG. 5 shows the sequence of recognition of the successor station following recognition of the preceding station described above.

1)再びフリート−クンを受は取ったへ局番、[、jf
方向イニシャルバケツl E I I)を送出する。こ
れにより、上述の順り向イニシャルで認知できた先行局
l?、局に*・l L II続局がA局であることを知
らせる。
1) The area number to which I received Fleet Kun again, [, jf
Send direction initial bucket l E I I). As a result, the preceding station l? which could be recognized by the above-mentioned forward direction initial? , informs the station that *・l L II is the next station.

ii)逆方向イニシャルバケソ1−ET+);1i:送
出したA局はフリート−クンを送出し、逆方向イニシャ
ルパケットEIPを受信したE局は送信権を得る。
ii) Reverse direction initial packet 1-ET+); 1i: Station A transmits a fleet token, and station E, which receives the reverse direction initial packet EIP, obtains the transmission right.

iii )フリート−クンを得たE局は、論理リングテ
ーブルL RTの後続部を固定する。
iii) The E station that obtained the fleet token fixes the subsequent part of the logical ring table LRT.

iv)  i > 、  ii) 、  1ii)と同
様の手順を1)、  C,B局と順に繰り返してイニシ
ャライズを終了する。
iv) i>, ii), Repeat the same procedure as 1ii) for stations 1), C, and B in order to complete the initialization.

第6図のフローチャートは上述の処理手順を各データ伝
送ステーションの処理に展開して示し、ステップa以降
の処理をA局が実行し、ステップbJ2J降の処理をA
局以外の局が実行する。これは、局番号の決め方に応し
て定まるものであり、いずれの局においてもステップa
以降の処理及びステップb以降の処理を実行することが
できる。
The flowchart in FIG. 6 shows the above-mentioned processing procedure expanded to the processing of each data transmission station, in which station A executes the processing from step a onwards, and station A executes the processing from step bJ2J.
Executed by a station other than the station. This is determined depending on how the station number is determined, and for any station, step a
Subsequent processing and processing after step b can be executed.

〈発明の効果〉 以」二説明したように、本発明においては、データ伝送
ステーションが先行馬、自局、後続局のアドレスデータ
をもつ順方向パケットと逆方向パケットを送信し、この
順方向パケットと逆方向パケットを受信したデータ伝送
ステーションが上記順方向パケットと逆方向パケットに
応じて先行局。
<Effects of the Invention> As explained in Section 2 below, in the present invention, a data transmission station transmits a forward packet and a reverse packet having address data of the leading horse, its own station, and the succeeding station, and transmits the forward packet. And the data transmission station that received the reverse packet is the preceding station according to the forward packet and reverse packet above.

自局、1&続局のアドレスからなる論理リングテーブル
を固定化してシステムのイニシャライズを行うようにし
たので、監視局が不要になり、各データ伝送ステーシリ
ンにおいてラフトウ0皿ア及びノ1−ドウエアを共通化
することにより、システムのコストダウンが実現できる
。また、分散制御であるので、危険分散が可能になり、
大きいイニシャラ・イズ障害が回避できるとともに、イ
ニシャライズの処理が迅速化でき■つ筒中化できる。さ
らに、全てのデータ伝送ステーションにおいてイニシャ
ライズに関する管理データを収集することができ、各デ
ータ伝送ステーションの管理データの比較からネッl−
ワークの不安定箇所や危険箇所の早期発見ができる。
Since the system is initialized by fixing the logical ring table consisting of the addresses of the own station, 1 & subsequent stations, there is no need for a monitoring station, and each data transmission station has a common rough address and no 1-doware. By optimizing the system, system costs can be reduced. In addition, since it is a distributed control, it is possible to spread the risk.
Large initialization failures can be avoided, and initialization processing can be speeded up and carried out in-process. Furthermore, management data related to initialization can be collected at all data transmission stations, and network information can be obtained by comparing the management data of each data transmission station.
Early detection of unstable or dangerous parts of the workpiece is possible.

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

第1図は本発明を通用したループ伝送システムの基本構
成を示す図、第2図は本発明実施例のパケットのフレー
ム構成を示す図、第3図は本発明実施例の論理リングテ
ーブルを示す図、第4図と第5図は本発明実施例のシー
ケンスを示す図、第6図は本発明実施例の処理手順を示
すフローチャート、第7図は従来例のループ伝送システ
ムの構成を示す図である。 A局、B局、 −、E局・・・データ伝送ステーション
RING・・・伝送路
FIG. 1 is a diagram showing the basic configuration of a loop transmission system using the present invention, FIG. 2 is a diagram showing the frame structure of a packet according to an embodiment of the present invention, and FIG. 3 is a diagram showing a logical ring table according to an embodiment of the present invention. 4 and 5 are diagrams showing the sequence of the embodiment of the present invention, FIG. 6 is a flow chart showing the processing procedure of the embodiment of the present invention, and FIG. 7 is a diagram showing the configuration of a conventional loop transmission system. It is. A station, B station, -, E station...data transmission station RING...transmission line

Claims (1)

【特許請求の範囲】[Claims] データの送受を行なう複数のデータ伝送ステーションを
環状に接続してなる伝送路上を周回するトークンを受信
したデータ伝送ステーションがデータの送信権を取得す
るトークンパッシング方式を用いたループ伝送システム
において、上記データ伝送ステーションが先行局、自局
、後続局のアドレスデータをもつ順方向パケットと逆方
向パケットを送信し、この順方向パケットと逆方向パケ
ットを受信したデータ伝送ステーションが上記順方向パ
ケットと逆方向パケットに応じて先行局、自局、後続局
のアドレスからなる論理リングテーブルを固定化するこ
とを特徴とするループ伝送システムにおけるイニシャラ
イズ制御方式。
In a loop transmission system using a token passing method in which a data transmission station that receives a token circulating on a transmission path formed by connecting a plurality of data transmission stations that transmit and receive data in a ring acquires the right to transmit data, the above-mentioned data A transmission station transmits a forward packet and a reverse packet containing the address data of the preceding station, its own station, and the succeeding station, and the data transmission station that receives the forward packet and reverse packet transmits the forward packet and reverse packet. An initialization control method in a loop transmission system characterized by fixing a logical ring table consisting of addresses of a preceding station, its own station, and a succeeding station according to the following.
JP60257411A 1985-11-15 1985-11-15 Initialization control system for loop transmission system Pending JPS62117437A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP60257411A JPS62117437A (en) 1985-11-15 1985-11-15 Initialization control system for loop transmission system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP60257411A JPS62117437A (en) 1985-11-15 1985-11-15 Initialization control system for loop transmission system

Publications (1)

Publication Number Publication Date
JPS62117437A true JPS62117437A (en) 1987-05-28

Family

ID=17306002

Family Applications (1)

Application Number Title Priority Date Filing Date
JP60257411A Pending JPS62117437A (en) 1985-11-15 1985-11-15 Initialization control system for loop transmission system

Country Status (1)

Country Link
JP (1) JPS62117437A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5632333A (en) * 1992-04-30 1997-05-27 Kabushiki Kaisha Komatsu Seisakusho Temperature and humidity adjusting apparatus and control method therefor
US6175687B1 (en) 1992-04-30 2001-01-16 Kabushiki Kaisha Komatsu Seisakusho Humidifier and hollow yarn body to be used therefor

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5632333A (en) * 1992-04-30 1997-05-27 Kabushiki Kaisha Komatsu Seisakusho Temperature and humidity adjusting apparatus and control method therefor
US6175687B1 (en) 1992-04-30 2001-01-16 Kabushiki Kaisha Komatsu Seisakusho Humidifier and hollow yarn body to be used therefor

Similar Documents

Publication Publication Date Title
US4792947A (en) Method of multi-address communication
JP3320297B2 (en) Operation mode establishment / maintenance method and station for connecting to port of LAN switch
US5361250A (en) Apparatus and method of token ring beacon station removal for a communication network
US4709365A (en) Data transmission system and method
JP3307508B2 (en) Communication network configuration detection method
US5319644A (en) Method and apparatus for identifying port/station relationships in a network
JPS59144242A (en) Method of identifying upstream station in ring communicationsystem
JPH07307751A (en) Full duplex communication between terminal stations in tokenring local area network
EP0119003A2 (en) Method and apparatus for the detection and regeneration of a lost token in a token based data communications network
US5528594A (en) Method and system for implementing sub-tokens on a token ring network
JPH0666806B2 (en) Token ring transmission method
US6175553B1 (en) Method and apparatus for locating and isolating a fault within a token ring network
US4769814A (en) Method for establishing a limited broadcast path within an interconnected network
JPS62117437A (en) Initialization control system for loop transmission system
US5414700A (en) Negotiation protocol for establishment of full duplex communication on a token ring network
US6219335B1 (en) Method and apparatus for locating and isolating a fault within a token ring network
US5602827A (en) Method and apparatus for correcting a defect in a token ring network
JPH06152624A (en) Token passing type data transmission method
JP3466860B2 (en) Node arrangement order check method for ring network
JP3177875B2 (en) Communication method with network connection device via gateway device
JP2539410B2 (en) Communication network routing information check method
JPS633536A (en) Loop transmission line error correction system
JPS58171150A (en) Communication system equivalent to loop
JP2504596B2 (en) Frame filtering method in large-scale LAN system
JPS6292637A (en) Method for multiple address communication