Shortest-path routing in randomized DHT-based peer-to-peer systems (Q2518512)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5493011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest-path routing in randomized DHT-based peer-to-peer systems |
scientific article; zbMATH DE number 5493011 |
Statements
Shortest-path routing in randomized DHT-based peer-to-peer systems (English)
0 references
16 January 2009
0 references
distributed hash tables
0 references
randomized networks
0 references
shortest-path routing
0 references
0.7458019256591797
0 references
0.7388745546340942
0 references
0.7257558703422546
0 references
