The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
Journal of the ACM (JACM)
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
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
Adaptive routing with stale information
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast RSTP convergence by using backup VLANs
ECC'11 Proceedings of the 5th European conference on European computing conference
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 5.23 |
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, each one of an infinite number of agents controls an infinitesimal amount of flow, thus contributing to a network flow which induces latency. In our dynamic extension of this model, agents are activated in a concurrent and asynchronous fashion and may reroute their flow with the aim of reducing their sustained latency. It is a well-known problem that in settings where latency information is not always up-to-date, such behaviour may lead to oscillation effects which seriously harm network performance. Two quantities determine the difficulty of avoiding oscillation: the steepness of the latency functions and the maximum possible age of the information T. In this work we ask for conditions that the rerouting policies must adhere to in order to converge to an equilibrium despite the information being stale. We consider simple policies which sample another path in a first step and then migrate from the current path to the new one with a probability that is a function of the anticipated latency gain. In fact we can show that our class of policies guarantees convergence if the latter migration probability function satisfies a certain smoothness condition that resembles Lipschitz continuity. It turns out that for smooth adaptation policies where the migration probability is chosen small enough relative to the inverse of the steepness of the latency functions and T, the population actually converges to an equilibrium. In addition, we analyse the speed of convergence towards approximate equilibria of two specific variants of smooth adaptive routing policies, e.g., for a replication policy adopted from evolutionary game theory.