JPS62216542A - Routing system - Google Patents

Routing system

Info

Publication number
JPS62216542A
JPS62216542A JP61058074A JP5807486A JPS62216542A JP S62216542 A JPS62216542 A JP S62216542A JP 61058074 A JP61058074 A JP 61058074A JP 5807486 A JP5807486 A JP 5807486A JP S62216542 A JPS62216542 A JP S62216542A
Authority
JP
Japan
Prior art keywords
manager
communication
network connection
communication medium
routing
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
JP61058074A
Other languages
Japanese (ja)
Inventor
Yoichi Oteru
大照 洋一
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.)
NEC Corp
Original Assignee
NEC 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 NEC Corp filed Critical NEC Corp
Priority to JP61058074A priority Critical patent/JPS62216542A/en
Publication of JPS62216542A publication Critical patent/JPS62216542A/en
Pending legal-status Critical Current

Links

Landscapes

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

Abstract

PURPOSE:To improve the utilizing efficiency by providing a sole manager to each communication medium to constitute a channel of logical direction not including a closed path directed to each manager from all communication media corresponding to each manger and to eliminate the need for the information relating to the location of a designation terminal thereby forming the shortest path routing. CONSTITUTION:Network connection equipments 1-5-1-9 have a terminal table belonging to communication media 1-1-1-4 assigned to each manager sent from the managers 1-11-1-13 in addition to a routing table. Each network connection device indexes the routing table corresponding to a link receiving a reception information frame and seeks a manager which is in charge of reception. If the manager is not listed in the routing table, the received information frame is renounced. When the manager is listed, the received information frame is transmitted from a corresponding transmission link. Thus, no special information and operation is not required for the terminal and an efficient routing system is obtained.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、複数の同報性を有する通信媒体が複数の網接
続装置によって接続された通信網におけるルーティング
方式に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a routing system in a communication network in which a plurality of communication media having broadcast properties are connected by a plurality of network connection devices.

〔従来の技術〕[Conventional technology]

複数の同報性を有する通信媒体が複数の網接続装置によ
って接続された通信網におけるルーティング方式として
は従来多くの方式が考えられているが、それらは大きく
2つのグループに分けられる。
Many routing methods have been considered in the past for communication networks in which a plurality of communication media having broadcasting properties are connected by a plurality of network connection devices, but they can be broadly divided into two groups.

一方のグループは送信元の端末が宛先端末への通信ルー
トを予め知っていてその通信経路上の網接続装置の情報
を始めから情報フレーム内に入れて送信する方式である
。この方式では各端末が、宛先となる全ての端末へのル
ート情報を保持している必要があり、コンフィグレイシ
ョンが頻繁に変わる例えばローカルエリアネットワーク
などには適さない。
One group is a method in which the source terminal knows the communication route to the destination terminal in advance and transmits information about the network connection devices on the communication route by putting it into an information frame from the beginning. This method requires each terminal to hold route information to all destination terminals, and is not suitable for, for example, a local area network where the configuration changes frequently.

他方のグループは、各端末には一切ルーテイングに関す
る情報を保持していることを要求せず、あたかもすべて
の端末が同一の通信媒体を介して接続されているように
見えることを目上した方式であり、この方式は各端末の
負担も小さく、コンフィグレイションの変わりやすいシ
ステムには向いている。そのような方式としては例えば
、各網接続装置が受信した全ての情報フレームを宛先に
関係なく受信したリンク以外の全てのリンクに送出する
方式が考えられるが、この方式では通信路に閉路があっ
た場合重複受信を生じるため各端末の処理の負担が大き
い。上記方式の重複受信を回避する方法としては、物理
的には閉路を有する通信路上に、閉路を含まない木構造
の論理的通信路を構成しその上で上記方式と同じ手続き
を行う方式が考えられる。この方法について第2図を用
いて説明する。
The other group does not require each terminal to maintain any routing information, but instead aims to make it appear as if all terminals are connected via the same communication medium. This method places less burden on each terminal and is suitable for systems where the configuration is easy to change. An example of such a method is a method in which all information frames received by each network connection device are sent to all links other than the link from which they were received, regardless of the destination. However, in this method, the communication path is closed. In this case, duplicate reception occurs, which places a heavy processing burden on each terminal. A possible method to avoid duplicate reception in the above method is to construct a tree-structured logical communication path that does not include a closed path on a communication path that physically has a closed path, and then perform the same procedure as the above method. It will be done. This method will be explained using FIG. 2.

