JPS63202199A - Route selection information generator - Google Patents

Route selection information generator

Info

Publication number
JPS63202199A
JPS63202199A JP62034803A JP3480387A JPS63202199A JP S63202199 A JPS63202199 A JP S63202199A JP 62034803 A JP62034803 A JP 62034803A JP 3480387 A JP3480387 A JP 3480387A JP S63202199 A JPS63202199 A JP S63202199A
Authority
JP
Japan
Prior art keywords
information
route
exchange
idle
routes
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
JP62034803A
Other languages
Japanese (ja)
Inventor
Shigeyuki Sato
佐藤 繁之
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 JP62034803A priority Critical patent/JPS63202199A/en
Publication of JPS63202199A publication Critical patent/JPS63202199A/en
Pending legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Exchange Systems With Centralized Control (AREA)

Abstract

PURPOSE:To speed up the generation of idle route selection information by distributing idle information of a route between inputted exchange stations depending on the station condition and the operating state so as to apply logical operation of the said information. CONSTITUTION:Selecting a route from an exchange station A to a station B, the route B is connected to a branched route X and routes C, D are connected to a branched route Y. Logic circuits 1, 2, 3 of a route selection information generator apply required logical operation to input information to generate output information. The circuit 1 generates idle information of the routes B, C, D from idle information subroutes b1, b2, c1, c2, d1, d2, the circuit 2 generates the idle information of the branched routes X, Y from the said information and the circuit 3 generates the idle information of ground B from the information. Network switches 4, 5, 6 select and supply the input information to the circuits 1, 2, 3 depending on the predetermined station condition and operating state from the output information of the circuits 1, 2 and the exchange A. An input terminal 7 receives the traffic information from the exchange A and an output terminal 8 sends route selection information to the exchange A.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は通信網における対地への空ルートを高速に生成
する装置に関する。
DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a device that rapidly generates an air route to the ground in a communication network.

〔従来の技術〕[Conventional technology]

従来、通信網における対地への空ルートを選択する場合
、ストアードプログラム方式の単−又は複数のプロセッ
サを有する計算機システムにより、通信網内の多くのル
ートについて同一の論理演算を繰返し行うことによシ、
目的の対地へのルート情報を生成している。
Conventionally, when selecting an air route to the ground in a communication network, a computer system having one or more stored program processors repeatedly performs the same logical operation for many routes in the communication network. ,
Generates route information to the destination.

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

しかしながら、従来は全ルートに対する演算を周期的に
繰返し行い全ルートをシーケンシャルに順次処理するた
め、トラヒック変動のあったルートを処理するまでに最
悪1周期分の遅れがある。
However, conventionally, calculations for all routes are periodically repeated and all routes are processed sequentially, so there is a delay of one cycle in the worst case until a route with traffic fluctuations is processed.

また、演算に多くの時間を必要とするため、処理周期が
長くなることを免れ得ない。したがって、通信網のトラ
ヒック変動に対して常に一定の遅れをもったルート情報
しか生成されず、トラヒックの急敏な変動には追従でき
ないという問題がある。
Furthermore, since the calculation requires a lot of time, the processing cycle inevitably becomes longer. Therefore, there is a problem in that only route information with a certain delay is always generated with respect to traffic fluctuations in the communication network, and rapid fluctuations in traffic cannot be followed.

〔問題点を解決するだめの手段〕[Failure to solve the problem]

本発明のルート選択情報生成装置は人力された交換局間
のルートの空状態を示すトラヒック情報を予め定められ
た局条件および運用状況に応じて分配する手段と、分配
された前記トラヒック情報の論理′@算を行い空のルー
ト選択情報を生成する手段とを備える。
The route selection information generation device of the present invention includes a means for distributing manually-generated traffic information indicating the empty status of routes between exchanges according to predetermined station conditions and operational status, and a logic system for distributing the distributed traffic information. '@ calculation and generating empty route selection information.

〔実施例〕〔Example〕

次に、本発明の実施例について図面を参照して説明する
Next, embodiments of the present invention will be described with reference to the drawings.

