Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
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
Interpreting Stale Load Information
IEEE Transactions on Parallel and Distributed Systems
Journal of the ACM (JACM)
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Elementary Differential Equations With Mathematica
Elementary Differential Equations With Mathematica
Computer Networking: A Top-Down Approach Featuring the Internet
Computer Networking: A Top-Down Approach Featuring the Internet
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
On cost sharing mechanisms in the network design game
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Fast load balancing via bounded best response
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Cost sharing mechanisms for near-optimal traffic aggregation and network design
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
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
Adaptive routing with stale information
Theoretical Computer Science
Efficiency and stability of Nash equilibria in resource allocation games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Nonadaptive selfish routing with online demands
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Distributed selfish load balancing with weights and speeds
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
We investigate adaptive routing policies for large networks in which agents reroute traffic based on old information. It is a well known and practically relevant problem that old information can lead to undesirable oscillation effects resulting in poor performance. We investigate how adaptive routing policies should be designed such that these effects can be avoided.The network is represented by a general graph with latency functions on the edges. Traffic is managed by a large number of agents each of which is responsible for a negligible amount of traffic. Initially the agents' routing paths are chosen in an arbitrary fashion. From time to time each agent revises her routing strategy by sampling another path and switching with positive probability to this path if it promises smaller latencies. As the information on which the agent bases her decision might be stale, however, this does not necessarily lead to an improvement. The points of time at which agents revise their strategy are generated by a Poisson distribution. Stale information is modelled in form of a bulletin board that is updated periodically and lists the latencies on all edges.We analyze such a distributed routing process in the so-called fluid limit, that is, we use differential equations describing the fractions of traffic on different paths over time. In our model, we can show the following effects. Simple routing policies that always switch to the better alternative lead to oscillation, regardless at which frequency the bulletin board is updated. Oscillation effects can be avoided, however, when using smooth adaption policies that do not always switch to better alternatives but only with a probability depending on the advantage in the latency. In fact, such policies have dynamics that converge to a fixed point corresponding to a Nash equilibrium for the underlying routing game, provided the update periods are not too large.In addition, we also analyze the speed of convergence towards approximate equilibria of two specific variants of smooth adaptive routing policies, eg., for a replication policy adopted from evolutionary game theory.