JPH10126429A - Network - Google Patents

Network

Info

Publication number
JPH10126429A
JPH10126429A JP8270500A JP27050096A JPH10126429A JP H10126429 A JPH10126429 A JP H10126429A JP 8270500 A JP8270500 A JP 8270500A JP 27050096 A JP27050096 A JP 27050096A JP H10126429 A JPH10126429 A JP H10126429A
Authority
JP
Japan
Prior art keywords
station
network
time
address
join
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
JP8270500A
Other languages
Japanese (ja)
Other versions
JP3334032B2 (en
Inventor
Yasuhiro Tanaka
康裕 田中
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.)
Fuji Electric Co Ltd
Fuji Facom Corp
Original Assignee
Fuji Electric Co Ltd
Fuji Facom 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 Fuji Electric Co Ltd, Fuji Facom Corp filed Critical Fuji Electric Co Ltd
Priority to JP27050096A priority Critical patent/JP3334032B2/en
Publication of JPH10126429A publication Critical patent/JPH10126429A/en
Application granted granted Critical
Publication of JP3334032B2 publication Critical patent/JP3334032B2/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

PROBLEM TO BE SOLVED: To prevent occurrence of a fault by surely detecting a duplicated address so as to send fault information to a system without sacrificing the transmission efficiency and giving hindrance to normal communication. SOLUTION: A station desiring a new subscription decides a wait time till a subscription request frame is sent after a new subscription request takes place in its own station by using a random number, and sends the subscription request frame after the lapse of the wait time. Furthermore, each station stores its own rising time and adds the rising time of its own station to the subscription request frame when the new subscription desiring station sends the subscription request frame.

Description

【発明の詳細な説明】DETAILED DESCRIPTION OF THE INVENTION

【0001】[0001]

【発明の属する技術分野】本発明は、複数の加入局によ
り形成される論理リングにもとづいて局間のデータ交信
が行われるネットワークに関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a network in which data communication between stations is performed based on a logical ring formed by a plurality of subscriber stations.

【0002】[0002]

【従来の技術】従来は、ネットワークの立ち上げ時な
ど、複数局が同時に多くのフレームを送受信して加入動
作を行っている。その結果、アドレスが互いに重複する
2局が、同時に加入しようとした場合、または、2つの
ネットワークを物理的に接続したためにアドレスの重複
が発生した場合に、両局は相互にアドレスの重複を監視
しているため、アドレスの重複が検出された時点で両方
とも論理リングから脱落する。また、論理リングを構成
する各局(エージェント)は、情報を収集する特定局
(マネージャ)に対して、異常要因の発生時に1対1で
通知している。また、各構成局には、通知先のマネージ
ャ局が管理者によりあらかじめ設定されている。
2. Description of the Related Art Conventionally, when a network is started, a plurality of stations transmit and receive many frames at the same time to perform a subscription operation. As a result, if two stations with overlapping addresses try to join at the same time, or if addresses overlap due to physical connection of two networks, both stations monitor each other for overlapping addresses. Therefore, when the duplication of the address is detected, both are dropped from the logical ring. In addition, each station (agent) configuring the logical ring notifies the specific station (manager) that collects information on a one-to-one basis when an abnormal cause occurs. In each constituent station, a manager station to be notified is set in advance by an administrator.

【0003】[0003]

【発明が解決しようとする課題】しかしながら、従来の
ネットワークでは次のような課題があった。 (l)2つの局が同時に加入要求フレームを送信した場
合、送信間隔が同一に設定されていると、送信のタイミ
ングが同期してしまい双方の局がアドレス重複を同時に
検出しあうため、何れも恒久的に加入できない。さらに
は、高い頻度で送受信処理することになり、各局の通信
処理負荷のみならず、伝送路の負荷も増大してしまう。 (2)一般に、アドレス重複が発生した場合、長時間安
定して通信を行っている方の局が、優先的に運転を継続
すべきである。従来の方法では、重複局が同時に存在し
得る状況(ネットワーク間の接続等)では、その全ての
局が脱落してしまう。そのため、システム動作のはじめ
から正常に通信していた局が脱落し、正常な通信が阻害
されることになる。
However, the conventional network has the following problems. (L) When two stations transmit the join request frame at the same time, if the transmission interval is set to be the same, the transmission timing is synchronized and both stations simultaneously detect the address duplication. Can't join permanently. Further, transmission / reception processing is performed at a high frequency, which increases not only the communication processing load of each station but also the load of the transmission path. (2) In general, when address duplication occurs, the station that is performing stable communication for a long time should continue operation with priority. In the conventional method, in a situation where a duplicate station can exist at the same time (connection between networks, etc.), all the stations are dropped. Therefore, a station that has normally communicated from the beginning of the system operation is dropped, and normal communication is hindered.

