Efficient computation of distance sketches in distributed networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2012, Pages 318-326

  Sarma, Atish Das ^a   Dinitz, Michael ^b   Pandurangan, Gopal ^c,d  

^a EBAY INC   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^d BROWN UNIVERSITY   (United States)

Author keywords

Distance sketches; Distributed computing

Indexed keywords

AMOUNT OF INFORMATION; APPROXIMATION TECHNIQUES; AVERAGE-CASE; BANDWIDTH-CONSTRAINED; DISTANCE COMPUTATION; DISTANCE SKETCHES; DISTRIBUTED IMPLEMENTATION; DISTRIBUTED NETWORKS; EFFICIENT COMPUTATION; EFFICIENT CONSTRUCTION; LABELINGS; LARGE-SCALE NETWORK; MESSAGE COMPLEXITY; METRIC EMBEDDINGS; NETWORK COORDINATE SYSTEMS; NETWORK DISTANCE; NETWORKING APPLICATIONS; NETWORKING COMMUNITY; ON-LINE FASHION; PAIRWISE DISTANCES; PEER TO PEER (P2P) NETWORK; PRE-PROCESSING; PREPROCESS; QUERY TIME; SHORTEST PATH; SOCIAL NETWORKS; THEORETICAL RESEARCH; THEORETICAL STUDY; TOPOLOGY DISCOVERY; WEB GRAPHS; WORST-CASE PERFORMANCE;

ALGORITHMS; COMMERCE; COMPUTATIONAL EFFICIENCY; NETWORK ARCHITECTURE; PEER TO PEER NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84864123219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2312005.2312060     Document Type: Conference Paper

References (31)

1. I. Abraham, Y. Bartal, T.-H. H. Chan, K. D. Dhamdhere, A. Gupta, J. Kleinberg, O. Neiman, and A. Slivkins. Metric embeddings with relaxed guarantees. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS '05, pages 83-100, Washington, DC, USA, 2005. IEEE Computer Society. (Pubitemid 44375722)
2. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In FOCS, pages 218-223, 1979.
3. A. R. Bharambe, M. Agrawal, and S. Seshan. Mercury: supporting scalable multi-attribute range queries. In SIGCOMM, pages 353-366, 2004. (Pubitemid 40954893)
4. T.-H. H. Chan, M. Dinitz, and A. Gupta. Spanners with slack. In Proceedings of the 14th European Symposium on Algorithms, pages 196-207, 2006. (Pubitemid 44699652)
5. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg. Labeling schemes for tree representation. Algorithmica, 53(1):1-15, 2009.
6. B. F. Cooper. Quickly routing searches without having to move content. In IPTPS, pages 163-172, 2005.
7. D. Coppersmith, P. Tetali, and P. Winkler. Collisions among random walks on a graph. SIAM J. Discret. Math., 6(3):363-374, 1993.
8. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A decentralized network coordinate system. In Proceedings of the ACM SIGCOMM '04 Conference, Portland, Oregon, August 2004.
9. S. Dolev, E. Schiller, and J. L. Welch. Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput., 5(7):893-905, 2006. also in PODC'02. (Pubitemid 44143938)
10. A. J. Ganesh, A.-M. Kermarrec, and L. Massoulié. Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput., 52(2):139-149, 2003.
11. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. J. Algorithms, 53(1):85-112, 2004.
12. C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid search schemes for unstructured peer-to-peer networks. In INFOCOM, pages 1526-1537, 2005. (Pubitemid 41390670)
13. A. Israeli and M. Jalfon. Token management schemes and random walks yield self-stabilizing mutual exclusion. In PODC, pages 119-131, 1990.
14. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In SPAA, pages 36-43, 2004.
15. M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for ow and connectivity. SIAM J. Comput., 34(1):23-40, 2004.
16. D. Kempe, J. M. Kleinberg, and A. J. Demers. Spatial gossip and resource location protocols. In STOC, pages 163-172, 2001. (Pubitemid 32865729)
17. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient distributed approximation algorithms via probabilistic tree embeddings. In Proc. 27th ACM Symp. on Principles of Distributed Computing (PODC), 2008. Journal version: Distributed Computing, 2012.
18. M. Khan and G. Pandurangan. A fast distributed approximation algorithm for minimum spanning trees. Distributed Computing, 20:391-402, 2008. (Pubitemid 351464295)
19. J. M. Kleinberg. The small-world phenomenon: an algorithm perspective. In STOC, pages 163-170, 2000.
20. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In INFOCOM, 2003.
21. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In SIGCOMM, pages 395-406, 2003.
22. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS, pages 84-95, 2002. (Pubitemid 35039987)
23. R. Morales and I. Gupta. Avmon: Optimal and scalable discovery of consistent availability monitoring overlays for distributed systems. In ICDCS, page 55, 2007.
24. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, New York, NY, USA, 1995.
25. G. Pandurangan and M. Khan. Theory of communication networks. In Algorithms and Theory of Computation Handbook, Second Edition. CRC Press, 2009.
26. D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
27. A. Slivkins. Distance estimation and object location via rings of neighbors. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, PODC '05, pages 41-50, New York, NY, USA, 2005. ACM. (Pubitemid 43218369)
28. A. Slivkins. Towards fast decentralized construction of locality-aware overlay networks. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pages 89-98, New York, NY, USA, 2007. ACM. (Pubitemid 350229305)
29. M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005. (Pubitemid 43078379)
30. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: a lightweight network location service without virtual coordinates. In Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '05, pages 85-96, New York, NY, USA, 2005. ACM. (Pubitemid 46323496)
31. M. Zhong, K. Shen, and J. I. Seiferas. Non-uniform random membership management in peer-to-peer networks. In INFOCOM, pages 1151-1161, 2005. (Pubitemid 41390768)