Name
Abstract | ||
|---|---|---|
This paper introduces PIC, a practical coordinate-based mechanism to estimate Internet network distance (i.e., round-trip delay or network hops). Network distance estimation is important in many applications, for example, network-aware overlay construction and server selection. There are several proposals for distance estimation in the Internet but they all suffer from problems that limit their benefit. Most rely on a small set of infrastructure nodes that are a single point of failure and limit scalability. Others use sets of peers to compute coordinates but these coordinates can be arbitrarily wrong if one of these peers is malicious. While it may be reasonable to secure a small set of infrastructure nodes, it is unreasonable to secure all peers. PIC addresses these problems: it does not rely on infrastructure nodes and it can compute accurate coordinates even when some peers are malicious. We present PIC's design, experimental evaluation, and an application to network-aware overlay construction and maintenance. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ICDCS.2004.1281582 | ICDCS |
Keywords | Field | DocType |
practical coordinate-based mechanism,network distance estimation,distance estimation,experimental evaluation,infrastructure node,small set,overlay construction,practical internet coordinates,network-aware overlay construction,limit scalability,internet network distance,web server,scalability,internet,economic indicators | Single point of failure,Computer science,Computer network,Peer to peer computing,Overlay,Small set,Internet network,The Internet,Distributed computing,Scalability,Web server | Conference |
ISSN | ISBN | Citations |
1063-6927 | 0-7695-2086-3 | 184 |
PageRank | References | Authors |
10.02 | 22 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Costa | 1 | 1589 | 88.62 |
| Miguel Castro | 2 | 184 | 10.02 |
| Antony Rowstron | 3 | 6605 | 542.43 |
| Peter Key | 4 | 1108 | 84.97 |