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.
Liste complète des métadonnées

http://hal.upmc.fr/hal-01540744
Contributeur : Sébastien Tixeuil <>
Soumis le : vendredi 16 juin 2017 - 14:55:11
Dernière modification le : dimanche 18 juin 2017 - 01:09:16

Fichiers

multicasting.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

131

Téléchargements du document

27