Abstract
We give a simple poly-time log-space ad hoc routing algorithm in static networks with a logarithmic overhead on the message size. The algorithm provides guaranteed delivery using universal exploration sequences.
| Original language | English (US) |
|---|---|
| Title of host publication | PODC'08 |
| Subtitle of host publication | Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing |
| Number of pages | 1 |
| State | Published - Dec 17 2008 |
| Externally published | Yes |
| Event | 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing - Toronto, ON, Canada Duration: Aug 18 2008 → Aug 21 2008 |
Other
| Other | 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing |
|---|---|
| Country/Territory | Canada |
| City | Toronto, ON |
| Period | 8/18/08 → 8/21/08 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Hardware and Architecture
- Software