JP2515871B2 - Optimal detour route selection method - Google Patents

Optimal detour route selection method

Info

Publication number
JP2515871B2
JP2515871B2 JP1009333A JP933389A JP2515871B2 JP 2515871 B2 JP2515871 B2 JP 2515871B2 JP 1009333 A JP1009333 A JP 1009333A JP 933389 A JP933389 A JP 933389A JP 2515871 B2 JP2515871 B2 JP 2515871B2
Authority
JP
Japan
Prior art keywords
outgoing
outgoing line
function
selection order
host computer
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.)
Expired - Lifetime
Application number
JP1009333A
Other languages
Japanese (ja)
Other versions
JPH02189043A (en
Inventor
裕子 江上
一夫 山脇
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.)
NIPPON DENKI ENJINIARINGU KK
NEC Corp
Original Assignee
NIPPON DENKI ENJINIARINGU KK
Nippon Electric Co 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 NIPPON DENKI ENJINIARINGU KK, Nippon Electric Co Ltd filed Critical NIPPON DENKI ENJINIARINGU KK
Priority to JP1009333A priority Critical patent/JP2515871B2/en
Publication of JPH02189043A publication Critical patent/JPH02189043A/en
Application granted granted Critical
Publication of JP2515871B2 publication Critical patent/JP2515871B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は交換システムにおける出接続時の迂回経路選
択方式に関し、特にネットワーク全体を通して各回路使
用効率に応じた最適迂回経路選択方式に関する。
Description: TECHNICAL FIELD The present invention relates to a detour route selection method at the time of connection / disconnection in a switching system, and more particularly to an optimal detour route selection method according to each circuit use efficiency throughout the entire network.

〔従来の技術〕[Conventional technology]

従来、迂回経路選択においては、ネットワークを構成
する各交換システムが独自に収容している全ての出入回
線の使用状態を記憶し、その使用状態から回線使用頻度
を求めると共に、迂回経路選択順位を決定している。
Conventionally, in the alternative route selection, the usage statuses of all incoming and outgoing lines that are individually accommodated by each switching system that composes the network are stored, the line usage frequency is calculated from the usage status, and the alternative route selection order is determined. are doing.

〔発明が解決しようとする課題〕[Problems to be Solved by the Invention]

しかしながら、ネットワークを構成する各交換システ
ムが独自に迂回経路選択順位を決定すると、1つの交換
システムにおいて収容される出入回線の輻輳状態に基づ
き決定される迂回経路選択順位が必ずしもネットワーク
全体における迂回経路が最適とは一致しない場合が多い
という問題がある。
However, if each switching system forming the network independently determines the detour route selection order, the detour route selection order determined based on the congestion state of the incoming and outgoing lines accommodated in one switching system is not always the detour route in the entire network. There is a problem that it does not always match the optimum.

したがって、近年のネットワークの広域化やこれに伴
なうネットワーク構成の複雑化は交換システム毎の迂回
経路選択順位の単なる積上げによる迂回経路の最適化で
はなく、ネットワーク全体の回線呼量に応じた迂回経路
の最適化が求められている。
Therefore, in recent years, the widening of the network and the complicated network configuration that accompanies it are not the optimization of detour routes by simply accumulating the detour route selection order for each switching system, Route optimization is required.

〔課題を解決するための手段〕[Means for solving the problem]

