A comparison of feedback based and fair queuing mechanisms for handling unresponsive traffic

Author

Iancu, Costin ; Acharya, Anurag

Author_Institution

Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA

fYear

2001

fDate

2001

Firstpage

288

Lastpage

295

Abstract

In this paper we examine the impact of router based congestion control mechanisms in the presence of uncooperative traffic. We consider two classes of control mechanisms: (1) fair queuing mechanisms (FRED, DRR, CSFQ) and (2) feedback based mechanisms (ERAF, NBP). Within the subclass of feedback based mechanisms we distinguish between binary feedback mechanisms (ERAF) and rate feedback mechanisms (NBP). The criteria we use for our comparison are: efficiency, fairness, convergence and scalability. Our results indicate that the feedback based mechanisms are able to shield responsive traffic competing with uncooperative traffic on a single link with the same efficiency as the fair queuing mechanisms. For more complex topologies, the feedback based mechanisms offer better bandwidth allocations than the fair queuing mechanisms alone

Keywords

Internet; bandwidth allocation; convergence of numerical methods; feedback; queueing theory; telecommunication congestion control; telecommunication network routing; telecommunication traffic; topology; CSFQ; DRR; ERAF; FRED; Internet; NBP; bandwidth allocation; binary feedback mechanisms; convergence; efficiency; fair queuing mechanisms; feedback based mechanisms; rate feedback mechanisms; responsive traffic; router based congestion control; scalability; unresponsive traffic; Asynchronous transfer mode; Computer science; Convergence; Feedback; Internet; Packet switching; Scalability; Telecommunication traffic; Topology; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 2001. Proceedings. Sixth IEEE Symposium on

Conference_Location

Hammamet

ISSN

1530-1346

Print_ISBN

0-7695-1177-5

Type

conf

DOI

10.1109/ISCC.2001.935389

Filename

935389