Adaptive routing with stale information

DOI10.1145/1073814.1073868zbMath1314.68040OpenAlexW2119813346MaRDI QIDQ5177249

Simon Fischer, Berthold Vöcking

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073868

zbMATH Keywords

adaptive routingstale information(evolutionary) game theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) (n)-person games, (n>2) (91A06) Stochastic games, stochastic differential games (91A15) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (7)

Adaptive routing with stale information ⋮ Greedy distributed optimization of multi-commodity flows ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Distributed Learning of Wardrop Equilibria ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ Management of Variable Data Streams in Networks

This page was built for publication: Adaptive routing with stale information