Title :
Low-state fairness: lower bounds and practical enforcement
Author :
Das, Abhimanyu ; Dutta, Detmjyoti ; Helmy, Ahmed ; Goel, Ashsh ; Heidemann, John
Author_Institution :
Dept. of CS, USC, Los Angeles, CA, USA
Abstract :
Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the space complexity of fairness algorithms, and the communication complexity of distributed global fairness algorithms. We show that in order to enforce max-min fairness with bounded errors, a router must maintain per-flow state. Then we present a practical edge-marking based architecture to demonstrate the enforcement of approximate global max-min fairness for representative scenarios with multiple bottlenecks and non-responsive traffic. We validate our architecture using packet level simulations.
Keywords :
bandwidth allocation; communication complexity; minimax techniques; queueing theory; routing protocols; telecommunication traffic; transport protocols; bandwidth allocation; communication complexity; distributed global fairness algorithm; edge-marking based architecture; max-min approximation; network router; nonresponsive traffic; packet level simulation; representative scenario; Bandwidth; Channel allocation; Communication system traffic control; Complexity theory; Degradation; Internet; Protocols; Scheduling algorithm; Telecommunication traffic; Traffic control;
Conference_Titel :
INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE
Print_ISBN :
0-7803-8968-9
DOI :
10.1109/INFCOM.2005.1498529