On the complexity of greedy routing in ring-based peer-to-peer networks (Q5401398): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1281100.1281117 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2098749004 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:44, 20 March 2024
scientific article; zbMATH DE number 6269559
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of greedy routing in ring-based peer-to-peer networks |
scientific article; zbMATH DE number 6269559 |
Statements
On the complexity of greedy routing in ring-based peer-to-peer networks (English)
0 references
13 March 2014
0 references
coupling
0 references
greedy routing
0 references
lower bound
0 references
peer-to-peer
0 references
random graphs
0 references
small-worlds
0 references