本発明の一実施例を示す第1図および第2図を参照する
と、通信網内の交換局A、B、C,Dはそれぞれ複数の
回線で接続され、全体として網を構成している。二つの
交換局間の全ての回線の束をルートと呼ぶ。また、ルー
ト内の回線属性毎の小束をサブルートと呼ぶ。通信網に
おいては、ある接続目的地(対地)に到達するルートは
複数存在する。ある対地への全ルートをその属性、例え
は経由する交換局の数毎に集めた複数ルートの束を分収
ルートという。第2図において、例えば交換局Aより交
換局Bの存在する対地Bに到達するには、交換局Aはル
ートB、ルートCおよびルートDのいずれかを選択すれ
ばよい。ここで、ルートBを分収ルートX1かつルート
C,Dを分収ルー)Yとする。一般にある対地に到達可
能か否かの情報は各ルートつまシ、各サブルートの空回
線の有無から得ることができる。例えば、交換局Aより
対地Bに到達するためには、サブルートbI、b2、サ
ブルートC1,C2、サブルートdl、d2の内の1つ
のサブルートに空回線が有ればよい。ここで、ルートE
、Fには空回線があるとすると、各サブルートの空回線
の有無情報よυ以下の論理演算によって対地Bへの到達
可能性が求められる。
Referring to FIGS. 1 and 2 showing an embodiment of the present invention, exchanges A, B, C, and D in a communication network are each connected by a plurality of lines, and constitute a network as a whole. The bundle of all lines between two exchanges is called a route. Further, a small bundle for each line attribute within a route is called a subroute. In a communication network, there are multiple routes to reach a certain connection destination. A bundle of multiple routes collected by attributes of all routes to a certain destination, for example, by the number of exchanges they pass through, is called a divided route. In FIG. 2, for example, in order to reach destination B where exchange B exists from exchange A, exchange A may select one of route B, route C, and route D. Here, the route B is the collection route X1, and the routes C and D are the collection route)Y. Generally, information on whether or not it is possible to reach a certain destination can be obtained from the presence or absence of an empty line on each route link and each subroute. For example, in order to reach destination B from exchange A, it is sufficient that one of the subroutes bI, b2, subroutes C1, C2, and subroutes dl, d2 has an idle line. Here, route E
, F has an empty line, the possibility of reaching ground B can be determined by the logical operation of υ or less based on the information on the presence or absence of an empty line for each subroute.

分収ルートX璧有 第2図記載のルート選択情報生成装置は以上の論理演算
を高速に行うことができる。論理回路1゜2.3は各段
においてそれぞれ入力情報に対して必要な論理演算を行
い出力情報を作成する。論理回路lはサブルートb1 
+ b2 + ’1 r cl l ct、 t d2
の9有情報からルートB、C,L)の9有情報を生成す
る。
The route selection information generating device shown in FIG. 2 can perform the above logical operations at high speed. The logic circuits 1, 2, and 3 perform necessary logical operations on input information at each stage to create output information. Logic circuit l is subroot b1
+ b2 + '1 r cl l ct, t d2
9 presence information of routes B, C, and L) is generated from the 9 presence information of routes B, C, and L.

論理回路2はルートB 、 C、Dの仝有情報から分収
ルートX、Yの9有情報を生成する。また、論理回路3
は分収ルートX、Yの9有情報から対地Bの9有情報を
生成する。ネットワークスイッチ4.5.6は論理回路
1,2.3に対する入力情報をトラヒック情報を生成す
る交換機Aおよび前段の論理回路1,2の出力情報よシ
予め定められた局条件および運用状況に応じて選択し供
給する。
The logic circuit 2 generates 9 presence information of divided routes X and Y from the presence information of routes B, C, and D. Also, logic circuit 3
generates 9 availability information for ground B from 9 availability information for collection routes X and Y. The network switch 4.5.6 converts the input information to the logic circuits 1 and 2.3 to the output information of the exchange A that generates traffic information and the logic circuits 1 and 2 in the previous stage according to predetermined station conditions and operational status. Select and supply.

