JPH06338918A - Burst band reservation method in asynchronous transfer network - Google Patents

Burst band reservation method in asynchronous transfer network

Info

Publication number
JPH06338918A
JPH06338918A JP12652993A JP12652993A JPH06338918A JP H06338918 A JPH06338918 A JP H06338918A JP 12652993 A JP12652993 A JP 12652993A JP 12652993 A JP12652993 A JP 12652993A JP H06338918 A JPH06338918 A JP H06338918A
Authority
JP
Japan
Prior art keywords
bandwidth
burst
band
link
minimum
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
JP12652993A
Other languages
Japanese (ja)
Inventor
Chinatsu Ikeda
千夏 池田
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 JP12652993A priority Critical patent/JPH06338918A/en
Priority to CA002112756A priority patent/CA2112756C/en
Priority to US08/182,421 priority patent/US5636212A/en
Priority to DE69425766T priority patent/DE69425766T2/en
Priority to EP94100115A priority patent/EP0609654B1/en
Publication of JPH06338918A publication Critical patent/JPH06338918A/en
Pending legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)

Abstract

PURPOSE:To effectively utilize a network by flexibly assigning a band in correspondence to the residual band of a link to lower a block rate in an asynchronous transfer network assigning a band at a burst level. CONSTITUTION:A call originating terminal reports a minimum band in addition to a maximum band (peak rate) at the time of band requirement in advance of the sending of a burst. A node assigns the peak rate when there is the sufficient residual band area of the link controlled by itself and the peak rate can be assigned and the node assignes a band which is not less than the minimum band but not more than the peak rate in correspondence to the residual band when the residual band remains not less than the minimum band even though it is little, so as to transfer the burst.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は非同期転送網におけるバ
ースト帯域予約方法に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a burst bandwidth reservation method in an asynchronous transfer network.

【0002】[0002]

【従来の技術】従来、バースト毎に帯域を割り当てる手
法は、1991年電子情報通信学会交換研究会論文.S
SE91−112において鈴木ほかにより発表された
「多重パス多重リンク経路選択を用いたATM動的帯域
予約方式」などに示されている。この論文には、バース
トレベルの帯域割り当てのために、バーストの送出に先
だって転送に必要な最大帯域(ピークレート)のみを発
信端末から申告し、一つのパス上のすべてのリンクにつ
いて最大帯域が予約できればバーストを送信し、最大帯
域が予約できなければバースト転送をブロックすること
が開示されている。
2. Description of the Related Art Conventionally, a method of allocating a band for each burst is described in 1991, IEICE Exchange Study Group. S
It is shown in "ATM Dynamic Bandwidth Reservation Method Using Multipath and Multilink Route Selection" announced by Suzuki et al. In SE91-112. In this paper, in order to allocate bandwidth at the burst level, only the maximum bandwidth (peak rate) required for transfer is declared from the transmitting terminal before sending the burst, and the maximum bandwidth is reserved for all links on one path. It discloses that bursts are transmitted if possible, and burst transfers are blocked if the maximum bandwidth cannot be reserved.

【0003】[0003]

【発明が解決しようとする課題】この従来のバースト帯
域の割り当て手法では、非同期転送網の負荷が高くなっ
た時、大きなピークレートの要求を出すと、ブロックさ
れる確率が高くなり、非同期転送網のスループットがあ
がらないという問題点がある。
According to this conventional burst bandwidth allocation method, when a request for a large peak rate is issued when the load of the asynchronous transfer network becomes high, the probability of blocking becomes high, and the asynchronous transfer network becomes high. However, there is a problem that the throughput does not increase.

【0004】本発明の目的は、上記の問題点を解決する
ため、予約要求された最大帯域および最小帯域とリンク
の残余帯域に応じたフレキシブルなバーストの帯域予約
方法を提供することにある。
SUMMARY OF THE INVENTION An object of the present invention is to provide a flexible burst bandwidth reservation method according to the maximum and minimum bandwidths requested for reservation and the remaining bandwidth of a link in order to solve the above problems.

【0005】[0005]

