JP3036859B2 - Automatic routing table creation method for exchanges - Google Patents
Automatic routing table creation method for exchangesInfo
- Publication number
- JP3036859B2 JP3036859B2 JP3013137A JP1313791A JP3036859B2 JP 3036859 B2 JP3036859 B2 JP 3036859B2 JP 3013137 A JP3013137 A JP 3013137A JP 1313791 A JP1313791 A JP 1313791A JP 3036859 B2 JP3036859 B2 JP 3036859B2
- Authority
- JP
- Japan
- Prior art keywords
- route
- exchanges
- exchange
- links
- network
- 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
Links
Landscapes
- Exchange Systems With Centralized Control (AREA)
Description
【発明の詳細な説明】DETAILED DESCRIPTION OF THE INVENTION
【０００１】[0001]
【産業上の利用分野】本発明は交換処理に関し、特に交
換機が呼の中継及び他局向発呼を行う場合に参照するル
ートテーブルの作成方法に関する。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a switching process, and more particularly to a method of creating a route table which is referred to when an exchange performs call relaying and calling to another station.
【０００２】[0002]
【従来の技術】従来、この種のルートテーブル作成方式
は、ルートテーブルをあらかじめ作成して局データとし
て登録し、変更が生じるたびに、外部装置からそのルー
トテーブルの書き替えを行っていた。2. Description of the Related Art Conventionally, in this type of route table creation method, a route table is created in advance and registered as station data, and each time a change occurs, the route table is rewritten from an external device.
【０００３】[0003]
【発明が解決しようとする課題】上述した従来のルート
テーブル作成方式は、ルートテーブルを局データとして
あらかじめ登録しているため、網の構成が変更になるた
びにそれにかかわるすべての交換機のルートテーブル
を、外部装置から交換機個々に書替えなければならない
という欠点がある。In the conventional route table creation method described above, since the route table is registered in advance as station data, every time the network configuration is changed, the route tables of all the exchanges involved are changed. However, there is a disadvantage that the exchange must be individually rewritten from an external device.
【０００４】本発明の目的は、各交換機間で網構成情報
を送受し、ネットワークの構成を把握し、最短交換段数
を算出する交換機の自動ルーティングテーブル作成方式
を提供することにある。An object of the present invention is to provide an automatic routing table creation method for exchanges, which exchanges network configuration information between exchanges, grasps the network configuration, and calculates the minimum number of exchange stages.
【０００５】[0005]
【課題を解決するための手段】本発明の交換機の自動ル
ーティングテーブル作成方式は、複数の交換機で構成す
る交換網における呼の中継、他局向け発呼時に参照する
ルーティングブルの作成において、前記複数の交換機が
個々に管理している隣接交換機との接続情報を、網内の
すべての交換機間で相互に通知しあい、この接続情報を
受信した交換機が個々に網内の構成情報を作成し、この
網構成情報から網内のすべての交換機へのルートとリン
ク数をワークエリアにセーブする手段と、このワークエ
リアにセーブした網内のすべての交換機への前記ルート
とリンク数とから対地交換機までの最小リンク数を第１
ルートとし、以下リンク数の少ない順に第２、第３ルー
トとしルーティングテーブルを作成する手段とを有す
る。According to the present invention, there is provided an automatic routing table creation system for an exchange, which is used for relaying a call in an exchange network comprising a plurality of exchanges and for creating a routable to be referred to when making a call to another station. switchboard connection information with adjacent exchange which manage the <br/> individually within the network of
All exchanges notify each other and share this connection information.
Receiving exchanges individually create configuration information in the network, and from this network configuration information , route and link to all exchanges in the network.
Means for saving the number of switches in the work area, and the route to all exchanges in the network saved in the work area.
And the minimum number of links from a number of links to ground exchange first
The second and third routes are used in the order from the smallest number of links.
And a means for creating a routing table.
【０００６】[0006]
【実施例】次に本発明について図面を参照して説明す
る。DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings.
【０００７】図１は、Ａ−Ｄ間の方路が追加された場合
の網構成情報α，βの流れを表わしているネットワーク
構成図であり、網構成情報α，βは、ネットワーク内の
全交換機に対して通知される。図２は、網構成情報を受
信した交換機Ａがその情報を元にルーティングテーブル
を自動作成する方法を記述したルーティングテーブル作
成方式図である。FIG. 1 is a network configuration diagram showing the flow of network configuration information α, β when a route between A and D is added. The network configuration information α, β The exchange is notified. FIG. 2 is a routing table creation method diagram describing a method in which the exchange A that has received the network configuration information automatically creates a routing table based on the information.
【０００８】交換機Ａから交換機Ｄへのルートテーブル
を作成するために、まず、交換機Ａが交換機Ｄの隣接交
換機の情報（網構成情報）を交換機Ｄから受信し、交換
機Ａの方路ａが含まれているか否かをチェックし、含ま
れている場合には、図２に示すようにワークエリアにル
ートｄ→ａとリンク数１をセーブする。In order to create a route table from the exchange A to the exchange D, first, the exchange A receives information (network configuration information) of an exchange adjacent to the exchange D from the exchange D, and includes a route a of the exchange A. It is checked whether it is included or not, and if it is included, the route d → a and the number of links 1 are saved in the work area as shown in FIG.
【０００９】次に、交換機Ｄの隣接交換機Ｂの網構成情
報から交換機Ａの方路ａが含まれているか否かをチェッ
クし、含まれている場合には、図２に示すようにワーク
エリアにルートｄ→ｂ→ａとリンク数２をセーブする。Next, it is checked from the network configuration information of the exchange B adjacent to the exchange D whether or not the route a of the exchange A is included, and if it is included, the work area as shown in FIG. To save the route d → b → a and the number of links 2.
【００１０】同様に隣接交換機ｃの網構成情報から、図
２に示すようにワークエリアにルートｄ→ｃ→ａとリン
ク数２をセーブする。Similarly, from the network configuration information of the adjacent exchange c, the route d → c → a and the number of links 2 are saved in the work area as shown in FIG.
【００１１】上述したように交換機Ｄの隣接交換機の情
報を元に、１ルートづつ各交換機から受信した網構成情
報を分析し、発信交換機Ａまでのルートを１つづつたど
ってワークエリアにセーブする。As described above, based on the information on the exchanges adjacent to the exchange D, the network configuration information received from each exchange is analyzed one by one, and the route to the originating exchange A is traced one by one and saved in the work area. .
【００１２】次にワークエリアにセーブした情報から、
リンク数をチェックし、最短リンク数から順に第１ルー
トｄ，第２ルートｂ，第３ルートｃとし、図２に示すよ
うにルーティングテーブルＸに設定する。なお、同一リ
ンク数が存在した場合には、交換機Ａの隣接交換機の局
番の若番を優先ルートとする。図２の例では交換機Ｂが
交換機Ｃより局番が若番であることを示している。この
ルートテーブルＸに、ルート情報を設定する方法は、対
地交換機Ｄのポインタ（アドレス）を選択し、そのポイ
ンタから順に第１のルートの方路ｄ、第２ルートの方路
ｂ第３ルートの方路ｃを設定する。Next, from the information saved in the work area,
The number of links is checked, and the first route d, the second route b, and the third route c are set in order from the shortest link number, and are set in the routing table X as shown in FIG. If the same number of links exists, the lower-ranked station number of the exchange adjacent to the exchange A is set as the priority route. In the example of FIG. 2, the exchange B has a lower station number than the exchange C. The route information is set in the route table X by selecting a pointer (address) of the ground exchange D, and starting with the pointer, the route d of the first route, the route b of the second route, and the route b of the third route. Set the route c.
【００１３】[0013]
【発明の効果】以上説明したように本発明は、各交換機
の網構成情報通知を送受することにより、ネットワーク
の構成を把握し、最短ルートを算出し、自動的にルーテ
ィングテーブルの変更が行えるという効果がある。As described above, according to the present invention, the network configuration information can be grasped, the shortest route can be calculated, and the routing table can be automatically changed by transmitting and receiving the network configuration information of each exchange. effective.
【図１】交換機Ａ−Ｄ間の方路が追加された場合の網構
成情報の流れを示すネットワーク構成図である。FIG. 1 is a network configuration diagram showing a flow of network configuration information when a route between exchanges A and D is added.
【図２】図１における交換機Ａのルートテーブルの作成
方法を示す図である。FIG. 2 is a diagram showing a method of creating a route table of exchange A in FIG.
Ａ 交換機Ａ Ｂ 交換機Ｂ Ｃ 交換機Ｃ Ｄ 交換機Ｄ ａ 交換機Ａの方路 ｂ 交換機Ｂの方路 ｃ 交換機Ｃの方路 ｄ 交換機Ｄの方路 α 交換機Ｄの網構成情報 β 交換機Ａの網構成情報 A exchange A B exchange B C exchange C D exchange D a exchange A route b exchange B route c exchange C route d exchange D route α exchange D network configuration information β exchange A network configuration information
───────────────────────────────────────────────────── フロントページの続き (56)参考文献 特開 平１−222556（ＪＰ，Ａ) 特開 昭54−118708（ＪＰ，Ａ) 特開 平２−47993（ＪＰ，Ａ) 特開 平４−180498（ＪＰ，Ａ) (58)調査した分野(Int.Cl.7，ＤＢ名) H04Q 3/545 H04M 3/00 H04Q 3/64 - 3/68 ──────────────────────────────────────────────────続 き Continuation of front page (56) References JP-A-1-222556 (JP, A) JP-A-54-118708 (JP, A) JP-A-2-47993 (JP, A) JP-A-4- 180498 (JP, A) (58) Field surveyed (Int. Cl. 7 , DB name) H04Q 3/545 H04M 3/00 H04Q 3/64-3/68
Claims (1)
呼の中継、他局向け発呼時に参照するルーティングブル
の作成において、前記複数の交換機が個々に管理してい
る隣接交換機との接続情報を、網内のすべての交換機間
で相互に通知しあい、この接続情報を受信した交換機が
個々に網内の構成情報を作成し、この網構成情報から網
内のすべての交換機へのルートとリンク数をワークエリ
アにセーブする手段と、このワークエリアにセーブした
網内のすべての交換機への前記ルートとリンク数とから
対地交換機までの最小リンク数を第１ルートとし、以下
リンク数の少ない順に第２、第３ルートとしルーティン
グテーブルを作成する手段とを有することを特徴とする
交換機の自動ルーティングテーブル作成方式。1. A relay calls in switching network consist of multiple exchanges, in the creation of the routing table to be referred to when another station for call connection information with adjacent exchange which the plurality of exchanges are managed individually Between all exchanges in the network
The exchanges that have received this connection information
Network configuration information is created individually, and the network
To save the route and the number of links to all exchanges in the work area, and to save in this work area
From the route and the number of links to all exchanges in the network
The minimum number of links to the ground switch is a first route, the following
Means for creating a routing table in which the second and third routes are arranged in ascending order of the number of links .
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP3013137A JP3036859B2 (en) | 1991-02-04 | 1991-02-04 | Automatic routing table creation method for exchanges |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP3013137A JP3036859B2 (en) | 1991-02-04 | 1991-02-04 | Automatic routing table creation method for exchanges |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| JPH04247796A JPH04247796A (en) | 1992-09-03 |
| JP3036859B2 true JP3036859B2 (en) | 2000-04-24 |
Family
ID=11824777
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP3013137A Expired - Lifetime JP3036859B2 (en) | 1991-02-04 | 1991-02-04 | Automatic routing table creation method for exchanges |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JP3036859B2 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3526474B2 (en) * | 1994-07-06 | 2004-05-17 | 富士通株式会社 | Distribution information management system in network |
-
1991
- 1991-02-04 JP JP3013137A patent/JP3036859B2/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| JPH04247796A (en) | 1992-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2981166B2 (en) | Apparatus and method for automatically providing trunk line selection and route selection parameters in communication network | |
| US5633922A (en) | Process and apparatus for restarting call routing in a telephone network | |
| JPH0831876B2 (en) | Routing control method in packet switching network | |
| JPS6298846A (en) | Call load balancing of automatic call distribution telephoneservice | |
| JP3036859B2 (en) | Automatic routing table creation method for exchanges | |
| GB2236641A (en) | Call distribution system | |
| JPH0638257A (en) | Line selection system for exchange | |
| CN1558685B (en) | A method for implementing cross-office wide area business group based on SPC exchange | |
| JP2972434B2 (en) | Optimal route selection method for exchanges | |
| KR100318930B1 (en) | Multiline Method Using Virtual Ports at Private Exchanges | |
| JPH01137760A (en) | Incoming call rejection system | |
| JP2900433B2 (en) | External line transmission control method in exchange | |
| JPH09215020A (en) | Private branch exchange connection control method and private branch exchange system | |
| JPH07284132A (en) | Manager secretary system | |
| JPH0331309B2 (en) | ||
| JPS6146693A (en) | Extension representation system in trunk line separate incoming | |
| JPH03187553A (en) | Facsimile equipment | |
| JPH03209956A (en) | Emergency line wire outgoing method | |
| Doner | An analytical model for telephone systems with correlated channel demand | |
| JPH01188161A (en) | System for calculating call frequency | |
| JPS59127457A (en) | Constitution system for variable communication network | |
| JPH0490650A (en) | Route regulation selection system by interoffice signal | |
| JPH0522765A (en) | Trunk line outgoing connection system | |
| JPH03108923A (en) | Route selection system | |
| JPS61203796A (en) | Stored program control exchange |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 Effective date: 20000125 |