これらのネットワークスイッチはサブルート、ルート、
分収ルートおよび対地の関係が局条件や運用状況により
常時変化するだめ、論理回路1,2゜3への入力情報を
可変とするため設けられる。入力端子7はトラヒック情
報、この場合は各サブルートの全有情報を交換機Aから
受ける。また、出力端子8はルート選択情報、この場合
は対地Bへの9有情報をこの情報を必要とする交換機A
に送出する。ネットワークスイッチ1b1」両回路9は
局条件および運用状況に基いて決定された中央制御回路
10からの命令に従ってネットワークスイッチ4.5.
6を切替制御する。
These network switches are subroot, root,
Since the relationship between the distribution route and the ground constantly changes depending on station conditions and operating conditions, the logic circuits 1 and 2 are provided to make the input information to the logic circuits 1 and 2 variable. Input terminal 7 receives traffic information from exchange A, in this case all information on each subroute. Output terminal 8 also outputs route selection information, in this case 9 presence information to destination B, to switch A that requires this information.
Send to. network switch 1b1'', both circuits 9 operate network switches 4, 5, .
6 is switched and controlled.

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

以上説明したように本発明によれば、トラヒック情報を
受信することによ)局条件および運用状況に応じたルー
ト選択情報を高速に生成することができる。
As described above, according to the present invention, by receiving traffic information, it is possible to quickly generate route selection information according to station conditions and operational status.

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

第1図および第2図は本発明の一実施例を示す図である
。 1.2.3・・・・・・論理回路、4,5,6・・・・
・・ネットワークスイッチ、9・・・・・・ネットワー
クスイッチ制御回路、10・・・・・・中央制御回路。
FIG. 1 and FIG. 2 are diagrams showing one embodiment of the present invention. 1.2.3...Logic circuit, 4,5,6...
...Network switch, 9...Network switch control circuit, 10...Central control circuit.

Claims (1)

【特許請求の範囲】[Claims] 入力された交換局間のルートの空状態を示すトラヒック
情報を予め定められた局条件および運用状況に応じて分
配する手段と、分配された前記トラヒック情報の論理演
算を行い空のルート選択情報を生成する手段とを備える
ことを特徴とするルート選択情報生成装置。
Means for distributing the input traffic information indicating the empty state of the route between switching stations according to predetermined station conditions and operational status, and performing a logical operation on the distributed traffic information to obtain empty route selection information. A route selection information generation device comprising: generating means.
JP62034803A 1987-02-17 1987-02-17 Route selection information generator Pending JPS63202199A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP62034803A JPS63202199A (en) 1987-02-17 1987-02-17 Route selection information generator

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP62034803A JPS63202199A (en) 1987-02-17 1987-02-17 Route selection information generator

Publications (1)

Publication Number Publication Date
JPS63202199A true JPS63202199A (en) 1988-08-22

Family

ID=12424388

Family Applications (1)

Application Number Title Priority Date Filing Date
JP62034803A Pending JPS63202199A (en) 1987-02-17 1987-02-17 Route selection information generator

Country Status (1)

Country Link
JP (1) JPS63202199A (en)

Similar Documents

Publication Publication Date Title
US4621359A (en) Load balancing for packet switching nodes
US4623996A (en) Packet switched multiple queue NXM switch node and processing method
CN101841471B (en) System having a plurality of nodes connected in multi-dimensional matrix, method of controlling system and apparatus
JPH0528122A (en) Broadcasting method and parallel computer therefor
EP0271492A1 (en) A data processing device
JPH08185380A (en) Parallel computer
JPH0492319A (en) Switch module
JP4818920B2 (en) Integrated data processing circuit having a plurality of programmable processors
Ramanathan et al. Delivery of time-critical messages using a multiple copy approach
EP0343611A3 (en) Routing method for fast packet switching systems
CN100464323C (en) Reconfigurable processor and semiconductor device
CN110932920B (en) Network topology structure
JP2509947B2 (en) Network control system
JPS59103166A (en) Hierarchical parallel data processor
US6823443B2 (en) Data driven type apparatus and method with router operating at a different transfer rate than system to attain higher throughput
JPH0125096B2 (en)
JPS63202199A (en) Route selection information generator
JP2003218917A (en) System and method for distributing traffic using ospf cost
US4922246A (en) Message merging device
CN113691433B (en) Data transmission system, method, device, electronic equipment and storage medium
CN112988651B (en) Computing system, computing processor, and data processing method
JPS62152071A (en) Data processor
JPH03209550A (en) Interprocessor data transfer device for parallel processor
JPH06231095A (en) Data processing system for multistage connecting network
JP2843105B2 (en) Printer connection method for communication between applications