【0004】(3)異常情報を通知するために、管理者
が局を特定して各局のファイルに記憶させておく必要が
ある。また、要因発生時に一度だけの通知では、フレー
ムが喪失された場合には、異常を伝えられないことがあ
る。これは、ネットワークが重大な障害に陥ることを未
然に予防するシステムにおいては大きな欠点である。そ
こでこの発明の目的とするところは、伝送効率を犠牲に
せず、しかも正常な通信を阻害することなく、確実にア
ドレス重複を検出してその異常情報をシステムに伝達し
障害の発生を予防することである。
(3) In order to notify abnormal information, it is necessary for an administrator to specify a station and store it in a file of each station. In addition, if a frame is lost by notifying only once when a factor occurs, an abnormality may not be transmitted. This is a major drawback in systems that prevent the network from falling into serious trouble. Therefore, an object of the present invention is to reliably detect address duplication and transmit the abnormal information to a system without sacrificing transmission efficiency and without hindering normal communication, thereby preventing occurrence of a failure. It is.

【0005】[0005]

【課題を解決するための手段】そこで上記課題を解決す
るために、請求項1の発明は、ネットワークに加入した
局により構成された論理リングにもとづき、加入各局間
でデータ交信を行うネットワークであって、新規加入を
希望する局から加入要求フレームがネットワークを介し
て既加入局に送信された場合に、その加入要求フレーム
を受信した既加入局のアドレスと加入希望局のアドレス
とが同一であるか否かを判別し、同一であると判別され
た場合に、異常応答フレームを既加入局から加入希望局
に返信して加入を拒絶するネットワークにおいて、新規
加入を希望する局が加入要求フレームをネットワーク上
に送信する際に、自局に新規加入要求が発生した時点か
ら加入要求フレームを送信するまでの待機時間を乱数を
用いて決定し、その待機時間を経過した後に、加入要求
フレームを送信させる。
SUMMARY OF THE INVENTION In order to solve the above-mentioned problems, a first aspect of the present invention is a network for performing data communication between each subscribed station based on a logical ring constituted by the stations subscribed to the network. In the case where a joining request frame is transmitted from a station desiring to newly join to an already joined station via a network, the address of the already joining station receiving the joining request frame is the same as the address of the joining desired station. In a network in which an abnormal response frame is returned from an existing joining station to a joining requesting station and the joining request is rejected, a station requesting a new joining sends a joining request frame. When transmitting on the network, the standby time from when a new subscription request is issued to the own station until transmission of a subscription request frame is determined by using a random number. After a lapse of waiting time to transmit the subscription request frame.

【0006】請求項2の発明は、ネットワークに加入し
た局により構成された論理リングにもとづき、加入各局
間でデータ交信を行うネットワークであって、新規加入
を希望する局から加入要求フレームがネットワークを介
して既加入局に送信された場合に、その加入要求フレー
ムを受信した既加入局のアドレスと加入希望局のアドレ
スとが同一であるか否かを判別し、同一であると判別さ
れた場合に、異常応答フレームを既加入局から加入希望
局に返信して加入を拒絶するネットワークにおいて、各
局ごとに自局の立ち上げ時刻を記憶しておき、新規加入
希望局が加入要求フレームを送信する場合に自局の立ち
上げ時刻データをフレームに付加して送信する。また、
加入要求フレームを受信した既加入局のアドレスと加入
希望局のアドレスとが同一である場合に、既加入局の立
ち上げ時刻と加入希望局の立ち上げ時刻とを比較し、既
加入局の立ち上げ時刻が加入希望局の立ち上げ時刻以前
であれば異常応答フレームを既加入局から加入希望局へ
返信し、既加入局の立ち上げ時刻が加入希望局の立ち上
げ時刻の後であれば既加入局をネットワークの論理リン
グから離脱させる。
According to a second aspect of the present invention, there is provided a network for exchanging data between the subscribed stations based on a logical ring constituted by the stations subscribing to the network. If the address of the joining station that received the joining request frame is the same as the address of the station that wants to join, when it is determined that the address is the same, In a network in which an abnormal response frame is returned from an existing joining station to a joining requesting station to reject the joining, the start-up time of the own station is stored for each station, and the new joining requesting station transmits a joining request frame. In this case, the start time data of the own station is added to the frame and transmitted. Also,
If the address of the already-subscribed station that has received the join request frame is the same as the address of the desired station, the start-up time of the already-subscribed station is compared with the start-up time of the desired station. If the start time is before the start time of the desired station, an abnormal response frame is returned from the existing station to the desired station, and if the start time of the existing station is after the start time of the desired station, the abnormal response frame is returned. The subscriber station leaves the logical ring of the network.

