JPS6365750A - Network management procedure for communication system - Google Patents

Network management procedure for communication system

Info

Publication number
JPS6365750A
JPS6365750A JP61209837A JP20983786A JPS6365750A JP S6365750 A JPS6365750 A JP S6365750A JP 61209837 A JP61209837 A JP 61209837A JP 20983786 A JP20983786 A JP 20983786A JP S6365750 A JPS6365750 A JP S6365750A
Authority
JP
Japan
Prior art keywords
station
route information
code
master station
route
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
JP61209837A
Other languages
Japanese (ja)
Inventor
Asako Shindou
麻子 進藤
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.)
Mitsubishi Electric Corp
Original Assignee
Mitsubishi Electric 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 Mitsubishi Electric Corp filed Critical Mitsubishi Electric Corp
Priority to JP61209837A priority Critical patent/JPS6365750A/en
Publication of JPS6365750A publication Critical patent/JPS6365750A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To easily detect a route change in a slave station by sending the code of a route information pattern in use periodically from a master station to the slave station. CONSTITUTION:The master station 0 stores all route information patterns. Slave stations 1-6 load and store the route information pattern in use from the master station 0 at system start. The master station 0 sends a route information code in use at present to the slave station periodically. The slave station compares the code sent from the master station with the code of said route information pattern stored in advance and when they are coincident, the communication is continued in the route information. In case of the dissidence, when the code sent from the master station is received as the identical code for plural number of times, it is discriminated that the route is changed to that shown in the code. When its own station does not store its code, the sending of route information is requested to the master station.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 この発明は、通信システムのネットワーク管理手順に関
するものである。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a network management procedure for a communication system.

〔従来の技術〕[Conventional technology]

