PIC: Practical internet coordinates for distance estimation

Proceedings - International Conference on Distributed Computing Systems

Volumn 24, Issue , 2004, Pages 178-187

  Costa, Manuel ^a   Castro, Miguel ^a   Rowstron, Antony ^a   Key, Peter ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DISTANCE MEASUREMENT; ERROR ANALYSIS; INFORMATION ANALYSIS; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION NETWORKS;

DISTANCE ESTIMATION; EUCLIDEAN SPACES; NETWORK HOPS; PRACTICAL INTERNET COORDINATES (PIC);

INTERNET;

EID: 2442538245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdcs.2004.1281582     Document Type: Conference Paper

References (30)

1. M. Castro, M. Costa, and A. Rowstron. Performance and dependability of structured peer-to-peer overlays. Technical Report MSR-TR-2003-94, Microsoft Research, Dec. 2003.
2. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Technical Report MSR-TR-2002-82, Microsoft Research, May 2002.
3. M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Proximity neighbor selection in tree-based structurd peer-to-peer overlays. Technical Report MSR-TR-2003-52, Microsoft Research, June 2003.
4. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream: High-bandwidth multicast in a cooperative environment. In SOSP'03, Oct. 2003.
5. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communication (JSAC), 20(8), October 2002.
6. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. Scalable application-level anycast for highly dynamic groups. In NCC'2003, 2003.
7. M. Castro, M. Jones, A.-M. Kermarrec, A. Rowstron, M. Theimer, H. Wang, and A. Wolman. An evaluation of scalable application-level multicast built using peer-to-peer overlay networks. In Proc. 22nt IEEE INFOCOM, Mar. 2003.
8. R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris. Practical, distributed network coordinates. In HotNets-II, Nov. 2003.
9. P. Francis, S. Jamin, V. Paxson, L. Zhang, D. Gryniewicz, and Y. Jin. An architecture for a global internet host distance estimation service. In IEEE Infocom99, March 1999.
10. R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In Proc. 19th IEEE INFOCOM, pages 1371-1380, Tel Aviv, Israel, March 2000. IEEE.
11. K. P. Gummadi, R. Gummadi, S. D. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of dht routing geometry on resilience and proximity. In ACM SIGCOMM 2003, 2003.
12. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distribted data location in a dynamic network. In SPAA'02, Aug. 2002. Winnipeg, Manitoba, Canada.
13. S. Hotz. Routing information organization to support scalable interdomain routing with heterogeneous path requirements, 1996.
14. Y. hua Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In Proc. of ACM Sigmetrics, pages 1-12, Santa Clara, CA, June 2000.
15. D. R. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In ACM Symposium on Theory of Computing (STOC '02), May 2002.
16. J. A. Neider and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-313, 1965.
17. T. S. E. Ng and H. Zhang. Predicting internet network distance with coordinates-based approaches. In IEEE Infocom02, June 2002.
18. V. N. Padmanabhan and L. Subramanian. An investigation of geographic mapping techniques for internet hosts. In ACM SIGCOMM 2001, August 2001.
19. M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for scalable distributed location. In IPTPS'03, Feburary 2003.
20. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. 9th ACM Symp. on Parallel Algorithms and Architectures, pages 311-320, June 1997. Newport, Rhode Island, USA.
21. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proc. of ACM SIGCOMM, Aug. 2001.
22. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Infocom, 2002.
23. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. 21st IEEE INFOCOM, New York, NY, June 2002.
24. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. IFIP/ACM Middleware 2001, Heidelberg, Germany, Nov. 2001.
25. S. Saroiu, K. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In MMCN, Jan. 2002.
26. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM '01 Conference, San Diego, California, August 2001.
27. H. Tangmunarunkit, R. Govindan, D. Estrin, and S. Shenker. The impact of routing policy on internet paths. In Proc. 20th IEEE INFOCOM, Alaska, USA, Apr. 2001.
28. M. Waldvogel and R. Rinaldi. Efficient topology-aware overlay network. In HotNets, 2002.
29. E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In INFOCOM96, 1996.
30. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.