【0007】請求項3の発明は、請求項1または請求項
2の発明において、加入希望局と既加入局とのアドレス
の重複異常や伝送路の異常が検出された場合に、その異
常内容にもとづいて異常通知フレームを作成し、検出さ
れた異常が解消されるまでの間、一定周期でブロードキ
ャスト伝送する。
According to a third aspect of the present invention, in the first or second aspect of the present invention, when an error in address duplication between a station desiring to join and an existing station and an abnormality in a transmission line are detected, the content of the abnormality is determined. Based on this, an abnormality notification frame is created, and broadcast transmission is performed at a constant period until the detected abnormality is resolved.

【0008】[0008]

【発明の実施の形態】以下、図に沿って本発明の実施形
態を説明する。図1は本発明の実施形態の全体の動作を
示すフローチャートである。図に示されるように、リン
グ加入時に、局立ち上げ時のシステム時刻を初期値とし
た乱数を用いて各局の加人要求フレームの送信間隔を分
散させる(S1,S2)。次に、加人要求フレームの送
信について一定時間、回線を監視した後、加入する(S
3〜S8)。また、この加入処理に先立ち、各局は、自
局の立ち上げ時に、そのシステム時刻を内部ファイルに
記録しておく。構成局は、フレーム内に設けた「局立ち
上げ時刻」領域にファイルの時刻を設定して一定周期で
ブロードキャスト伝送する。
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a flowchart showing the overall operation of the embodiment of the present invention. As shown in the figure, at the time of ring joining, the transmission interval of the addition request frame of each station is dispersed using random numbers with the system time at the time of starting the station as an initial value (S1, S2). Next, after monitoring the line for a certain period of time for transmission of the addition request frame, the subscriber joins (S
3-S8). Prior to the joining process, each station records its system time in an internal file when the station starts up. The constituent stations set the time of the file in the “station start-up time” area provided in the frame and perform broadcast transmission at a fixed cycle.

【0009】受信したフレームの送信元アドレスと自局
のアドレスが一致したとき、同受信フレーム内に設けた
「局立ち上げ時刻」領域の情報と、自局の立ち上げ時刻
を比較し、リンクを継続するか脱落するかを判断する。
その判断は、”相手局時刻>自局時刻”の場合に自局継
続とし、”相手局時刻≦自局時刻”の場合に自局脱落と
する。各局が、同一の判断処理を行うことで、重複局間
では、先に動作していた局が継続して通信を続け、後か
ら加入しようとする局が脱落する。
When the source address of the received frame and the address of the own station match, the information of the "station start time" area provided in the received frame is compared with the start time of the own station, and the link is established. Determine if you want to continue or drop out.
The determination is that the local station is to be continued when “partner station time> local station time” and that the local station is to be dropped when “partner station time ≦ local station time”. By performing the same determination process by each station, the station that has operated first continues to communicate between the overlapping stations, and the station that wants to join later drops out.

【0010】次に、全構成局は、異常の発生時に、異常
要因を異常通知フレームに設定してブロードキャスト伝
送で各構成局に通知する。同時に、定周期タイマを起動
し、タイムアップ毎に異常通知フレームを送信する。異
常要因が解除したらタイマを停止する。それにより、異
常通知フレームを受信した構成局は、異常要因の発生と
その要因を認識し、それと同時に要因毎に異なる時間を
設定したタイマを起動する。ここで再び、同フレームを
受信した場合は、異常要因に該当するタイマを再設定す
る。次いで、タイムアップしたら、そのタイマの異常要
因を解除する。以上の受信解析処理を、各局が起動する
ことによりシステム全体の異常を各局で認識することが
できる。
Next, when an abnormality occurs, all the constituent stations set the cause of the abnormality in the abnormality notification frame and notify each constituent station by broadcast transmission. At the same time, a fixed-period timer is started, and an abnormality notification frame is transmitted each time up. When the cause of the error is removed, the timer stops. Thereby, the constituent station receiving the abnormality notification frame recognizes the occurrence of the abnormality factor and the factor, and at the same time, starts a timer that sets a different time for each factor. Here, when the same frame is received again, the timer corresponding to the cause of the abnormality is reset. Next, when the time is up, the cause of the abnormality of the timer is released. When each station starts the above-described reception analysis processing, each station can recognize an abnormality in the entire system.