【課題を解決するための手段】本発明は発信端末と着信
端末とを複数のノードを通して接続し、呼設定時に発着
信ノード間に経路を設定しておき、前記発信端末からの
バーストの送出に先だって前記バーストを転送するため
の帯域を前記経路上の各リンクについて予約して前記バ
ーストを前記着信端末まで転送し、前記バーストの送出
終了後に予約した帯域の解放を行なう非同期転送網にお
けるバースト帯域予約方法において、前記発信端末は前
記バーストの送出に先だって前記バーストの転送に必要
な最大帯域および最小帯域を示す信号を発信ノードに送
出して帯域予約要求を行ない、前記経路上の各ノードは
予約要求された最大帯域および最小帯域とその各各が管
理するリンクの残余帯域とに基づき、リンクの残余帯域
が最小帯域以上であればリンクの残余帯域に応じて最小
帯域以上で最大帯域以下の帯域を予約する。
According to the present invention, a calling terminal and a called terminal are connected through a plurality of nodes, a route is set between the calling and called nodes at the time of call setting, and a burst is sent from the calling terminal. Burst band reservation in an asynchronous transfer network in which a band for transferring the burst is reserved for each link on the path in advance, the burst is transferred to the destination terminal, and the reserved band is released after the transmission of the burst is completed. In the method, the sending terminal sends a signal indicating a maximum band and a minimum band required for transfer of the burst to a sending node to send a band reservation request prior to sending the burst, and each node on the path makes a reservation request. Based on the specified maximum and minimum bandwidths and the residual bandwidth of the links managed by each of them, the residual bandwidth of the link is equal to or greater than the minimum bandwidth. Book up band following the band at the minimum bandwidth more, depending on the remaining band of the link if Re.

【0006】また、本発明は上述の非同期転送網におけ
るバースト帯域予約方法において、前記発信端末は前記
バーストの送出に先だって前記バーストの転送に必要な
最大帯域および最小帯域を示す信号を発信ノードに送出
して帯域予約要求を行ない、前記経路上の最初のノード
は予約要求された最大帯域および最小帯域と自らが管理
するリンクの残余帯域とに基づき、リンクの残余帯域が
最小帯域以上であればこの残余帯域に応じて最小帯域以
上で最大帯域以下の帯域を予約し、前記経路上の2番目
以降のノードは最初のノードと同様の手順でその各各が
管理するリンクの残余帯域が最小帯域以上であれば前の
ノードに割り当てた帯域以下で最小帯域以上を予約す
る。
Further, according to the present invention, in the burst bandwidth reservation method in the above-mentioned asynchronous transfer network, the transmitting terminal transmits a signal indicating a maximum bandwidth and a minimum bandwidth required for transferring the burst to the transmitting node before transmitting the burst. Then, the first node on the path makes a reservation based on the maximum bandwidth and the minimum bandwidth requested for reservation and the residual bandwidth of the link managed by itself, and if the residual bandwidth of the link is equal to or greater than the minimum bandwidth, A band from the minimum band to the maximum band and below the maximum band is reserved according to the residual band, and the second and subsequent nodes on the path have the residual band of the link managed by each of them equal to or greater than the minimum band in the same procedure as the first node. In that case, the bandwidth less than or equal to the bandwidth allocated to the previous node is reserved and the minimum bandwidth or more is reserved.

【0007】さらに、本発明は上述の非同期転送網にお
けるバースト帯域予約方法において、前記発信端末は前
記バーストの送出に先だって前記バーストの転送に必要
な最大帯域および最小帯域を示す信号を発信ノードに送
出して帯域予約要求を行ない、前記経路上の最初のノー
ドは予約要求された最大帯域P1および最小帯域P2と
自らが管理するリンクの残余帯域Cとから関数f(P
1,P2,C)によって求めた帯域を予約し、前記経路
上の2番目以降のノードは最初のノードと同様の手順で
その各各が管理するリンクの残余帯域Cが最小帯域P2
以上であれば前のノードに割り当てられた帯域P3と最
小帯域P2とリンクの残余帯域Cとから関数f(P3,
P2,C)によって求めた帯域を予約する。
Furthermore, according to the present invention, in the burst bandwidth reservation method for an asynchronous transfer network described above, the transmitting terminal transmits a signal indicating a maximum bandwidth and a minimum bandwidth required for transferring the burst to the transmitting node prior to transmitting the burst. Then, the bandwidth reservation request is made, and the first node on the path determines the function f (P) from the maximum bandwidth P1 and the minimum bandwidth P2 requested to be reserved and the residual bandwidth C of the link managed by itself.
1, P2, C), and the second and subsequent nodes on the path have the remaining bandwidth C of the link managed by each node in the same procedure as the first node and the minimum bandwidth P2.
If the above is satisfied, the function f (P3,3) is calculated from the band P3 assigned to the previous node, the minimum band P2, and the residual band C of the link.
Reserve the band obtained by P2, C).

【0008】[0008]

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