第8図は、通(gシステムのネットワーク構成の一例で
あり、(0)は主局、(1)〜(5)は従局を表す。
FIG. 8 shows an example of the network configuration of the TS (g system), where (0) represents the master station and (1) to (5) represent the slave stations.

次に動作fこついて説明する。第3図のようなネットワ
ークIこおいて、主局(0)(こは、1つのルート情報
が設定、記憶されており、従局はシステム起動時に主局
からそのルート情報をロードし、記憶する。各局は、こ
のルート情報に従って、データ通信を行う。
Next, the operation f will be explained. In the network I shown in Figure 3, the master station (0) (here, one route information is set and stored, and the slave stations load and store the route information from the master station when the system is started). .Each station performs data communication according to this route information.

〔発明が解決しようとする問題点〕[Problem that the invention seeks to solve]

この様なシステム(こおいては、各局の持つルート情報
間の整合が非常に重要であるが、従来の方法では、情報
の交換が終わり、通信が開始されると、その後何らかの
条件で不整合が発生しても。
In such systems, consistency between the route information possessed by each station is extremely important, but in conventional methods, once the information exchange has finished and communication has begun, there may be some inconsistency due to some condition. Even if it occurs.

検出・回復する手段がなかった。There was no way to detect or recover.

この発明は上記の様な問題点を解消するためになされた
もので、従局がルート情報の不整合を検出できると共に
、ネットワーク内のルート情報の回復処理を容易1こ行
う事のできる通信システムを得ることを目的とする。
This invention was made in order to solve the above-mentioned problems, and provides a communication system in which slave stations can detect inconsistencies in route information and can easily recover route information within the network. The purpose is to obtain.

〔問題点8解決するための手段〕 この発明fこ係る通信システムでは、主局が従局fζ対
し、テ、 トのルート情報を使用しているかを周期的f
こ送信するものである。
[Means for Solving Problem 8] In this communication system, the master station periodically determines whether the master station is using the route information of T and T for the slave station fζ.
This is what is sent.

〔作用〕[Effect]

この発明における通信システムでは、従局は受信したル
ート情報を自局の使用している情報と比較する事ζζよ
り、情報の不一致を検出し、親局に対してルート情報送
信の要求を行う。
In the communication system according to the present invention, the slave station compares the received route information with the information used by its own station, detects a discrepancy in information, and requests the master station to transmit the route information.

〔実施例〕〔Example〕

以下、この発明の一実施例を図1ζついて説明する。 An embodiment of the present invention will be described below with reference to FIG. 1ζ.

第1図は1通信システムのネットワーク構成の一例であ
り1図において、(0)は主局、(l)〜(5)は従局
を表す。実線は現在使用されているルートを示し1点線
は使用可能なルートを示す。主局には。
FIG. 1 shows an example of the network configuration of one communication system. In FIG. 1, (0) represents a master station, and (l) to (5) represent slave stations. Solid lines indicate currently used routes, and dotted lines indicate available routes. For the main station.

ルート情報パターン■〜■が用意されている。Route information patterns ■ to ■ are prepared.

第2図は、ルート情報コード送信例である。FIG. 2 is an example of route information code transmission.

次に動作について説明する。第1図のネットワークにお
いて、主局(0)は第2図のルート[報パターンをすべ
て記憶している。従局は、システム起動時に使用するパ
ターンを主局からロードし記憶する。ルート情報パター
ンは、コード化されているO 主局は、子局に対し、現在使用しているルート情報コー
ドを周期的に送信する。従局は、主局の送信し1こコー
ドと、記憶するコードを比較し、一致すればそのルート
情報で通信を続ける。一致しない場合は、複数回同じコ
ードを受信した場合。
Next, the operation will be explained. In the network shown in FIG. 1, the main station (0) stores all the route patterns shown in FIG. The slave station loads and stores the pattern used at system startup from the master station. The route information pattern is coded O. The master station periodically transmits the currently used route information code to the slave stations. The slave station compares the first code transmitted by the master station with the code it stores, and if they match, it continues communication using that route information. If there is no match, if you receive the same code multiple times.

そのコードの示すルート(こルート変更されTこと判断
するが、そのコードを自局が記憶していないならば、主
局に対し、コードを送出し、ルート情報を送出する様に
要求する。主局は、コードを受信すると、そのコードに
対応したルート情報を従局に送出する。従局は、ルート
情報を受信すると。
The route indicated by the code (it is determined that this route has been changed), but if the local station does not have that code stored, it sends the code and requests the master station to send route information. When the station receives the code, it sends route information corresponding to the code to the slave station.When the slave station receives the route information, the station sends route information corresponding to the code to the slave station.

その情報1こ従って、ルート変更を行い、コードを記憶
する。
According to that information, the route is changed and the code is stored.

なお、上記実施例では、ルート変更の判断を。In addition, in the above embodiment, the decision to change the route is made.

異なるパターンの連続受信が8回であるとしたが。Assume that different patterns are received 8 times in succession.

適用するシステムの稼動率、重要性等lζ応じて判断す
る回数を設定すればよい。
The number of times the determination is made may be set depending on the operating rate, importance, etc. of the system to be applied.

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

以上の様に、この発明によれば、主局が、使用している
ルート情報パターンのコードを周期的に従局に送信して
いるので、従局は、ルートの変更を容易iζ検出し1回
復処理を行う事ができる。
As described above, according to the present invention, the master station periodically transmits the code of the route information pattern that it is using to the slave station, so that the slave station can easily detect a route change and perform the recovery process. can be done.

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

第1図は、この発明の一実施例fζよるネットワーク構
成図、第2図はルート情報コード送信例を示す図、第8
図は従来のネットワーク構成図である。 図中の(0)は主局、(1)〜(5)は従局を表し、■
〜■はルート情報パターンを示す。
FIG. 1 is a network configuration diagram according to an embodiment fζ of the present invention, FIG. 2 is a diagram showing an example of route information code transmission, and FIG.
The figure is a conventional network configuration diagram. In the figure, (0) represents the main station, (1) to (5) represent the slave stations, and ■
~ ■ indicates a route information pattern.

Claims (1)

【特許請求の範囲】[Claims] 主たる局とそれに従う1つ、又は複数の従局間で相互に
通信を行うシステムにおいて、各局に記憶された複数の
ルート情報によつて、ルートの変更を行う機能を持ち、
どのルートを使用するかの情報を主局から従局に周期的
に送信し、従局で受信された情報と複数回照合・判別し
、その結果によつてルートの切換えを行うことを特徴と
する通信システムのネットワーク管理手順。
In a system in which a main station and one or more slave stations that follow the main station communicate with each other, the system has a function to change the route based on multiple pieces of route information stored in each station,
Communication characterized by periodically transmitting information on which route to use from the master station to the slave station, comparing and determining the information received by the slave station multiple times, and switching the route based on the results. System network management procedures.
JP61209837A 1986-09-05 1986-09-05 Network management procedure for communication system Pending JPS6365750A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP61209837A JPS6365750A (en) 1986-09-05 1986-09-05 Network management procedure for communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP61209837A JPS6365750A (en) 1986-09-05 1986-09-05 Network management procedure for communication system

Publications (1)

Publication Number Publication Date
JPS6365750A true JPS6365750A (en) 1988-03-24

Family

ID=16579436

Family Applications (1)

Application Number Title Priority Date Filing Date
JP61209837A Pending JPS6365750A (en) 1986-09-05 1986-09-05 Network management procedure for communication system

Country Status (1)

Country Link
JP (1) JPS6365750A (en)

Similar Documents

Publication Publication Date Title
EP0784271B1 (en) Operation right interlinking method and cooperative working method for shared application programs
US5914939A (en) Automatic learning of network routing by exchanging route information
JPS6365750A (en) Network management procedure for communication system
US5479406A (en) Data communication system and method
JPH07141241A (en) Decentralized data base system management system
JPS63164737A (en) Network management method for communication system
JPS63160446A (en) Network management method for communication system
KR0174603B1 (en) How to restore the database of the exchange
JPH02217039A (en) Poling/selecting control procedure system
JP3345223B2 (en) Satellite communication method and central and terminal stations
EP0358293A3 (en) Local area system transport
JPS6367063A (en) Network managing procedure for communication system
JPS62100048A (en) System for sending large amount data in parallel
JPH04281638A (en) Configuration management system
JPH07141242A (en) Automatic file updating system
JP2716307B2 (en) Local area network system
JP2566350B2 (en) Data way device
JPS5824985B2 (en) Polling Address Kenshiyutsuhoshiki
JPS61224543A (en) System for managing identifier
JPH0442877B2 (en)
JPH04172032A (en) Polling control system
JPH11316717A (en) Data transfer system
JPS59161952A (en) Establishment of communication path
JPH05324505A (en) Method and system for file transfer
JPS62192827A (en) File transmitting system