Papillon: Greedy Routing in Rings
We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n / log d) hops.
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n / log d) hops. |
|---|---|
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/11561927_47 |