JPS59135953A - System for deciding data transmitting path - Google Patents
System for deciding data transmitting pathInfo
- Publication number
- JPS59135953A JPS59135953A JP58010706A JP1070683A JPS59135953A JP S59135953 A JPS59135953 A JP S59135953A JP 58010706 A JP58010706 A JP 58010706A JP 1070683 A JP1070683 A JP 1070683A JP S59135953 A JPS59135953 A JP S59135953A
- Authority
- JP
- Japan
- Prior art keywords
- data
- route
- communication path
- path
- registered
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
【発明の詳細な説明】
（ａ） 発明の技術分野
本発明はデータ交換機に係り、特にデータを送出すべき
経路を、経路群内の各経路に負荷が均等に加わる如（選
択するデータ送出経路決定方式に関す。DETAILED DESCRIPTION OF THE INVENTION (a) Technical Field of the Invention The present invention relates to a data exchange, and in particular, the present invention relates to a data exchange system, and in particular, the route to which data is to be sent is determined in such a way that the load is applied evenly to each route in a route group (the selected data transmission route Regarding the decision method.
（ｂ） 技術の背景
第１図は、本発明の対象となるデータ交換網の一例を示
す図であり、第２図は第１図におけるデータ交換機の一
例を示す図である。第１図および第２図において、デー
タ交換機１に収容される端末２が、データ交換ｔａ ３
に収容される端末４宛のデータをデータ交換機１に対し
送出すると、データ交換ｔａ Ｉの交換処理部１ｏは端
末２に対応して設けられている通信路対応部９を介して
受信したデータの宛先を分析し、該データを送出すべき
方路５を選定する。更に交換処理部１ｏは、該方路５を
構成するそれぞれ通信路番号１乃至ｎを付与された複数
の通信路５１乃至５ｎがら前記データを送出すべき通信
路５ｉ（ｉはｌ乃至ｎの何れが）を選定し、前記データ
を該通信路５１に送出を登録した後、記ｊ１部１１に格
納する。通信路５１に対応する通信路対応部９１は、登
録されているデータを順次記憶部１１から抽出し、通信
路５１に送出する。かかる場合に、方路５内の各通信路
５１乃至５ｎに極力均等な負荷が加わる様、通信路５量
を選定することが望ましい。(b) Technical background FIG. 1 is a diagram showing an example of a data exchange network to which the present invention is applied, and FIG. 2 is a diagram showing an example of the data exchange device in FIG. 1. 1 and 2, a terminal 2 accommodated in a data exchange 1 is a data exchange ta 3
When the data addressed to the terminal 4 accommodated in the terminal 4 is sent to the data exchange 1, the exchange processing unit 1o of the data exchange taI processes the data received via the communication channel support unit 9 provided corresponding to the terminal 2. The destination is analyzed and the route 5 to which the data should be sent is selected. Furthermore, the exchange processing unit 1o selects a communication path 5i (where i is any one of 1 to n) to which the data is to be sent out of a plurality of communication paths 51 to 5n, each assigned a communication path number 1 to n, constituting the path 5. ), and after registering the transmission of the data to the communication path 51, the data is stored in the memory section 11. The communication channel correspondence unit 91 corresponding to the communication channel 51 sequentially extracts the registered data from the storage unit 11 and sends it to the communication channel 51. In such a case, it is desirable to select the amount of communication paths 5 so that loads are applied to each of the communication paths 51 to 5n within the path 5 as evenly as possible.
（Ｃ） 従来技術と問題点
第３図はこの種データ交換機における従来あるデータ送
出経路決定方式の一例を示す図である。(C) Prior Art and Problems FIG. 3 is a diagram showing an example of a conventional data transmission route determination method in this type of data exchange.
第３図には、交換処理部１０内に設けられている方路選
択部１２および通信路選択部１３と、記憶部ｌｌ内に設
けられている方路５内の各通信路５１乃至５ｎに対応す
る待行列１５１乃至１５ｎと、該各通イａ路５１乃至５
ｎに対応する通信路対応部９１乃至９ｎとか示されてい
る。また通信路選択部１３は、方路選択部１２から起動
される度に１歩進し、ｎ歩進で循環する計数回路１４を
具備している。今方路選択部１２が公知の方法によりデ
ータを送出すべき方路５を選定すると、通信路選択部１
３を起動する。通信路選択部１３は、計数回路１４の計
数値ｉと通信路番号ｉの一致する通信路５１を選択し、
対応する待行列１５ｉに該データを登録する。第４図は
従来あるデータ送出経路決定方式の他の一例を示す図で
ある。第４図においては、通信路選択部１６内に乱数発
生部１７が設げられており、方路選択部１２から起動さ
れる度に１乃至ｎの乱数を発生する。いまデータを送出
すべき方路５を選定した方路選択部１２が通信路選択部
１６を起動すると、通信路選択部１６は乱数発生部１７
が発生ずる乱数ｉと通信路番号ｉの一致する通信路５１
を選択し、対応する待行列１５ｉに該データを割当てる
。FIG. 3 shows the route selection unit 12 and the communication path selection unit 13 provided in the exchange processing unit 10, and each communication path 51 to 5n in the route 5 provided in the storage unit 11. The corresponding queues 151 to 15n and the corresponding routes 51 to 5
Communication path corresponding parts 91 to 9n corresponding to n are shown. The communication path selection section 13 also includes a counting circuit 14 that advances by one step every time it is activated by the route selection section 12 and circulates by n steps. When the current route selection unit 12 selects the route 5 to send data using a known method, the communication path selection unit 1
Start 3. The communication path selection unit 13 selects the communication path 51 whose count value i of the counting circuit 14 matches the communication path number i,
The data is registered in the corresponding queue 15i. FIG. 4 is a diagram showing another example of a conventional data transmission route determination method. In FIG. 4, a random number generation section 17 is provided in the communication path selection section 16, and generates a random number from 1 to n every time the route selection section 12 starts up. When the route selection unit 12 that has selected the route 5 to which data should now be sent starts the communication path selection unit 16, the communication path selection unit 16 activates the random number generation unit 17.
The communication channel 51 where the random number i that is generated matches the channel number i
is selected and the data is assigned to the corresponding queue 15i.
以上の説明から明らかな如く、従来あるデータ送出経路
決定方式においては、通信路選択部１３または１６は、
データを送出すべき通信路５１を計数回路１４の計数値
ｉに従って循環的に選択するが、または乱数発生部１７
の発生する乱数ｉにより無作為に選択していた。然し方
路５を構成する通信路５１乃至５ｎは種々の通信速度を
有する場合が有り、かかる場合に低速度の通信路５１に
対応する待行列１５ｉは、高速度の通信路５１に対応す
る待行列１５ｉに比し長くなり、負荷が均等とならぬ欠
点が有った。As is clear from the above explanation, in a conventional data transmission route determination method, the communication path selection unit 13 or 16
The communication channel 51 to which data should be sent is selected cyclically according to the count value i of the counting circuit 14, or the random number generator 17
was selected at random using a random number i generated by . However, the communication paths 51 to 5n constituting the route 5 may have various communication speeds, and in such a case, the queue 15i corresponding to the low speed communication path 51 is different from the queue 15i corresponding to the high speed communication path 51. It is longer than the matrix 15i, and has the disadvantage that the load is not uniform.
ｆｄｌ 発明の目的。fdl Purpose of the invention.
本発明の目的は、前述の如き従来あるデータ送出経路決
定方式の欠点を除去し、所定経路群を構成する各経路に
加わる負荷が極力均等となる如きデータ送出経路決定方
式を実現することに在る。An object of the present invention is to eliminate the drawbacks of the conventional data transmission route determination method as described above, and to realize a data transmission route determination method in which the load applied to each route constituting a predetermined route group is as equalized as possible. Ru.
ｔｅ＋ 発明の構成
この目的は、複数の経路を含む所定経路群からデータを
送出すべき経路を選択して該データを送出するデータ交
換機において、前記所定経路群内の各経路に対応して送
出すべきデータ数を登録するテーブルを設け、前記経路
群に対するデータ送出要求が生起の際該テーブルの各経
路を選択し、登録済みデータ数が最小である経路をデー
タ送出要求として決定することにより達成される。te+ Structure of the Invention This object is to provide a data exchange that selects a route for transmitting data from a predetermined route group including a plurality of routes and transmits the data, in which data is transmitted corresponding to each route in the predetermined route group. This is achieved by providing a table in which the number of data to be registered is registered, selecting each route in the table when a data transmission request for the route group occurs, and determining the route with the minimum number of registered data as the data transmission request. Ru.
（ｆｌ 発明の実施例 以下、本発明の一実施例を図面により説明する。(fl Embodiments of the invention An embodiment of the present invention will be described below with reference to the drawings.
第５図は本発明の一実施例によるデータ送出経路決定方
式を示す図であり、第６図および第７図は第５図におけ
る動作過程の一例を示す図である。FIG. 5 is a diagram showing a data sending route determination method according to an embodiment of the present invention, and FIGS. 6 and 7 are diagrams showing an example of the operation process in FIG. 5.
第５図においては、交換処理部１０ （第２図参照）内
に設りられている方路選択部１２および通信路選択部１
８、記憶部１１ （第２図）内に設けられている待行列
１５１乃至１５ｎ、並びに通信路対応部９１乃至９ｎ以
外に、記憶部ｌｌ内に設けられている選択テーブル１９
および登録数計数領域２０が示されている。選択テーブ
ル１９および登録数計数領域２０はそれぞれ経路群（以
後方路と称す）毎に設けられており、−例として方路５
に対応する選択テーブル１９および登録数計数領域２０
が図示されている。（他の方路に対応する選択チーフル
および登録数計数領域は矢線方向に展開される。）選択
テーブル１９は、所定登録数ｍ以下の各データ数ｊ （
」は１乃至ｍ）毎に、各通信路５１乃至５ｎに該データ
数１以上のデータが登録されているか否かを示す表示符
号ＳＤ （ｉｊ）が格納されている。表示符号ＳＤ （
ｉ ｊ）は、−通信路５１に所定数１以上のデータが登
録済みの場合には論理値０に設定され、また該所定数１
以上のデータが未登録の場合には論理値１に設定される
。例えば通信路５１に全く送出すべきデータが登録され
ていない場合には、データ数ｉ＝１乃至ｍに対応する総
ての表示符号５Ｄ（ｉｆ）乃、至ＳＤ（ｉｍ）は論理値
１に設定されており、また通信路５１に送出すべきデー
タが１個だけ登録されている場合には、データ数ｊ−ｔ
に対応する表示符号５Ｄ（ｉｌ）は論理値０に設定され
、データ数ｊ＝２乃至ｍに対応する表示符号５Ｄ（ｉ２
）乃至Ｓ’Ｄ（ｉｒｎ）は論理値１に設定される。更に
通信１ｉ７’ｔ ５ ｉに送出ずべきデータがｍ１１１
登録されているか、ＴＥたは障害等の理由で送出不能の
場合には、データ数ｊ＝１乃至ｍに対応する総ての表示
符号５Ｄ（ｉｌ）乃至ＳＤ（ｉｍ）は論理値０に設定さ
れる。また割当数計数領域２０には、各通信路５１に現
在登録中のデータ数ＣＮＴい）が格納されており、新た
にデータが登録されると１が加３？され、データが送出
終了すると１が減算される。第５図および第６図におい
て、方略選択部１２が公知の方法でデータを送出すべき
方路５を決定し、通信路選択部１８を起動すると、通信
路選択部１８は方路選択部１２から通知された方路５に
対応する選択テーブル１９のアドレスを求める（ステッ
プ３１）。次に通信路選択部１８はデータ数ｊを１に設
定しくステップＳ２）、対応する表示符号ＳＤ、（１１
）乃至５Ｄ（ｎｌ）を抽出しくステップＳ３）、最初に
通信路番号ｉを１に設定しくステップＳ４）、通信路５
１に対応する表示符号５Ｄ（１１）の論理値を検査する
（ステップ３５）。該検査の結果論理値０であれば、通
信路番号１（＝１）に１を加えた後（ステップＳ６）、
通信路５２に対応する表示符号ＳＤ （２１）に対しス
テップＳ５の検査を行う。以下同様にして、通信路５ｎ
に対応する表示符号ＳＤ （ｎｌ）迄ステップＳ５の検
査を行った結果論理値ｌを検出出来ぬ場合には（ステッ
プＳ７）、設定中のデータ数ｊ（＝１）に１を加算した
後（ステ・ノブＳ８）、対応する表示符号５Ｄ（１２）
乃至５Ｄ（ｎ２’）に対するステップＳ３乃至Ｓ７の検
査を行う。以下同様にして、データ数ｊに対応する表示
符号Ｓ［） （ｔ ｊ）乃至５Ｄ（ｎｊ）に対しステッ
プＳ３乃至Ｓ７の検査を行った結果、表示符号ＳＤ （
ｉ ｊ）が初めて論理値１であることを検出すると、通
信路選択部１Ｂは対応する通信路５１をデータを送出す
べき通信路として決定しくステップ３１１）、該表示符
号ＳＤ （ｔ ｊ）を論理値Ｏに設定しくステップ３１
２）、登録数計数領域２０の通信路５１に対応する登録
中データ数ＣＮＴ （ｉ）に１を加算しくステップ５１
３）、該データを待行列Ｌ５ｔに登録する。次に第５図
および第７図において、通信路５１に登録中のデータが
送出ｉｍ終わると、通信路対応部９１は通信路選択部１
８にデータの送出終了を通知する。通信路選択部１８は
、方路５に対応する選択テーブル１９のアドレスを求め
た後（ステップ５２１）、登録数計数領域２０内の、送
出終了した通信路５ｊに対応する登録中データ数ＣＮＴ
（ｉ）に等しいデータ数ｊ （ステップ５２２）−お
よび通信路５１に対応する表示ＳＤ （ｉ ｊ）を論理
値０から論理値ｌに変更した後（ステップ５２３）、登
録数計数領域２０内の登録中データ数ＣＮＴ （ｉ）か
ら１を減算する（ステップ５２４）、第８図Ａ乃至Ｆは
選択テーブルの使用状況を例を上げて示した説明図であ
る。第８図Ａ乃至Ｆにおいて、方路５内通信路は第５図
と同様５１乃至５ｎ、各通信路５１乃至５ｎのデータ送
出可能個数をｍ個とし、またデーク送出可を示す表示符
号ＳＤ （ｉ ｊ）を論理値１、データ送出不可を示す
表示符号ＳＤ （ｉ ｊ）を論理値０とする。第８図Ａ
は選択テーブル１９の初期状態を示す。かかる状態で通
信路５２が送出可能状態となると、第８図Ｂに示す如く
データ数１乃至ｍに対応する表示符号５Ｄ（２１）乃至
ＳＤ（２ｍ）を総て論理値ｌに設定する。次に第８図Ｃ
は全通信路５１乃至５ｎが送出可能となり、通信路５１
にデータ送出要求が１個登録されている状態を示す。か
かる状態で更にデータ送出要求が生起すると、データ数
１に対応する表示符号ＳＤ （１１）乃至５Ｄ（ｎｌ）
が順次選択され、最初に論理値１を示す表示符号５Ｄ（
２１）が選出されると、該データ送出要求を通信路５２
に登録し、第８図りに示す如く表示符号５Ｄ（２１）を
論理値０に設定する。次に第８図Ｅは総ての通信路５１
乃至５ｎに対し２個のデータ送出が登録されている状態
を示す。かかる状態で通信路５３におけるデータ送出完
了が検出されると、第８図Ｆに示す如く通信路５３の論
理値Ｏに設定されているデータ数が最大の表示符号５Ｄ
（３２）を論理値１に設定し、データ送出の登録を１個
解放する。かかる状態で、新たにデータ送出要求が住起
すると論理値１を示すデータ数最小の表示符号５Ｄ（３
２）が選択され、通信路５３に登録される。以」二によ
り客通信路５１乃至５ｎが均等に使用される。In FIG. 5, a route selection section 12 and a communication path selection section 1 provided in the exchange processing section 10 (see FIG. 2) are shown.
8. In addition to the queues 151 to 15n provided in the storage section 11 (FIG. 2) and the communication path correspondence sections 91 to 9n, a selection table 19 provided in the storage section 11.
and a registration number counting area 20 are shown. The selection table 19 and the registration number counting area 20 are provided for each route group (hereinafter referred to as a route).
Selection table 19 and registration number counting area 20 corresponding to
is illustrated. (The selection table and the registration number counting area corresponding to other routes are developed in the arrow direction.) The selection table 19 has each data number j (
1 to m), a display code SD (ij) indicating whether data equal to or greater than 1 is registered in each communication path 51 to 5n is stored. Display code SD (
i j) is set to a logical value of 0 when a predetermined number of data equal to or more than 1 has been registered in the communication path 51;
If the above data are unregistered, the logical value is set to 1. For example, if no data to be sent is registered in the communication channel 51, all display codes 5D(if) to SD(im) corresponding to the data numbers i=1 to m have a logical value of 1. is set, and if only one piece of data to be sent to the communication path 51 is registered, the number of data j−t
The display code 5D(il) corresponding to
) to S'D(irn) are set to a logical value of 1. Furthermore, data that should not be sent to communication 1i7't 5i is m111.
If it is registered or cannot be sent due to TE or failure, all display codes 5D (il) to SD (im) corresponding to the number of data j = 1 to m are set to logical value 0. be done. In addition, the allocated number counting area 20 stores the number of data currently registered in each communication channel 51 (CNT), and when new data is registered, 1 is added to 3? When the data transmission is completed, 1 is subtracted. In FIGS. 5 and 6, when the strategy selection unit 12 determines the route 5 to send data using a known method and starts the communication path selection unit 18, the communication path selection unit 18 The address of the selection table 19 corresponding to the route 5 notified from is obtained (step 31). Next, the communication path selection unit 18 sets the number of data j to 1 (step S2), and sets the corresponding display code SD, (11
) to 5D(nl) are extracted in step S3), and the communication channel number i is first set to 1 in step S4).
The logical value of the display code 5D(11) corresponding to 1 is checked (step 35). If the result of this check is a logical value of 0, after adding 1 to the communication path number 1 (=1) (step S6),
The display code SD (21) corresponding to the communication path 52 is checked in step S5. Similarly, communication path 5n
If the logical value l cannot be detected as a result of checking in step S5 up to the display code SD (nl) corresponding to (step S7), 1 is added to the number of data being set j (=1), and then ( Ste knob S8), corresponding display code 5D (12)
The tests in steps S3 to S7 are performed for 5D(n2'). Similarly, the display codes S[) (t j) to 5D(nj) corresponding to the data number j are checked in steps S3 to S7, and as a result, the display code SD (
When detecting that the logical value 1 for the first time is 1, the communication path selection unit 1B determines the corresponding communication path 51 as the communication path to which data should be sent.In step 311), the display code SD (tj) is Set to logical value O Step 31
2) Add 1 to the number of registered data CNT (i) corresponding to the communication path 51 in the registration number counting area 20. Step 51
3) Register the data in queue L5t. Next, in FIGS. 5 and 7, when the data being registered in the communication channel 51 has been sent im, the communication channel corresponding section 91
8 of the completion of data transmission. After obtaining the address of the selection table 19 corresponding to the route 5 (step 521), the communication channel selection unit 18 calculates the number of registered data CNT corresponding to the communication channel 5j that has been sent, in the registration number counting area 20.
After changing the data number j equal to (i) (step 522) and the display SD (i j) corresponding to the communication path 51 from the logical value 0 to the logical value l (step 523), the number of data in the registration number counting area 20 is changed. 1 is subtracted from the number of registered data CNT (i) (step 524). FIGS. 8A to 8F are explanatory diagrams showing examples of how the selection table is used. In FIGS. 8A to 8F, the communication paths in the route 5 are 51 to 5n as in FIG. i j) has a logical value of 1, and the display code SD (i j) indicating that data cannot be sent is a logical value of 0. Figure 8A
indicates the initial state of the selection table 19. When the communication path 52 becomes ready for transmission in such a state, all display codes 5D(21) to SD(2m) corresponding to the data numbers 1 to m are set to the logical value 1, as shown in FIG. 8B. Next, Figure 8C
All the communication channels 51 to 5n can be sent, and the communication channel 51
This shows a state in which one data transmission request is registered. When another data transmission request occurs in this state, the display codes SD (11) to 5D (nl) corresponding to the data number 1 are
are selected one after another, and the display code 5D(
21) is selected, the data transmission request is sent to the communication channel 52.
, and set the display code 5D (21) to a logical value of 0 as shown in the eighth diagram. Next, FIG. 8E shows all the communication channels 51.
This shows a state in which two data transmissions are registered for 5n to 5n. When the completion of data transmission on the communication path 53 is detected in this state, as shown in FIG.
(32) is set to logical value 1, and one data transmission registration is released. In this state, when a new data transmission request is issued, the display code 5D (3
2) is selected and registered in the communication path 53. As a result of the above, the customer communication channels 51 to 5n are used equally.
以−１二の説明から明らかな如く、本実施例によれは、
通信１１δｉｆｆ沢部１８はデータが到来する度に選択
テーブル１９を参照することにより、最も送出を登録さ
れているデータ数ｊの少ない通信路５１に送出ずべきデ
ータを登録する為、方路５内の各通信路５１乃至５ｎに
対する待行列１５１乃至１５ｎが略一様となり、各通信
路５１乃至５ｎの負イＷ工が均等化される。As is clear from the explanation below-12, according to this embodiment,
The communication 11 δiff swell section 18 refers to the selection table 19 every time data arrives, and registers the data that should not be sent to the communication path 51 with the smallest number of data registered for sending, j. The queues 151 to 15n for each of the communication paths 51 to 5n are approximately uniform, and the negative power of each communication path 51 to 5n is equalized.
なお、第５図乃至第８図はあく迄本発明の一実施例に過
きす、例えば表示符号ＳＤ四ｊ）は所定数１以上のデー
タが登録済みの場合に論理値０、未登録の場合に論理値
１に限定されることは無く、逆の論理値に対応する場合
にも本発明の効果は変わらない。またデータ送出経路決
定方式の構成は図示されるものに限定されることは無く
、プログラムで実現する等地に幾多の変形が考慮される
が、何れの場合にも本発明の効果は変らない。更に本発
明の対象は、特定方路５内の通信路５１を選択するもの
に限定されることは無く、データ交換機１から宛先端末
に至る複数の方路の中から、データを送出すべき方路を
選定する場合等、他に幾多の変形が考慮されるが、何れ
の場合にも本発明の効果は変らない。Note that FIGS. 5 to 8 are only examples of the present invention; for example, the display symbol SD4j) has a logical value of 0 if a predetermined number of data of 1 or more has been registered, and a logical value of 0 if the data has not been registered. However, the present invention is not limited to a logical value of 1, and the effects of the present invention do not change even when corresponding to the opposite logical value. Furthermore, the configuration of the data sending route determination system is not limited to that shown in the drawings, and many variations may be considered in implementing the program, but the effects of the present invention remain the same in any case. Furthermore, the object of the present invention is not limited to selecting the communication path 51 within the specific path 5, but is applicable to any one of a plurality of paths from the data exchange 1 to the destination terminal to which data should be sent. Many other modifications may be considered when selecting a path, but the effects of the present invention remain the same in any case.
ｆｇｌ 発明の効果
以上、本発明によれば、前記データ交換機において、所
定経路群を構成する各経路に加わる負荷を極力均等化し
得るデータ送出経路決定方式を実現することが可能とな
る。fgl Effects of the Invention As described above, according to the present invention, in the data exchanger, it is possible to realize a data transmission route determination method that can equalize as much as possible the loads applied to each route constituting a predetermined route group.
第１図は本発明の対象となるデータ文換網の一例を示す
図、第２図は第１図におけるデータ交換機の一例を示す
図、第３図は従来あるデータ送出経路決定方式の一例を
示す図、第４図は従来あるデータ送出経路決定方式の他
の一例を示す図、第５図は本発明の一実施例によるデー
タ送出経路決定方式を示す図、第６図および第７図は第
５図における動作過程の一例を示す図であり、第６図は
データ送出割当時、第７図はデータ送出終了時の動作過
程をそれぞれ示し、第８図Ａ乃至Ｆは選択チーフルの使
用状況を例を上げて示した説明図である。
図において、１．３および６はデータ交換機、２．４お
よび７は端末、５および８は方路、５１乃至５ｎは１ｌ
ｒＩ信路、９および９１乃至９ｎは通信路対応部、１ｏ
は交換処理部、１１は記↑、ａ部、１２は方路選択「１
５．１３．１６および１８は通信路選択部、１４は計数
回路、１５１乃至１５ｎはｊう行列、１７は乱数発生部
、１９は選択テーブル、２０は登録数ｉｉｔ ｌ＆領領
域５Ｄ（１１）乃至ｓＤ（ｎｍ）は表示符号、ｃＮＴ（
１）乃至ｃＮＴ（ｎ）は登録中データ数、ｉ （＝１乃
至ｎ）は通信路番号、ｊ（−１乃至ｍ）はデータ数、を
示す。
祭 ５ ｇ
第６ ｇ
第８ 図
第ｇ区FIG. 1 is a diagram showing an example of a data exchange network to which the present invention is applied, FIG. 2 is a diagram showing an example of the data exchange in FIG. 1, and FIG. 3 is a diagram showing an example of a conventional data transmission route determination method. FIG. 4 is a diagram showing another example of a conventional data transmission route determination method, FIG. 5 is a diagram showing a data transmission route determination method according to an embodiment of the present invention, and FIGS. 6 and 7 are diagrams showing another example of a conventional data transmission route determination method. 5 is a diagram showing an example of the operation process in FIG. 5, FIG. 6 shows the operation process at the time of data transmission allocation, FIG. 7 shows the operation process at the end of data transmission, and FIGS. 8 A to F show the usage status of the selected chifur. It is an explanatory diagram showing an example. In the figure, 1.3 and 6 are data exchangers, 2.4 and 7 are terminals, 5 and 8 are routes, and 51 to 5n are 1l
rI signal path, 9 and 91 to 9n are communication path corresponding parts, 1o
11 is the exchange processing section, 11 is the above ↑, a part, 12 is the route selection "1"
5.13. 16 and 18 are communication path selection units, 14 is a counting circuit, 151 to 15n are matrices, 17 is a random number generation unit, 19 is a selection table, 20 is a registration number iit l®ion area 5D (11) to sD (nm) is the display code, cNT (
1) to cNT(n) indicate the number of data being registered, i (=1 to n) indicates the communication channel number, and j (-1 to m) indicates the number of data. Festival 5 g 6th g Figure 8 Ward g
Claims (1)
路を選択して該データを送出するデータ交換機において
、前記所定経路群内の各経路に対応して送出すべきデー
タ数を登録するテーブルを設け、前記経路群に対するデ
ータ送出要求が生起の際該テーブルの各経路を選択し、
登録済みデータ数が最小である経路をデータ送出経路と
して決定することを特徴とするデータ送出経路決定方式
。In a data exchange that selects a route for transmitting data from a predetermined route group including a plurality of routes and transmits the data, a table is provided for registering the number of data to be transmitted corresponding to each route in the predetermined route group. and selecting each route in the table when a data transmission request for the route group occurs;
A data transmission route determination method characterized in that a route with the least number of registered data is determined as a data transmission route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP58010706A JPS59135953A (en) | 1983-01-26 | 1983-01-26 | System for deciding data transmitting path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP58010706A JPS59135953A (en) | 1983-01-26 | 1983-01-26 | System for deciding data transmitting path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPS59135953A true JPS59135953A (en) | 1984-08-04 |
Family
ID=11757739
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP58010706A Pending JPS59135953A (en) | 1983-01-26 | 1983-01-26 | System for deciding data transmitting path |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPS59135953A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4630258A (en) * | 1984-10-18 | 1986-12-16 | Hughes Aircraft Company | Packet switched multiport memory NXM switch node and processing method |
| JPS62500627A (en) * | 1984-10-18 | 1987-03-12 | ヒユ−ズ・エアクラフト・カンパニ− | Packet Switching Notebook Load Balancer |
| JPS6346841A (en) * | 1986-08-14 | 1988-02-27 | Nippon Telegr & Teleph Corp <Ntt> | Communication control equipment in storage type information communication network |
| JPS63259752A (en) * | 1987-04-17 | 1988-10-26 | Hitachi Ltd | Registration system for message destined to terminal |
| US4837676A (en) * | 1984-11-05 | 1989-06-06 | Hughes Aircraft Company | MIMD instruction flow computer architecture |
| EP0336401A2 (en) * | 1988-04-06 | 1989-10-11 | Hitachi, Ltd. | Method and system for packet exchange |
-
1983
- 1983-01-26 JP JP58010706A patent/JPS59135953A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4630258A (en) * | 1984-10-18 | 1986-12-16 | Hughes Aircraft Company | Packet switched multiport memory NXM switch node and processing method |
| JPS62500627A (en) * | 1984-10-18 | 1987-03-12 | ヒユ−ズ・エアクラフト・カンパニ− | Packet Switching Notebook Load Balancer |
| US4837676A (en) * | 1984-11-05 | 1989-06-06 | Hughes Aircraft Company | MIMD instruction flow computer architecture |
| JPS6346841A (en) * | 1986-08-14 | 1988-02-27 | Nippon Telegr & Teleph Corp <Ntt> | Communication control equipment in storage type information communication network |
| JPS63259752A (en) * | 1987-04-17 | 1988-10-26 | Hitachi Ltd | Registration system for message destined to terminal |
| EP0336401A2 (en) * | 1988-04-06 | 1989-10-11 | Hitachi, Ltd. | Method and system for packet exchange |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US4500987A (en) | Loop transmission system | |
| US6781986B1 (en) | Scalable high capacity switch architecture method, apparatus and system | |
| US6411701B1 (en) | Method and system of dynamic traffic control in a communication network | |
| US4551842A (en) | Error-protected data transmission device and communication network | |
| JP3787011B2 (en) | Method for resolving scheduling conflicts between packets | |
| US4096355A (en) | Common channel access method for a plurality of data stations in a data transmission system and circuit for implementing the method | |
| JP2713226B2 (en) | Automatic IP address generation method in network | |
| JPH0338137A (en) | High-speed digital packet exchanging system | |
| US7191259B2 (en) | Method and apparatus for fast integer within-range compare | |
| JPH09505713A (en) | System for parallel assembly of data transmission in broadband networks | |
| JP2018191279A (en) | Method for test traffic generation and inspection, and associated switch input port or output port and switch | |
| CN112104568B (en) | Data transmission control method and gateway | |
| JPH11507487A (en) | System and method for resolving substantially simultaneous two-way requests for spare capacity | |
| US5883895A (en) | Arbitration ring with automatic sizing for a partially populated switching network | |
| JPS59135953A (en) | System for deciding data transmitting path | |
| AU642255B2 (en) | ATM switching network | |
| KR100382360B1 (en) | Method and apparatus for transmitting explict multicast data packet over ethernet | |
| US8619627B2 (en) | Automatic determination of groupings of communications interfaces | |
| KR100323276B1 (en) | How to randomly select one of N units and its device | |
| US6931014B2 (en) | Method for generating and transmitting a train packet in an ATM switch system | |
| US11914540B2 (en) | On-chip integrated circuit, data processing device, and data processing method | |
| US20020181449A1 (en) | Method and apparatus for determining connections in a crossbar switch | |
| US6023454A (en) | Deflection network | |
| US20060198366A1 (en) | Crossbar switching circuit and operating method thereof | |
| Bonuccelli et al. | Optimal on demand packet scheduling in single-hop multichannel communication systems |