An Architecture for a Global Internet Host Distance Estimation Service (1999)
Cached
Download Links
- [www.cs.cornell.edu]
- [idmaps.eecs.umich.edu]
- [www-2.cs.cmu.edu]
- [cs.ucsb.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In: Proceedings of IEEE INFOCOM |
| Citations: | 112 - 2 self |
BibTeX
@INPROCEEDINGS{Francis99anarchitecture,
author = {Paul Francis and Sugih Jamin and Vern Paxson and Lixia Zhang and Daniel F. Gryniewicz and Yixin Jin},
title = {An Architecture for a Global Internet Host Distance Estimation Service},
booktitle = {In: Proceedings of IEEE INFOCOM},
year = {1999}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between Internet hosts. For example, to select the nearest of multiple equal-content web servers. This paper explores technical issues related to the creation of a public infrastructure service to provide such information. In so doing, we suggests an architecture, called IDMaps, whereby Internet distance information is distributed over the Internet, using IP multicast groups, in the form of a virtual distance map. Systems listening to the groups can estimate the distance between any pair of IP addresses by running a spanning tree algorithm over the received distance map. We also present the results of experiments that give preliminary evidence supporting the architecture. This work thus lays the initial foundation for future work in this new area.