【0009】図1は本発明のバースト帯域予約方法を適
用する非同期転送網の一例を示す。この非同期転送網
は、発信端末80と着信端末90とを接続する第1のパ
ス7を形成するためのノード10,20,30,40お
よびリンク1,2,3と、第2のパス8を形成するため
のノード10,40,50,60およびリンク4,5,
6とを有する。各ノードは非同期転送モード(ATM)
の交換スイッチおよびセルの転送を制御するためのプロ
セッサなどを含み構成されている(詳細は図示省略)。
各ノード間のリンク1,2,3,4,5,6の各各は単
一リンクの場合を示しているので、パス7,8上には一
つのバーチャルチャネル(VC)がそれぞれ存在するこ
とになる。なお、各パスおよび各リンクをそれぞれ多重
パスおよび多重リンク構成としてもこの発明は同様に実
施できる。
FIG. 1 shows an example of an asynchronous transfer network to which the burst bandwidth reservation method of the present invention is applied. This asynchronous transfer network includes nodes 10, 20, 30, 40 and links 1, 2, 3 for forming a first path 7 connecting a source terminal 80 and a destination terminal 90, and a second path 8. Nodes 10, 40, 50, 60 and links 4, 5, for forming
6 and. Asynchronous transfer mode (ATM) for each node
And a processor for controlling cell transfer (details are not shown).
Since each of the links 1, 2, 3, 4, 5, 6 between the nodes is a single link, one virtual channel (VC) exists on each of the paths 7 and 8. become. The present invention can be similarly implemented even if each path and each link have a multipath and multilink configuration, respectively.

【0010】まず、本発明の第1の実施例における各バ
ースト送出時の帯域予約の動作について図1および図2
を併せ参照して説明する。発信端末80からのバースト
送出に先立ち、帯域の予約要求を行なうために発信端末
80から予約セルがノード10に送信される。この予約
セルには最大帯域(ピークレート)P1および最小帯域
P2を示す情報が含まれる。ここでは、P1が“10
0”で、P2が“50”とする。また、ノード10,2
0,30がそれぞれ管理するリンク1,2,3の残余帯
域は、それぞれ“150”,“80”,“120”とす
る。発信端末80から予約セルを受信したノード10
は、1番目のリンク1の残余帯域が“150”であるの
で要求された最大帯域100で予約した後、2番目のリ
ンク2を管理するノード20に予約セルを送信する。ノ
ード20は残余帯域が“80”であり、最大帯域100
に満たないが、最小帯域50以上なので、残余帯域分の
“80”をリンク2について予約し、予約セルをノード
30に送信する。ノード30は3番目のリンク3につい
て最大帯域100以上の残余帯域があるので、最大帯域
100を予約する。ノード40は最終段のリンク3まで
予約できたことをノード30からの予約セル(発信端末
80から送出されたP1=100,P2=50と、各ノ
ードでの予約帯域100,80,100とを示す情報を
含む)の受信によって知り、予約できた最小帯域80を
記述したACKセルがノード30,20,10を経て発
信端末80に返送される。帯域が“80”で予約できた
ことを示すACKセルを受信した発信端末80は、送信
レート80でバーストの送出を行ない、バースト送出後
に帯域の解放動作を行なう。
First, the band reservation operation at the time of transmitting each burst in the first embodiment of the present invention will be described with reference to FIGS. 1 and 2.
Will also be described. Prior to the burst transmission from the transmission terminal 80, a reservation cell is transmitted from the transmission terminal 80 to the node 10 in order to make a bandwidth reservation request. This reserved cell includes information indicating the maximum band (peak rate) P1 and the minimum band P2. Here, P1 is “10
At 0 ", P2 is set to" 50 ". Also, nodes 10 and 2
The residual bandwidths of the links 1, 2, and 3 managed by 0 and 30 are “150”, “80”, and “120”, respectively. Node 10 that has received the reserved cell from source terminal 80
Since the remaining bandwidth of the first link 1 is “150”, the reservation is made with the requested maximum bandwidth 100, and then the reserved cell is transmitted to the node 20 managing the second link 2. The remaining bandwidth of the node 20 is “80”, and the maximum bandwidth is 100.
However, since the minimum band is 50 or more, the remaining band “80” is reserved for the link 2 and the reserved cell is transmitted to the node 30. The node 30 reserves the maximum bandwidth 100 because there is a residual bandwidth of the maximum bandwidth 100 or more for the third link 3. The node 40 indicates that the reserved cells up to the link 3 at the final stage are reserved cells from the node 30 (P1 = 100, P2 = 50 transmitted from the transmitting terminal 80 and reserved bandwidths 100, 80, 100 at each node). (Including the information shown), the ACK cell describing the reserved and minimum bandwidth 80 is returned to the originating terminal 80 via the nodes 30, 20, 10. The transmitting terminal 80, which has received the ACK cell indicating that the bandwidth is "80" and has been reserved, transmits the burst at the transmission rate 80, and releases the bandwidth after the burst transmission.

【0011】なお、いずれかのリンクの残余帯域が最小
帯域50未満であれば、バーストの転送はブロックさ
れ、NACKセルが送信側に返送される。これと共に、
すでに予約していたリンクの帯域は、デッドロックを避
けるために解放される。この場合、発信端末80はバッ
クオフ時間経過後に再予約動作を行なう。各ノードはリ
ンクの残余帯域をメモリのテーブルにより管理すること
ができる。
If the residual bandwidth of any of the links is less than the minimum bandwidth 50, burst transfer is blocked and a NACK cell is returned to the transmission side. With this,
The bandwidth of the already reserved link is released to avoid deadlock. In this case, the transmitting terminal 80 performs the re-reservation operation after the backoff time has elapsed. Each node can manage the remaining bandwidth of the link by using a memory table.