本発明の最適迂回経路選択方式はネットワークを構成
する複数の交換システムとホストコンピュータとを接続
し、前記交換システムのそれぞれは収容している全ての
出入回線の使用状態を前記ホストコンピュータに定期的
に送出する機能と、前記ホストコンピュータから送られ
てくる出回線群選択順位情報を記憶する機能と、前記出
回線群選択順位情報に基づき出回線を選択し出接続を実
行する機能とを備え、前記ホストコンピュータは前記交
換システムのそれぞれから送られてくる出入回線使用状
態情報に基づきネットワーク内での出入回線使用頻度を
求める機能と、前記出入回線使用頻度から出接続におけ
るネットワーク内での最適迂回経路を決定する機能と、
前記最適迂回経路から前記交換システム毎の前記出回線
群選択順位情報を求める機能と、前記出回線群選択順位
情報を対応する交換システムに送出する機能とを備え
る。
The optimum detour route selection method of the present invention connects a plurality of switching systems constituting a network to a host computer, and each of the switching systems periodically informs the host computer of the usage status of all the incoming and outgoing lines accommodated therein. And a function of storing outgoing line group selection order information sent from the host computer, and a function of selecting outgoing line based on the outgoing line group selection order information and executing outgoing connection. The host computer determines the frequency of use of the incoming and outgoing lines in the network based on the incoming and outgoing line usage status information sent from each of the switching systems, and the optimum detour route in the network for outgoing and outgoing connections from the frequency of incoming and outgoing lines used. Function to determine,
It is provided with a function of obtaining the outgoing line group selection order information for each of the switching systems from the optimum detour route, and a function of sending the outgoing line group selection order information to the corresponding switching system.

〔実施例〕〔Example〕

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

本発明の一実施例を示す第1図を参照すると、ホスト
コンピュータ1は破線で示した伝送路120,121,122,123,
124を介して通信ネットワークを構成する交換システム2
0,21,22,23,24とそれぞれ接続されている。また、交換
システム20はネットワーク内の他の交換システム21,24,
22に対してそれぞれ方路番号200,201,202を付与された
出入回線群を有している。その他の交換システム21,22,
23,24についても同様の関連性をもつ出入回線群を有し
ている。また、各交換システムは自交換システムに収容
される出入回線群の使用状態を表す第2図に示す様な方
路毎の全回線数mと使用回線数nとからなる情報を有
し、各出入回線毎に発信捕捉時にこの情報中の使用回線
数を+1と加算し、通話終了時に+1減算する。各交換
システムはこうして得られた情報をホストコンピュータ
1に定期的に送出する。ホストコンピュータ1は各交換
システムから送られてくる出入回線群使用状態情報を収
集し、各方路毎に全回線数mと使用回線数nとにより、
回線使用頻度を算出し、この算出結果により任意の発信
交換システムと着信交換システムとの間の中継交換シス
テムを介存させた場合も含めた最適迂回経路選択順位を
最小使用頻度順に決定する。こうして得られた最適迂回
経路選択順位情報を各交換システムに送出する。更に、
各交換システムではホストコンピュータ1から送られて
きた着信交換システム毎の最適迂回経路選択順位情報を
記憶しておき、任意の発信接続に際してこの情報に基づ
き出方路を選択して出接続を実行する。
Referring to FIG. 1 showing an embodiment of the present invention, the host computer 1 has transmission lines 120, 121, 122, 123, shown by broken lines.
Switching system 2 forming a communication network via 124
0,21,22,23,24 are connected respectively. In addition, the switching system 20 includes other switching systems 21, 24,
22 has input / output line groups to which route numbers 200, 201, and 202 are assigned respectively. Other exchange systems 21,22,
23 and 24 also have input / output line groups with similar relationships. Further, each switching system has information consisting of the total number of lines m and the number of used lines n for each route as shown in FIG. 2 which shows the usage state of the input / output line group accommodated in the own switching system. For each outgoing / incoming line, the number of lines used in this information is added to +1 when the call is captured, and +1 is subtracted when the call ends. Each exchange system periodically sends the information thus obtained to the host computer 1. The host computer 1 collects the input / output line group usage status information sent from each switching system, and calculates the total number of lines m and the number of used lines n for each route.
The line use frequency is calculated, and the optimum detour route selection order including the case where a transit switching system between any outgoing exchange system and the incoming exchange system is interposed is determined in the order of the minimum use frequency based on the calculation result. The optimum detour route selection order information thus obtained is sent to each switching system. Furthermore,
In each switching system, optimum detour route selection order information for each incoming switching system sent from the host computer 1 is stored, and at any outgoing connection, an outgoing route is selected based on this information and outgoing connection is executed. .

