JPH0358646A - Band assignment system in packet communication network - Google Patents
Band assignment system in packet communication networkInfo
- Publication number
- JPH0358646A JPH0358646A JP1195473A JP19547389A JPH0358646A JP H0358646 A JPH0358646 A JP H0358646A JP 1195473 A JP1195473 A JP 1195473A JP 19547389 A JP19547389 A JP 19547389A JP H0358646 A JPH0358646 A JP H0358646A
- Authority
- JP
- Japan
- Prior art keywords
- bandwidth
- call
- class
- band
- priority
- 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
- 238000004891 communication Methods 0.000 title claims description 14
- 230000005540 biological transmission Effects 0.000 claims abstract description 42
- 238000000034 method Methods 0.000 claims description 15
- 239000000872 buffer Substances 0.000 abstract description 13
- 230000000694 effects Effects 0.000 abstract description 6
- 238000000275 quality assurance Methods 0.000 abstract description 2
- 230000007774 longterm Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 230000006866 deterioration Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
【発明の詳細な説明】
(産業上の利用分野)
本発明は、音声、データ、画像等を一括統合交換する為
の高速パケット交換網に関し、特に通信品質を確実に保
証しつつ、伝送路に対して効率良く呼の収容を行なう方
式に関するものである。[Detailed Description of the Invention] (Field of Industrial Application) The present invention relates to a high-speed packet switching network for collectively exchanging voice, data, images, etc. The present invention relates to a system for efficiently accommodating calls.
(従来の技術)
このような多重化方式に対応した高速パヶノト交換網に
おいては、パケットの発生が統計的性質をもつ。したが
って、呼の仮想回線を設定する場合、要求されるパケッ
トの遅延、廃棄といった伝送品質を保ちつつ、伝送路の
有効利用を計るため、網内でその呼に対してある帯域を
割当て、呼量を管理する必要がある。その場合、プロト
コルを簡略化するため実際のトラヒソク量を測定l一つ
つ、フロー制御を行なう方式よりは、呼設定時に人力負
荷(帯域)を予想して帯域割当てにより呼設定を許可/
拒否する方式が望ましい。(Prior Art) In a high-speed Pagano switching network compatible with such a multiplexing method, the generation of packets has statistical properties. Therefore, when setting up a virtual circuit for a call, in order to effectively utilize the transmission path while maintaining the required transmission quality such as packet delay and discard, allocate a certain amount of bandwidth to the call within the network and need to be managed. In that case, in order to simplify the protocol, it is better to measure the actual traffic volume and perform flow control by estimating the human load (bandwidth) at the time of call setup and permitting call setup by allocating bandwidth.
A method of refusing is preferable.
このような帯域割当て方式について電子情報通信学会技
術報告SE87−138、43〜48ページ記載の、渡
辺他著「高速パケット交換における統計多重制御法の検
討jによるものが知られている。この文献では、仮想回
線を設定する場合、平均帯域、最大帯域、バースト長(
どの程度パケソI・が連続して発生ずるかを示す値)と
いった様々なパラメータを考慮した平均帯域以上、最大
帯域以下の「仮想帯域」によって伝送路の帯域割当てを
おこなっている。Regarding such a band allocation method, one is known from Watanabe et al., ``Study of statistical multiplex control method in high-speed packet switching,'' described in IEICE technical report SE87-138, pages 43-48. , when configuring a virtual circuit, the average bandwidth, maximum bandwidth, and burst length (
The bandwidth of the transmission path is allocated using a "virtual bandwidth" that is greater than the average bandwidth and less than the maximum bandwidth, taking into account various parameters such as (a value indicating how many Paqueso I* occur continuously).
(発明が解決しようとする課題)
従来技術によれば、各呼の帯域割当てを平均帯域以上、
最大帯域以下の「仮想帯域」によっておこなっているが
、帯域割当ての面から考えると、高速パケット網で扱う
呼は以下の3つに分類される。(Problem to be Solved by the Invention) According to the prior art, the bandwidth allocation for each call is equal to or greater than the average bandwidth.
Although calls are made using a "virtual bandwidth" that is less than the maximum bandwidth, from the perspective of bandwidth allocation, calls handled by high-speed packet networks can be classified into the following three types.
Oクラス1...平均帯域と最大帯域が等しい固定帯域
呼
Oクラス2...最大帯域が大きい(例えばリンク容量
の10分の1以上)為、品質を保
証する為には、最大帯域で割当
てせざるを得ないバースト呼
Oクラス3...最大帯域が小さい為、最大帯域より小
さい仮想帯域で帯域割当
てしても品質保証が可能なバー
スト呼
クラス1並びにクラス2の呼は、回線交換(固定帯域割
当て)と同じ多重度しか得られない。ただし、最大帯域
つまり確定的な帯域で伝送路容量の割当てを行なう為、
他の呼に対して品質劣化を及ぼず事はない。一方、クラ
ス3の呼に対しては回線交換より大きい多重数が期待で
きる。これを統計多重効果と呼ぶ。ただしクラス3の呼
は統計多重効果が期待できる半面、帯域に確率的変動が
あり、仮想帯域以」−の負荷が加わる可能性がある。つ
まりクラス3の呼を許容すると、割当てた帯域以上の1
・ラヒックが網内に流入し、他の呼に対して遅延、バッ
ファ溢れ等の品質劣化を及ぼず可能性がある。O class 1. .. .. Fixed-band call O class where average bandwidth and maximum bandwidth are equal 2. .. .. Since the maximum bandwidth is large (for example, more than 1/10 of the link capacity), burst calls must be allocated at the maximum bandwidth in order to guarantee quality. .. .. Since the maximum bandwidth is small, burst call class 1 and class 2 calls, for which quality can be guaranteed even if bandwidth is allocated using a virtual bandwidth smaller than the maximum bandwidth, can only obtain the same multiplicity as circuit switching (fixed bandwidth allocation). However, since the transmission line capacity is allocated using the maximum band, that is, the deterministic band,
This does not cause quality deterioration to other calls. On the other hand, for class 3 calls, a higher number of multiplexes than circuit switching can be expected. This is called statistical multiple effects. However, although class 3 calls can be expected to have a statistical multiplexing effect, there are stochastic fluctuations in the band, and there is a possibility that a load beyond the virtual band will be added. In other words, if Class 3 calls are allowed, 1
- There is a possibility that the traffic may flow into the network without causing quality deterioration such as delay or buffer overflow to other calls.
一般に、動画や高速の静止画転送の様な呼はクラス1,
2に属ずるが、これらはデータ通信のようなクラス3の
呼に比べ要求品質が厳しい。しかしながらここで問題に
なるのは、クラス1, 2. 3の呼の網内パケット転
送処理を一律に取扱うと、クラス1,2の呼が、確定的
な帯域で帯域確保したにもかかわらず、確率的に帯域割
当てされるクラス3の呼によって品質劣化が起きる可能
性があることである。これが第一の従来技術の問題点で
ある。Generally, calls such as video or high-speed still image transfers are Class 1,
However, these calls have stricter quality requirements than class 3 calls such as data communications. However, the problem here is class 1, 2. If the intra-network packet transfer processing for calls 3 is treated uniformly, the quality of class 1 and 2 calls will deteriorate due to the stochastic band allocation due to class 3 calls, even though the bands are secured in a deterministic band. is a possibility that may occur. This is the problem with the first prior art.
次に問題となるのは、クラス3の仮想帯域の算出法であ
る。バースト呼の仮想帯域は、要求品質を満足する条件
下での多重効率によって定まるが、一般にこれはリンク
容量に列する各呼の帯域の大きさに大きく依存する。第
3図は端末の最大帯域(リンク速度で正規化)に対する
仮想帯域Rvの例である(本図の仮想帯域の導出法は電
子情報通信学会技術報告IN88−117、村瀬他著[
ATM網に於けるバーストトラヒックの収容法]にその
一例が記載されている)。第3図には最大帯域と平均帯
域を併記している。仮想帯域は最大帯域以下と平均帯域
以上の値で定義される。本図から最大帯域が大きい呼ほ
ど仮想帯域は大きく設定する必要があることがわかる。The next problem is how to calculate the class 3 virtual bandwidth. The virtual bandwidth of a burst call is determined by the multiplexing efficiency under conditions that satisfy the required quality, but generally this depends largely on the size of the bandwidth of each call in line with the link capacity. Figure 3 is an example of the virtual bandwidth Rv for the maximum bandwidth of the terminal (normalized by link speed).
An example of this is described in ``Methods for Accommodating Burst Traffic in ATM Networks''. In FIG. 3, the maximum band and the average band are both shown. The virtual bandwidth is defined by a value below the maximum bandwidth and above the average bandwidth. From this figure, it can be seen that the larger the maximum band for a call, the larger the virtual band needs to be set.
ここで注意すべきなのは、この仮想帯域がリンク容量で
正規化された最大帯域に依存していることである。ここ
でリンク容量とは、クラス3のバースト呼が多重化され
るリンクの容量を意味する。It should be noted here that this virtual bandwidth depends on the maximum bandwidth normalized by the link capacity. Here, link capacity means the capacity of a link on which class 3 burst calls are multiplexed.
例えば第4図に示すように同一伝送路内でクラス1,2
の呼が多重されている場合には、それらの使用帯域を伝
送路の帯域から差引いた残余容量を意味する。実際には
、クラス1,2の呼の使用帯域は時々刻々と変化してい
る為、残余帯域が刻々と変化し、各バースト呼の仮想帯
域はその度に定義しなおさなければならない。従って、
仮想帯域を用いた帯域割当てを行なう従来技術において
は、クラス3の呼に幻ずる仮想帯域の計算量が著しく増
加することになる。これが従来技術の第2の問題点であ
る。For example, as shown in Figure 4, class 1 and 2
When calls are multiplexed, it means the remaining capacity obtained by subtracting the bandwidth used by these calls from the bandwidth of the transmission path. In reality, since the bandwidth used by class 1 and 2 calls changes from moment to moment, the remaining bandwidth changes from moment to moment, and the virtual band for each burst call must be redefined each time. Therefore,
In the conventional technology that allocates bandwidth using virtual bandwidth, the amount of calculation for the virtual bandwidth for class 3 calls increases significantly. This is the second problem with the prior art.
本発明は、クラス3の呼へのイ1?域割当てを変化させ
ても、クラス1,2の呼への品質に影響を与えることが
なく、かつクラス3の呼に刻する帯域割当ての計算量も
少ない帯域割当て方式を提供することを目自りとする。The present invention provides a method for addressing Class 3 calls. The objective is to provide a bandwidth allocation method that does not affect the quality of calls of classes 1 and 2 even if the area allocation is changed, and that requires less calculation of bandwidth allocation for class 3 calls. I will do it.
(課題を解決するための手段)
第1の本発明によれば、パケット通信網において、優先
度を2種類設け、第1の優先度を要求する呼に対しては
、情報発生源のパク゛ット送出速度の最大値に等しい帯
域により通過する伝送路に対して帯域割当てを行ない、
第2の優先度を要求する呼に対しては、情報発生源のパ
ケット退出速度の平均値以上、最大値以下の仮想帯域に
より通過する伝送路に対して帯域割当てを行ない、網内
において第1の優先度をもつパケットは第2の優先度を
もつパケノトより優先的に伝送されることを特徴とする
パケット通信網における帯域割当て方式が得られる。(Means for Solving the Problems) According to the first aspect of the present invention, two types of priorities are provided in a packet communication network, and for a call requesting the first priority, packet transmission from an information source is performed. Bandwidth is allocated to the passing transmission path using a band equal to the maximum speed,
For calls that require the second priority, bandwidth is allocated to the transmission path passing through using a virtual band that is greater than or equal to the average value and less than the maximum value of the packet exit speed of the information source, and A bandwidth allocation method in a packet communication network is obtained in which a packet having a priority of 1 is transmitted preferentially over a packet having a second priority.
また第2の本発明によれば、パケット通信網において、
おのおのの呼を情報発生源のパケット退出速度の最大値
に等しい帯域により、通過する伝送路に対して帯域割当
てを行なう第一の呼種と情報発生源のパケット送出速度
の平均値以上、最大値以下の仮想帯域により通過する伝
送路に対して帯域割当てを行なう第2の呼種とに分類し
各伝送路の総容量を第一の呼種に割当てる容量と、第二
の呼種に割当てる容量とにあらかじめ論理的に分離して
運用する帯域割当て方式が得られる。Further, according to the second invention, in the packet communication network,
Bandwidth is allocated to the transmission path through which each call passes, using a bandwidth equal to the maximum value of the packet exit speed of the information source.The first call type and the average value of the packet sending speed of the information source, the maximum value The total capacity of each transmission path is divided into a second call type, in which bandwidth is allocated to the transmission path passing through the following virtual bands, and the capacity is allocated to the first call type, and the capacity is allocated to the second call type. This provides a bandwidth allocation method that logically separates and operates in advance.
また第2の本発明において、前記第一の呼種と前記第2
の呼種の長期的な負荷変動に応じ、前記第一の呼種と前
記第2の呼種にたいし論理的に分離した伝送路容量の再
割当てを行なうことも可能である。Further, in the second aspect of the present invention, the first call type and the second
It is also possible to reallocate logically separate transmission line capacities to the first call type and the second call type in response to long-term load fluctuations of the call types.
(作用)
第1の発明では、最大帯域で伝送路の帯域割当てをする
クラス1.2の呼に対して、高優先権を与え、確率的に
定まる仮想帯域で帯域割当てをするクラス3の呼に低優
先権を与えて網内転送制御を行なうことにより、クラス
間の相互影響は排除している。この優先権の導入により
、高優先のクラスの呼は、低優先のクラスの呼の帯域変
動に影響されなくなる。高優先権のクラス1,2の呼は
最大帯域で帯域割当てされるので、確定的な伝送品質を
保証する事ができる。これに対し、クラス3は仮想的な
帯域割当てによって多重する事により統計多重効果が得
られるが、確率的な品質劣化はクラス3の呼の間でのみ
発生するようにすることができる。(Operation) In the first invention, a high priority is given to a class 1.2 call in which the maximum bandwidth is allocated to a transmission path, and a class 3 call is allocated in a probabilistically determined virtual band. Mutual influence between classes is eliminated by giving low priority to the class and performing intra-network transfer control. By introducing this priority, calls in the high priority class are not affected by bandwidth fluctuations in calls in the low priority class. Since the highest priority class 1 and 2 calls are allocated the maximum bandwidth, reliable transmission quality can be guaranteed. On the other hand, class 3 can obtain a statistical multiplexing effect by multiplexing based on virtual bandwidth allocation, but stochastic quality deterioration can be made to occur only between class 3 calls.
第2の発明では、あらかじめ仮想的にクラス1,2とク
ラス3にたいずるリンク容量は仮想的に分離して害り当
てられている。そのため、クラス3にとっての仮想リン
ク容量は、クラス1,2の呼の負荷状況に影響されず常
に一定である。クラス3の呼にとっての仮想帯域は、あ
らかじめ割当てられた仮想リンク量で帯域を正規化して
計算すれば良く、一度仮想帯域を決めれば、再計算する
必要はなくなる。In the second invention, the link capacities for classes 1, 2 and 3 are virtually separated and allocated in advance. Therefore, the virtual link capacity for class 3 is always constant without being affected by the call load status of classes 1 and 2. The virtual bandwidth for a class 3 call can be calculated by normalizing the bandwidth with the amount of virtual links allocated in advance, and once the virtual bandwidth is determined, there is no need to recalculate it.
また第2の発明では、長期的な負荷状況に応じて、両ク
ラスに月ずる仮想リンク容量の再割当てを行なえば、さ
らに効率的に多重化が行なえる。再割当ての際、仮想帯
域を再計算する必要が有るが、長期的な負荷変動に応じ
た再割当ては頻繁には起きないので、計算量の増加は小
さい。Further, in the second invention, multiplexing can be performed more efficiently by reallocating the virtual link capacity to both classes on a monthly basis depending on the long-term load situation. When reallocating, it is necessary to recalculate the virtual bandwidth, but since reallocation in response to long-term load fluctuations does not occur frequently, the increase in the amount of calculation is small.
(実施例)
次に図を参照して本発明のパケット通信網における帯域
割当て方式について説明する。(Embodiment) Next, a band allocation method in a packet communication network according to the present invention will be described with reference to the drawings.
第1図は請求項第1の発明の実施例を示す模式図である
。第1図によれば、本発明の実施例は、クラス1, 2
. 3を収容するパケットバッファ120, 121と
制御線がバケツトバツファ120, 121のパケット
書込読み出しを制御する優先度制御装置130と、伝送
路100と、伝送路100の帝域管理をずる帯域割当て
装置110により構成される。FIG. 1 is a schematic diagram showing an embodiment of the invention according to claim 1. According to FIG. 1, the embodiment of the present invention
.. 3, a priority control device 130 that controls packet writing/reading of the bucket buffers 120, 121, a transmission path 100, and a bandwidth allocation device 110 that manages the transmission path 100. Consisted of.
ここでクラス1は固定帯域R1の呼である。クラス2は
バースト呼では有るが、最大帯域が大きいバースト呼で
、要求品質を満たず為には最大帝域R2で帯域確保を行
なわなければならない呼である。これらの呼の例どして
は、パケット伝送網にたいして高い伝送品質(例えばパ
ケット廃棄確率が10−9以下)を要求するもので、動
画情報や大容量の静止画転送などが考えられる。Here, class 1 is a fixed band R1 call. Class 2 is a burst call, but it is a burst call with a large maximum bandwidth, and in order to not meet the required quality, the bandwidth must be secured in the maximum imperial area R2. Examples of these calls require high transmission quality (for example, packet discard probability of 10-9 or less) from the packet transmission network, such as video information or large-capacity still image transfer.
クラス3は最大帯域が小さく統計多重効果が期待できる
ため、伝送路100に対して仮想帯域R3で帯域確保を
行なう呼である。その例としては、伝送路速度に比べて
比較的低速な速度のバースト通信である、LAN間通信
や端末−ホスト間の会話形通信などが挙げられる。Class 3 is a call in which the virtual band R3 is reserved for the transmission line 100 because the maximum band is small and a statistical multiplexing effect can be expected. Examples include LAN-to-LAN communications and terminal-to-host conversational communications, which are burst communications that are relatively slow compared to the transmission path speed.
ここで帯域割当て装置110はこれら各クラスの呼にた
いして、伝送路100の容量割当てを行なうものである
。特にクラス3に対しては、その呼の平均帯域と最大帯
域から仮想帯域を決定する。$3図に各呼の最大帯域と
、リンク容量と仮想帯域の関係を示したが、帯域割当て
装置110はこのような関係式(工1)
を用いて仮想帯域を得る。あらたな呼設定要求にたいし
ては、各呼の最大帯域あるいは仮想帯域の和を計算し(
例えばRl + R2 + R3)、これが伝送路10
0の容量Cより小さいときに限り呼設定を許す。Here, the band allocation device 110 allocates the capacity of the transmission path 100 to each of these classes of calls. Particularly for class 3, the virtual bandwidth is determined from the average bandwidth and maximum bandwidth of the call. Figure 3 shows the relationship between the maximum bandwidth of each call, the link capacity, and the virtual bandwidth, and the bandwidth allocation device 110 obtains the virtual bandwidth using such a relational expression (Step 1). For new call setup requests, calculate the maximum bandwidth or the sum of virtual bandwidth for each call (
For example, Rl + R2 + R3), this is the transmission line 10
Call setup is allowed only when the capacity C is smaller than 0.
ここでクラス],2の呼は割当てられた帯域以」二にパ
ケットが入力されることはないが、クラス3の呼は確率
的に帯域が変動し、割当てられた仮想帯域以上にパケッ
トが網入力される事がある。その為に他の呼に対1,、
品質劣化を及ぼす可能性がある。その為の列策として、
本発明ではクラス1,2を高優先クラス、クラス3を低
優先クラスと定義して網内伝送を行なう。バッファ12
0は高優先クラス専用、バッファ121は低優先専用で
、優先制御装置130がバッファの書込読み出し制御を
行なう。高優先バッファにパケットが有るときには、低
優先パケットは送出されない。このようにすると、クラ
ス3の呼の確率的帯域変動によりクラス1,2に品質劣
化を及ぼずことはなくなる。Here, calls of class], 2 will never receive packets beyond the allocated bandwidth, but calls of class 3 will have their bandwidth stochastically fluctuated, and packets will be input to the network beyond the allocated virtual bandwidth. It may be entered. For that reason, 1 for other calls...
There is a possibility of quality deterioration. As a measure for that purpose,
In the present invention, classes 1 and 2 are defined as high priority classes, and class 3 is defined as a low priority class, and intra-network transmission is performed. Buffer 12
0 is dedicated to the high priority class, and the buffer 121 is dedicated to the low priority class, and the priority control device 130 controls writing and reading of the buffer. When there are packets in the high priority buffer, low priority packets are not sent. In this way, the quality of classes 1 and 2 will not be degraded due to stochastic band fluctuations in class 3 calls.
つぎに第2の発明の実施例を第2図を用いて説明する。Next, a second embodiment of the invention will be described using FIG. 2.
(12)
伝送路容量Cはクラス1,2用の仮想リンク容量C1と
クラス3用の仮想リンク容量C3に論理的に分離される
。この01と02の割当ては長期的な両l・ラヒックの
割合を統計的に予想して決められる。ここでクラス1,
2の呼の帯域をRl, R2とずるとC1≧R1+R2
となるように、クラス3の呼の仮想帯域の総和をΣR3
とずれば、C2≧ΣR3となるように帯域割当てが行な
われる。この帯域割当ては第1図の帯域割当てで装置1
10によって実行される。(12) The transmission line capacity C is logically separated into a virtual link capacity C1 for classes 1 and 2 and a virtual link capacity C3 for class 3. The allocation of 01 and 02 is determined by statistically predicting the long-term ratio of both l-rahic. Here class 1,
If the band of call 2 is set as Rl and R2, C1≧R1+R2
The total virtual bandwidth of class 3 calls is ΣR3 so that
If it deviates, band allocation is performed so that C2≧ΣR3. This bandwidth allocation is based on the bandwidth allocation shown in Figure 1 for device 1.
10.
これにより、伝送路容JtCからクラス1,2の呼の使
用容量を差引いた、クラス3にとっての残余容量は常に
02以上確保される事になる。従って、前述した仮想帯
域の計算は、C2をリンク容量として正規化した各呼の
最大帯域と平均帯域から第3図の関係を用いて計算すれ
ば良い。この時C2はクラス1,2の呼の使用容量に依
存しないので、仮想帯域は一度計算すれば再計算する必
要はない。またC1と02の割当ては長期的なトラヒッ
ク予測に基づいて行なうと述べたがこれを、長期的なト
ラヒック変動(時間、日、人為的事象による物)によっ
て再割当てを行なっても良い。これは第2図の01と0
2の仮想境界(論理的な境界)を動的に移動させる事で
ある。これにより、伝送路を有効に使用する事ができる
。As a result, the remaining capacity for class 3, which is obtained by subtracting the usage capacity of class 1 and 2 calls from the transmission path capacity JtC, is always 02 or more. Therefore, the virtual bandwidth described above may be calculated using the relationship shown in FIG. 3 from the maximum bandwidth and average bandwidth of each call normalized with C2 as the link capacity. At this time, C2 does not depend on the usage capacity of class 1 and 2 calls, so once the virtual bandwidth is calculated, there is no need to recalculate it. Furthermore, although it has been described that the allocation of C1 and 02 is performed based on long-term traffic prediction, reallocation may also be performed based on long-term traffic fluctuations (due to time, day, or human events). This is 01 and 0 in Figure 2.
It is to dynamically move the virtual boundary (logical boundary) of 2. This allows the transmission path to be used effectively.
この時C2が変わる事によりクラス3の仮想帯域を再計
算する必要が有るが、Cl, C2の再割当ては頻繁に
起きる物ではないので、計算量はさほど増えない。At this time, it is necessary to recalculate the class 3 virtual bandwidth due to the change in C2, but since reallocation of Cl and C2 does not occur frequently, the amount of calculation does not increase much.
なお第1の発明と第2の発明は独立に実施する事ができ
、併用する事もできる。また本実施例においては、一段
の伝送リンクにおける適用例を示したが、バケソト呼が
通過する多重化装置、交換機のすべての伝送路での帯域
割当てに適用できる。Note that the first invention and the second invention can be implemented independently or can be used in combination. Further, in this embodiment, an example of application to a single-stage transmission link has been shown, but the present invention can also be applied to bandwidth allocation in all transmission paths of multiplexing equipment and exchanges through which bucket calls pass.
また第1の発明の実施例において、優先権別にバッファ
を設ける構或を示したが、本バツファ構戒例に限らず、
他のバッファ構或法による優先制御にたいしても本発明
は適用できる。Further, in the embodiment of the first invention, a structure is shown in which buffers are provided for each priority, but this example is not limited to this buffer structure.
The present invention can also be applied to priority control using other buffer structure methods.
(発明の効果)
以上述べたように本発明によれば、伝送品質と優先度を
関係付けて仮想回線の帯域割当てを行なうことにより、
確実な品質保証が実現できる。(Effects of the Invention) As described above, according to the present invention, by allocating the bandwidth of a virtual circuit by associating transmission quality and priority,
Reliable quality assurance can be achieved.
第1図は第1の発明の実施例を示す図、第2図は第2の
発明の実施例によるリンク容量の仮想的な分割をした場
合の帯域割当て状況の例を示す図、第3図は、従来技術
による、仮想:{17域の決定法の一例を示す図、第4
図は従来技術による帯域割当て状況の例を示す図である
。
図におで、
100・・・伝送路、110・・・帯域割当装置、12
0, 1.21・・・バッファ、130・・・優先制御
装置。FIG. 1 is a diagram showing an embodiment of the first invention, FIG. 2 is a diagram showing an example of a bandwidth allocation situation when link capacity is virtually divided according to an embodiment of the second invention, and FIG. is a diagram illustrating an example of a method for determining a virtual:
The figure is a diagram showing an example of a band allocation situation according to the prior art. In the figure, 100... Transmission line, 110... Bandwidth allocation device, 12
0, 1.21...Buffer, 130...Priority control device.
Claims (3)
第1の優先度を要求する呼に対しては、情報発生源のパ
ケット送出速度の最大値に等しい帯域により通過する伝
送路に対して帯域割当てを行ない、第2の優先度を要求
する呼に対しては、情報発生源のパケット送出速度の平
均値以上、最大値以下の仮想帯域により通過する伝送路
に対して帯域割当てを行ない、網内において第1の優先
度をもつパケットは第2の優先度をもつパケットより優
先的に伝送されることを特徴とするパケット通信網にお
ける帯域割当て方式。(1) In the packet communication network, two types of priorities are established,
For a call requesting the first priority, bandwidth is allocated to the transmission path passing by a band equal to the maximum value of the packet transmission rate of the information source, and for a call requesting the second priority. For this purpose, bandwidth is allocated to the transmission path passing through using a virtual bandwidth that is greater than or equal to the average value and less than the maximum value of the packet transmission speed of the information source, and packets with the first priority within the network are assigned the second priority. A bandwidth allocation method in a packet communication network that is characterized in that packets are transmitted preferentially over packets with higher priorities.
のパケット送出速度の最大値に等しい帯域により、通過
する伝送路に対して帯域割当てを行なう第一の呼種と情
報発生源のパケット送出速度の平均値以上、最大値以下
の仮想帯域により通過する伝送路に対して帯域割当てを
行なう第2の呼種とに分類し各伝送路の総容量を第一の
呼種に割当てる容量と、第二の呼種に割当てる容量とに
あらかじめ論理的に分離して運用する帯域割当て方式。(2) In a packet communication network, the first type of call and information source packet transmission in which each call is allocated a bandwidth to the transmission path through which the call is assigned a bandwidth equal to the maximum value of the packet transmission speed of the information source. a second call type that allocates bandwidth to transmission paths passing through a virtual band whose speed is above the average value and below the maximum value; and a capacity where the total capacity of each transmission path is allocated to the first call type; Bandwidth allocation method that operates by logically separating the capacity allocated to the second call type in advance.
方式において、前記第一の呼種と前記第2の呼種の長期
的な負荷変動に応じ、前記第一の呼種と前記第2の呼種
にたいし論理的に分離した伝送路容量の再割当てを行な
う事を特徴とするパケット通信網における帯域割当て方
式。(3) In the band allocation method for a packet communication network according to claim 2, the first call type and the second call type are A bandwidth allocation method in a packet communication network characterized by reallocating logically separate transmission path capacities for two call types.
Priority Applications (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP1195473A JPH0358646A (en) | 1989-07-27 | 1989-07-27 | Band assignment system in packet communication network |
| EP19900105434 EP0388951A3 (en) | 1989-03-23 | 1990-03-22 | Call control with transmission priority in a packet communication network of an atm type |
| CA002012868A CA2012868C (en) | 1989-03-23 | 1990-03-22 | Call control with transmission priority in a packet communication network of an atm type |
| US07/496,973 US5132966A (en) | 1989-03-23 | 1990-03-23 | Call control with transmission priority in a packet communication network of an atm type |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP1195473A JPH0358646A (en) | 1989-07-27 | 1989-07-27 | Band assignment system in packet communication network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPH0358646A true JPH0358646A (en) | 1991-03-13 |
Family
ID=16341671
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP1195473A Pending JPH0358646A (en) | 1989-03-23 | 1989-07-27 | Band assignment system in packet communication network |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH0358646A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04245742A (en) * | 1990-08-23 | 1992-09-02 | American Teleph & Telegr Co <Att> | Packet data traffic transmission method and device |
| JPH06224941A (en) * | 1992-09-10 | 1994-08-12 | Internatl Business Mach Corp <Ibm> | Network access control system |
| JPH0715473A (en) * | 1992-12-16 | 1995-01-17 | Internatl Business Mach Corp <Ibm> | Method and system for requesting resources in a packet switched network |
| US5734654A (en) * | 1993-08-05 | 1998-03-31 | Fujitsu Limited | Frame relay switching apparatus and router |
| US6470014B1 (en) | 1997-09-11 | 2002-10-22 | Fujitsu Limited | Short cell multiplexer |
| JP2003501886A (en) * | 1999-06-01 | 2003-01-14 | ファーストフォワード・ネットワークス・インコーポレーテッド | Methods and devices for bandwidth allocation |
| US6552999B2 (en) | 1996-09-06 | 2003-04-22 | Nec Corp. | Asynchronous transfer mode network providing stable connection quality |
| US7460474B2 (en) | 2003-10-21 | 2008-12-02 | Ntt Docomo, Inc. | Packet transmission control apparatus and packet transmission control method |
| WO2009093298A1 (en) * | 2008-01-21 | 2009-07-30 | Fujitsu Limited | Resource allocation control method and base station |
| US7653078B2 (en) | 2004-02-23 | 2010-01-26 | Ntt Docomo, Inc. | Packet transmission control apparatus and packet transmission control method scheduling packets in accordance with capabilities of mobile stations |
| US8238345B2 (en) | 2005-04-15 | 2012-08-07 | Ntt Docomo, Inc. | Packet transmission control device, and packet transmission control method |
-
1989
- 1989-07-27 JP JP1195473A patent/JPH0358646A/en active Pending
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04245742A (en) * | 1990-08-23 | 1992-09-02 | American Teleph & Telegr Co <Att> | Packet data traffic transmission method and device |
| JPH06224941A (en) * | 1992-09-10 | 1994-08-12 | Internatl Business Mach Corp <Ibm> | Network access control system |
| JPH0715473A (en) * | 1992-12-16 | 1995-01-17 | Internatl Business Mach Corp <Ibm> | Method and system for requesting resources in a packet switched network |
| US5734654A (en) * | 1993-08-05 | 1998-03-31 | Fujitsu Limited | Frame relay switching apparatus and router |
| US6552999B2 (en) | 1996-09-06 | 2003-04-22 | Nec Corp. | Asynchronous transfer mode network providing stable connection quality |
| US6470014B1 (en) | 1997-09-11 | 2002-10-22 | Fujitsu Limited | Short cell multiplexer |
| US7277430B2 (en) | 1997-09-11 | 2007-10-02 | Fujitsu Limited | Short cell multiplexer |
| JP2003501886A (en) * | 1999-06-01 | 2003-01-14 | ファーストフォワード・ネットワークス・インコーポレーテッド | Methods and devices for bandwidth allocation |
| US7460474B2 (en) | 2003-10-21 | 2008-12-02 | Ntt Docomo, Inc. | Packet transmission control apparatus and packet transmission control method |
| US7653078B2 (en) | 2004-02-23 | 2010-01-26 | Ntt Docomo, Inc. | Packet transmission control apparatus and packet transmission control method scheduling packets in accordance with capabilities of mobile stations |
| US8238345B2 (en) | 2005-04-15 | 2012-08-07 | Ntt Docomo, Inc. | Packet transmission control device, and packet transmission control method |
| WO2009093298A1 (en) * | 2008-01-21 | 2009-07-30 | Fujitsu Limited | Resource allocation control method and base station |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5467348A (en) | Bandwidth allocation system of virtual path in asynchronous transfer mode | |
| JP3354689B2 (en) | ATM exchange, exchange and switching path setting method thereof | |
| US5867663A (en) | Method and system for controlling network service parameters in a cell based communications network | |
| CA2314944C (en) | Multicommodity flow method for designing traffic distribution on a multiple-service packetized network | |
| US5247516A (en) | Configurable composite data frame | |
| US7236458B2 (en) | Method for monitoring traffic in packet switched network | |
| EP0398037A2 (en) | Packet network with communication resource allocation and call set up control of higher quality of service | |
| US20110310742A1 (en) | Guaranteed bandwidth sharing in a traffic shaping system | |
| JPH0514410A (en) | Traffic control method | |
| EP1072117A2 (en) | Methods and apparatuses for allocating time slots to circuit-switched channels | |
| CN101133394B (en) | Prioritized reallocation of buffer space | |
| EP1102516A1 (en) | A telecommunication network and a method for controlling such network | |
| JPH0358646A (en) | Band assignment system in packet communication network | |
| US8730794B2 (en) | Priority service protection | |
| JP2002064524A (en) | Time slot assignment system in communication system, and network side device | |
| JP3859721B2 (en) | Method for assigning priority to cell information in a system for transferring information in asynchronous transfer ATM mode | |
| JP2513025B2 (en) | Bandwidth allocation method in packet communication network | |
| JP3053356B2 (en) | Bandwidth variable communication device | |
| JP2740433B2 (en) | Dynamic Bandwidth Allocation Method for Trunk Line in Asynchronous Transfer Mode | |
| JPH10200547A (en) | Fixed-length cell handling exchange and fixed-length cell readout speed control method | |
| JP2626585B2 (en) | Communication resource management type packet switching equipment | |
| JPH03119845A (en) | Resource allocation system for packet switching network | |
| JP2004527190A (en) | Method and system for assigning lines to new service requests in a communication network | |
| JPH04150439A (en) | System for managing communication resource | |
| JP3347370B2 (en) | Method for designing packet-switched network, apparatus for designing packet-switched network, and method for constructing packet-switched network |