On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks

TL;DR

This paper investigates the exact conditions under which greedy routing guarantees packet delivery in large-scale decentralized networks, focusing on the properties of supporting graphs.

Contribution

It identifies the necessary and sufficient conditions for graphs to support guaranteed greedy routing in geographical data networks.

Findings

Characterization of graphs supporting guaranteed greedy routing

Conditions for avoiding local minima in greedy forwarding

Theoretical framework for designing routing-supporting graphs

Abstract

Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. A perfect geometrical routing scheme is expected to deliver each packet to the point in the network that is closest to the packet destination. However greedy routing fails to guarantee such delivery as the greedy forwarding decision sometimes leads the packets to localized minimums. This article investigates the necessary and sufficient properties of the greedy supporting graphs that provide the guaranteed delivery of packets when acting as a routing substrate.