A guided tour of Chernoff bounds
Information Processing Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Journal of the ACM (JACM)
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive routing with stale information
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Distributed selfish load balancing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Network games with atomic players
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Distributed Learning of Wardrop Equilibria
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Models of Non-atomic Congestion Games --- From Unicast to Multicast Routing
Algorithmics of Large and Complex Networks
Distributed algorithms for QoS load balancing
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities each of which is defined by a collection of paths (represented by a DAG) and a flow rate. Each commodity is controlled by an agent which aims at balancing its traffic among its paths such that all used paths have the same latency. Such an allocation is called a Wardrop equilibrium. In recent work, it was shown that an infinite population of users each of which carries an infinitesimal amount of traffic can attain approximate equilibria in a distributed and concurrent fashion quickly. Interestingly, the convergence time is independent of the underlying graph and depends only mildly on the latency functions. Unfortunately, a direct simulation of this process requires to maintain an exponential number of variables, one for each path. The focus of this work lies on the distributed and efficient computation of the adaptation rules by a finite number of agents. In order to guarantee a polynomial running time, every agent computes a randomised path decomposition in every communication round. Based on this decomposition, agents remove flow from paths with high latency and reassign it proportionally to all paths. This way, our algorithm can handle exponentially large path collections in polynomial time.