BeRGeR: Byzantine-Robust Geometric Routing
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910371760046080 |
|---|---|
| author | Zaz, Brown Nesterenko, Mikhail Sharma, Gokarna |
| author_facet | Zaz, Brown Nesterenko, Mikhail Sharma, Gokarna |
| contents | We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization. The communication graph is a planar embedding that remains three-connected if all edges intersecting the source-target line segment are removed. We prove the algorithm correct and estimate its message complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12256 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | BeRGeR: Byzantine-Robust Geometric Routing Zaz, Brown Nesterenko, Mikhail Sharma, Gokarna Distributed, Parallel, and Cluster Computing We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization. The communication graph is a planar embedding that remains three-connected if all edges intersecting the source-target line segment are removed. We prove the algorithm correct and estimate its message complexity. |
| title | BeRGeR: Byzantine-Robust Geometric Routing |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2403.12256 |