ここで、交換システムに収容される出方路201及び交
換システム22に収容される出方路221,222がそれぞれ所
定の使用限界を超えて出接続に使用されている状態で、
交換システム20に収容される加入者(電話機)Aが他の
交換システム24に収容される加入者Bに発信接続を行な
うことを望んだ場合、交換システム20における通常の出
方路選択順位が201→202→200であるとすると、この場
合の最適迂回経路選択順位は前述した交換システム及び
ホストコンピュータ1の各々の機能によって決定される
交換システム20での出方路選択順位は、交換システム21
→23→24をそれぞれ経由する迂回経路を第1選択順位と
し、第2選択順位は交換システム22を経由する迂回経路
であり、方路番号201の選択順位は最下位とすることが
可能となる。
Here, in a state where the outgoing route 201 accommodated in the exchange system and the outgoing route 221 and 222 accommodated in the exchange system 22 are used for outgoing connection exceeding respective predetermined use limits,
When a subscriber (telephone) A accommodated in the switching system 20 desires to make an outgoing connection to a subscriber B accommodated in another switching system 24, the normal outgoing route selection order in the switching system 20 is 201. Assuming that → 202 → 200, the optimum detour route selection order in this case is determined by the respective functions of the switching system and the host computer 1 described above, and the outgoing route selection order in the switching system 20 is the switching system 21.
The detour route passing through each of → 23 → 24 is the first selection order, the second selection order is the detour route passing through the switching system 22, and the selection order of the route number 201 can be the lowest. .

〔発明の効果〕〔The invention's effect〕

以上説明したように本発明によれば、複数の交換シス
テムからなるネットワーク全体の出入回線群使用効率を
常時監視するホストコンピュータを設けることにより、
一層効率的なネットワーク運用を行なうことができる。
As described above, according to the present invention, by providing the host computer that constantly monitors the use efficiency of the input / output line group of the entire network including the plurality of switching systems,
More efficient network operation can be performed.

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

第1図及び第2図は本発明の一実施例を示す図である。 1…ホストコンピュータ、120,121,122,123,124…伝送
路、20,21,22,23,24…交換システム、200,201,202,210,
211,220,221,222,230,231,232,240,241,242…方路番
号、m1〜mi…全回線数、n1〜ni…使用回線数。
1 and 2 are diagrams showing an embodiment of the present invention. 1 ... Host computer, 120,121,122,123,124 ... Transmission path, 20,21,22,23,24 ... Switching system, 200,201,202,210,
211,220,221,222,230,231,232,240,241,242 ... the route number, m 1 ~m i ... total number of lines, n 1 ~n i ... Number of Lines.

───────────────────────────────────────────────────── フロントページの続き (56)参考文献 特開 昭63−309047(JP,A) 特開 昭63−314044(JP,A) 特開 昭63−9251(JP,A) 特開 昭61−251261(JP,A) 特開 昭61−15445(JP,A) ─────────────────────────────────────────────────── ─── Continuation of front page (56) Reference JP-A-63-309047 (JP, A) JP-A-63-314044 (JP, A) JP-A-63-9251 (JP, A) JP-A-61- 251261 (JP, A) JP 61-15445 (JP, A)

Claims (1)

