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
L'architecture de services différenciés (diffserv) a été proposée pour mettre en œuvre une différenciation de services évolutive sur Internet. Le transfert accéléré et le transfert assuré ont été standardisés en tant que comportements par saut (PHB) dans diffserv. Le transfert assuré peut être utilisé pour réaliser le service, qui fournit à chaque utilisateur un débit minimum garanti et une part équitable de la bande passante résiduelle. Nous appelons cela un service à tarif garanti (GR). Avec le service GR, chaque paquet pour le flux i est marqué in or ande basé sur la comparaison entre le tarif d’envoi et le tarif minimum garanti. Lorsque des congestions surviennent dans les réseaux, ande les paquets sont abandonnés de manière plus agressive que in paquets. Récemment, plusieurs systèmes de files d'attente équitables ont été proposés pour les réseaux centraux sans état. Ils peuvent obtenir une allocation de bande passante plus équitable que la détection précoce aléatoire (RED). Cependant, aucune étude n’a examiné l’utilisation des bits d’entrée/sortie pour prendre en charge le service GR. Cet article propose comment étendre les schémas qui ont été proposés pour les réseaux centraux sans état afin de permettre la prise en charge de l'utilisation des bits d'entrée/sortie. Nous présentons les performances de l'un des schémas étendus et comparons le schéma à RED avec bit d'entrée/sortie (RIO) en termes d'allocation équitable de bande passante.
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.
Copier
Masayoshi NABESHIMA, Takashi SHIMIZU, Ikuo YAMASAKI, "Performance of Fair Queuing with In/Out Bit in Core Stateless Networks" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 6, pp. 1488-1497, June 2001, doi: .
Abstract: The differentiated services (diffserv) architecture has been proposed for implementing scalable service differentiation in the Internet. Expedited forwarding and assured forwarding have been standardized as Per-Hop Behaviors (PHB) in diffserv. Assured forwarding can be utilized to realize the service, which provides each user with a minimum guaranteed rate and a fair share of the residual bandwidth. We call it guaranteed rate (GR) service. With GR service, each packet for flow i is marked in or out based on comparison between the sending rate and the minimum guaranteed rate. When congestion occurs in networks, out packets are dropped more aggressively than in packets. Recently, several fair queuing schemes have been proposed for core stateless networks. They can achieve fairer bandwidth allocation than random early detection (RED). However, there have not been any studies that consider in/out bit usage to support GR service. This paper proposes how to extend the schemes that have been proposed for core stateless networks to allow the support of in/out bit usage. We present the performance of one of the extended schemes and compare the scheme to RED with in/out bit (RIO) in terms of fair bandwidth allocation.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_6_1488/_p
Copier
@ARTICLE{e84-b_6_1488,
author={Masayoshi NABESHIMA, Takashi SHIMIZU, Ikuo YAMASAKI, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance of Fair Queuing with In/Out Bit in Core Stateless Networks},
year={2001},
volume={E84-B},
number={6},
pages={1488-1497},
abstract={The differentiated services (diffserv) architecture has been proposed for implementing scalable service differentiation in the Internet. Expedited forwarding and assured forwarding have been standardized as Per-Hop Behaviors (PHB) in diffserv. Assured forwarding can be utilized to realize the service, which provides each user with a minimum guaranteed rate and a fair share of the residual bandwidth. We call it guaranteed rate (GR) service. With GR service, each packet for flow i is marked in or out based on comparison between the sending rate and the minimum guaranteed rate. When congestion occurs in networks, out packets are dropped more aggressively than in packets. Recently, several fair queuing schemes have been proposed for core stateless networks. They can achieve fairer bandwidth allocation than random early detection (RED). However, there have not been any studies that consider in/out bit usage to support GR service. This paper proposes how to extend the schemes that have been proposed for core stateless networks to allow the support of in/out bit usage. We present the performance of one of the extended schemes and compare the scheme to RED with in/out bit (RIO) in terms of fair bandwidth allocation.},
keywords={},
doi={},
ISSN={},
month={June},}
Copier
TY - JOUR
TI - Performance of Fair Queuing with In/Out Bit in Core Stateless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1488
EP - 1497
AU - Masayoshi NABESHIMA
AU - Takashi SHIMIZU
AU - Ikuo YAMASAKI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2001
AB - The differentiated services (diffserv) architecture has been proposed for implementing scalable service differentiation in the Internet. Expedited forwarding and assured forwarding have been standardized as Per-Hop Behaviors (PHB) in diffserv. Assured forwarding can be utilized to realize the service, which provides each user with a minimum guaranteed rate and a fair share of the residual bandwidth. We call it guaranteed rate (GR) service. With GR service, each packet for flow i is marked in or out based on comparison between the sending rate and the minimum guaranteed rate. When congestion occurs in networks, out packets are dropped more aggressively than in packets. Recently, several fair queuing schemes have been proposed for core stateless networks. They can achieve fairer bandwidth allocation than random early detection (RED). However, there have not been any studies that consider in/out bit usage to support GR service. This paper proposes how to extend the schemes that have been proposed for core stateless networks to allow the support of in/out bit usage. We present the performance of one of the extended schemes and compare the scheme to RED with in/out bit (RIO) in terms of fair bandwidth allocation.
ER -