The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 대규모 네트워크에서 ABR(Available Bit Rate) 제어 메커니즘을 사용하여 GFR(Guarantee Frame Rate) 서비스 구현을 제안합니다. GFR은 프레임 수준에서 각 가상 채널(VC)에 최소 셀 속도(MCR) 보장을 제공하기 위해 새로운 ATM 서비스 범주로 표준화되고 있습니다. ABR도 MCR을 지원할 수 있지만 소스는 네트워크 정체 표시에 따라 셀 방출 속도를 조정해야 합니다. 대조적으로, GFR 서비스는 ABR에서 요구하는 소스 행동 규칙을 준수할 준비가 되지 않은 사용자를 위한 것입니다. 많은 기존 사용자가 이 범주에 속할 것으로 예상됩니다. GFR의 구현 중 하나로 각 스위치에서 VC당 대기열을 사용하는 WRR(가중 라운드 로빈)이 잘 알려져 있습니다. 그러나 WRR은 어떤 VC 대기열을 서비스해야 하는지 하나의 셀 시간 내에 결정해야 하기 때문에 많은 수의 VC를 지원하는 스위치에서 구현하기가 어렵습니다. 또한 제어 메커니즘이 노드 수준에서 폐쇄되어 있기 때문에 네트워크 수준에서 대역폭 활용이 비효율적일 수 있습니다. 한편, ABR 서비스 표준화의 진전으로 인해 많은 수의 연결을 처리할 수 있는 일부 ABR 제어 알고리즘이 개발되었습니다. 따라서 우리는 이미 개발된 많은 연결에 대처할 수 있는 ABR 제어 메커니즘을 사용하여 GFR을 구현하는 것을 제안합니다. 이는 명시적 속도(ER) 제어 메커니즘과 가상 소스/가상 대상(VS/VD) 메커니즘으로 구성됩니다. VS/VD를 에지 스위치에 할당하고 ER 제어를 백본 스위치에 할당하면 네트워크 입구까지 ABR 제어를 적용할 수 있어 네트워크 수준에서 대역폭을 효과적으로 활용할 수 있습니다. 또한 우리의 방법을 사용하면 GFR과 ABR 연결 간에 리소스를 공유할 수 있어 링크 비용이 절감됩니다. 시뮬레이션 분석을 통해 우리는 우리의 방법이 다양한 교통 상황에서 WRR보다 더 잘 작동할 수 있음을 보여줍니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Ryoichi KAWAHARA, Yuki KAMADO, Masaaki OMOTANI, Shunsaku NAGATA, "Method of Implementing GFR Service in Large-Scale Networks Using ABR Control Mechanism and Its Performance Analysis" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 12, pp. 2081-2094, December 1999, doi: .
Abstract: This paper proposes implementing guaranteed frame rate (GFR) service using the available bit rate (ABR) control mechanism in large-scale networks. GFR is being standardized as a new ATM service category to provide a minimum cell rate (MCR) guarantee to each virtual channel (VC) at the frame level. Although ABR also can support MCR, a source must adjust its cell emission rate according to the network congestion indication. In contrast, GFR service is intended for users who are not equipped to comply with the source behavior rules required by ABR. It is expected that many existing users will fall into this category. As one implementation of GFR, weighted round robin (WRR) with per-VC queueing at each switch is well known. However, WRR is hard to implement in a switch supporting a large number of VCs because it needs to determine in one cell time which VC queue should be served. In addition, it may result in ineffective bandwidth utilization at the network level because its control mechanism is closed at the node level. On the other hand, progress in ABR service standardization has led to the development of some ABR control algorithms that can handle a large number of connections. Thus, we propose implementing GFR using an already developed ABR control mechanism that can cope with many connections. It consists of an explicit rate (ER) control mechanism and a virtual source/virtual destination (VS/VD) mechanism. Allocating VSs/VDs to edge switches and ER control to backbone switches enables us to apply ABR control up to the entrance of a network, which results in effective bandwidth utilization at the network level. Our method also makes it possible to share resources between GFR and ABR connections, which decreases the link cost. Through simulation analysis, we show that our method can work better than WRR under various traffic conditions.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_12_2081/_p
부
@ARTICLE{e82-b_12_2081,
author={Ryoichi KAWAHARA, Yuki KAMADO, Masaaki OMOTANI, Shunsaku NAGATA, },
journal={IEICE TRANSACTIONS on Communications},
title={Method of Implementing GFR Service in Large-Scale Networks Using ABR Control Mechanism and Its Performance Analysis},
year={1999},
volume={E82-B},
number={12},
pages={2081-2094},
abstract={This paper proposes implementing guaranteed frame rate (GFR) service using the available bit rate (ABR) control mechanism in large-scale networks. GFR is being standardized as a new ATM service category to provide a minimum cell rate (MCR) guarantee to each virtual channel (VC) at the frame level. Although ABR also can support MCR, a source must adjust its cell emission rate according to the network congestion indication. In contrast, GFR service is intended for users who are not equipped to comply with the source behavior rules required by ABR. It is expected that many existing users will fall into this category. As one implementation of GFR, weighted round robin (WRR) with per-VC queueing at each switch is well known. However, WRR is hard to implement in a switch supporting a large number of VCs because it needs to determine in one cell time which VC queue should be served. In addition, it may result in ineffective bandwidth utilization at the network level because its control mechanism is closed at the node level. On the other hand, progress in ABR service standardization has led to the development of some ABR control algorithms that can handle a large number of connections. Thus, we propose implementing GFR using an already developed ABR control mechanism that can cope with many connections. It consists of an explicit rate (ER) control mechanism and a virtual source/virtual destination (VS/VD) mechanism. Allocating VSs/VDs to edge switches and ER control to backbone switches enables us to apply ABR control up to the entrance of a network, which results in effective bandwidth utilization at the network level. Our method also makes it possible to share resources between GFR and ABR connections, which decreases the link cost. Through simulation analysis, we show that our method can work better than WRR under various traffic conditions.},
keywords={},
doi={},
ISSN={},
month={December},}
부
TY - JOUR
TI - Method of Implementing GFR Service in Large-Scale Networks Using ABR Control Mechanism and Its Performance Analysis
T2 - IEICE TRANSACTIONS on Communications
SP - 2081
EP - 2094
AU - Ryoichi KAWAHARA
AU - Yuki KAMADO
AU - Masaaki OMOTANI
AU - Shunsaku NAGATA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 1999
AB - This paper proposes implementing guaranteed frame rate (GFR) service using the available bit rate (ABR) control mechanism in large-scale networks. GFR is being standardized as a new ATM service category to provide a minimum cell rate (MCR) guarantee to each virtual channel (VC) at the frame level. Although ABR also can support MCR, a source must adjust its cell emission rate according to the network congestion indication. In contrast, GFR service is intended for users who are not equipped to comply with the source behavior rules required by ABR. It is expected that many existing users will fall into this category. As one implementation of GFR, weighted round robin (WRR) with per-VC queueing at each switch is well known. However, WRR is hard to implement in a switch supporting a large number of VCs because it needs to determine in one cell time which VC queue should be served. In addition, it may result in ineffective bandwidth utilization at the network level because its control mechanism is closed at the node level. On the other hand, progress in ABR service standardization has led to the development of some ABR control algorithms that can handle a large number of connections. Thus, we propose implementing GFR using an already developed ABR control mechanism that can cope with many connections. It consists of an explicit rate (ER) control mechanism and a virtual source/virtual destination (VS/VD) mechanism. Allocating VSs/VDs to edge switches and ER control to backbone switches enables us to apply ABR control up to the entrance of a network, which results in effective bandwidth utilization at the network level. Our method also makes it possible to share resources between GFR and ABR connections, which decreases the link cost. Through simulation analysis, we show that our method can work better than WRR under various traffic conditions.
ER -