Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Awerbuch, R. Khandekar (2007)
Greedy distributed optimization of multi-commodity flowsDistributed Computing, 21
J. Wardrop (1952)
ROAD PAPER. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH., 1
J. Wardrop, J. Whitehead (1952)
CORRESPONDENCE. SOME THEORETICAL ASPECTS OF ROAD TRAFFIC RESEARCH., 1
(2007)
Effiziente Algorithmen für Gleichgewichtsflüsse
D. Bertsekas (1998)
Network optimization : continuous and discrete models
Avrim Blum, Eyal Even-Dar, Katrina Ligett (2006)
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing gamesTheory Comput., 6
P. Berenbrink, Tom Friedetzky, L. Goldberg, P. Goldberg, Zengjian Hu, R. Martin (2005)
Distributed selfish load balancing
T. Roughgarden, É. Tardos (2002)
How bad is selfish routing?J ACM, 49
Eyal Even-Dar, Y. Mansour (2005)
Fast convergence of selfish rerouting
J. Wardrop (1952)
Some Theoretical Aspects of Road Traffic Research, 1
S. Fischer, Harald Räcke, Berthold Vöcking (2006)
Fast convergence to Wardrop equilibria by adaptive sampling methodsSIAM J. Comput., 39
L. Fleischer (2005)
Linear tolls suffice: New bounds and algorithms for tolls in single source networksTheor. Comput. Sci., 348
S. Fischer, Berthold Vöcking (2005)
Adaptive routing with stale informationTheor. Comput. Sci., 410
B. Awerbuch, Robert Kleinberg (2004)
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
T. Roughgarden, É. Tardos (2000)
How bad is selfish routing?Proceedings 41st Annual Symposium on Foundations of Computer Science
B. Awerbuch, R. Khandekar, Satish Rao (2007)
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
R. Ahuja, T. Magnanti, J. Orlin (1993)
Network Flows: Theory, Algorithms, and Applications
P. Goldberg (2004)
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
M. Beckman, C. Mcguire, C. Winsten, T. Koopmans (1956)
Studies in the Economics of Transportation.A Quarterly Journal of Operations Research, 7
R. Cominetti, J. Correa, N. Stier-Moses (2006)
Network Games with Atomic Players
R. Cole, Y. Dodis, T. Roughgarden (2003)
How much can taxes help selfish routing?J. Comput. Syst. Sci., 72
T. Roughgarden (2002)
How unfair is optimal routing?
T. Hagerup, Christine Rüb (1990)
A Guided Tour of Chernoff BoundsInf. Process. Lett., 33
We present efficient algorithms for computing approximate Wardrop equilibria in a distributed and concurrent fashion. Our algorithms are exexuted by a finite number of agents each of which controls the flow of one commodity striving to balance the induced latency over all utilised paths. The set of allowed paths is represented by a DAG. Our algorithms are based on previous work on policies for infinite populations of agents. These policies achieve a convergence time which is independent of the underlying network and depends mildly on the latency functions. These policies can neither be applied to a finite set of agents nor can they be simulated directly due to the exponential number of paths. Our algorithms circumvent these problems by computing a randomised path decomposition in every communication round. Based on this decomposition, flow is shifted from overloaded to underloaded paths. This way, our algorithm can handle exponentially large path collections in polynomial time. Our algorithms are stateless, and the number of communication rounds depends polynomially on the approximation quality and is independent of the topology and size of the network.
Distributed Computing – Springer Journals
Published: Mar 13, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.