Optimal flow distribution among multiple channels with unknown capacities

Authors:
Richard Karp;Till Nierhoff;Till Tantau
Affiliations:
International Computer Science Institute, Berkeley;Institut für Informatik, Humboldt-Universität zu Berlin, Germany;Fakultät für Elektrotechnik und Informatik, TU Berlin, Germany
Venue:
Theoretical Computer Science
Year:
2006

Citing 4
Cited 1

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks

Computer Networks and ISDN Systems
On-Line End-to-End Congestion Control

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Optimization problems in congestion control

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science

Online packing with gradually improving capacity estimations and applications to network lifetime maximization

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	5.23

Visualization

Abstract

Consider a simple network flow problem in which a flow of value D must be split among n channels directed from a source to a sink. The initially unknown channel capacities can be probed by attempting to send a flow of at most D units through the network. If the flow is not feasible, we are told on which channels the capacity was exceeded (binary feedback) and possibly also how many units of flow were successfully sent on these channels (throughput feedback). For throughput feedback we present optimal protocols for minimizing the number of rounds needed to find a feasible flow and for minimizing the total amount of wasted flow. For binary feedback we present an asymptotically optimal protocol.