【0011】図2は、請求項1の発明の実施形態を示す
説明図であり、各局は、FDDIで接続されブロードキ
ャスト伝送機能を実装し、局の立ち上げ時刻を各々ファ
イルに記録している。論理リングへの加入動作を、3回
(100〜500m秒の間でランダムに変化する)加入
要求フレームをブロードキャスト伝送し、2秒間異常応
答がなければ加入する。また、異常応答フレーム(ブロ
ードキャスト伝送)を受信すれば加入しないと規定した
場合、各局からは、加入要求フレームが各々異なった周
期で送信されて、それにより、他局では加入要求フレー
ムが異なるタイミングで受信されて、アドレスの重複等
がチェックされる。
FIG. 2 is an explanatory diagram showing an embodiment of the first aspect of the present invention. Each station is connected by FDDI, implements a broadcast transmission function, and records the start-up time of each station in a file. The operation of joining the logical ring is broadcast three times (randomly changing between 100 and 500 msec) by transmitting a join request frame, and if there is no abnormal response for 2 seconds, join. In addition, if it is specified that a subscription is not made if an abnormal response frame (broadcast transmission) is received, each station transmits a subscription request frame at a different cycle, so that other stations transmit subscription request frames at different timings. The received address is checked for duplication of addresses.

【0012】図では、アドレス2である、既加入局と加
入希望局が存在するため、アドレス2の加入希望局から
加入要求フレームがブロードキャスト伝送されると、ア
ドレス2の既加入局がそれを受信して、自局のアドレス
2との重複を検出し、異常応答フレームを作成してブロ
ードキャスト伝送する。それをアドレス2の加入希望局
が受信して異常処理を実行して、論理リングへの参加は
中断される。他のアドレス1、アドレス3の加入希望局
は、自局に対する異常応答フレームを受信しないと、応
答監視時間2秒を経過後に、論理リングに加入される。
[0012] In the figure, since there is an already-subscribed station and a desired subscribed station which is address 2, when a subscribe request frame is broadcast-transmitted from the desired subscribed station at address 2, the previously subscribed station at address 2 receives it. Then, an overlap with the address 2 of the own station is detected, an abnormal response frame is created, and broadcast transmission is performed. This is received by the station desiring to join at address 2 and abnormal processing is executed, so that participation in the logical ring is interrupted. Unless an abnormal response frame for the own station is received, the stations desiring to join other addresses 1 and 3 are joined to the logical ring after a response monitoring time of 2 seconds has elapsed.

【0013】図3は、請求項2の発明の実施形態を示す
説明図であり、各局は、FDDIで接続され、ブロード
キャスト伝送機能と同一のアドレス重複時判断処理を実
装し、局の立ち上げ時刻を各々ファイルに記録してい
る。それぞれの局は、2つのネットワークFDDI1と
FDDI2に分かれており、双方を結合した場合、各々
のネットワークには、同一のアドレス3(例えばIPア
ドレス)を持つA局とB局が存在することになる。そこ
で、各局は、フレーム(UDP/IPのPDU)内の立
ち上げ時刻領域に、あらかじめ記録しておいた時刻を設
定して送信する。
FIG. 3 is an explanatory diagram showing an embodiment of the second aspect of the present invention. Each station is connected by FDDI, implements the same address duplication judgment processing as the broadcast transmission function, and sets the start time of the station. Are recorded in each file. Each station is divided into two networks FDDI1 and FDDI2, and when both are combined, there will be an A station and a B station having the same address 3 (eg, IP address) in each network. . Therefore, each station sets a time recorded in advance in a start-up time area in a frame (PDU / UDP / IP) and transmits the frame.

