ClosestNode.com: an open access, scalable, shared geocast service for distributed systems

ClosestNode.com is an accurate, scalable, and backwards-compatible service for mapping clients to a nearby server. It provides a DNS interface by which unmodified clients can look up a service name, and get the IP address of the closest server. A shared system for performing such a mapping amortizes the administration and implementation costs of proximity-based server selection. It is aimed at minimizing the amount of effort required for system developers to make new and existing infrastructure services proximity-aware.

[1]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

[2]  Miguel Castro,et al.  PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[3]  Emin Gün Sirer,et al.  Meridian: a lightweight network location service without virtual coordinates , 2005, SIGCOMM '05.

[4]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[5]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[6]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[7]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Hyuk Lim,et al.  Constructing Internet coordinate system based on delay measurement , 2003, IEEE/ACM Transactions on Networking.

[9]  David Mazières,et al.  Democratizing Content Publication with Coral , 2004, NSDI.

[10]  Mark Crovella,et al.  Virtual landmarks for the internet , 2003, IMC '03.

[11]  Michael J. Freedman,et al.  Locality Prediction for Oblivious Clients , 2005, IPTPS.

[12]  Jon Crowcroft,et al.  Lighthouses for Scalable Distributed Location , 2003, IPTPS.

[13]  Vivek S. Pai,et al.  The effectiveness of request redirection on CDN robustness , 2002, OSDI '02.

[14]  Venugopalan Ramasubramanian,et al.  Optimal Resource Utilization in Content Distribution Networks , 2005 .

[15]  Steven Lerman,et al.  PCoord: network position estimation using peer-to-peer measurements , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..

[16]  Bobby Bhattacharjee,et al.  Scalable peer finding on the Internet , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[17]  Bobby Bhattacharjee,et al.  Finding close friends on the Internet , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[18]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[19]  Hui Zhang,et al.  A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.

[20]  Yuval Shavitt,et al.  Big-Bang simulation for embedding network distances in Euclidean space , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Lawrence K. Saul,et al.  Modeling distances in large-scale networks by matrix factorization , 2004, IMC '04.