Active queue management and global fairness objectives

Author

Wu, Xudong ; Nikolaidis, Ioanis

Author_Institution

Comput. Sci. Dept., Alberta Univ., Edmonton, Alta., Canada

fYear

2003

fDate

9-11 April 2003

Firstpage

353

Lastpage

360

Abstract

We present an active queue management policy and we study its ability to steer, in a distributed fashion, an entire TCP/IP network into global max-min fairness of its long-lived flows. A previously proposed technique, initially applicable to circuit-switched networks and feedback-based flow control networks is adapted to the realities of packet-switching and TCP flow/congestion control, together with a per-hop policy, called FairShare. The proposed solution is evaluated using several example topologies, including linear, loop, and irregular topologies as well as dynamic load fluctuations.

Keywords

circuit switching; feedback; minimax techniques; network topology; packet switching; queueing theory; telecommunication congestion control; telecommunication network management; transport protocols; FairShare; TCP flow/congestion control; TCP/IP network; active queue management; circuit-switched networks; dynamic load fluctuations; feedback-based flow control networks; global fairness objectives; global max-min fairness; irregular topology; linear topology; long-lived flows; loop topology; network topologies; packet-switching; per-hop policy; Bandwidth; Circuit topology; Computer network management; Computer networks; Distributed computing; Feedback circuits; IP networks; Network topology; TCPIP; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Performance, Computing, and Communications Conference, 2003. Conference Proceedings of the 2003 IEEE International

ISSN

1097-2641

Print_ISBN

0-7803-7893-8

Type

conf

DOI

10.1109/PCCC.2003.1203718

Filename

1203718