【0014】これらのフレームを受信した局は、フレー
ムの送信元IPアドレスと自局のIPアドレスを比較
し、一致を検出したとき、同受信フレーム内の「局立ち
上げ時刻」領域の情報と自局の立ち上げ時刻を比較す
る。A局の場合は、”相手局時刻(5:00)>自局時
刻(1:00)”であり、A局がB局よりも以前から稼
働していたため優先権を認めてリンクを継続する。B局
の場合は、”相手局時刻(1:00)≦自局時刻(5:
00)”であり、A局よりも稼働が新しいので優先権を
認めずにネットワークから脱落させて、アドレス重複の
事態を回避する。
A station that receives these frames compares the source IP address of the frame with its own IP address, and when a match is detected, the information of the “station start-up time” area in the received frame and the station itself are compared. Compare the start-up times of the stations. In the case of the station A, "the partner station time (5:00)> the own station time (1:00)" is satisfied, and since the station A has been operating before the station B, the priority is recognized and the link is continued. . In the case of the station B, “the partner station time (1:00) ≦ the own station time (5:
00) ", the operation is newer than that of the station A, so that it is dropped from the network without recognizing the priority and the situation of address duplication is avoided.

【0015】図4は、請求項3の発明の実施形態を示す
説明図であり、各局は、FDDIで接続されブロードキ
ャスト伝送機能を実装している。図示例は、ケーブル劣
化による光レベル低下を異常要因としWRAP状態にな
る場合を示している。異常を検出したアドレス3局は、
フレームに異常要因を設定してブロードキャスト送信す
る。ケーブル劣化によりフレームが喪失した時でも、一
定周期で送信するため伝送路の切り替がなされた後、必
ず通知される。また、各局に対して、受信解析処理を起
動するマンマシンインタフェースを用意することで、何
れの構成局からでもシステム全体に発生している異常を
認識することが可能になる。
FIG. 4 is an explanatory diagram showing an embodiment of the third aspect of the present invention. Each station is connected by FDDI and has a broadcast transmission function. The illustrated example shows a case in which a WRAP state is caused by a decrease in light level due to cable deterioration as an abnormal factor. The address 3 stations that detected the abnormality
Set the cause of the error in the frame and broadcast. Even when a frame is lost due to deterioration of the cable, it is always notified after the transmission path is switched for transmission at a fixed period. In addition, by providing a man-machine interface for starting the reception analysis process for each station, it is possible to recognize an abnormality occurring in the entire system from any of the constituent stations.

【0016】各実施形態で説明したように、加入要求フ
レームの送信タイミングをずらして加入時の伝送路負荷
を分散させたことにより、フレームの喪失がなくなり加
入時の異常を確実に検出することができる。また、論理
リング加入時だけではなく、加入済の局についてもアド
レス重複の検出および重複局の判定をすることにより、
正常局の通信を阻害することが防止される。さらに、異
常情報の通知を、一定周期でブロードキャスト伝送する
ことにより、取りこぼしによる伝達不良の解消が可能に
なる。また、検出元の構成局に特定の通知先を設定する
ことなく全局が異常情報を受信可能にしたため、任意の
構成局においてネットワーク上の異常を認識することが
できるようになる。
As described in each embodiment, by dispersing the transmission line load at the time of joining by shifting the transmission timing of the joining request frame, it is possible to eliminate the loss of the frame and reliably detect the abnormality at the time of joining. it can. In addition, by detecting address duplication and judging an overlapping station not only at the time of joining a logical ring but also at an already joined station,
Disturbing the communication of the normal station is prevented. Further, by transmitting broadcast of the notification of the abnormality information at a constant period, it is possible to eliminate a transmission failure due to a missing message. In addition, since all stations can receive abnormality information without setting a specific notification destination to the constituent station of the detection source, any constituent station can recognize an abnormality on the network.

【0017】[0017]

【発明の効果】以上述べたように請求項1の発明によれ
ば、新規加入を希望する局が加入要求フレームをネット
ワーク上に送信する際に、自局に新規加入要求が発生し
た時点から加入要求フレームを送信するまでの待機時間
が乱数を用いて決定され、その待機時間を経過した後
に、加入要求フレームが送信される。それにより、アド
レスの重複する複数の新規加入局が同時に加入を希望し
ても加入要求フレームの送信タイミングが互いにずれる
ため、任意の1局のみが確実に加入される。
As described above, according to the first aspect of the present invention, when a station desiring to join a new station transmits a joining request frame to the network, the station joins from the time when a new joining request is issued to the station itself. The waiting time until the request frame is transmitted is determined using a random number, and after the waiting time, the joining request frame is transmitted. Thus, even if a plurality of new subscriber stations having overlapping addresses desire to join at the same time, the transmission timings of the subscription request frames are shifted from each other, so that only one arbitrary station is reliably subscribed.