第2図(a)、  (b)において、2−1〜2−4は
同報性ををする通信媒体、2−5〜2−9は網接続装置
である。第2図(a)は全体として物理的な閉路ををす
る通信網である。第2図(b)は、第2図(a)の通信
網上に構成された閉路を含まない論理的通信路である。
In FIGS. 2(a) and 2(b), 2-1 to 2-4 are communication media that perform broadcasting, and 2-5 to 2-9 are network connection devices. FIG. 2(a) shows a communication network that has a physically closed circuit as a whole. FIG. 2(b) shows a logical communication path that does not include a cycle and is configured on the communication network of FIG. 2(a).

つまり第2図(b)の論理的通信路は第2図(a)の網
接続装置2=8および2−9を用いない事により閉路が
できるのを防いでいる。
In other words, the logical communication path of FIG. 2(b) is prevented from forming a closed circuit by not using the network connection devices 2=8 and 2-9 of FIG. 2(a).

〔発明が解決しようとする問題点] しかしこのような方式では例えば通信媒体2−3に接続
された端末から通信媒体2−4に接続された端末へ送ら
れる情報フレームは、物理的には網接続装置2−9を介
して直接送れる通信路が存在するにも拘わらず、網接続
装置2−6.2−5および2−7を介して通信媒体2−
1および2−2を経由していわば遠回りして届けられる
ことになり、これは通信媒体の使用効率からもむだであ
り、また特定の通信媒体の輻較の原因にもなり好ましく
ない。この例でいえば通信媒体2−3上の端末と通信媒
体2−4上の端末同士の通信は網接続装置2−9を介し
て行われるのが好ましく、全ての端末間の通信において
各々の最短経路を用いるルーティング方式が望ましい。
[Problems to be Solved by the Invention] However, in such a system, for example, an information frame sent from a terminal connected to communication medium 2-3 to a terminal connected to communication medium 2-4 is not physically connected to the network. Despite the existence of a communication path that can be sent directly via the connection device 2-9, the communication medium 2-6 is transmitted via the network connection devices 2-6, 2-5 and 2-7.
1 and 2-2, and this is not preferable since it is wasteful in terms of communication medium usage efficiency and also causes a conflict between specific communication media. In this example, communication between the terminals on the communication medium 2-3 and the terminals on the communication medium 2-4 is preferably performed via the network connection device 2-9, and in communication between all terminals, each A routing method that uses the shortest path is desirable.

本発明の目的は、複数の同報性を有する通信媒体と複数
の網接続装置とからなる通信網において、各端末は宛先
端末の位置に関する情報を一切必要とせず、しかも最短
経路ルーティングを可能とするルーティング方式を提供
することである。
An object of the present invention is to provide a communication network consisting of a plurality of broadcasting communication media and a plurality of network connection devices, in which each terminal does not require any information regarding the location of a destination terminal, and moreover, enables shortest route routing. The objective is to provide a routing method for

〔発明の構成〕[Structure of the invention]

本発明は、複数の同報性を有する通信媒体が複数の網接
続装置によって接続された通信システムにおけるルーテ
ィング方式において、各通信媒体に唯一のマネージャー
を設け、各マネージャー対応に、全ての通信媒体から各
マネージャーに向かう閉路を含まない論理的方向付き通
信路を構成し、各マネージャーは自分の受け持ちの通信
媒体に直接接続された端末のアドレスを全ての網接続装
置に知らせ、順接続装置においては、受信した情報フレ
ームの宛先アドレスを調べ、その宛先アドレスの受け持
ちのマネージャーに対応した論理的方向付き通信路に従
って受信情報フレームの方路を決定することを特徴とす
る。
The present invention provides a routing method for a communication system in which a plurality of communication media having broadcasting properties are connected by a plurality of network connection devices, in which a unique manager is provided for each communication medium, and a manager is assigned to all communication media for each manager. A logical directional communication path that does not include a closed circuit is configured toward each manager, and each manager notifies all network connection devices of the addresses of terminals directly connected to the communication medium for which it is responsible. The method is characterized in that the destination address of the received information frame is checked, and the route of the received information frame is determined in accordance with the logical directional communication path corresponding to the manager in charge of the destination address.