【0012】図3は第2の実施例による各バーストの送
出時の帯域予約の動作例を示している。第1の実施例と
同様に図1に示す非同期転送網に実施するものとする。
発信端末80はバーストの送出に先立ち、帯域の予約要
求を行なうために予約セルをノード10に送出する。こ
こで要求する帯域は、最大帯域P1が“100”で最小
帯域P2が“50”である。リンク1,2,3の残余帯
域はそれぞれ“150”,“80”,“120”であ
る。ノード10は1番目のリンク1を最大帯域100で
予約する。ノード20は2番目のリンク2の残余帯域が
“80”であり、最大帯域100には満たないが、最小
帯域50以上なので、残余帯域80を予約する。ノード
30は3番目のリンク3についてリンク2で予約した帯
域80以下でリンク3の残余帯域が“80”以上あるの
で、“80”を予約する。ノード40は最終段のリンク
まで予約できたことをノード30からの予約セルの受信
によって知り、予約できた帯域80を記述したACKセ
ルをノード30,20,10を経て発信端末80に返送
する。ACKセルを中継する際、帯域を余分に予約して
いるノード10は、余分に予約している帯域分20だけ
解放し、予約帯域“80”とするようにテーブルを更新
する。以降の動作は第1の実施例と同様である。
FIG. 3 shows an example of band reservation operation at the time of transmission of each burst according to the second embodiment. As in the first embodiment, the asynchronous transfer network shown in FIG. 1 is used.
The transmitting terminal 80 transmits a reserved cell to the node 10 in order to make a bandwidth reservation request before transmitting the burst. The requested bandwidth is "100" for the maximum bandwidth P1 and "50" for the minimum bandwidth P2. The residual bandwidths of the links 1, 2 and 3 are "150", "80" and "120", respectively. The node 10 reserves the first link 1 with the maximum bandwidth 100. The node 20 reserves the residual band 80 because the residual band of the second link 2 is “80”, which is less than the maximum band 100 but is the minimum band 50 or more. The node 30 reserves "80" because the remaining bandwidth of the link 3 is "80" or more and the bandwidth of 80 or less reserved in the link 2 for the third link 3 is present. The node 40 knows that the link up to the last stage has been reserved by receiving the reserved cell from the node 30, and returns the ACK cell describing the reserved band 80 to the transmitting terminal 80 via the nodes 30, 20, and 10. When relaying the ACK cell, the node 10 that reserves the extra band releases the extra bandwidth 20 and updates the table so that the reserved band is set to “80”. The subsequent operation is the same as in the first embodiment.

【0013】図4は第3の実施例による各バーストの送
出時の帯域予約の動作例を示している。第2の実施例で
は、残余帯域が最小帯域以上であった場合、その残余帯
域が最大帯域以上であれば最大帯域を、かつ最大帯域未
満であれば残余帯域の全部を予約したが、本実施例で
は、関数f(P1,P2,C)から求まる帯域を予約す
ることにより、残余帯域をある程度残しておき、これに
よりバースト送信のブロック率を低くすることができ
る。上述と同様に図1に示す非同期転送網に実施するも
のとする。発信端末80から着信端末90までのバース
ト転送のためのバーチャルチャネル(VC)のリンク
1,2,3の残余帯域(C)は、それぞれ“150”,
“80”,“120”であるとする。ここで、予約帯域
は要求最大帯域または前のノードでの割り当て帯域であ
るP1と要求最小帯域P2とリンクの残余帯域Cとから
なる関数f(P1,P2,C)から計算される。ここに
は、関数f(P1,P2,C)が、
FIG. 4 shows an example of band reservation operation at the time of transmission of each burst according to the third embodiment. In the second embodiment, when the residual band is equal to or larger than the minimum band, the maximum band is reserved if the residual band is equal to or larger than the maximum band, and the entire residual band is reserved if the residual band is smaller than the maximum band. In the example, by reserving the band obtained from the function f (P1, P2, C), the residual band is left to some extent, and thereby the block rate of burst transmission can be lowered. Similar to the above, the asynchronous transfer network shown in FIG. 1 is implemented. The residual bandwidths (C) of the links 1, 2, and 3 of the virtual channel (VC) for burst transfer from the source terminal 80 to the destination terminal 90 are “150”,
It is assumed that they are “80” and “120”. Here, the reserved band is calculated from a function f (P1, P2, C) including P1 which is the requested maximum band or the allocated band at the previous node, the requested minimum band P2, and the residual band C of the link. Here, the function f (P1, P2, C) is

