Network-aware overlays with network coordinates

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2006, Pages

  Pietzuch, Peter ^a   Ledlie, Jonathan ^a   Mitzenmacher, Michael ^a   Seltzer, Margo ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS; DISTANCE MEASUREMENT;

(P ,P ,T) MEASUREMENTS; AUTOMATIC ADAPTATION; CO-ORDINATE SYSTEMS; DISTRIBUTED COMPUTING SYSTEMS; DISTRIBUTED SYSTEMS; INTERNATIONAL CONFERENCES; LOW OVERHEAD; NETWORK COORDINATES; NETWORK DISTANCE; OVERLAY NETWORKS (ON); ROUTING TABLE (RT);

TELECOMMUNICATION NETWORKS;

EID: 44949092476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCSW.2006.76     Document Type: Conference Paper

References (49)

1. I. Abraham, A. Badola, D. Bickson, D. Malkhi, S. Maloo, and S. Ron. Practical Locality-Awareness for Large Scale Information Sharing. In Proc. of IPTPS'05, Feb. 2005.
2. I. Abraham, D. Dolev, and D. Malkhi. LLS: a Locality Aware Location Service for Mobile Ad Hoc Networks. In Proc. of DIAL-M-POMC'04, Philadelphia, PA, Oct. 2004.
3. I. Abraham and D. Malkhi. Compact Routing on Euclidian Metrics. In Proc. of PODC'04, July 2004.
4. S. Arora. Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. Journal of the ACM, 45(5), Sept. 1998.
5. S. Arora. Approximation Schemes for NP-hard Geometric Optimization Problems: A Survey. Math Prog., Aug. 2003.
6. Azureus BitTorrent Client. http://azureus.sourceforce.net/.
7. Y. Bartal, M. Charikar, and D. Raz. Approximating MinSum k-Clustering in Metric Spaces. In STOC'01, July 2001.
8. M. Costa, M. Castro, A. Rowstron, and P. Key. PIC: Practical Internet Coordinates for Distance Estimation. In Proc. of ICDCS'04, Tokyo, Japan, Mar. 2004.
9. R. Cox, F. Dabek, F. Kaashoek, et al. Practical, Distributed Network Coordinates. In Proc. of HotNets'03, Nov. 2003.
10. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: A Decentralized Network Coordinate System. In Proc. of SIGCOMM'04, Aug. 2004.
11. P. J. Denning. The Locality Principle. Communications of the ACM, 48(7), July 2005.
12. S. Dolev, S. Gilbert, N. A. Lynch, A. A. Shvartsman, and J. Welch. GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks. In Proc. of DISC'05, Sept. 2005.
13. A. Goel, P. Indyk, and K. R. Varadarajan. Reductions among High Dim. Proximity Prob. In SODA'01, Jan. 2001.
14. Y. Hassin and D. Peleg. Sparse Communication Networks and Efficient Routing in the Plane. In Proc. of PODC'00, Portland, Oregon, 2000.
15. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. North-Holland, 1992.
16. P. Indyk. Sublinear Time Algorithms for Metric Space Problems. In Proc. of STOC'99, Atlanta, GA, May 1999.
17. J. M. Keil and C. A. Gutwin. Classes of Graphs Which Approximate the Complete Euclidean Graph. Discrete & Computational Geometry, 7(1), 1992.
18. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proc. of STOC'00, May 2000.
19. J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and Embedding Using Small Sets of Beacons. In Proc. of FOCS'04, Rome, Italy, 2004.
20. F. Korn and S. Muthukrishnan. Influence Sets based on Reverse Nearest Neighbor Queries. In SIGMOD, May 2000.
21. A. Lakhina, K. Papagiannaki, M. Crovella, et al. Structural Analysis of Network Traffic Flows. SIGMETRICS Perform. Eval. Rev., 32(1), June 2004.
22. J. Ledlie, P. Pietzuch, and M. Seltzer. Stable and Accurate Network Coordinates. In Proc. of ICDCS'06, Lisbon, Portugal, July 2006.
23. J. Ledlie and M. Seltzer. Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn. In INFOCOM, Miami, FL, Mar. 2005.
24. S.-J. Lee, P. Sharma, S. Banerjee, S. Basu, and F. Rodrigo. Measuring bandwidth between planetlab nodes. In PAM, Boston, MA, Mar. 2005.
25. E. K. Lua, T. Griffin, M. Pias, H. Zheng, and J. Crowcroft. On the Accuracy of Embeddings for Internet Coordinate Systems. In IMC, Berkeley, CA, Oct. 2005.
26. D. Malkhi. Locality-Aware Network Solutions. Technical Report TR 2004-6, School of CS and Engineering, The Hebrew University, June 2004.
27. P. B. Mirchandani, , and R. L. Francis, editors. Discrete Location Theory. Wiley-Interscience, 1999.
28. T. S. E. Ng and H. Zhang. Predicting Internet Network Distance with Coordinates-Based Approaches. In Proc. of INFOCOM'02, June 2002.
29. D. Oppenheimer, D. A. Patterson, and A. Vahdat. A Case for Informed Service Placement on PlanetLab. Technical Report 04-025, PlanetLab, 2004.
30. M. Pias, J. Crowcroft, S. Wilbur, et al. Lighthouses for Scalable Distributed Location. In Proc. of IPTPS'03, Berkeley, CA, Feb. 2003.
31. P. Pietzuch, J. Ledlie, and M. Seltzer. Supporting Network Coordinates on PlanetLab. In Proc. of WORLDS'05, San Francisco, CA, Dec. 2005.
32. P. Pietzuch, J. Ledlie, J. Shneidman, M. Roussopoulos, M. Welsh, and M. Seltzer. Network-Aware Operator Placement for Stream-Processing Systems. In Proc. of ICDE'06, Atlanta, GA, Apr. 2006.
33. PLC. Planetlab. http://www.planet-lab.org, 2002.
34. S. Ratnasamy, P. Francis, M. Handley, et al. A Scalable Content-Addressable Network. In Proc. of SIGCOMM'01, SanDiega, CA, 2001.
35. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker. GHT: A Geographic Hash Table for Data-Centric Storage. In Proc. of WSNA'02, Sept. 2002.
36. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling Churn in a DHT. In USENIX '04, Boston, MA, June 2004.
37. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. In Proc. of SIGMOD'95, May 1995.
38. A. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. In Proc. of Middleware'01, Nov. 2001.
39. Y. Shavitt and T. Tankel. Big-Bang Simulation for Embedding Network Distances in Euclidean Space. In Proc. of INFOCOM'03, San Francisco, CA, Mar. 2003.
40. D. B. Shmoys, E. Tardos, and K. Aardal. Approx. Algorithms for Facility Location Problems. In Proc. of STOC'97, El Paso, TX, 1997.
41. J. Shneidman, P. Pietzuch, M. Welsh, M. Seltzer, and M. Roussopoulos. A Cost-Space Approach to Distributed Query Optimization in Stream Based Overlays. In Proc. of NetDB'05, Tokyo, Japan, Apr. 2005.
42. A. Slivkins. Distributed Approaches to Triangulation and Embedding. In Proc. of SODA'05, Jan. 2005.
43. I. Stoica, R. Morris, D. Karger, et al. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In Proc. of ACM SIGCOMM'01, San Diego, CA, Aug. 2001.
44. M. Waldvogel and R. Rinaldi. Efficient Topology-Aware Overlay Network. SIGCOMM Rev., 33(1), 2003.
45. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A Lightweight Network Location Service without Virtual Coordinates. In Proc. of SIGCOMM'05, Aug. 2005.
46. Z. Zhang, S.-M. Shi, and J. Zhu. SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT. In Proc. of IPTPS'03, Berkeley, CA, Feb. 2003.
47. B. Y. Zhao, L. Huang, J. Stribling, et al. Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Comm., 22(1), Jan. 2004.
48. B. Y. Zhao, A. Joseph, and J. Kubiatowicz. Locality-Aware Mechanisms for Large-Scale Networks. In Proc. of FuDiCo '02, 2002.
49. H. Zheng, E. K. Lua, M. Pias, and T. G. Griffin. Internet Routing Policies and Round-Trip-Times. In Proc. of PAM'05, Mar. 2005.