Adaptive decentralized routing in small-world networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Bakun, Oleg ^a   Konjevod, Goran ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECENTRALIZED ROUTING; GREEDY ROUTING; MACHINE-LEARNING; REAL NETWORKS; SMALL WORLD NETWORKS; THEORETICAL EXPLANATION;

EID: 77953894481     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2010.5466704     Document Type: Conference Paper

References (22)

1. B. Bollobás, Random Graphs, 2nd ed. Cambridge University Press, 2001.
2. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, vol. 393, pp. 440-442, April 1998.
3. J. Kleinberg, "The small-world phenomenon: an algorithm perspective," in Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000, pp. 163-170.
4. S. Milgram, "The small world problem," Psychology Today, vol. 1, no. 1, pp. 60-67, 1967.
5. Y. Koren, "On spectral graph drawing," in COCOON, 2003, pp. 496-508.
6. D. P. de Farias and N. Megiddo, "Combining expert advice in reactive environments," J. ACM, vol. 53, no. 5, pp. 762-799, 2006.
7. N. Littlestone and M. K. Warmuth, "The weighted majority algorithm," in FOCS, 1989, pp. 256-261.
8. S. Arora, E. Hazan, and S. Kale, "The multiplicative weights update method: a meta algorithm and applications," unpublished survey. Available at www.cs.princeton.edu/~arora/pubs/MWsurvey.pdf.
9. P. Fraigniaud, C. Gavoille, and C. Paul, "Eclecticism shrinks even small worlds," in PODC, 2004, pp. 169-178.
10. E. Lebhar and N. Schabanel, "Almost optimal decentralized routing in long-range contact networks," in ICALP, 2004, pp. 894-905.
11. B. Awerbuch and R. Kleinberg, "Online linear optimization and adaptive routing," J. Comput. Syst. Sci., vol. 74, no. 1, pp. 97-114, 2008.
12. M. Thorup and U. Zwick, "Compact routing schemes," in Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architecture, 2001, pp. 1-10.
13. I. Abraham, C. Gavoille, and D. Malkhi, "On space-stretch trade-offs: Lower bounds," in Proceedings of the 18th ACM Symposium on Parallel Algorithms and Architecture, 2006, pp. 207-216.
14. G. Konjevod, A. W. Richa, and D. Xia, "Optimal scale-free compact routing schemes in networks of low doubling dimension," in Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 939-948.
15. J. Kleinberg, "Complex networks and decentralized search algorithms," in Proceedings of the International Congress of Mathematicians, 2006.
16. O. Sandberg, "Distributed routing in small-world networks," in Proceedings of the 9th ALENEX, 2006, pp. 144-155.
17. W. T. Tutte, "How to draw a graph," Proceedings of the London Mathematical Society, vol. s3-13, no. 1, pp. 743-768, 1963.
18. M. Dell'Amico, "Mapping small worlds," in Peer-to-Peer Computing, 2007, pp. 219-228.
19. M. E. J. Newman, "Network data," web page at www-personal.umich.edu/~mejn/netdata/.
20. L. A. Adamic and N. Glance, "The political blogosphere and the 2004 u.s. election: divided they blog," in LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery. New York, NY, USA: ACM Press, 2005, pp. 36-43. [Online]. Available: http://dx.doi.org/http://dx.doi.org/10.1145/ 1134271.1134277
21. M. E. J. Newman, "The structure of scientific collaboration networks," PROC.NATL.ACAD.SCI.USA, vol. 98, pp. 404-409, 2001. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:condmat/0007214
22. S. Tauro, C. Palmer, G. Siganos, and M. Faloutsos, "A simple conceptual model for the Internet topology," in IEEE Global Telecommunications Conference, 2001. GLOBECOM'01., 2001.