【0014】 [0014]

【0015】のときの例を示している。すなわち、リン
ク1では、残余帯域が“150”のため、P1(10
0)〉150/2〉P2(50)であるのでC/2=7
5を予約する。リンク2では、残余帯域が“80”であ
るため、80/2〈P2(50)であるのでP2=50
を予約する。また、リンク3では、残余帯域が“12
0”であるため、前のリンクで予約した帯域P1=50
〈C/2であるのでP1=50を予約する。第2の実施
例と同様に最終段のリンクまで予約すると、予約できた
帯域50を記述したACKセルが発信端末80へ送られ
る。ACKセルを中継する際、帯域を余分に予約してい
るノード10は、余分に予約している帯域分25だけ解
放し、予約帯域を“50”とするようにテーブルを更新
する。以降の動作は他の実施例と同様である。
An example in the case of is shown. That is, in link 1, since the residual band is “150”, P1 (10
0)>150/2> P2 (50), so C / 2 = 7
Book 5 In link 2, since the residual bandwidth is “80”, 80/2 <P2 (50), so P2 = 50.
Book. In the link 3, the residual band is "12".
Since it is 0 ", the bandwidth P1 reserved by the previous link is P1 = 50
<C / 2, so reserve P1 = 50. When the last link is reserved as in the second embodiment, an ACK cell describing the reserved band 50 is sent to the transmitting terminal 80. When relaying the ACK cell, the node 10 that reserves the extra band releases 25 for the extra band and updates the table so that the reserved band is set to “50”. The subsequent operation is similar to that of the other embodiments.

【0016】[0016]

【発明の効果】以上説明したように、本発明によれば、
リンクに最大帯域が残っていなくても最小帯域以上であ
れば残余帯域に応じて帯域を割り当てるため、ブロック
率が下がり、網の使用効率があがる。
As described above, according to the present invention,
Even if the maximum bandwidth does not remain in the link, if the bandwidth is more than the minimum bandwidth, the bandwidth is allocated according to the residual bandwidth, so that the block rate decreases and the network usage efficiency increases.

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

【図1】本発明の実施対象とする非同期転送網を示す図
である。
FIG. 1 is a diagram showing an asynchronous transfer network to which the present invention is applied.

【図2】本発明の第1の実施例におけるバーストレベル
の帯域予約動作を説明する図である。
FIG. 2 is a diagram for explaining a burst level band reservation operation in the first embodiment of the present invention.

【図3】本発明の第2の実施例におけるバーストレベル
の帯域予約動作を説明する図である。
FIG. 3 is a diagram illustrating a burst level band reservation operation according to a second embodiment of the present invention.

【図4】本発明の第3の実施例におけるバーストレベル
の帯域予約動作を説明する図である。
FIG. 4 is a diagram illustrating a burst level band reservation operation according to a third embodiment of the present invention.

【符号の説明】[Explanation of symbols]

1,2,3,4,5,6 リンク 7,8 パス 10,20,30,40,50,60 ノード 80 発信端末 90 着信端末 1,2,3,4,5,6 Link 7,8 Path 10,20,30,40,50,60 Node 80 Calling terminal 90 Calling terminal

Claims (3)

