JPS60214137A - Network management system - Google Patents

Network management system

Info

Publication number
JPS60214137A
JPS60214137A JP59070406A JP7040684A JPS60214137A JP S60214137 A JPS60214137 A JP S60214137A JP 59070406 A JP59070406 A JP 59070406A JP 7040684 A JP7040684 A JP 7040684A JP S60214137 A JPS60214137 A JP S60214137A
Authority
JP
Japan
Prior art keywords
address
station
slave station
random value
master station
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
JP59070406A
Other languages
Japanese (ja)
Inventor
Tetsuya Mori
哲也 森
Kenzo Kobayashi
賢造 小林
Hiromi Suzuki
宏実 鈴木
Junko Oshima
順子 大島
Katsumi Kamihatsu
神初 嘉津美
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.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP59070406A priority Critical patent/JPS60214137A/en
Publication of JPS60214137A publication Critical patent/JPS60214137A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)

Abstract

PURPOSE:To attain ease of new installation or transfer of a slave station by adding a mixture preventing portion to a registration request address at a slave station, transmits the result to a master station and alloowing the master station to add the address of the slave station and the mixture preventing portion to the information representing propriety of registration and transmit the result to the slave station. CONSTITUTION:When a slave station is connected newly to a communication network NW in the NW comprising one master station and plural slave stations, the slave station sets optionally the address of the own station, the set address passes through a switch 13, a registration processing section 11 adds a random value of the mixture preventing portion generated from a random value generating section 10, it is transmitted to the master station through a switch 14 and the random value is stored in a storage section 12. The master station collates an address table 23, the transmitted address is used by the NW, whether it is not registered previously is checked, a command processing section 21 adds an OK signal to the random value and address value of the slave station read by the storage section 22 and transmits the result to the slave station. The slave station uses an output of an AND 16 between the random value added by the master station and the value from the storage section 12 to close a switch 15 and receives the signal.

Description