〔作用〕[Effect]

以下本発明の原理を詳細に説明する。以後順接続装置と
各通信媒体との接続部をリンクと呼ぶことにし、また説
明のため各図において各順接続装置の上側のリンクをリ
ンクl、下側のリンクをリンク2と呼ぶことにする。ま
たここでは、最烟経路とは送信端末から宛先端末に達す
るまでに経由する網接続装置の数つまりホップ数が最小
という意味で用いることにする。
The principle of the present invention will be explained in detail below. Hereinafter, the connection between the sequential connection device and each communication medium will be called a link, and for the sake of explanation, the upper link of each sequential connection device will be called link 1 and the lower link will be called link 2 in each figure. . Furthermore, here, the term "the worst route" is used to mean the minimum number of network connection devices, that is, the minimum number of hops, from the sending terminal to the destination terminal.

本発明によれば、各通信媒体に唯一のマネージャーと呼
ぶ特別な局を設け、各マネージャー対応に、全ての通信
媒体から各マネージャーに向かう閉路を含まない論理的
方向付き通信路を構成することが必要である。基本的に
は、閉路を含まない論理的な通信路を構成するには、各
通信媒体ごとにその通信媒体に接続されている網接続装
置の内から、通信媒体上を流れる情報フレームを受信し
て他の通信媒体へ送信する役割を行う網接続装置を1つ
ずつ選ばなければならない。そのような網接続装置を各
通信媒体の責任接続装置と呼ぶことにする。各マネージ
ャーに向かう最短経路の通信路を構成するには、特に各
通信媒体に接続されている複数の網接続装置の内からマ
ネージャーへのホップ数が一番小さい網接続装置を、通
信媒体のマネージャー対応の責任接続装置に選べばよい
According to the present invention, a special station called a unique manager is provided for each communication medium, and a logical directional communication path that does not include a closed path from all communication media to each manager can be configured for each manager. is necessary. Basically, to configure a logical communication path that does not include a closed circuit, information frames flowing on the communication medium must be received from the network connection device connected to the communication medium for each communication medium. The network connection devices responsible for transmitting data to other communication media must be selected one by one. Such a network connection device will be referred to as a connection device responsible for each communication medium. In order to configure the shortest communication path to each manager, select the network connection device with the smallest number of hops to the manager from among the multiple network connection devices connected to each communication medium as the communication medium's manager. All you have to do is choose the corresponding responsible connection device.

各マネージャー対応の各通信媒体の責任接続装置を選ぶ
には例えば次のようにすればよい。各マネージャーは、
自分のアドレスを書き込んだ方路決定用フレームを、全
ての網接続装置間で定められた特定のグループアドレス
を宛先として用いて送信する。方路決定用フレームには
送信元マネージャーへのホ・71数を書く場所を設け、
送信元マネージャーはそこに0を書いておく。この方路
決定用フレームを受信した網接続装置はそのフレームに
書き込まれたホップ数を読んで、もしそのホップ数がそ
の受信したリンクでそれまでに受信されたそのマネージ
ャーからの方路決定用フレームに書かれていたホ・71
数よりも小さい時にだけその受信フレームをその受信し
たリンク番号と共に記録すると共に、フレーム内のポツ
プ数の値を1つ増して受信した以外の全てのリンクに送
信する。
For example, the following procedure may be used to select the connection device responsible for each communication medium corresponding to each manager. Each manager is
A route determination frame with its own address written therein is transmitted using a specific group address determined between all network connection devices as the destination. In the frame for determining the route, there is a place to write the number 71 for the sender manager.
The source manager writes 0 there. The network connection device that receives this routing frame reads the number of hops written in the frame, and if the number of hops is equal to the number of routing frames previously received from the manager on the received link. It was written 71
Only when the received frame is smaller than the received link number, the received frame is recorded together with the received link number, and the value of the pop number in the frame is incremented by one and transmitted to all links other than the received link.