【特許請求の範囲】[Claims] 【請求項1】 発信端末と着信端末とを複数のノードを
通して接続し、呼設定時に発着信ノード間に経路を設定
しておき、前記発信端末からのバーストの送出に先だっ
て前記バーストを転送するための帯域を前記経路上の各
リンクについて予約して前記バーストを前記着信端末ま
で転送し、前記バーストの送出終了後に予約した帯域の
解放を行なう非同期転送網におけるバースト帯域予約方
法において、 前記発信端末は前記バーストの送出に先だって前記バー
ストの転送に必要な最大帯域および最小帯域を示す信号
を発信ノードに送出して帯域予約要求を行ない、 前記経路上の各ノードは予約要求された最大帯域および
最小帯域とその各各が管理するリンクの残余帯域とに基
づき、リンクの残余帯域が最小帯域以上であればリンク
の残余帯域に応じて最小帯域以上で最大帯域以下の帯域
を予約することを特徴とする非同期転送網におけるバー
スト帯域予約方法。
1. A method for connecting a source terminal and a destination terminal through a plurality of nodes, setting a route between the source and destination nodes at the time of call setting, and transferring the burst prior to sending the burst from the source terminal. A burst bandwidth reservation method in an asynchronous transfer network in which the bandwidth is reserved for each link on the path, the burst is transferred to the destination terminal, and the reserved bandwidth is released after the transmission of the burst is completed. Prior to the transmission of the burst, a signal indicating the maximum band and the minimum band required for the transfer of the burst is transmitted to the transmitting node to make a bandwidth reservation request, and each node on the route has the requested maximum band and minimum band. And the remaining bandwidth of the link managed by each of them, if the remaining bandwidth of the link is greater than or equal to the minimum bandwidth, the remaining bandwidth of the link Burst bandwidth reservation method in an asynchronous transfer network, characterized in that reserving the band of maximum bandwidth below a minimum bandwidth more depending.
【請求項2】 発信端末と着信端末とを複数のノードを
通して接続し、呼設定時に発着信ノード間に経路を設定
しておき、前記発信端末からのバーストの送出に先だっ
て前記バーストを転送するための帯域を前記経路上の各
リンクについて予約して前記バーストを前記着信端末ま
で転送し、前記バーストの送出終了後に予約した帯域の
解放を行なう非同期転送網におけるバースト帯域予約方
法において、 前記発信端末は前記バーストの送出に先だって前記バー
ストの転送に必要な最大帯域および最小帯域を示す信号
を発信ノードに送出して帯域予約要求を行ない、 前記経路上の最初のノードは予約要求された最大帯域お
よび最小帯域と自らが管理するリンクの残余帯域とに基
づき、リンクの残余帯域が最小帯域以上であればこの残
余帯域に応じて最小帯域以上で最大帯域以下の帯域を予
約し、 前記経路上の2番目以降のノードは最初のノードと同様
の手順でその各各が管理するリンクの残余帯域が最小帯
域以上であれば前のノードに割り当てた帯域以下で最小
帯域以上を予約することを特徴とする非同期転送網にお
けるバースト帯域予約方法。
2. A method for connecting a calling terminal and a called terminal through a plurality of nodes, setting a route between the calling and called nodes at call setting, and transferring the burst before the burst is sent from the calling terminal. A burst bandwidth reservation method in an asynchronous transfer network in which the bandwidth is reserved for each link on the path, the burst is transferred to the destination terminal, and the reserved bandwidth is released after the transmission of the burst is completed. Prior to sending the burst, a signal indicating the maximum band and the minimum band required for the transfer of the burst is sent to the originating node to request a band reservation, and the first node on the path makes the requested maximum band and the minimum band. Based on the bandwidth and the residual bandwidth of the link that it manages, if the residual bandwidth of the link is greater than or equal to the minimum bandwidth, the residual bandwidth is adjusted accordingly. If the remaining bandwidth of the link managed by each of the second and subsequent nodes on the path is equal to or greater than the minimum bandwidth, the second and subsequent nodes on the path are reserved by the same procedure as the first node. A method for reserving a burst bandwidth in an asynchronous transfer network, characterized by reserving a bandwidth equal to or less than a bandwidth allocated to each node.
【請求項3】 発信端末と着信端末とを複数のノードを
通して接続し、呼設定時に発着信ノード間に経路を設定
しておき、前記発信端末からのバーストの送出に先だっ
て前記バーストを転送するための帯域を前記経路上の各
リンクについて予約して前記バーストを前記着信端末ま
で転送し、前記バーストの送出終了後に予約した帯域の
解放を行なう非同期転送網におけるバースト帯域予約方
法において、 前記発信端末は前記バーストの送出に先だって前記バー
ストの転送に必要な最大帯域および最小帯域を示す信号
を発信ノードに送出して帯域予約要求を行ない、 前記経路上の最初のノードは予約要求された最大帯域P
1および最小帯域P2と自らが管理するリンクの残余帯
域Cとから関数f(P1,P2,C)によって求めた帯
域を予約し、 前記経路上の2番目以降のノードは最初のノードと同様
の手順でその各各が管理するリンクの残余帯域Cが最小
帯域P2以上であれば前のノードに割り当てられた帯域
P3と最小帯域P2とリンクの残余帯域Cとから関数f
(P3,P2,C)によって求めた帯域を予約すること
を特徴とする非同期転送網におけるバースト帯域予約方
法。
3. A calling terminal and a called terminal are connected through a plurality of nodes, a path is set between the calling and called nodes at the time of call setting, and the burst is transferred before the burst is sent from the calling terminal. A burst bandwidth reservation method in an asynchronous transfer network in which the bandwidth is reserved for each link on the path, the burst is transferred to the destination terminal, and the reserved bandwidth is released after the transmission of the burst is completed. Prior to the transmission of the burst, a signal indicating the maximum band and the minimum band required for the transfer of the burst is transmitted to the source node to make a bandwidth reservation request, and the first node on the path makes the maximum bandwidth P requested to be reserved.
1 and the minimum bandwidth P2 and the residual bandwidth C of the link managed by itself are reserved for the bandwidth obtained by the function f (P1, P2, C), and the second and subsequent nodes on the path are the same as the first node. If the residual bandwidth C of the link managed by each of them in the procedure is equal to or greater than the minimum bandwidth P2, the function f is calculated from the bandwidth P3 and the minimum bandwidth P2 assigned to the previous node and the residual bandwidth C of the link.
A burst bandwidth reservation method in an asynchronous transfer network, characterized in that the bandwidth obtained by (P3, P2, C) is reserved.
JP12652993A 1993-01-06 1993-05-28 Burst band reservation method in asynchronous transfer network Pending JPH06338918A (en)

