# Concurrent Geometric Multicasting

## TL;DR

This paper introduces MCFR, a geometric multicast routing algorithm that guarantees low latency independent of network size and demonstrates superior reliability through simulation.

## Contribution

The paper presents MCFR, the first geometric multicast routing algorithm with size-independent latency and improved reliability over existing methods.

## Key findings

- Latency is independent of network size
- MCFR outperforms existing algorithms in reliability
- Simulation confirms theoretical performance bounds

## 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.