【0018】請求項2の発明によれば、各局ごとに自局
の立ち上げ時刻を記憶しておき、新規加入希望局が加入
要求フレームを送信する場合に自局の立ち上げ時刻デー
タをフレームに付加して送信される。また、既加入局の
アドレスと加入希望局のアドレスとが同一である場合
に、自局の立ち上げ時刻と加入希望局の立ち上げ時刻と
を比較し、既加入局の立ち上げ時刻が加入希望局の立ち
上げ時刻以前であれば異常応答フレームが既加入局から
加入希望局へ返信され、既加入局の立ち上げ時刻が加入
希望局の立ち上げ時刻の後であれば既加入局がネットワ
ークの論理リングから離脱される。それにより、既加入
局とアドレスの重複する局が新規に加入を希望しても、
新規加入希望局の加入は認められず、既加入局は優先さ
れてそのまま論理リングに残る。
According to the second aspect of the present invention, the start-up time of the own station is stored for each station, and the start-up time data of the own station is stored in a frame when a new joining requesting station transmits a join request frame. Sent with addition. In addition, when the address of the already-joined station is the same as the address of the desired station, the start-up time of the own station is compared with the start-up time of the desired station. If it is before the start time of the station, an abnormal response frame is returned from the existing station to the station that wants to join, and if the start time of the existing station is after the start time of the station that wants to join, the existing station returns to the network. Leaves the logical ring. As a result, even if a station with the same address as an existing station wishes to newly join,
A new subscriber is not allowed to join, and existing subscribers are given priority and remain in the logical ring.

【0019】請求項3の発明によれば、加入希望局と既
加入局とのアドレスの重複異常や伝送路の異常が検出さ
れた場合に、その異常内容にもとづいて異常通知フレー
ムが作成され、検出された異常が解消されるまでの間、
一定周期でブロードキャスト伝送される。その結果、万
一、異常通知フレームが伝送途中で消失された場合で
も、再度送信されるため、確実に他局へ異常発生が伝達
される。
According to the third aspect of the present invention, when an address duplication error between a station desiring to join and an already joined station or an abnormality in a transmission line is detected, an abnormality notification frame is created based on the details of the abnormality, Until the detected abnormality is resolved,
Broadcast transmission is performed at a fixed cycle. As a result, even if the abnormality notification frame is lost during transmission, the frame is transmitted again, so that the occurrence of the abnormality is reliably transmitted to another station.

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

【図1】本発明の実施形態の動作を説明するフローチャ
ートである。
FIG. 1 is a flowchart illustrating an operation of an exemplary embodiment of the present invention.

【図2】請求項1の発明の実施形態を示す説明図であ
る。
FIG. 2 is an explanatory diagram showing an embodiment of the first invention.

【図3】請求項2の発明の実施形態を示す説明図であ
る。
FIG. 3 is an explanatory view showing an embodiment of the invention of claim 2;

【図4】請求項3の発明の実施形態を示す説明図であ
る。
FIG. 4 is an explanatory view showing an embodiment of the invention of claim 3;

Claims (3)

