Adaptive routing with stale information

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 276-283

  Fischer, Simon ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

(Evolutionary) game theory; Adaptive routing; Stale information

Indexed keywords

ADAPTIVE SYSTEMS; EVOLUTIONARY ALGORITHMS; GAME THEORY; INFORMATION ANALYSIS; OSCILLATIONS; PROBABILITY; TELECOMMUNICATION TRAFFIC;

ADAPTIVE ROUTING; ROUTING GAME; STALE INFORMATION;

ROUTERS;

EID: 32344441572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073868     Document Type: Conference Paper

References (17)

1. M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economies and Transportation. Yale University Press, 1956.
2. Richard Ernest Bellman and Kenneth L. Cooke. Differential-Difference Equiations, volume 6 of Mathematics in Science and Engineering. Academic Press, 1963.
3. Dimitri P. Bertsekas and John N. Tistiklis. Parallel and Distributed Computing: Numerical Methods. Athena Scientific, 1989.
4. William Boyce. Elementary Differential Equations and Boundary Value Problems. John Wiley & Sons, 1965.
5. Jianhua Cao and Christian Nyberg. An approximate analysis of load balancing using stale state information for servers in parallel, In Proc. 2nd IASTED Int. Conf. on Communications Internet and Information Technology, November 2003.
6. Michael Dahlin, Interpreting stale load information. IEEE Trans. Parallel Distrib. Syst., 11(10):1033-1047, 2000.
7. Rodney D. Driver. Existence and stability of solutions of a delay-differential system. Arch. Rational Mech. Anal., 10:401-426, 1962.
8. Simon Fischer and Berthold Vöcking. On the evolution of selfish routing. In Proc. 12th Ann. European Symp. on Algorithms (ESA), Lecture Notes in Comput. Sci. 3221, pages 323-334. Springer-Verlag, September 2004.
9. Alain B. Haurie and Patrice Marcotte. On the relationship between Nash-Cournot and Wardrop equilibria, Networks, 15:295-308, 1985.
10. Atul Khanna and John A. Zinky. The revised ARPANET routing metric. In Proc. ACM SIGCOMM, pages 45-56, 1998.
11. James F. Kurose and Keith W. Ross. Computer Networking, a top down approach featuring the Internet, 3rd ed. Addison-Wesley Longman, 2004.
12. Michael Mitzenmacher, How useful is old information? In Proc. 16th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 83-91, 1997.
13. Jennifer Rexford. Handbook of Optimization in Telecommunications, chapter Route optimization in IP networks, Kluwer Academic Publishers, 2005.
14. Tim Roughgarden. How unfair is optimal routing? In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 203-204, 2002.
15. Tim Roughgarden and Éva Tardos. How bad is selfish routing? J. ACM, 49(2):236-259, 2002.
16. Stefan Savage, Andy Collins, Eric Huffman, John Snell, and Thomas E. Anderson, The end-to-end effects of internet path selection. In Proc. ACM SIGCOMM, pages 289-299, Boston, MA, 1999.
17. John Glen Wardrop. Some theoretical aspects of road traffic research. In Proc. of the Institute of Civil Engineers, Pt. II, pages 325-378, 1952.