Name
Abstract | ||
|---|---|---|
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimated from their positions. Applications for these schemes include efficient overlay construction, compact routing, anonymous route selection, and efficient byzantine agreement. We present a new latency estimation scheme, Treeple. Our scheme is different from existing ones in several aspects: Treeple is provably secure, rather than being able to resist known attacks; positions in Treeple are not Euclidean coordinates and reflect the underlying network topology; finally, positions in Treeple are accurate, stable, and can be assigned to peers not participating in the system. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1866307.1866389 | ACM Conference on Computer and Communications Security |
Keywords | Field | DocType |
compact routing,anonymous route selection,efficient overlay construction,efficient byzantine agreement,underlying network topology,secure latency estimation,new latency estimation scheme,network latency estimation scheme,provable security,network topology | Computer security,Latency (engineering),Computer science,Computer network,Network topology,Euclidean geometry,Overlay,Latency estimation,Distributed computing | Conference |
Citations | PageRank | References |
2 | 0.40 | 22 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eric Chan-Tin | 1 | 229 | 15.79 |
| Nicholas Hopper | 2 | 1469 | 95.76 |