Abstract
To improve performance, large-scale Internet systems require clients to access nearby servers. While centralized systems can leverage static topology maps for rough network distances, fully-decentralized systems have turned to active probing and network coordinate algorithms to scalably predict inter-host latencies. Internet applications seeking immediate adoption, however, must inter-operate with unmodified clients running existing protocols such as HTTP and DNS.
This paper explores a variety of active probing algorithms for locality prediction. Upon receiving an external client request, peers within a decentralized system are able to quickly estimate nearby servers, using a minimum of probes from multiple vantages. We find that, while network coordinates may play an important role in scalably choosing effective vantage points, they are not directly useful for predicting a client’s nearest servers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akamai Technologies (2004), http://www.akamai.com/
Costa, M., Castro, M., Rowstron, A., Key, P.: PIC: Practical Internet coordinates for distance estimation. In: Conference on Distributed Systems, Tokyo, Japan (March 2004)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A decentralized network coordinate system. In: ACM SIGCOMM, Portland, OR (August 2004)
Francis, P., Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: IDMaps: A global Internet host distance estimation service. IEEE/ACM Trans. on Networking (October 2001)
Freedman, M.J., Freudenthal, E., Mazières, D.: Democratizing content publication with Coral. In: USENIX/ACM NSDI, San Francisco, CA (March 2004)
Grimm, R., Kravetz, A., Lichtman, G., Michalakis, N., Raza, S., Elliston, A., Miller, J.: OpenEdge: A unified architecture for edge-side content creation, transformation, and caching. Technical report, NYU (February 2005)
Karp, B., Ratnasamy, S., Rhea, S., Shenker, S.: Spurring adoption of DHTs with OpenHash, a public DHT service. In: 3rd Intl. Workshop on Peer-to-Peer Systems, San Diego, CA (February 2004)
Ng, E., Zhang, H.: Predicting Internet network distance with coordinates-based approaches. In: IEEE INFOCOM, New York, NY (June 2002)
Ng, E., Zhang, H.: A network positioning system for the Internet. In: USENIX Conference, Boston, MA (March 2004)
Pias, M., Crowcroft, J., Wilbur, S., Bhatti, S., Harris, T.: Lighthouses for scalable distributed location. In: 2nd Intl. Workshop on Peer-to-Peer Systems (February 2003)
PlanetLab (2004), http://www.planet-lab.org/
Tang, L., Crovella, M.: Virtual landmarks for the Internet. In: Internet Measurement Conference, Miami Beach, FL (October 2003)
Walfish, M., Balakrishnan, H., Shenker, S.: Untangling the Web from DNS. In: USENIX/ACM NSDI, San Francisco, CA (March 2004)
Walfish, M., Stribling, J., Krohn, M., Balakrishnan, H., Morris, R., Shenker, S.: Middleboxes no longer considered harmful. In: USENIX OSDI, San Francisco, CA (December 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shanahan, K.P., Freedman, M.J. (2005). Locality Prediction for Oblivious Clients. In: Castro, M., van Renesse, R. (eds) Peer-to-Peer Systems IV. IPTPS 2005. Lecture Notes in Computer Science, vol 3640. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558989_23
Download citation
DOI: https://doi.org/10.1007/11558989_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29068-1
Online ISBN: 978-3-540-31906-1
eBook Packages: Computer ScienceComputer Science (R0)