Active queue control scheme for achieving approximately fair bandwidth allocation

Takashi Miyamura, Takashi Kurimoto, Kenji Nakagawa, Prasad Dhananjaya, Michihiro Aoki, Naoaki Yamanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the flow with an estimated fair bandwidth share. Though V-WFQ is a hardware-efficient FIFO-based algorithm, it can achieve almost ideal fairness in bandwidth allocation. Simulation results show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages1269-1273
Number of pages5
Volume2
Publication statusPublished - 2002
Externally publishedYes
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: 2002 Apr 282002 May 2

Other

Other2002 International Conference on Communications (ICC 2002)
CountryUnited States
CityNew York, NY
Period02/4/2802/5/2

Fingerprint

Frequency allocation
Bandwidth
HIgh speed networks
Computer hardware
Hardware

ASJC Scopus subject areas

  • Media Technology

Cite this

Miyamura, T., Kurimoto, T., Nakagawa, K., Dhananjaya, P., Aoki, M., & Yamanaka, N. (2002). Active queue control scheme for achieving approximately fair bandwidth allocation. In IEEE International Conference on Communications (Vol. 2, pp. 1269-1273)

Active queue control scheme for achieving approximately fair bandwidth allocation. / Miyamura, Takashi; Kurimoto, Takashi; Nakagawa, Kenji; Dhananjaya, Prasad; Aoki, Michihiro; Yamanaka, Naoaki.

IEEE International Conference on Communications. Vol. 2 2002. p. 1269-1273.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Miyamura, T, Kurimoto, T, Nakagawa, K, Dhananjaya, P, Aoki, M & Yamanaka, N 2002, Active queue control scheme for achieving approximately fair bandwidth allocation. in IEEE International Conference on Communications. vol. 2, pp. 1269-1273, 2002 International Conference on Communications (ICC 2002), New York, NY, United States, 02/4/28.
Miyamura T, Kurimoto T, Nakagawa K, Dhananjaya P, Aoki M, Yamanaka N. Active queue control scheme for achieving approximately fair bandwidth allocation. In IEEE International Conference on Communications. Vol. 2. 2002. p. 1269-1273
Miyamura, Takashi ; Kurimoto, Takashi ; Nakagawa, Kenji ; Dhananjaya, Prasad ; Aoki, Michihiro ; Yamanaka, Naoaki. / Active queue control scheme for achieving approximately fair bandwidth allocation. IEEE International Conference on Communications. Vol. 2 2002. pp. 1269-1273
@inproceedings{9600cceef456424b9f2ceeecc8c32089,
title = "Active queue control scheme for achieving approximately fair bandwidth allocation",
abstract = "We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the flow with an estimated fair bandwidth share. Though V-WFQ is a hardware-efficient FIFO-based algorithm, it can achieve almost ideal fairness in bandwidth allocation. Simulation results show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.",
author = "Takashi Miyamura and Takashi Kurimoto and Kenji Nakagawa and Prasad Dhananjaya and Michihiro Aoki and Naoaki Yamanaka",
year = "2002",
language = "English",
volume = "2",
pages = "1269--1273",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Active queue control scheme for achieving approximately fair bandwidth allocation

AU - Miyamura, Takashi

AU - Kurimoto, Takashi

AU - Nakagawa, Kenji

AU - Dhananjaya, Prasad

AU - Aoki, Michihiro

AU - Yamanaka, Naoaki

PY - 2002

Y1 - 2002

N2 - We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the flow with an estimated fair bandwidth share. Though V-WFQ is a hardware-efficient FIFO-based algorithm, it can achieve almost ideal fairness in bandwidth allocation. Simulation results show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.

AB - We propose a buffer management mechanism, called V-WFQ (Virtual Weighted Fair Queueing), for achieving approximately fair bandwidth allocation with a small hardware amount in high-speed networks. The basic process for allocating bandwidth fairly uses selective packet dropping to compare the measured input rate of the flow with an estimated fair bandwidth share. Though V-WFQ is a hardware-efficient FIFO-based algorithm, it can achieve almost ideal fairness in bandwidth allocation. Simulation results show that V-WFQ achieves a good balance between fairness and link utilization under various simulation conditions.

UR - http://www.scopus.com/inward/record.url?scp=0036279698&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036279698&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036279698

VL - 2

SP - 1269

EP - 1273

BT - IEEE International Conference on Communications

ER -