【特許請求の範囲】[Claims] 【請求項1】 ネットワークに加入した局により構成さ
れた論理リングにもとづき、加入各局間でデータ交信を
行うネットワークであって、新規加入を希望する局から
加入要求フレームがネットワークを介して既加入局に送
信された場合に、その加入要求フレームを受信した既加
入局のアドレスと加入希望局のアドレスとが同一である
か否かを判別し、同一であると判別された場合に、異常
応答フレームを既加入局から加入希望局に返信して加入
を拒絶するネットワークにおいて、 新規加入を希望する局が加入要求フレームをネットワー
ク上に送信する際に、自局に新規加入要求が発生した時
点から加入要求フレームを送信するまでの待機時間を乱
数を用いて決定し、その待機時間を経過した後に、加入
要求フレームを送信させる手段を備えたことを特徴とす
るネットワーク。
1. A network for exchanging data between stations that have joined based on a logical ring constituted by stations that have joined the network. If the address of the subscriber station that has received the join request frame is the same as the address of the station that wants to join, it is determined whether the address is the same. In a network that refuses to join by replying from the existing station to the station that wants to join, when a station that wants to join newly sends a join request frame on the network, it joins from the point when a new join request is issued to its own station. Means for determining a waiting time until transmitting the request frame by using a random number, and transmitting the joining request frame after the waiting time has elapsed. Network, characterized in that.
【請求項2】 ネットワークに加入した局により構成さ
れた論理リングにもとづき、加入各局間でデータ交信を
行うネットワークであって、新規加入を希望する局から
加入要求フレームがネットワークを介して既加入局に送
信された場合に、その加入要求フレームを受信した既加
入局のアドレスと加入希望局のアドレスとが同一である
か否かを判別し、同一であると判別された場合に、異常
応答フレームを既加入局から加入希望局に返信して加入
を拒絶するネットワークにおいて、 各局ごとに自局の立ち上げ時刻を記憶しておく手段と、 新規加入希望局が加入要求フレームを送信する場合に自
局の立ち上げ時刻データをフレームに付加して送信する
手段と、 既加入局のアドレスと加入希望局のアドレスとが同一で
ある場合に、自局の立ち上げ時刻と加入希望局の立ち上
げ時刻とを比較する手段と、 比較の結果、既加入局の立ち上げ時刻が加入希望局の立
ち上げ時刻以前であれば異常応答フレームを既加入局か
ら加入希望局へ返信し、既加入局の立ち上げ時刻が加入
希望局の立ち上げ時刻の後であれば既加入局をネットワ
ークの論理リングから離脱させる手段と、 を備えたことを特徴とするネットワーク。
2. A network for exchanging data between each subscribed station based on a logical ring constituted by stations subscribed to the network, wherein a subscribe request frame is transmitted from a subscribed station via the network to a subscribe request frame. If the address of the subscriber station that has received the join request frame is the same as the address of the station that wants to join, it is determined whether the address is the same. In a network that refuses to join by replying to the desired station from the already-subscribed station, means for storing the start-up time of the own station for each station; Means for adding the start-up time data of the station to the frame and transmitting it. When the address of the existing subscriber station is the same as the address of the desired station, the own station is started. Means for comparing the time with the start-up time of the desired station; and, as a result of the comparison, if the start-up time of the already-subscribed station is before the start-up time of the desired station, an abnormal response frame is sent from the previously-subscribed station to the desired station. Means for returning the existing station from the logical ring of the network if the start time of the existing station is after the start time of the desired station.
【請求項3】 請求項1または請求項2記載のネットワ
ークにおいて、 加入希望局と既加入局とのアドレスの重複異常または/
および伝送路の異常が検出された場合に、その異常内容
にもとづいて異常通知フレームを作成する手段と、 作成された異常通知フレームを、検出された異常が解消
されるまでの間、一定周期でブロードキャスト伝送する
手段と、 を備えたことを特徴とするネットワーク。
3. The network according to claim 1 or 2, wherein an address duplication error between a station that desires to join and an already joined station is abnormal.
Means for creating an abnormality notification frame based on the content of the abnormality when an abnormality is detected in the transmission path, and transmitting the created abnormality notification frame at a constant interval until the detected abnormality is resolved. A network, comprising: means for performing broadcast transmission.
JP27050096A 1996-10-14 1996-10-14 network Expired - Fee Related JP3334032B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP27050096A JP3334032B2 (en) 1996-10-14 1996-10-14 network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP27050096A JP3334032B2 (en) 1996-10-14 1996-10-14 network

Publications (2)

Publication Number Publication Date
JPH10126429A true JPH10126429A (en) 1998-05-15
JP3334032B2 JP3334032B2 (en) 2002-10-15

Family

ID=17487133

Family Applications (1)

Application Number Title Priority Date Filing Date
JP27050096A Expired - Fee Related JP3334032B2 (en) 1996-10-14 1996-10-14 network

Country Status (1)

