IEICE TRANSACTIONS on Communications
Packet Scheduling Mechanism to Improve Quality of Short Flows and Low-Rate Flows
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.7 pp.1890-1896
- Publication Date
- 2010/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.1890
- Type of Manuscript
- PAPER
- Category
- Internet
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
