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

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

2009-03-30

arxiv.org/abs/0903.5208v1

Computer Science

Computational Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-425020