A Distributed Routing Algorithm for Internet-wide Geocast

TL;DR

This paper introduces two distributed geographic routing algorithms for geocast delivery, achieving near-shortest path performance using only local data, with potential applications in efficient internet-wide data dissemination.

Contribution

It presents a novel purely distance vector-based algorithm and an enhanced path-based algorithm for geocast routing, both operating without central knowledge.

Findings

Distance vector algorithm approaches shortest path performance with few routers in destination.

Path-based algorithm nearly matches shortest path tree in most geocast scenarios.

Both algorithms demonstrate efficient, distributed geocast routing capabilities.

Abstract

Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based on path data. In our evaluation, we show that our purely distance vector based algorithm can come close to shortest path tree performance when a small number of routers are present in the destination area. We also show that our path based algorithm can come close to the performance of a shortest path tree in almost all geocast situations.