Towards fast decentralized construction of locality-aware overlay networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 89-98

  Slivkins, Aleksandrs ^a  

^a Brown Univerity   (United States)

Author keywords

Distance labeling; Grid dimension; Growth constrained metrics; Locality awareness; Multi cast trees; Routing schemes; Triangulation

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; NETWORK ROUTING; SCALABILITY;

DISTANCE LABELING; GRID DIMENSION; GROWTH-CONSTRAINED METRICS; MULTI-CAST TREES; OVERLAY NETWORK; POLYLOGARITHMIC NUMBER; ROUTING SCHEMES;

COMPUTER NETWORKS;

EID: 36849031279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281116     Document Type: Conference Paper

References (35)

1. I. Abraham, C. Gavoille, A. Goldberg, and D. Malkhi. Routing in networks with low doubling dimension. In 26th IEEE Intl. Conf. on Distributed Computing Systems (ICDCS), 2006.
2. I. Abraham, C. Gavoille, and D. Malkhi. On space-stretch trade-offs: upper bounds. In 18th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 207-216, 2006.
3. I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. In 16th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 20-24, 2004.
4. I. Abraham and D. Malkhi. Name independent routing for growth bounded networks. In 17th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 49-55, 2005.
5. I. Abraham, D. Malkhi, and O. Dobzinski. LAND: Stretch (1 + ε) locality-aware networks for DHTs. In 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 550-559, 2004.
6. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. J. of Algorithms, 11(3):307-341, 1990.
7. B. Awerbuch and D. Peleg. Sparse partitions. In 31st Symp. on Foundations of Computer Science (FOCS), pages 503-513, 1990.
8. Y.-H. Chu, S. G. Rao, S. Seshan, and H. Zhang. Case for End System Multicast. IEEE J. on Selected Areas in Communication (JSAC), 20(8), 2002.
9. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In ACM SIGCOMM, 2004.
10. P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel. Towards small world emergence. In 19th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 225-232, 2006.
11. P. Francis, S. Jamin, C. Jin, Y Jin, D. Raz, Y. Shavitt, and L. Zhang. IDMaps: A global Internet host distance estimation service. IEEE/ACM Transactions on Networking, 9:525-540, October 2001.
12. C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In 9th Annual European Symp. on Algorithms (ESA), pages 476-487, 2001.
13. C. Gavoille and D. Peleg. Compact and localized distributed data structures. J. of Distributed Computing, 16:111-120, 2003.
14. C. Gavoille, D. Peleg, S. Perennes, andR. Raz. Distance labeling in graphs. J. of Algorithms, 53(1):85-112, 2004. (Preliminary version in 12th ACM-SIAM SODA, 2001).
15. J. Guyton and M. Schwartz. Locating nearby copies of replicated Internet servers. In ACM SIGCOMM, 1995.
16. K. Hildrum, J. Kubiatowicz, S. Ma, and S. Rao. A note on the nearest neighbor in growth-restricted metrics. In 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 560-561, 2004.
17. D. Karger and M. Ruhl. Finding Nearest Neighbors in Growth-restricted Metrics. In 34th ACM Symp. on Theory of Computing (STOC), 2002.
18. V. King and J. Saia. Choosing a random peer. In 23rd Annual ACM SIGACT-SIGOPS Symp. on Principles Of Distributed Computing (PODC), pages 125-130, 2004.
19. J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and Embedding Using Small Sets of Beacons. In 45th Symp. on Foundations of Computer Science (FOCS), pages 444-453, 2004.
20. C. Kommareddy, N. Shankar, and B. Bhattacharjee. Finding close friends on the Internet. In 12th IEEE Intl. Conf. on Network Protocols (ICNP), 2001.
21. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh. In ACM Symp. on Operating Systems Principles (SOSP), 2003.
22. R. Krauthgamer and J. R. Lee. The Intrinsic Dimensionality of Graphs. In 35th ACM Symp. on Theory of Computing (STOC), pages 438-447, 2003.
23. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth. In 24th Annual ACM SIGACT-SIGOPS Symp. on Principles Of Distributed Computing (PODC), pages 7-15, 2005.
24. C. Law and K.-Y Siu. Distributed construction of random expander networks. In IEEE INFOCOM, 2003.
25. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, Cambridge, 1995.
26. T. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In IEEE INFOCOM, 2002.
27. G. Pandurangan, P. Raghavan, and E. Upfal. Building Low-Diameter P2P Networks. IEEE Journal on Selected Areas in Communications, 21(6):995-1002, 2003. Preliminary version in 42nd IEEE FOCS, 2001.
28. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst., 32(3):241-280, 1999. Preliminary version in 9th ACM SPAA, 1997.
29. A. Slivkins. Distance estimation and object location via rings of neighbors. In 24th Annual ACM SIGACT-SIGOPS Symp. on Principles Of Distributed Computing (PODC), pages 41-50, July 2005. Full version appeared in the special issue of Distributed Computing: 19(4), pp. 313-333, March 2007.
30. A. Slivkins. Towards Fast Decentralized Construction of Locality-Aware Overlay Networks. Technical report, Brown University, June 2007. Available online at http://www.cs.brown.edu/people/slivkins/.
31. K. Talwar. Bypassing the embedding: approximation schemes and compact representations for growth restricted metrics. In 36th ACM Symp. on Theory of Computing (STOC), pages 281-290, 2004.
32. M. Thorup and U. Zwick. Approximate distance oracles. J. of the ACM, 52(1):1-24, 2005. (Preliminary version in 33rd ACM STOC, 2001).
33. V. Vishnumurthy and P. Francis. On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks. In IEEE INFOCOM, 2006.
34. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A Lightweight Network Location Service without Virtual Coordinates. In ACM SIGCOMM, 2005.
35. Q. Zhang, F. Yang, W. Zhu, and Y.-Q. Zhang. A Construction of Locality-Aware Overlay Network: mOverlay and its performance. IEEE J. on Selected Areas in Communications (JSAC), 22(1):18-28, 2004.