Adaptive routing with stale information

DOI10.1016/J.TCS.2008.01.055MaRDI QIDQ838148zbMATH OpenOpenAlexFDO

Authors Simon Fischer, Berthold Vöcking

Publication date 21 August 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.01.055

zbMATH Keywords

adaptive routinggame theorystale informationWardrop model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Stochastic network models in operations research (90B15) Evolutionary games (91A22) Games involving graphs (91A43)

Recommendations

• Adaptive routing with stale information
• Distributed admission control, scheduling, and routing with stale information
• Optimal information location for adaptive routing
• Robust adaptive routing under uncertainty
• An optimal adaptive routing algorithm
• An adaptive routing strategy for packet delivery in complex networks
• Stochastic Routing in Ad-Hoc Networks
• Optimal adaptive routing with efficient flapping prevention
• A distributed adaptive routing algorithm

Cites work

• Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
• Adaptive routing with stale information
• Algorithms – ESA 2004
• Automata, Languages and Programming
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How bad is selfish routing?
• How much can taxes help selfish routing?
• How useful is old information (extended abstract)?
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 6731648 (Why is no real title available?)
• scientific article; zbMATH DE number 6469241 (Why is no real title available?)
• scientific article; zbMATH DE number 3337915 (Why is no real title available?)
• Route optimization in IP networks
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• The effect of collusion in congestion games
• The price of anarchy is independent of the network topology

Cited in

(6)

• Wardrop equilibrium on time-varying graphs
• Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
• Concurrent imitation dynamics in congestion games
• The Value of Information in Selfish Routing
• Adaptive routing with stale information
• Fast convergence to Wardrop equilibria by adaptive sampling methods

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838148)