Gateway algorithm for fair bandwidth sharing

Author

Yi, Wei ; Makkar, Rupinder ; Lambadaris, Ioannis ; Marmorkos, Ioannis

Author_Institution

Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada

Volume

2

fYear

2004

fDate

20-24 June 2004

Firstpage

1141

Abstract

In this paper we propose a Virtual Round Robin (VRR) gateway algorithm to enforce per-flow fair bandwidth allocation by keeping per-flow information. This mechanism achieves reasonably fair bandwidth allocation and is easily amenable to high-speed implementations. It uses a single FIFO queue with probabilistic drop-on-arrival. In our simulation study, we compare the performance VRR with other two algorithms, Random Early Detection (RED) and Flow Random Early Drop (FRED) (D. Lin and R. Morris, 1997). Our simulation results show that VRR outperforms RED and FRED in wide variety of scenarios.

Keywords

Internet; bandwidth allocation; probability; queueing theory; bandwidth allocation; fair bandwidth sharing; flow random early drop; probabilistic drop-on-arrival; random early detection; single FIFO queue; virtual round robin gateway algorithm; Adaptive control; Adaptive systems; Bandwidth; Channel allocation; IP networks; Informatics; Programmable control; Round robin; Systems engineering and theory; Telecommunication computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 2004 IEEE International Conference on

Print_ISBN

0-7803-8533-0

Type

conf

DOI

10.1109/ICC.2004.1312678

Filename

1312678