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
Ces dernières années, les flux d’éléphants ont augmenté en raison du développement des applications peer-to-peer (P2P) sur Internet. En conséquence, la bande passante est occupée par des utilisateurs spécifiques, ce qui déclenche une allocation injuste des ressources. Le principal mécanisme de planification de paquets actuellement utilisé est le premier entré, premier sorti (FIFO), dans lequel la bande passante disponible des flux courts est limitée par les flux éléphants. Le service le moins atteint (LAS), qui décide de la priorité de transfert des paquets en fonction de la quantité totale de données transférées dans tous les flux, a été proposé pour résoudre ce problème. Cependant, les routeurs dotés de LAS limitent les flux avec de grandes quantités de données transférées même s'ils sont à faible débit. Il est donc nécessaire d’améliorer la qualité des flux bas débits avec des temps d’attente longs comme les applications de voix sur protocole Internet (VoIP). Cet article propose un contrôle de priorité basé sur le débit (RBPC), qui calcule le débit et contrôle la priorité en l'utilisant. La méthode que nous proposons permet de transférer à l’avance les flux courts et les flux à faible débit. De plus, ses bonnes performances sont démontrées par des simulations.
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
Kenji YOKOTA, Takuya ASAKA, Tatsuro TAKAHASHI, "Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 7, pp. 1890-1896, July 2010, doi: 10.1587/transcom.E93.B.1890.
Abstract: In recent years elephant flows are increasing by expansion of peer-to-peer (P2P) applications on the Internet. As a result, bandwidth is occupied by specific users triggering unfair resource allocation. The main packet-scheduling mechanism currently employed is first-in first-out (FIFO) where the available bandwidth of short flows is limited by elephant flows. Least attained service (LAS), which decides transfer priority of packets by the total amount of transferred data in all flows, was proposed to solve this problem. However, routers with LAS limit flows with large amount of transferred data even if they are low-rate. Therefore, it is necessary to improve the quality of low-rate flows with long holding times such as voice over Internet protocol (VoIP) applications. This paper proposes rate-based priority control (RBPC), which calculates the flow rate and control the priority by using it. Our proposed method can transfer short flows and low-rate flows in advance. Moreover, its fair performance is shown through simulations.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.1890/_p
Copier
@ARTICLE{e93-b_7_1890,
author={Kenji YOKOTA, Takuya ASAKA, Tatsuro TAKAHASHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows},
year={2010},
volume={E93-B},
number={7},
pages={1890-1896},
abstract={In recent years elephant flows are increasing by expansion of peer-to-peer (P2P) applications on the Internet. As a result, bandwidth is occupied by specific users triggering unfair resource allocation. The main packet-scheduling mechanism currently employed is first-in first-out (FIFO) where the available bandwidth of short flows is limited by elephant flows. Least attained service (LAS), which decides transfer priority of packets by the total amount of transferred data in all flows, was proposed to solve this problem. However, routers with LAS limit flows with large amount of transferred data even if they are low-rate. Therefore, it is necessary to improve the quality of low-rate flows with long holding times such as voice over Internet protocol (VoIP) applications. This paper proposes rate-based priority control (RBPC), which calculates the flow rate and control the priority by using it. Our proposed method can transfer short flows and low-rate flows in advance. Moreover, its fair performance is shown through simulations.},
keywords={},
doi={10.1587/transcom.E93.B.1890},
ISSN={1745-1345},
month={July},}
Copier
TY - JOUR
TI - Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows
T2 - IEICE TRANSACTIONS on Communications
SP - 1890
EP - 1896
AU - Kenji YOKOTA
AU - Takuya ASAKA
AU - Tatsuro TAKAHASHI
PY - 2010
DO - 10.1587/transcom.E93.B.1890
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2010
AB - In recent years elephant flows are increasing by expansion of peer-to-peer (P2P) applications on the Internet. As a result, bandwidth is occupied by specific users triggering unfair resource allocation. The main packet-scheduling mechanism currently employed is first-in first-out (FIFO) where the available bandwidth of short flows is limited by elephant flows. Least attained service (LAS), which decides transfer priority of packets by the total amount of transferred data in all flows, was proposed to solve this problem. However, routers with LAS limit flows with large amount of transferred data even if they are low-rate. Therefore, it is necessary to improve the quality of low-rate flows with long holding times such as voice over Internet protocol (VoIP) applications. This paper proposes rate-based priority control (RBPC), which calculates the flow rate and control the priority by using it. Our proposed method can transfer short flows and low-rate flows in advance. Moreover, its fair performance is shown through simulations.
ER -