【発明の詳細な説明】 (al 発明の技術分野 本発明はネットワーク管理方式に係り、特にアドレスが
任意に選択できる専用システムに使用するネットワーク
管理方式に関するものである。
DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention relates to a network management system, and particularly to a network management system used in a dedicated system in which addresses can be arbitrarily selected.

(b) 従来技術と問題点 従来の子局に対するネットワーク管理方式としては、新
しく子局をネットワークに接続する場合はネットワーク
管理者(保守者)がオフラインで管理しその情報を親局
に登録する方法と、子局よりオンラインで予め割り付け
られたアドレスを登録する方法がある。
(b) Prior art and problems The conventional network management method for slave stations is that when a new slave station is connected to the network, a network administrator (maintainer) manages it offline and registers the information in the master station. Alternatively, there is a method of registering a pre-assigned address online from a slave station.

前者の場合はオフラインで行うのでリアルタイム性に欠
けると共に保守者が重複しない様にアドレスを管理する
為に全ての子局は保守者を通じてアドレスを貰わなけれ
ばならないし、自分が付けたいアドレスが付けられず自
由度に欠けると云う問題があった。
In the former case, since it is done offline, there is a lack of real-time performance, and in order for the maintainer to manage the addresses so that there are no duplicates, all slave stations must receive addresses through the maintainer, and the address that you want to assign can be assigned. There was a problem that there was a lack of freedom.

一方、後者の場合は子局はオンラインで自由に親局にア
ドレスできるが、子局のアドレスが重複しない様にする
為には前者と同じく子局のアドレスは任意のアドレスを
付加できないし、又オンラインで行う為にアドレスの二
重登録の危険性があると云う問題点があった。
On the other hand, in the latter case, the slave station can freely address the master station online, but in order to prevent the addresses of the slave stations from duplicating, as in the former case, it is not possible to add any arbitrary address to the address of the slave station, and There was a problem in that because it was done online, there was a risk of double address registration.

(C1発明の目的 本発明は上記従来技術の問題に鑑みなされたものであっ
て、子局の新設、移設を容易にすると共に比較的自由度
が高く且つリアルタイム性のあるネットワーク管理方式
を提供する事を目的とじている。
(C1 Purpose of the Invention The present invention has been made in view of the problems of the prior art described above, and provides a network management system that facilitates the installation and relocation of slave stations, has a relatively high degree of freedom, and is capable of real-time performance. Aiming for something.

tdl 発明の構成 上記発明の目的は一台の親局と複数台の子局によって構
成される通信ネットワークシステムに於て、子局では登
録要求するアトlメスに混在防止部分をイ1加して親局
に送出し、親局では該アドレスをチェックして登録の可
否の情報に該アドレス及び該混在防止部分を付加して子
局に送出する様にした事を特徴とネソ[ワ−り管理方式
を促供する事により達成される。
tdl Structure of the Invention The object of the above invention is to provide a communication network system consisting of one master station and a plurality of slave stations, by adding a mixing prevention part to the AT female that requests registration in the slave stations. The main station checks the address, adds the address and the mixing prevention part to the information on whether or not it can be registered, and sends it to the slave station. This is achieved by promoting methods.

(e)発明の実施例 第1図は通信ネ、・トワークシステムの構成例を示す。(e) Examples of the invention FIG. 1 shows an example of the configuration of a communication network system.

図中、1は親局を、2〜4は子局を、5は伝送路をそれ
ぞれを示す。
In the figure, 1 indicates a master station, 2 to 4 indicate slave stations, and 5 indicates a transmission path.

同図に於て、同一・の通信ネノ1−ワーク内に親局1、
子局2へ4が存在1〜、親局1でη理された子局2へ4
のアルレスを用いて各局間の通信が行われる。
In the same figure, the master station 1,
4 to slave station 2 exists 1~, 4 to slave station 2 processed by master station 1
Communication between each station is performed using the Arres.

第2図は本発明を実施する為の子局側ランダム値発生・
検出部の一例を示す。
Figure 2 shows the slave station random value generation and
An example of a detection unit is shown.

第3図は本発明を実施する為の親局側アト[・ス・ラン
ダム値処理部の−・例を示す。
FIG. 3 shows an example of a random value processing section on the master station side for implementing the present invention.

第4図は第2図及び第3図すこ示j〜だ装置を用いて行
われるアドレス登録手順例を説明する為の図である。
FIG. 4 is a diagram for explaining an example of an address registration procedure performed using the apparatuses shown in FIGS. 2 and 3.

、二こで、第2図中、10はランダム植発住部を、11
は登録処理部を、12はランダム値記憶部を、13−1
5はスイッチ部を、lfiはアンド回路を、17〜2゜
は端子をそれぞれ示す。
, 2. In Figure 2, 10 is the random vegetation area, and 11 is the random vegetation area.
12 represents a registration processing unit, 12 represents a random value storage unit, and 13-1 represents a registration processing unit.
5 represents a switch section, lfi represents an AND circuit, and 17-2° represents a terminal.

第3図中、21はコマンド処理部を、22はランダム値
記憶部を、23はアドレステーブル部を、24及び25
は端子をそれぞれ示す。
In FIG. 3, 21 is a command processing section, 22 is a random value storage section, 23 is an address table section, 24 and 25
indicate the respective terminals.

次に、第2図及び第3図の動作を第4図及び第5図を参
考にしながら説明する。
Next, the operations in FIGS. 2 and 3 will be explained with reference to FIGS. 4 and 5.

先ず第2図に示す子局に於て、子局2がネットワークに
新規に接続されその情報を親局1に通知rる場合、先ず
子局2はネノj・ワークア1ルス体系下の中で自局のア
トlメスを任意に設定する。
First, in the slave station shown in Fig. 2, when the slave station 2 is newly connected to the network and notifies the master station 1 of the information, the slave station 2 first connects to the network and notifies the master station 1 of the information. Set your own station's AT female as desired.

任意に設定されたアト1ノスは端子17がらス仁)千部
13を通って登録処理部11でランダム値発生部10よ
り自動的に発件されたランダム値(特許請求の範囲に記
載された混在防止部分の一例)が後に(J加され、ス・
インチ部14を通って端子19より親局1に送出される
(第5図■参照)。
The arbitrarily set at1nos is a random value automatically generated by the random value generation section 10 in the registration processing section 11 through the terminal 17 and the random value generation section 10 (as described in the claims). (Example of mixing prevention part) is added later (J is added,
It passes through the inch part 14 and is sent to the master station 1 from the terminal 19 (see FIG. 5).

尚、子局で発4.したランダム値はランダム値記憶部1
2に記憶される。
In addition, the slave station issues 4. The random value is stored in the random value storage unit 1.
2 is stored.

次に、第3図に示した親局では端子25より入力された
子局2のアドレス及びランダム値のうちア[・レスが下
記の条件を満足しているかと・うかをチェックする。
Next, the master station shown in FIG. 3 checks whether the address of the slave station 2 and the random value input from the terminal 25 satisfy the following conditions.

(1) ごのネットワークで使用できるアトlメスであ
るかど・)か。
(1) Is it an AT female that can be used in your network?

(2) アドレスが先に登録されたものと重複していな
いかどうか。
(2) Whether the address is a duplicate of a previously registered address.

これば、アドレステーブル部23にあるアドレスと照合
して行う。
This is done by comparing the address with the address in the address table section 23.

上記の2つの条イ?1を満足していれば、親局はランダ
ム値記憶部22より読出された子局2のランダム値とア
トlメスにOKの信号を、既に登録されてぃればNoの
信号をコマンド処理部21でイ」加して−r局2に送出
する(第5図■参照)。
The above two articles? 1, the master station sends the random value of the slave station 2 read from the random value storage unit 22 and an OK signal to the AT female, and if it has already been registered, sends a NO signal to the command processing unit. At step 21, the signal is added and sent to -r station 2 (see Figure 5).

第2図に示ず子局−Cは、端子20に加えられた親。A slave station-C not shown in FIG. 2 is a parent station added to the terminal 20.

局1よりの信号はアンド回路16でこの信号の中に含ま
れるランダム値と、ラングJ、イ直記憶部12より読出
された登録コマンド送信時のラング!、値を比較して一
致していればスイッチ部15はオンになる。
The signal from station 1 is processed by an AND circuit 16, which combines the random value contained in this signal, rung J, and rung! , the values are compared and if they match, the switch section 15 is turned on.

そこで、端子20と18が接続され端イ111に接続さ
れている検出回路(図示せず)で親局に送出しムーアl
゛レスが親局に登録された。ヌは登録されなかったと云
う事が検出される(第5図■参照)。
Therefore, a detection circuit (not shown) connected to terminals 20 and 18 and connected to terminal A111 sends a signal to the master station.
゛Response has been registered to the master station. It is detected that ``nu'' has not been registered (see Figure 5 ■).

登録されれば、スイッチ部13及び14目オンになり端
子17と19が接続され通信が可能となる。
Once registered, switch sections 13 and 14 are turned on, terminals 17 and 19 are connected, and communication becomes possible.

上記と同じ手順で他の子局もアドレスを登録する(第5
図■及び■参照)。
Register addresses for other slave stations using the same procedure as above (5th
(See Figures ■ and ■).

若し、同一・アトlメスで登録依頼が重なった時は親局
1は子局2の依頼を受付し1てそれに対する(I K応
答を登録依頼時に受けたランダム値及びアルレスに付加
して送出する。
If there are duplicate registration requests for the same address/female, master station 1 will accept the request from slave station 2 and respond to it (adding the IK response to the random value and address received at the time of the registration request). Send.

そこで、子局2は前記の様にOKK応答検出する事がで
きるが、例えば子局3は登録依頼時のランダム値と異な
る為にスイッチ部15はオンとならず親局1よりのOK
倍信号検出する事が出来ない。
Therefore, the slave station 2 can detect the OK response as described above, but for example, since the random value of the slave station 3 is different from the one at the time of the registration request, the switch unit 15 will not be turned on and the OK response from the master station 1 will not be turned on.
Unable to detect double signal.

そこで、アドレスの登録を再度要求しなければならない
Therefore, you must request address registration again.

第5図はフレームフォーマットの一例ヲ示ス。Figure 5 shows an example of the frame format.

同図に於て、Fo及びFcは同期用フラグを、八は相手
局アドレスを、Cは制御悄@(例えば登録をしたい又は
OK等)を、SAは自局アドレスを、RDはランダム値
を、Fcsは誤り検出符号をそれぞれ示す。このフレー
ムブーマットに従って子局よりのアドレス登録及び親局
よりの応答が行われる。
In the figure, Fo and Fc are the synchronization flags, 8 is the partner station address, C is the control @ (for example, want to register or OK, etc.), SA is the own station address, and RD is the random value. , Fcs indicate error detection codes, respectively. Address registration from the slave station and response from the master station are performed according to this frame boot mat.

ffl 発明の詳細 な説明した様に、本発明によれば子局が新設/移設等で
アドレスが変化する時に該子局より親局に対してアドレ
スの登録依頼を行わなければならない。
ffl As described in detail, according to the present invention, when the address of a slave station changes due to new installation/relocation, etc., the slave station must request the master station to register the address.

この時、子局側でネットワークアドレス体系下の任意の
アドレスとランダム値を付加して送信し、親局では二重
登録をチェックすると共に同一アドレスの登録が複数子
局より行われた場合にもランダム値を付加する事により
二重登録の阻止が行える様にした。
At this time, the slave station sends an arbitrary address under the network address system and a random value, and the master station checks for double registration and also checks if the same address is registered by multiple slave stations. Double registration can be prevented by adding a random value.

この為、ネットワークの運用を安全且つ効率良く行う事
ができる。
Therefore, the network can be operated safely and efficiently.

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

第1図は通信ネットワークシステムの構成例を、第2図
は本発明を実施する為の子局側ランダム値発生・検出部
を、第3図は親局アドレス・ランダム値処理部を、第4
図はアドレス登録手順例を、第5図はフレームフォーマ
ットの一例をそれぞれ示す。 図中、10はランダム値発生部を、11は登録処理部を
、12及び22はランダム値記憶部を、1〜〜15はス
イッチ回路を、16はアンド回路を、21はコマンド処
理部を、23はアドレステーブル部を、17〜20及び
24.25は端子をそれぞれ示す。 代理人 弁理士 検量 宏四部Q
Fig. 1 shows an example of the configuration of a communication network system, Fig. 2 shows a slave station random value generation/detection unit for carrying out the present invention, Fig. 3 shows a master station address/random value processing unit, and Fig. 4 shows a master station address/random value processing unit.
The figure shows an example of an address registration procedure, and FIG. 5 shows an example of a frame format. In the figure, 10 is a random value generation section, 11 is a registration processing section, 12 and 22 are random value storage sections, 1 to 15 are switch circuits, 16 is an AND circuit, 21 is a command processing section, 23 represents an address table section, and 17 to 20 and 24.25 represent terminals, respectively. Agent Patent Attorney Calibration Koshibe Q

Claims (1)

【特許請求の範囲】[Claims] 1台の親局と複数台の子局によって構成された通信ネッ
トワークシステムに於て、子局では登録要求するアドレ
スに混在防止部分を付加して親局に送出し、該親局では
該アドレスをチェックして登録の可否の情報に該アドレ
ス及び該混在防止部分を付加して該子局に送出する様に
した事を特徴とするネットワーク管理方式。
In a communication network system composed of one master station and multiple slave stations, the slave station adds a mix prevention part to the address to request registration and sends it to the master station, and the master station then sends the address to the master station. A network management method characterized in that the address and the mixture prevention part are added to the information on whether or not registration is possible after checking, and the information is sent to the slave station.
JP59070406A 1984-04-09 1984-04-09 Network management system Pending JPS60214137A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP59070406A JPS60214137A (en) 1984-04-09 1984-04-09 Network management system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP59070406A JPS60214137A (en) 1984-04-09 1984-04-09 Network management system

Publications (1)

Publication Number Publication Date
JPS60214137A true JPS60214137A (en) 1985-10-26

Family

ID=13430550

Family Applications (1)

Application Number Title Priority Date Filing Date
JP59070406A Pending JPS60214137A (en) 1984-04-09 1984-04-09 Network management system

Country Status (1)

Country Link
JP (1) JPS60214137A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS62159936A (en) * 1986-01-08 1987-07-15 Sharp Corp Detecting system for duplicated address of transmission line
JPH03106143A (en) * 1989-09-19 1991-05-02 Omron Corp Communication fault check method in data communication system
JPH03127531A (en) * 1989-10-13 1991-05-30 Matsushita Electric Ind Co Ltd Address setting method

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5836048A (en) * 1981-08-27 1983-03-02 バロ−ス・コ−ポレ−シヨン Station in communication network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS5836048A (en) * 1981-08-27 1983-03-02 バロ−ス・コ−ポレ−シヨン Station in communication network

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS62159936A (en) * 1986-01-08 1987-07-15 Sharp Corp Detecting system for duplicated address of transmission line
JPH0564898B2 (en) * 1986-01-08 1993-09-16 Sharp Kk
JPH03106143A (en) * 1989-09-19 1991-05-02 Omron Corp Communication fault check method in data communication system
JPH03127531A (en) * 1989-10-13 1991-05-30 Matsushita Electric Ind Co Ltd Address setting method

Similar Documents

Publication Publication Date Title
US5991828A (en) System for automatically connecting portable device to network using network environment information including domain name of naming device and community name of network management protocol
US4814984A (en) Computer network system with contention mode for selecting master
JPS6215950A (en) Data transmission control system
CA2050012A1 (en) Controller architecture for rf trucking distributed multisite switch
DE69838902T2 (en) EQUIPMENT OF WIRELESSLY CONNECTED EQUIPMENT
JPS60214137A (en) Network management system
JPS60246146A (en) Data transmission control system
KR20070097784A (en) Duplexing method and system in wireless telecommunication system
JP2000293496A (en) Decentralizing device for service load of network
JPS60246148A (en) Data transmission control system
JPS61256846A (en) Network system
JPS61222341A (en) Address setting system
CN106453093A (en) Port isolation method and apparatus
JPS6025352A (en) Data communication system
JPH07303111A (en) Communication method
JPS60198936A (en) Device address managing system
JPH03226140A (en) Data transmission system
JPS59161952A (en) Establishment of communication path
JPH0468936A (en) Address management system in local area network
Oestreicher A simple reliable globally-ordered broadcast service
JPS59119463A (en) Back-up system of terminal trouble
JPH0818585A (en) Loop network
JPH0420143A (en) Multi-address communication replay system and its circuit
JPS6085646A (en) Data transmission system
JPH01171343A (en) Connection order check system in loop type network system