この様にして、網接続装置を1つ経るたびに、方略決定
用フレーム内に書き込まれたホップ数は1つずつ大きく
なるが、通信システムの大きさによって予め定められた
ある特定の値以上のホップ数が害かれたフレームを受信
した網接続装置は受信したフレームを廃棄する。以上の
操作の結果、ある特定の時間経過後に、各網接続装置は
記録された方路決定用フレームより各マネージャーへの
自分のホップ数を決める。各マネージャーへの自分のホ
ップ数は、受信したマネージャーからの方路決定用フレ
ームに書かれたホップ数の一番小さい値に1を足したも
のとする。自分のホップ数よりも小さいホップ数が書か
れた方路決定用フレームを受信したリンクが接続されて
いる通信媒体には、自分よりそのマネージャーに近い網
接続装置があるか又はそのマネージャーが直接接続され
ているので、その通信媒体の責任接続装置にはなれない
In this way, the number of hops written in the strategy determination frame increases by one each time it passes through one network connection device, but the number of hops written in the strategy determination frame increases by one, but if A network connection device that receives a frame with a damaged hop count discards the received frame. As a result of the above operations, after a certain period of time has elapsed, each network connection device determines the number of hops to each manager from the recorded route determination frame. The number of hops to each manager is determined by adding 1 to the smallest number of hops written in the received route determination frame from the manager. The communication medium to which the link that received the route determination frame with the hop count smaller than the own hop count is connected has a network connection device that is closer to the manager than itself, or the manager is directly connected. Since the communication medium is connected, it cannot be the responsible connecting device for that communication medium.

そのような通信媒体に接続されたリンクをマネージャー
側リンクと呼ぶことにする。自分のホップ数よりも大き
いホップ数が書かれた方路決定用フレームしか受信しな
かったリンクに接続された通信媒体には、自分が一番近
いことがわかるのでその通信媒体の責任接続装置となる
。もし自分のポツプ数と同じホップ数が書かれた方路決
定用フレームを受信したリンクに関しては、その接続さ
れた通信媒体に自分と同じホップ数の網接続装置が他に
も存在するので、その場合は競合解消用の規則を設けて
一つの網接続装置を責任接続装置として選ぶ。競合解消
用の規則としては、例えば各網接続装置に固有のアドレ
スを用いてこのアドレスの一番小さいものを責任接続装
置として選ぶのでも良い。
A link connected to such a communication medium will be referred to as a manager-side link. If a communication medium connected to a link that only received a route determination frame with a hop count greater than your own hop count knows that you are the closest, it will be assigned the responsibility of that communication medium. Become. If a link receives a route determination frame with the same number of hops as its own, there is another network connection device with the same number of hops on the connected communication medium. In this case, a conflict resolution rule is established to select one network connection device as the responsible connection device. As a rule for conflict resolution, for example, a unique address may be used for each network connection device, and the one with the smallest address may be selected as the responsible connection device.

以上の様にして各マネージャー対応に各通信媒体に唯一
の責任接続装置が選ばれる。各網接続装置は各マネージ
ャーごとにマネージャー側リンクと責任接続装置となっ
ている通信媒体側のリンクを知り、マネージャー側リン
クを送出側、責任装置となっている通信媒体側のリンク
を受信側とすることにより、各マネージャーに向かう最
短ホップ数の閉路を含まない論理的方向付き通信路が構
成される。
In this manner, a unique connection device responsible for each communication medium is selected for each manager. Each network connection device knows the manager side link and the link on the communication medium side that is the responsible connection device for each manager, and the manager side link is known as the sending side and the link on the communication medium side that is the responsible device as the receiving side. By doing this, a logical directional communication path that does not include a cycle with the shortest number of hops toward each manager is constructed.