Priority Applications (5)

Application Number Priority Date Filing Date Title
JP12652993A JPH06338918A (en) 1993-05-28 1993-05-28 Burst band reservation method in asynchronous transfer network
CA002112756A CA2112756C (en) 1993-01-06 1994-01-04 Burst band-width reservation method in asynchronous transfer mode (atm) network
US08/182,421 US5636212A (en) 1993-01-06 1994-01-05 Burst bandwidth reservation method in asynchronous transfer mode (ATM) network
DE69425766T DE69425766T2 (en) 1993-01-06 1994-01-05 Burst bandwidth reservation procedure for networks with asynchronous transfer mode (ATM)
EP94100115A EP0609654B1 (en) 1993-01-06 1994-01-05 Burst band-width reservation method in an asynchronous transfer mode (ATM) network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP12652993A JPH06338918A (en) 1993-05-28 1993-05-28 Burst band reservation method in asynchronous transfer network

Publications (1)

Publication Number Publication Date
JPH06338918A true JPH06338918A (en) 1994-12-06

Family

ID=14937463

Family Applications (1)

Application Number Title Priority Date Filing Date
JP12652993A Pending JPH06338918A (en) 1993-01-06 1993-05-28 Burst band reservation method in asynchronous transfer network

Country Status (1)

Country Link
JP (1) JPH06338918A (en)

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5736944A (en) * 1995-04-14 1998-04-07 Kabushiki Kaisha Toshiba Image decoding apparatus
US5841475A (en) * 1994-10-28 1998-11-24 Kabushiki Kaisha Toshiba Image decoding with dedicated bidirectional picture storage and reduced memory requirements
US5946298A (en) * 1995-04-06 1999-08-31 Kabushiki Kaisha Toshiba Digital interface which inserts a transfer rate value into a packet header and controls access to a bus based on a total transfer rate
WO2002025878A1 (en) * 2000-09-22 2002-03-28 Matsushita Electric Industrial Co., Ltd. Data transmitting/receiving method, transmitting device, receiving device, transmitting/receiving system, and program
US6657958B1 (en) 1998-05-18 2003-12-02 Nec Corporation Bandwidth control system and method
US7652994B2 (en) 2006-03-31 2010-01-26 Sharp Laboratories Of America, Inc. Accelerated media coding for robust low-delay video streaming over time-varying and bandwidth limited channels
US7652993B2 (en) 2006-11-03 2010-01-26 Sharp Laboratories Of America, Inc. Multi-stream pro-active rate adaptation for robust video transmission
US7784076B2 (en) 2004-10-30 2010-08-24 Sharp Laboratories Of America, Inc. Sender-side bandwidth estimation for video transmission with receiver packet buffer
US7797723B2 (en) 2004-10-30 2010-09-14 Sharp Laboratories Of America, Inc. Packet scheduling for video transmission with sender queue control
US8018850B2 (en) 2004-02-23 2011-09-13 Sharp Laboratories Of America, Inc. Wireless video transmission system
US8356327B2 (en) 2004-10-30 2013-01-15 Sharp Laboratories Of America, Inc. Wireless video transmission system
US8861597B2 (en) 2006-09-18 2014-10-14 Sharp Laboratories Of America, Inc. Distributed channel time allocation for video streaming over wireless networks
US9325998B2 (en) 2003-09-30 2016-04-26 Sharp Laboratories Of America, Inc. Wireless video transmission system
US9544602B2 (en) 2005-12-30 2017-01-10 Sharp Laboratories Of America, Inc. Wireless video transmission system
JP2023500143A (en) * 2019-11-08 2023-01-04 華為技術有限公司 Service traffic adjustment method and apparatus

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6331333A (en) * 1986-07-25 1988-02-10 Nippon Telegr & Teleph Corp <Ntt> Variable speed communication system
JPS6412740A (en) * 1987-07-07 1989-01-17 Fujitsu Ltd Communication quality setting system
JPH02222339A (en) * 1989-02-23 1990-09-05 Fujitsu Ltd Communication traffic control system
JPH03220837A (en) * 1989-08-15 1991-09-30 American Teleph & Telegr Co <Att> Resource allocation method for transmitting data in data communication network and wide-band isdn communication network and terminal adapter for connecting to data communication network
JPH0445632A (en) * 1990-06-13 1992-02-14 Nec Corp Call connection control system for packet exchange network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6331333A (en) * 1986-07-25 1988-02-10 Nippon Telegr & Teleph Corp <Ntt> Variable speed communication system
JPS6412740A (en) * 1987-07-07 1989-01-17 Fujitsu Ltd Communication quality setting system
JPH02222339A (en) * 1989-02-23 1990-09-05 Fujitsu Ltd Communication traffic control system
JPH03220837A (en) * 1989-08-15 1991-09-30 American Teleph & Telegr Co <Att> Resource allocation method for transmitting data in data communication network and wide-band isdn communication network and terminal adapter for connecting to data communication network
JPH0445632A (en) * 1990-06-13 1992-02-14 Nec Corp Call connection control system for packet exchange network

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5841475A (en) * 1994-10-28 1998-11-24 Kabushiki Kaisha Toshiba Image decoding with dedicated bidirectional picture storage and reduced memory requirements
US5946298A (en) * 1995-04-06 1999-08-31 Kabushiki Kaisha Toshiba Digital interface which inserts a transfer rate value into a packet header and controls access to a bus based on a total transfer rate
US5736944A (en) * 1995-04-14 1998-04-07 Kabushiki Kaisha Toshiba Image decoding apparatus
US6657958B1 (en) 1998-05-18 2003-12-02 Nec Corporation Bandwidth control system and method
WO2002025878A1 (en) * 2000-09-22 2002-03-28 Matsushita Electric Industrial Co., Ltd. Data transmitting/receiving method, transmitting device, receiving device, transmitting/receiving system, and program
US9325998B2 (en) 2003-09-30 2016-04-26 Sharp Laboratories Of America, Inc. Wireless video transmission system
US8018850B2 (en) 2004-02-23 2011-09-13 Sharp Laboratories Of America, Inc. Wireless video transmission system
US7784076B2 (en) 2004-10-30 2010-08-24 Sharp Laboratories Of America, Inc. Sender-side bandwidth estimation for video transmission with receiver packet buffer
US7797723B2 (en) 2004-10-30 2010-09-14 Sharp Laboratories Of America, Inc. Packet scheduling for video transmission with sender queue control
US8356327B2 (en) 2004-10-30 2013-01-15 Sharp Laboratories Of America, Inc. Wireless video transmission system
US9544602B2 (en) 2005-12-30 2017-01-10 Sharp Laboratories Of America, Inc. Wireless video transmission system
US7652994B2 (en) 2006-03-31 2010-01-26 Sharp Laboratories Of America, Inc. Accelerated media coding for robust low-delay video streaming over time-varying and bandwidth limited channels
US8861597B2 (en) 2006-09-18 2014-10-14 Sharp Laboratories Of America, Inc. Distributed channel time allocation for video streaming over wireless networks
US7652993B2 (en) 2006-11-03 2010-01-26 Sharp Laboratories Of America, Inc. Multi-stream pro-active rate adaptation for robust video transmission
JP2023500143A (en) * 2019-11-08 2023-01-04 華為技術有限公司 Service traffic adjustment method and apparatus

