Name
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 presents 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. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1109/INFCOM.1999.749285 | IEEE INFOCOM '99 - THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: THE FUTURE IS NOW |
Keywords | DocType | ISSN |
web pages,protocols,computer architecture,web server,bandwidth,web servers,search engines,transport protocols,internet,spanning tree algorithm,computer science,latency | Conference | 0743-166X |
Citations | PageRank | References |
104 | 70.71 | 9 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Francis | 1 | 5420 | 738.15 |
| sugih jamin | 2 | 2669 | 493.09 |
| Vern Paxson | 3 | 14031 | 2130.20 |
| Lixia Zhang | 4 | 11729 | 2506.06 |
| Daniel F. Gryniewicz | 5 | 104 | 70.71 |
| Yixin Jin | 6 | 421 | 108.33 |