〔実施例〕〔Example〕

以下本発明の実施例を図を用いて説明する。 Embodiments of the present invention will be described below with reference to the drawings.

第3図は、第2図(a)に示した通信網の各通信媒体に
マネージャーを設けた通信網を示す。第3図において、
1−1〜1−4は通信媒体、1−5〜l−9は網接続装
置、1−1O〜1−13はマネージ、【・−である。こ
の通信網に上述の方法を適用して構成した、各マネージ
ャーへ向かう最短経路の閉路を含まない論理的方向付き
通信路を第1図に示す。
FIG. 3 shows a communication network in which a manager is provided for each communication medium of the communication network shown in FIG. 2(a). In Figure 3,
1-1 to 1-4 are communication media, 1-5 to l-9 are network connection devices, 1-1O to 1-13 are managers, and [.--. FIG. 1 shows a logically directional communication path that does not include a shortest path to each manager and that is configured by applying the above-described method to this communication network.

第1図(a)はマネージャー1−10、第1図(b)は
マネージャー1−11、第1図(C)はマネージャー1
−12、第1図(d)はマネージャー1−13へ向かう
論理的通信路である。第1図の各網接続装置がルーティ
ング用に各々保持しているルーティングテーブルの内容
を表1に示す。
Figure 1(a) is manager 1-10, Figure 1(b) is manager 1-11, and Figure 1(C) is manager 1.
-12, FIG. 1(d) is a logical communication path toward the manager 1-13. Table 1 shows the contents of the routing tables held by each network connection device in FIG. 1 for routing.

表1 各網接続装置は表1で示したルーティングテーブル以外
に、各マネージャーから送られた各マネージャーの受け
持ちの通信媒体に属する端末の表を保持している。各網
接続装置は自分の接続している通信媒体上を流れる全て
の情報フレームを一度受信し、この受信情報フレームの
宛先アドレスから上記表を引き、宛先端末の受け持ちの
マネージャーを知る。次にこの受信情報フレームを受信
したリンクに対応したルーティングテーブルを引き、受
け持ちのマネージャーを捜す。もし受け持ちのマネージ
ャーがルーティングテーブルに載っていない時には受信
した情報フレームを廃棄する。
Table 1 In addition to the routing table shown in Table 1, each network connection device maintains a table of terminals belonging to the communication medium assigned to each manager, which is sent from each manager. Each network connection device once receives all the information frames flowing on the communication medium to which it is connected, looks up the above table from the destination address of this received information frame, and learns the manager in charge of the destination terminal. Next, it looks up the routing table corresponding to the link that received this received information frame and searches for the manager in charge. If the responsible manager is not listed in the routing table, the received information frame is discarded.

もし受け持ちのマネージャーが載っていたときは対応す
る送出リンクから受信した情報フレームを送信する。
If the manager in charge is listed, the information frame received from the corresponding sending link is sent.

[発明の効果〕 以上説明した通り本発明によれば、端末には一切特別な
情報及び動作を必要とせずしかも効率のよいルーティン
グ方式が得られる。
[Effects of the Invention] As explained above, according to the present invention, an efficient routing system that does not require any special information or operation at the terminal can be obtained.

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

第1図は本発明の実施例における論理的通信路を示す図
、 第2図は従来の方法を説明するだめの説明図、第3図は
各通信媒体にマネージャーを設けた通信網を示す図であ
る。 1−1〜1−4および2−1〜2−4 ・・・・・通信媒体 1−5〜1−9および2−5〜2−9 ・・・・・網接続装置
FIG. 1 is a diagram showing a logical communication path in an embodiment of the present invention, FIG. 2 is an explanatory diagram for explaining the conventional method, and FIG. 3 is a diagram showing a communication network in which a manager is provided for each communication medium. It is. 1-1 to 1-4 and 2-1 to 2-4...Communication media 1-5 to 1-9 and 2-5 to 2-9...Network connection device

Claims (1)

【特許請求の範囲】[Claims] (1)複数の同報性を有する通信媒体が複数の網接続装
置によって接続された通信システムにおけるルーティン
グ方式において、各通信媒体に唯一のマネージャーを設
け、各マネージャー対応に、全ての通信媒体から各マネ
ージャーに向かう閉路を含まない論理的方向付き通信路
を構成し、各マネージャーは自分の受け持ちの通信媒体
に直接接続された端末のアドレスを全ての網接続装置に
知らせ、網接続装置においては、受信した情報フレーム
の宛先アドレスを調べ、その宛先アドレスの受け持ちの
マネージャーに対応した論理的方向付き通信路に従って
受信情報フレームの方路を決定することを特徴とするル
ーティング方式。
(1) In a routing method in a communication system in which multiple communication media with broadcast capability are connected by multiple network connection devices, a unique manager is provided for each communication medium, and each manager is assigned a A logical directional communication path that does not include a closed path toward the manager is configured, and each manager notifies all network connection devices of the address of the terminal directly connected to the communication medium for which he/she is responsible. A routing method characterized in that the destination address of the received information frame is checked, and the route of the received information frame is determined according to a logically directed communication path corresponding to the manager in charge of the destination address.
JP61058074A 1986-03-18 1986-03-18 Routing system Pending JPS62216542A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP61058074A JPS62216542A (en) 1986-03-18 1986-03-18 Routing system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP61058074A JPS62216542A (en) 1986-03-18 1986-03-18 Routing system

Publications (1)

Publication Number Publication Date
JPS62216542A true JPS62216542A (en) 1987-09-24

Family

ID=13073766

Family Applications (1)

Application Number Title Priority Date Filing Date
JP61058074A Pending JPS62216542A (en) 1986-03-18 1986-03-18 Routing system

Country Status (1)

Country Link
JP (1) JPS62216542A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03136433A (en) * 1989-05-18 1991-06-11 British Telecommun Plc <Bt> Dispersion communication network
US5963546A (en) * 1996-02-14 1999-10-05 Nec Corporation Method of searching for available path in mesh architecture

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH03136433A (en) * 1989-05-18 1991-06-11 British Telecommun Plc <Bt> Dispersion communication network
JP2574514B2 (en) * 1989-05-18 1997-01-22 ブリテイッシュ・テレコミュニケーションズ・パブリック・リミテッド・カンパニー Distributed communication network
US5963546A (en) * 1996-02-14 1999-10-05 Nec Corporation Method of searching for available path in mesh architecture

Similar Documents

Publication Publication Date Title
CA1323704C (en) Distributed load sharing
US5495426A (en) Inband directed routing for load balancing and load distribution in a data communication network
US5889776A (en) Physical layer switch system for ethernet local area network communication system
US7660318B2 (en) Internetworking support between a LAN and a wireless mesh network
CA2157144A1 (en) Method for adaptive routing in a communication network
US5802056A (en) Configuration of virtual rings in a token ring local area network
JPS61194989A (en) Still picture transmitter
US6272135B1 (en) Data communication method and system for one-to-one communication and one-to-plurality broadcast communication
NO995555D0 (en) Procedure for packet switched data transfer
US5289467A (en) Manhattan street network with loop architecture
JPS62216542A (en) Routing system
JPS58166849A (en) Route setting system between network nodes
WO2014165278A1 (en) Extended packet switch and method for remote forwarding control and remote port identification
JPH03216040A (en) Routing system
JPH03125537A (en) Packet repeating method in packet switching network
US5359599A (en) Interface for inserting a set of equipments interconnected by a telecommunication network into a management system for said equipments
JPS63196132A (en) Routing system
JPS56136061A (en) Mutual connection system of data communication network
JPH04150636A (en) Selective multiple address communication system
JPS6313543A (en) Routing system
JPS6313544A (en) Routing system
JPS62216449A (en) Routing system
JPH043549A (en) Routing system
CA2386758C (en) Expandable telecommunications system
JPH08293886A (en) System for selecting repeater route