Similar Documents

Publication Publication Date Title
CA2112756C (en) Burst band-width reservation method in asynchronous transfer mode (atm) network
US5367517A (en) Method and system of requesting resources in a packet-switched network with minimal latency
JPH06338918A (en) Burst band reservation method in asynchronous transfer network
JP3325610B2 (en) Congestion control for high-speed packet networks
JP5206765B2 (en) Transmission terminal device, network node, and relay switch
JPH0659053B2 (en) Packet exchange method
JPH09186701A (en) Optimum band width assignment method and its device
JP3008496B2 (en) Method of resource allocation by reservation based on expectation in integrated services satellite communication network
EP0669734A2 (en) Method and apparatus for managing communications between multi-node quota-based communication systems
JP2522152B2 (en) Burst server storage exchange method
US5289463A (en) Method of managing flows in a wideband integrated services digital telecommunications network
US6198725B1 (en) Network element delay allocation for efficient use of network resources
JP2002064524A (en) Time slot assignment system in communication system, and network side device
JP2000261435A (en) Minimum band guarantee connection method and device
JP4238415B2 (en) Transmission terminal device, network node, and relay switch
JP2806739B2 (en) Congestion control method
Widjaja Random access for ATM LANs and WANs
US6618400B1 (en) System for effectively using ISDN backup channel
KR100275517B1 (en) Method for managing dynamic bnadwith of virtual path on atm switching system
JP2725678B2 (en) Packet communication method
JP2940400B2 (en) Communication system and communication method using cross-connect network
KR960004709B1 (en) Effective band width management strategy using reserved common pool in the atm network
JP3461459B2 (en) Packet buffer circuit
JP2928882B1 (en) Local area network bandwidth control
KR0175484B1 (en) Path Control Method using Band Reservation in Fully Distributed Asynchronous Transfer Mode Switching System

Legal Events

Date Code Title Description
A02 Decision of refusal

Free format text: JAPANESE INTERMEDIATE CODE: A02

Effective date: 19960827