JPH01177743A - Routing setting system for hybrid link system - Google Patents
Routing setting system for hybrid link systemInfo
- Publication number
- JPH01177743A JPH01177743A JP63001887A JP188788A JPH01177743A JP H01177743 A JPH01177743 A JP H01177743A JP 63001887 A JP63001887 A JP 63001887A JP 188788 A JP188788 A JP 188788A JP H01177743 A JPH01177743 A JP H01177743A
- Authority
- JP
- Japan
- Prior art keywords
- flow
- switched
- call loss
- circuit
- signals
- 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
- 238000000034 method Methods 0.000 claims description 13
- 230000007423 decrease Effects 0.000 claims description 8
- 238000009472 formulation Methods 0.000 claims description 8
- 239000000203 mixture Substances 0.000 claims description 8
- 230000005540 biological transmission Effects 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 4
- 239000011159 matrix material Substances 0.000 claims description 3
- 230000003252 repetitive effect Effects 0.000 abstract 2
- 230000011664 signaling Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 241001108995 Messa Species 0.000 description 1
- 239000000872 buffer Substances 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C33/00—Moulds or cores; Details thereof or accessories therefor
- B29C33/0022—Multi-cavity moulds
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C45/00—Injection moulding, i.e. forcing the required volume of moulding material through a nozzle into a closed mould; Apparatus therefor
- B29C45/14—Injection moulding, i.e. forcing the required volume of moulding material through a nozzle into a closed mould; Apparatus therefor incorporating preformed parts or layers, e.g. injection moulding around inserts or for coating articles
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C45/00—Injection moulding, i.e. forcing the required volume of moulding material through a nozzle into a closed mould; Apparatus therefor
- B29C45/17—Component parts, details or accessories; Auxiliary operations
- B29C45/26—Moulds
- B29C2045/2683—Plurality of independent mould cavities in a single mould
Abstract
Description
【発明の詳細な説明】
（産業上の利用分野）
本発明は、即時系サービスの回線交換信号と待時系サー
ビスのパケット交換信号を同時に伝送す（従来の技術と
その問題点）
回線／パケット交換信号を統合的に伝送する方式として
ムーバブル・バウンダリ一方式のノ１イブリッド・リン
クが提案され、実用的に有望な方式として注目を集めて
いる（ Ｋ、 Ｋｕｍｍｅｒ ｌｅ 、” Ｍｕｌ ｔ
ｉｐｌｅｘｏｒＰｅｒｆｏｒｍａｎｃｅ ｆｏｒ Ｉ
ｎｔｅｇｒａｔｅｄＬｉｎｅ−ａｎｄ Ｐａｃｋｅｔ
−８ｗ１ｔｃｈｅｄ Ｔｒａｆｆｉｃ、” Ｉｎｔｅｒ
ｎａｔｉｏｎａｌ Ｃｏｎｆｅｒｅｎｃｅ ｏｎＣｏｍ
ｍｕｎｉｃａｔｉｏｎｓ 、 ｐｐ、 ５０７ ５１５
＋ １９７４ ）。[Detailed Description of the Invention] (Industrial Application Field) The present invention simultaneously transmits circuit-switched signals for real-time services and packet-switched signals for standby services (prior art and its problems) Line/Packet A movable boundary one-way hybrid link has been proposed as a system for integrated transmission of exchange signals, and is attracting attention as a practically promising system (K, Kummer le, "Mult
iplexorPerformance for I
integrated Line-and Packet
-8w1tched Traffic,” Inter
National Conference on Com
communications, pp, 507 515
+1974).
本方式は、第２図に示すように、時間軸上で複数のスロ
ットからなる一定時間長のフレームを設ける時分割多重
方式を用いることにより実現される。さらに、これらの
スロットは複数のビットから構成され、その規模は回線
交換信号の所要速度に依存する。例えば、音声サービス
を考えた場合、１スロツトに必要なビット数は音声のデ
ィジタル化速度およびフレーム長により決定される。回
線交換信号は１フレーム当り１スロツトを用いて伝送さ
れ、パケット交換信号は通常複数のスロットを用いて伝
送される。As shown in FIG. 2, this method is realized by using a time division multiplexing method in which a frame of a constant length consisting of a plurality of slots is provided on the time axis. Furthermore, these slots are made up of multiple bits, the size of which depends on the required speed of the circuit-switched signal. For example, when considering voice services, the number of bits required for one slot is determined by the voice digitization rate and frame length. Circuit-switched signals are transmitted using one slot per frame, and packet-switched signals are typically transmitted using multiple slots.
各フレームは境界（バウンダリー）により回線交換領域
（ｐスロット）とパケット交換領域（ｑスロット）Ｋ分
けられる。回線交換信号に対しては、ｐスロットを用い
た呼損系のサービスが提供され、ｑスロットが全て使用
中のときは新たな呼の接続を許さない。パケット交換信
号に対してはバッファが用意され待時系サービスが提供
されるが、パケット交換領域のみならず、あるフレーム
において回線交換領域に空きスロットがあればそのスロ
ットを使用することが可能である。Each frame is divided into a circuit switching area (p slot) and a packet switching area (q slot) K by a boundary. For circuit switched signals, a call loss service using p slots is provided, and no new call connection is allowed when all q slots are in use. Buffers are prepared for packet-switched signals and wait-time services are provided, but if there is an empty slot not only in the packet-switched area but also in the circuit-switched area in a certain frame, it is possible to use that slot. .
第３図は複数のこのようなハイブリッド・リンクを用い
て複数のノードを結んだ統合ネットワークの構成例であ
る。ノードの機能としては前記ハイブリッド・リンクか
らの回線交換信号およびパケット交換信号を受け、各々
に対し従来の回線交換動作およびパケット交換動作を行
ない両交換信号をさらにハイブリッド・リンクへ送シ出
すことが必要である。FIG. 3 shows an example of the configuration of an integrated network using a plurality of such hybrid links to connect a plurality of nodes. The function of the node is to receive circuit-switched signals and packet-switched signals from the hybrid link, perform conventional circuit-switched operations and packet-switched operations on each, and further send both switched signals to the hybrid link. It is.
同図では５つのノードおよび７つのリンクから成るネッ
トワードの例を示し、Ｎｉはノードｉ、Ｌｋはリンクに
、Ａｉｊ、γｉｊは各々ノード１発１着の回線交換信号
およびパケット交換信号のトラヒック・フロー、Ｃｋ、
ｎｋは各々リンクにの回線容量（伝送速度）および回線
交換信号のスロット数（境界）、さらにΣ１Ａｉｊ、Σ
ｊｒｉｊは各々ノードｉからネットワークに流入する回
線交換信号およヒハケット交換信号の総トラヒック・フ
ロー、Σ１Ａｉｊ、Σ１ｒｉｊは各々ノードｊへ到着す
る回線交換信号およびパケット交換信号の総トラヒック
・フローを示す。The figure shows an example of a network word consisting of five nodes and seven links, where Ni is the node i, Lk is the link, and Aij and γij are the traffic signals of circuit-switched signals and packet-switched signals originating from one node and ending at one node, respectively. Flow, Ck,
nk is the line capacity (transmission speed) of each link, the number of slots (boundary) for circuit exchange signals, and Σ1Aij, Σ
jrij represents the total traffic flow of circuit-switched signals and packet-switched signals entering the network from node i, and Σ1Aij and Σ1rij represent the total traffic flows of circuit-switched signals and packet-switched signals arriving at node j, respectively.
このとき、ノードの位置およびリンクとの接続関係を規
定するネットワーク・トポジー、各リンクの伝送速度（
Ｃｋ）、境界（ｎｋ）、トラヒック・７０−（Ａｉｊ
）、（ｒｉ月が与えられ〆とダ、あるノードからあるノ
ードまでネットワーク内をどのような径路でどれだけの
割合でトラヒック・フローを疎通させるかという問題が
存在する。すなわち、本問題はリンクの総数をＮＬとす
ると各リンク上の総回線交換信号のトラヒック量ａ；（
ａｔ＋ａ２．・・・、“ａｚＮＬ）および総パケット交
換信号のトラとツク量λ＝（λｌ、λ２．・・・１．λ
２ＮＬ ）を各発着ノード対ごとの各ノードのおけるフ
ロー保存則が満足されるように策定することである。At this time, the network topology that defines the location of nodes and connection relationships with links, the transmission speed of each link (
Ck), boundary (nk), traffic 70-(Aij
), (Given a month, the problem is how to route traffic from one node to another within the network and at what rate. In other words, this problem is based on link The total number of circuit switched signal traffic on each link is a; (
at+a2. ..., "azNL) and the total amount of packet exchange signals λ=(λl, λ2...1.λ
2NL) such that the flow conservation law at each node for each pair of originating and destination nodes is satisfied.
本問題の設計アルゴリズムにおける目的関数としては一
般に回線交換信号およびパケット交換信号の各々の網内
の平均呼損率ＦＢおよび平均遅延時間ＴＤをトレードオ
フバラメータαで関係付けたＦＢ＋ａＴＤとしている（
Ｍ、Ｇｅｔｌａ他、’Ｄｅｓｉｇｎｏｆ Ｉｎｔｅｇｒ
ａｔｅｄ Ｐａｃｋｅｔ ａｎｄ Ｃ１ｒｃｕｉｔ Ｓ
ｗｉｔｃｈｉｎｇＮｅｔｗｏｒｋｓ、” ＧＬＯＢＥＣ
ＯＭ ’９５ 、５ｅｓｓｉｏｎ ４４，５ 。The objective function in the design algorithm for this problem is generally FB+aTD, where the average call loss rate FB and average delay time TD in the network for circuit-switched signals and packet-switched signals are related by a trade-off parameter α (
M. Getla et al. 'Designof Integra
Ated Packet and C1rcuit S
witchingNetworks,” GLOBEC
OM'95, 5ession 44,5.
１９８６、等）。しかしながら、αの値により前記両信
号のサービス品質を大まかには制御（αを大きく設定す
ると結果としてＴＤが大きく、ＰＢが小さくなり、αを
小さく設定するとその逆となる）は可能であるが、設計
結果を見ないとサービス品質を知ることはできず、所要
の値を得るにはαの値を変え試行錯誤により設計を繰シ
返す必要があるという問題がある。1986, etc.). However, although it is possible to roughly control the service quality of both signals by the value of α (setting α to a large value will result in a large TD and a small PB, and setting α to a small value will result in the opposite); There is a problem in that the service quality cannot be known without looking at the design results, and in order to obtain the desired value it is necessary to repeat the design by changing the value of α and by trial and error.
本発明は、即時系サービスの回線交換信号と待時系サー
ビスのパケット交換信号を同時に伝送するハイブリッド
・リンクを用いた統合ネットヮ−りを対象として、あら
かじめ回線交換信号のサービス品質を陽に規定した設計
が可能なルーティング策定方式を提供することを目的と
する。The present invention targets an integrated network using a hybrid link that simultaneously transmits circuit-switched signals for real-time services and packet-switched signals for standby services, and explicitly defines the service quality of circuit-switched signals in advance. The purpose is to provide a routing formulation method that can be designed.
（問題点を解決するための手段）
本発明の方式は、伝送リンクの時間軸上で複数のスロッ
トからなるフレームを設け、前記フレームを境界により
二つの領域に分け、回線交換信号は第一の領域のみを用
い、パケット交換信号は第二の領域および第一の領域の
空きスロットを用いて前記両信号を伝送するハイブリッ
ド・リンクを用いた統合ネットワークのトポロジー、各
リンクの回線容量、前記境界位置、各ノード間トラヒッ
ク・マトリクス、前記回線交換信号の呼損率規準値が与
えられたときの前記両信号のルーティング策定方式にお
いて、
呼損率が前記規準値より大きくなる前記両信号のフロー
割尚の初期設定を行い、前記回線交換信号のフロー変動
ベクトルおよび最適変動幅から新たな回線交換信号のフ
ローを計算し、呼損率が前回の値より減少しないときは
実現可能解がないものと策定を中止し、減少かつその値
が前記規準値より大きいときは該回線交換信号の新たな
フロー計算を繰り返し、減少かつその値が前記規準値よ
り小さいときはフロー変動幅を調整することにより呼損
率が前記規準値となる回線交換信号フローを求め、前記
パケット交換信号のフロー変動ベクトルおよび最適変動
幅から新たなパケット交換信号のフローを計算し、遅延
時間が減少する限り該パケット交換信号の新たなフロー
計算を繰り返すことを特徴とする。(Means for Solving the Problems) The system of the present invention provides a frame consisting of a plurality of slots on the time axis of a transmission link, divides the frame into two areas by a boundary, and the circuit switching signal is divided into two areas. The topology of an integrated network using a hybrid link in which the packet-switched signal is transmitted using only the second area and empty slots in the first area, the line capacity of each link, and the boundary position. , a traffic matrix between each node, and a method for determining the routing of both signals when the call loss probability standard value of the circuit switched signal is given; Then, a new circuit-switched signal flow is calculated from the circuit-switched signal flow fluctuation vector and the optimal fluctuation width, and if the call loss rate does not decrease from the previous value, it is assumed that there is no feasible solution, and the formulation is stopped, and the flow is determined to decrease and When the value is larger than the reference value, a new flow calculation of the circuit switched signal is repeated, and when the value decreases and the value is smaller than the reference value, the flow fluctuation range is adjusted, so that the call loss rate becomes the reference value. A switching signal flow is determined, a new packet switching signal flow is calculated from the packet switching signal flow variation vector and an optimal variation width, and the new packet switching signal flow calculation is repeated as long as the delay time decreases. shall be.
（実施例） 次に図面を参照して本発明の実施例について説明する。(Example) Next, embodiments of the present invention will be described with reference to the drawings.
第１図（ａ）は本発明のルーティング策定方式の一実施
例のフローチャートであり、同図におけるブロック１０
３，１０４の詳細は各々第１図ｆｂ） 、 （Ｃ）に示
されている。FIG. 1(a) is a flowchart of an embodiment of the routing formulation method of the present invention, in which block 10
Details of 3 and 104 are shown in FIGS. 1fb) and 1c, respectively.
本実施例では、まずブロック１０１において対象となる
ネットワークのノード間の接続関係を示すトポロジー、
各ハイブリッド・リンクの回線速度および回線交換信号
とパケット交換信号の境界位置、各ノード間の前記両信
号のトラヒックマトリクスおよび回線交換信号の呼損率
規準値Ｐ Ｂ ｍａｘを入力する。In this embodiment, first, in block 101, a topology indicating the connection relationship between nodes of the target network,
The line speed of each hybrid link, the boundary position between the circuit-switched signal and the packet-switched signal, the traffic matrix of the two signals between each node, and the call loss probability standard value P B max of the circuit-switched signal are input.
次に、ブロック１０２において前記両信号の初期フロー
として呼損率が規準値ＰＢｍａｘより大きくなるように
設定する。このためには前述のＭ。Next, in block 102, the initial flow of both signals is set so that the call loss probability is greater than the reference value PBmax. For this purpose, the above-mentioned M.
Ｇｅｒｌａらによる第２の参考文献のアルゴリズムにお
いてトレードオフパラメータαを極端に大きく設定し設
計を行えばよい。これにより、回線交換信号およびパケ
ット交換信号の初期フロー（ａＯ１λＯ）が得られる。In the algorithm of the second reference by Gerla et al., the design may be performed by setting the trade-off parameter α extremely large. This results in an initial flow (aO1λO) of circuit-switched and packet-switched signals.
次に、ブロック１０３において呼損率がＰＢｍａＸとな
るまで回線交換信号の７０−の変更を行う。Next, in block 103, the circuit switching signal is changed 70- until the call loss probability becomes PBmaX.
この操作は例えばＧｒａｄｉｅｎｔ Ｐｒｏｊｅｃｔｉ
ｏｎ法（Ｍ。This operation can be performed using, for example, the Gradient Project.
on method (M.
Ｓｃｈｗａｒｔｚ他、 ” Ｔｈｅ Ｇｒａｄｉｅｎｔ
Ｐｒｏｊｅｃｔｉｏｎ Ａｌｇｏｒｉｔｈｍｆｏｒ
Ｍｕｌｔｉｐｌｅ Ｒｏｕｔｉｎｇ ｉｎ Ｍｅｓｓａ
ｇｅ−８ｗｉｔｃｈｅｄＮｅｔｗｏｒｋｓ、” Ｉ Ｅ
ＥＥ Ｔｒａｎｓ、 ｏｎ Ｃｏｍｍ、、 ｖｏｌ
、 Ｃ０Ｍ−２４、ｎｏ、４．ｐｐ、 ４４９−４５６
、Ａｐｒｉｌ １９７６）を修正することにより可能
である。Schwartz et al., “The Gradient
Projection Algorithmfor
Multiple Routing in Messa
ge-8witchedNetworks,”I.E.
EE Trans, on Comm,, vol.
, C0M-24, no, 4. pp, 449-456
, April 1976).
即ち、第１図ｔｂ）に示すように回線交換信号のフロー
変頁処理の繰り返しステップ数をｎを０と初期化を行い
目的関数（ここでは呼損率）が最小となるフロー変動ベ
クトルｆおよびその変動幅を決めるスカラ量ｈｏｐｔ
を求め、それらの値を用いて新たなフローベクトルａ
ｎ＋１ ＝ａｎ−ｈａｐｔ ” ’が計算される。That is, as shown in Fig. 1 (tb), the number of repetition steps of the flow pagination process for circuit switched signals is initialized to 0, and the flow fluctuation vector f and its fluctuations that minimize the objective function (call loss probability here) are calculated. scalar quantity hopt that determines the width
and use those values to create a new flow vector a
n+1 = an-hapt '' is calculated.
この回線交換信号の新たなフローに対する呼損率Ｆ Ｂ
（ａｎ＋ｔ ）が前回の繰シ返しステップにおけるフ
ローに対する呼損率ＦＢ（ａｎ）よりも大きいかあるい
は等しいときはこれ以上呼損率の低減はできないものと
して与えられた呼損率規準値ＰＢｍ、ｘとなる実現可能
解はないものと判断しアルゴリズムを中止する。Call loss probability F B for this new flow of circuit switched signals
When (an+t) is greater than or equal to the call loss rate FB(an) for the flow in the previous iteration step, the call loss rate can not be reduced any further, and the feasible solution for the call loss rate standard value PBm,x is It is determined that there is no such thing and the algorithm is stopped.
呼損率ＰＲ（ａｎ＋１）がＰＢ（ａｎ）よりも小さくか
つ呼損率規準値ＰＢｌｌｎ、ｘよシ大きいときは繰り返
しステップ数ｎをインクリメントし処理を繰シ返す。When the call loss rate PR(an+1) is smaller than PB(an) and larger than the call loss rate reference value PBlln,x, the number of repetition steps n is incremented and the process is repeated.
呼損率ＰＢ（ａｎ＋１）が呼損率規準値ＰＢｆｆ、１ｘ
より小さくあるいは等しくなったときは繰り返し処理
を終了しフロー変動幅のスカラ量ｈ′を調整し呼損率が
正確に規準値ＰＢｍａ！となるフｏ −ａ＝ａｎ−ｈ’
・ｆを求め回線交換信号のフロー変更を終了する。The call loss rate PB(an+1) is the call loss rate reference value PBff, 1x
When it becomes smaller or equal to the value, the iterative process is terminated and the scalar amount h' of the flow fluctuation width is adjusted so that the call loss rate is accurately set to the reference value PBma! The fo -a=an-h'
・Find f and finish changing the flow of circuit switching signals.
次に、第１図（Ｃ）に示すブロック１０４において遅延
時間が減少する限りパケット交換信号のフロー変更が回
線交換信号のフロー変更と同様な方法で行われる。ただ
し、目的関数を遅延時間とし、フローを示すベクトル変
数がλ、フロー変動ベクトルがｇとなり、呼損率の収束
条件の判定が不用で該処理が含まれていない点が違うだ
けであるので詳しい説明は省略する。Next, in block 104 shown in FIG. 1C, the flow change of packet switched signals is performed in a manner similar to the flow change of circuit switched signals as long as the delay time is reduced. However, the only difference is that the objective function is the delay time, the vector variable indicating the flow is λ, the flow variation vector is g, and the process is not included because there is no need to judge the convergence condition of the call loss rate. Omitted.
（発明の効果）
以上の説明かられかるように、本発明によればあらかじ
め回線交換信号の呼損率規準値を設定可能なハイブリッ
ド・リンク・システムのルーティング策定方式が提供で
きる。(Effects of the Invention) As can be seen from the above description, according to the present invention, it is possible to provide a routing formulation method for a hybrid link system in which a reference value of call loss probability for circuit switching signals can be set in advance.
第１図は本発明の一実施例のハイブリッド・リンク・シ
ステムのルーティング策定方式のフローチャート図、第
２図はハイブリッド・リンクの７レ一ム構成図、第３図
はハイブリッド・リンクを用いた統合ネットワークの構
成例を示す図である。
（３（１，λＯ）・・・・・・回線交換信号およびパケ
ット交換信号の初期フロー、ｎ・・・・・・フロー変更
の繰シ返しステップ数、ｆ、ｇ・・・・・・フロー変動
ベクトル、ｈ ｏｐｔ・・・・・・フロー変動幅を決め
るスカラ量、ａｎ＋１゜ａｆｌ・・・・・・回線交換信
号のフローベクトル、ＰＢ・・・・・・呼損率、λ。＋
１．λ。・・・・・・パケット交換信号のフローベクト
ル、ＴＤ・・・・・・遅延時間、Ｃ８・・・・・・回線
交換信号、ＰＳ・・・・・・パケット交換信号、ｐ・・
・・・・回線交換信号領域のスロット数、ｑ・・・・・
・パケット交換信号領域のスロット数、Ａｉｊ・・・・
・・ノード１発３着の回線交換信号のトラヒック・フロ
ー、γｉｊ・・・・・・ノード１発３着のパケット交換
信号のトラヒック・フロー、Ｃｋ・・・・・・リンクに
の回線容量、ｎｋ・・・・・・リンクにの回線交換信号
領域のスロット数、Ｎｉ・・・・・・ノードｉ、Ｌｋ・
・・・・・リンクに、ａｋ・・団・リンクに上の総回線
交換信号トラヒック、λｋ・・・・・・リンクに上の総
パケット交換信号トラヒック。
代理人 弁理士 内 原 晋
箒 １ 回（Ｃプ
１界
＄ ２ 舅Fig. 1 is a flowchart of a routing formulation method for a hybrid link system according to an embodiment of the present invention, Fig. 2 is a seven-frame configuration diagram of a hybrid link, and Fig. 3 is an integration using a hybrid link. FIG. 2 is a diagram showing an example of a network configuration. (3(1,λO)...Initial flow of circuit switched signals and packet switched signals, n...Number of repeated steps for flow change, f, g...Flow Fluctuation vector, h opt... Scalar quantity that determines flow variation width, an+1° afl... Flow vector of circuit switched signal, PB... Call loss probability, λ.+
1. λ. ...Flow vector of packet switching signal, TD...Delay time, C8...Circuit switching signal, PS...Packet switching signal, p...
...Number of slots in the circuit switched signal area, q...
・Number of slots in packet exchange signal area, Aij...
...Traffic flow of circuit-switched signals from node 1 to 3rd destination, γij...Traffic flow of packet-switched signals from node 1 to 3rd destination, Ck...Circuit capacity of link, nk...Number of slots in the circuit switching signal area for the link, Ni...Node i, Lk.
...total circuit-switched signaling traffic on the link, ak...total circuit-switched signaling traffic on the link, λk...total packet-switched signaling traffic on the link. Agent: Patent attorney Shinho Uchihara 1 time (CP 1 world $ 2 father-in-law)
Claims (1)
ムを設け、前記フレームを境界により二つの領域に分け
、回線交換信号は第一の領域のみを用い、パケット交換
信号は第二の領域および第一の領域の空きスロットを用
いて前記両信号を伝送するハイブリッド・リンクを用い
た統合ネットワークのトポロジー、各リンクの回線容量
、前記境界位置、各ノード間トラヒック・マトリクス、
前記回線交換信号の呼損率規準値が与えられたときの前
記両信号のルーティング策定方式において、呼損率が前
記規準値より大きくなる前記両信号のフロー割当の初期
設定を行い、前記回線交換信号のフロー変動ベクトルお
よび最適変動幅から新たな回線交換信号のフローを計算
し、呼損率が前回の値より減少しないときは実現可能解
がないものとし策定を中止し、減少かつその値が前記規
準値より大きいときは該回線交換信号の新たなフロー計
算を繰り返し、減少かつその値が前記規準値より小さい
ときはフロー変動幅を調整することにより呼損率が前記
規準値となる回線交換信号フローを求め、前記パケット
交換信号のフロー変動ベクトルおよび最適変動幅から新
たなパケット交換信号のフローを計算し、遅延時間が減
少する限り該パケット交換信号の新たなフロー計算を繰
り返すことを特徴とするハイブリッド・リンク・システ
ムのルーティング策定方式。A frame consisting of a plurality of slots is provided on the time axis of the transmission link, and the frame is divided into two areas by a boundary. Circuit-switched signals use only the first area, and packet-switched signals use the second area and the first area. a topology of an integrated network using a hybrid link that transmits both signals using empty slots in the area, the line capacity of each link, the boundary position, the traffic matrix between each node,
In the routing formulation method for both signals when the call loss probability standard value of the circuit switched signal is given, initial settings are made for flow allocation of the two signals whose call loss probability is larger than the standard value, and flow fluctuations of the circuit switched signal are determined. A new circuit switching signal flow is calculated from the vector and the optimal variation range, and if the call loss rate does not decrease from the previous value, it is assumed that there is no feasible solution and the formulation is stopped, and if the call loss rate decreases and the value is larger than the above-mentioned standard value. repeats a new flow calculation of the circuit-switched signal, and when it decreases and the value is smaller than the standard value, the circuit-switched signal flow in which the call loss probability becomes the standard value is determined by adjusting the flow fluctuation range, and the packet-switched Routing for a hybrid link system characterized by calculating a new packet-switched signal flow from a signal flow fluctuation vector and an optimal fluctuation width, and repeating the calculation of the new packet-switched signal flow as long as the delay time decreases. Formulation method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP63001887A JPH01177743A (en) | 1988-01-08 | 1988-01-08 | Routing setting system for hybrid link system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP63001887A JPH01177743A (en) | 1988-01-08 | 1988-01-08 | Routing setting system for hybrid link system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPH01177743A true JPH01177743A (en) | 1989-07-14 |
Family
ID=11514083
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP63001887A Pending JPH01177743A (en) | 1988-01-08 | 1988-01-08 | Routing setting system for hybrid link system |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH01177743A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0758778A (en) * | 1993-06-07 | 1995-03-03 | Internatl Business Mach Corp <Ibm> | Packet management at inside of communication network |
-
1988
- 1988-01-08 JP JP63001887A patent/JPH01177743A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0758778A (en) * | 1993-06-07 | 1995-03-03 | Internatl Business Mach Corp <Ibm> | Packet management at inside of communication network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Athuraliya et al. | REM: Active queue management | |
| Benmohamed et al. | Feedback control of congestion in packet switching networks: The case of a single congested node | |
| JP2648579B2 (en) | Method and network node for determining optimal route | |
| US5577028A (en) | Routing system using a neural network | |
| CN105553855B (en) | Method and system for dynamically adjusting topological structure of underlying network spanning tree | |
| US6744734B1 (en) | Method for generating the optimal PNNI complex node representations for restrictive costs | |
| CN112637061B (en) | Dynamic multi-factor path calculation method based on heuristic algorithm | |
| US5719930A (en) | Method of volume screening signalling messages in a telecommunication system | |
| JP2839024B2 (en) | Buffer control device | |
| Hwang et al. | On-call processing delay in high speed networks | |
| JPH01177743A (en) | Routing setting system for hybrid link system | |
| Schwartz et al. | Routing and flow control in data networks | |
| Doubligeris et al. | A game theoretic approach to flow control in an integrated environment with two classes of users | |
| US7609965B2 (en) | Method for reorganizing wavelength division multiplexing network using dynamic watermarks | |
| US20060176819A1 (en) | Method for operating a network node of a communication network and network node of a communication network | |
| Miyahara et al. | Delay and throughput evaluation of switching methods in computer communication networks | |
| Moscholios et al. | Qos guarantee in a multirate loss model of batched Poisson arrival processes | |
| Bolot | A self-tuning regulator for adaptive overload control in communication networks | |
| JP3066910B2 (en) | ATM admission network call admission control method | |
| Tsitsiklis et al. | Distributed asynchronous optimal routing in data networks | |
| JPS63161749A (en) | Flow assigning system for hybrid link system | |
| Bhat et al. | A queueing network analysis of dynamic reconfigurability in a hierarchical information network | |
| Uhl | THE ALTERNATE ROUTING–PROS AND CONS FOR AN APPLICATION IN COMPUTER COMMUNICATION NETWORKS | |
| JP2611659B2 (en) | Calculation method of transmission capacity and traffic flow | |
| Baccelli et al. | On the stable behaviors of window flow control |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A621 | Written request for application examination |
Effective date: 20040824 Free format text: JAPANESE INTERMEDIATE CODE: A621 |
|
| A977 | Report on retrieval |
Free format text: JAPANESE INTERMEDIATE CODE: A971007 Effective date: 20051215 |
|
| A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20051220 |
|
| A521 | Written amendment |
Effective date: 20060217 Free format text: JAPANESE INTERMEDIATE CODE: A523 |
|
| A02 | Decision of refusal |
Effective date: 20060324 Free format text: JAPANESE INTERMEDIATE CODE: A02 |
|
| A521 | Written amendment |
Effective date: 20060523 Free format text: JAPANESE INTERMEDIATE CODE: A523 |
|
| A911 | Transfer of reconsideration by examiner before appeal (zenchi) |
Free format text: JAPANESE INTERMEDIATE CODE: A911 Effective date: 20060802 |
|
| A131 | Notification of reasons for refusal |
Effective date: 20060912 Free format text: JAPANESE INTERMEDIATE CODE: A131 |
|
| A521 | Written amendment |
Effective date: 20060919 Free format text: JAPANESE INTERMEDIATE CODE: A523 |
|
| TRDD | Decision of grant or rejection written | ||
| A01 | Written decision to grant a patent or to grant a registration (utility model) |
Effective date: 20061017 Free format text: JAPANESE INTERMEDIATE CODE: A01 |
|
| A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20061026 |
|
| R150 | Certificate of patent (=grant) or registration of utility model |
Free format text: JAPANESE INTERMEDIATE CODE: R150 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Year of fee payment: 4 Free format text: PAYMENT UNTIL: 20101102 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Year of fee payment: 4 Free format text: PAYMENT UNTIL: 20101102 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20111102 Year of fee payment: 5 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20111102 Year of fee payment: 5 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20121102 Year of fee payment: 6 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20121102 Year of fee payment: 6 |
|
| FPAY | Renewal fee payment (prs date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20131102 Year of fee payment: 7 |
|
| LAPS | Cancellation because of no payment of annual fees |