Concurrent Geometric Multicasting - Sorbonne Université Access content directly
Reports (Research Report) Year : 2017

Concurrent Geometric Multicasting


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.
Fichier principal
Vignette du fichier
multicasting.pdf (403.9 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01540744 , version 1 (16-06-2017)



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



Gmail Mastodon Facebook X LinkedIn More