Country Link
JP (1) JP3334032B2 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1343297A2 (en) * 2002-03-07 2003-09-10 Brother Kogyo Kabushiki Kaisha Method, apparatus and system for automatically assigning addresses
WO2007097248A1 (en) * 2006-02-23 2007-08-30 Daikin Industries, Ltd. Transmission control device, equipment managing system and transmission control method
JP2009071442A (en) * 2007-09-11 2009-04-02 Ricoh Co Ltd Image forming apparatus preventing address duplication, address duplication preventing method, and address duplication preventing program
JP2018157461A (en) * 2017-03-21 2018-10-04 株式会社明電舎 Optical dual-loop transmission system and communication method for optical dual-loop transmission system
JP2020191556A (en) * 2019-05-22 2020-11-26 オムロン株式会社 Network apparatus

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8180863B2 (en) 2002-03-07 2012-05-15 Brother Kogyo Kabushiki Kaisha Electronic apparatus and system capable of assigning appropriate address
EP1343297A3 (en) * 2002-03-07 2005-04-20 Brother Kogyo Kabushiki Kaisha Method, apparatus and system for automatically assigning addresses
US7370093B2 (en) 2002-03-07 2008-05-06 Brother Kogyo Kabushiki Kaisha Electronic apparatus and system capable of assigning appropriate address
US7984124B2 (en) 2002-03-07 2011-07-19 Brother Kogyo Kabushiki Kaisha Electronic apparatus and system capable of assigning appropriate address
EP1343297A2 (en) * 2002-03-07 2003-09-10 Brother Kogyo Kabushiki Kaisha Method, apparatus and system for automatically assigning addresses
US8661099B2 (en) 2002-03-07 2014-02-25 Brother Kogyo Kabushiki Kaisha Electronic apparatus and system capable of assigning appropriate address
WO2007097248A1 (en) * 2006-02-23 2007-08-30 Daikin Industries, Ltd. Transmission control device, equipment managing system and transmission control method
JP2009071442A (en) * 2007-09-11 2009-04-02 Ricoh Co Ltd Image forming apparatus preventing address duplication, address duplication preventing method, and address duplication preventing program
JP2018157461A (en) * 2017-03-21 2018-10-04 株式会社明電舎 Optical dual-loop transmission system and communication method for optical dual-loop transmission system
JP2020191556A (en) * 2019-05-22 2020-11-26 オムロン株式会社 Network apparatus
WO2020235187A1 (en) * 2019-05-22 2020-11-26 オムロン株式会社 Network apparatus
CN113711542A (en) * 2019-05-22 2021-11-26 欧姆龙株式会社 Network machine
CN113711542B (en) * 2019-05-22 2023-08-11 欧姆龙株式会社 Network machine

Also Published As

Publication number Publication date
JP3334032B2 (en) 2002-10-15

Similar Documents

Publication Publication Date Title
US5859959A (en) Computer network with devices/paths having redundant links
CN102075643B (en) Terminal device and backup system
US7924702B2 (en) Method for reconfiguring a communication network
JPH05276175A (en) Data communication method and communication system
JP3857317B2 (en) Automatic negotiation progress monitor
JP2001509657A (en) Active fault detection
CN106603261A (en) Hot backup method, first master device, backup device and communication system
US20060146804A1 (en) Telephone system, switching system and management method of telephone system
US6591212B2 (en) Method for testing continuity of ISUP relay call
JP2005006121A (en) Ip-pbx backup device, ip-pbx backup system, and method for countermeasure against fault of system
US7187926B1 (en) Method and system for controlling the use of satellite transmission capacity in terrestrial networks
CN113949649B (en) Fault detection protocol deployment method and device, electronic equipment and storage medium
US5736933A (en) Method and apparatus for providing redundancy in a communication network
JPH10126429A (en) Network
EP2071764B1 (en) A method, device and communication system thereof of electing local master
JP2000172527A (en) Dynamic burn lack listener server
CN112367179B (en) Link switching method and device
US7330462B2 (en) Managing wireless packet service resources
JP3666412B2 (en) Communications system
JPS60246148A (en) Data transmission control system
JP2687745B2 (en) Retry wait time setting device
JP3056075B2 (en) Network path disconnection / reconnection method
JPH04124933A (en) Sequential multi-address data verifying system
JPH0918518A (en) Method for communication with network connection device through gateway device
JPH0687559B2 (en) Bus type LAN

Legal Events

Date Code Title Description
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20020625

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20070802

Year of fee payment: 5

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20080802

Year of fee payment: 6

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20080802

Year of fee payment: 6

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090802

Year of fee payment: 7

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090802

Year of fee payment: 7

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100802

Year of fee payment: 8

LAPS Cancellation because of no payment of annual fees