(57)【特許請求の範囲】(57) [Claims] 【請求項1】ネットワークを構成する複数の交換システ
ムとホストコンピュータとを接続し、前記交換システム
のそれぞれは収容している全ての出入回線の使用状態を
前記ホストコンピュータに定期的に送出する機能と、前
記ホストコンピュータから送られてくる出回線群選択順
位情報を記憶する機能と、前記出回線群選択順位情報に
基づき出回線を選択し出接続を実行する機能とを備え、
前記ホストコンピュータは前記交換システムのそれぞれ
から送られてくる出入回線使用状態情報に基づきネット
ワーク内での出入回線使用頻度を求める機能と、前記出
入回線使用頻度から出接続におけるネットワーク内での
最適迂回経路を決定する機能と、前記最適迂回経路から
前記交換システム毎の前記出回線群選択順位情報を求め
る機能と、前記出回線群選択順位情報を対応する交換シ
ステムに送出する機能とを備えることを特徴とする最適
迂回経路選択方式。
1. A function of connecting a plurality of switching systems forming a network to a host computer, and periodically sending out the usage statuses of all the incoming and outgoing lines accommodated in each of the switching systems to the host computer. A function of storing outgoing line group selection order information sent from the host computer, and a function of selecting outgoing line based on the outgoing line group selection order information and executing outgoing connection
The host computer has a function of obtaining the frequency of use of the incoming / outgoing line in the network based on the information of the state of use of the incoming / outgoing line sent from each of the switching systems, and an optimal detour route in the network in the outgoing connection from the frequency of using the incoming / outgoing line And a function of determining the outgoing line group selection order information for each of the switching systems from the optimum detour path, and a function of sending the outgoing line group selection order information to the corresponding switching system. Optimal alternative route selection method.
JP1009333A 1989-01-17 1989-01-17 Optimal detour route selection method Expired - Lifetime JP2515871B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP1009333A JP2515871B2 (en) 1989-01-17 1989-01-17 Optimal detour route selection method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP1009333A JP2515871B2 (en) 1989-01-17 1989-01-17 Optimal detour route selection method

Publications (2)

Publication Number Publication Date
JPH02189043A JPH02189043A (en) 1990-07-25
JP2515871B2 true JP2515871B2 (en) 1996-07-10

Family

ID=11717545

Family Applications (1)

Application Number Title Priority Date Filing Date
JP1009333A Expired - Lifetime JP2515871B2 (en) 1989-01-17 1989-01-17 Optimal detour route selection method

Country Status (1)

Country Link
JP (1) JP2515871B2 (en)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS63309047A (en) * 1987-06-11 1988-12-16 Nec Corp Congestion control system by network control system

Also Published As

Publication number Publication date
JPH02189043A (en) 1990-07-25

Similar Documents

Publication Publication Date Title
EP0599764B1 (en) Distributed processing of route selection across networks and subnetworks
EP1235461B1 (en) A method of admission control and routing of virtual circuits
US4873517A (en) Method for selecting least weight end node to end node route in a data communications network
JPH0831876B2 (en) Routing control method in packet switching network
JPH10126439A (en) Route selection device for packet exchange communication network
JPH02117236A (en) Route deciding system
US5311502A (en) Method for maintaining connections given an at least partial outage of connecting paths
JP2515871B2 (en) Optimal detour route selection method
EP0986219A3 (en) Maximal flow data routing
JP2980031B2 (en) Reconfigurable network
JPS60241349A (en) Data communication processing system by intra-network circulating packet
Nakamura et al. On a hybrid network system of circuit switching and packet switching
JP2802408B2 (en) Path setting method for ring transmission network
CN109510765A (en) A kind of interconnection topology constructing connection method of calculate node and software systems
KR100204476B1 (en) A method of optimal route setting in atm networks
JPH02209044A (en) Exchange
US6512765B1 (en) Exchange
JP2003298517A (en) Multi-layer optical network
JP3185785B2 (en) Reconfiguration server and communication node
JPH0514396A (en) Data transmission equipment
JPH09191322A (en) Data exchange route selection system
JP2848913B2 (en) Blockage rate control processing method
JP2001036527A (en) Network charging data management system and its management method
JPH04168835A (en) Routing system for atm exchange and routing system for atm exchange network
JP2003333086A (en) Photonic node and photonic network

Legal Events

Date Code Title Description
S533 Written request for registration of change of name

Free format text: JAPANESE INTERMEDIATE CODE: R313533

R350 Written notification of registration of transfer

Free format text: JAPANESE INTERMEDIATE CODE: R350

S531 Written request for registration of change of domicile

Free format text: JAPANESE INTERMEDIATE CODE: R313531

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20080430

Year of fee payment: 12

R350 Written notification of registration of transfer

Free format text: JAPANESE INTERMEDIATE CODE: R350

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090430

Year of fee payment: 13

EXPY Cancellation because of completion of term
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090430

Year of fee payment: 13