Skip to Main content Skip to Navigation
Reports

Concurrent Geometric Multicasting

Abstract : We present MCFR, a multicasting concurrent face routing algorithm that uses geometric routing to deliver a message from source to multiple targets. We describe the algorithm's operation, prove it correct, estimate its performance bounds and evaluate its performance using simulation. Our estimate shows that MCFR is the first geometric multicast routing algorithm whose message delivery latency is independent of network size and only proportional to the distance between the source and the targets. Our simulation indicates that MCFR has significantly better reliability than existing algorithms.
Complete list of metadata

https://hal.sorbonne-universite.fr/hal-01540744
Contributor : Sébastien Tixeuil <>
Submitted on : Friday, June 16, 2017 - 2:55:11 PM
Last modification on : Friday, January 8, 2021 - 5:38:04 PM
Long-term archiving on: : Wednesday, December 13, 2017 - 2:58:08 PM

Files

multicasting.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01540744, version 1
  • ARXIV : 1706.05263

Citation

Jordan Adamek, Mikhail Nesterenko, James Scott Robinson, Sébastien Tixeuil. Concurrent Geometric Multicasting. [Research Report] UPMC Sorbonne Universités. 2017. ⟨hal-01540744⟩

Share

Metrics

Record views

731

Files downloads

304