Adaptive Probabilistic Flooding for Multipath Routing

Details Adaptive Probabilistic Flooding for Multipath Routing Adaptive Probabilistic Flooding for Multipath Routing

2011-04-29

arxiv.org/abs/1104.5636v1

Computer Science

Networking and Internet Architecture

6 pages, 6 figures

Scientific paper

In this work, we develop a distributed source routing algorithm for topology discovery suitable for ISP transport networks, that is however inspired by opportunistic algorithms used in ad hoc wireless networks. We propose a plug-and-play control plane, able to find multiple paths toward the same destination, and introduce a novel algorithm, called adaptive probabilistic flooding, to achieve this goal. By keeping a small amount of state in routers taking part in the discovery process, our technique significantly limits the amount of control messages exchanged with flooding -- and, at the same time, it only minimally affects the quality of the discovered multiple path with respect to the optimal solution. Simple analytical bounds, confirmed by results gathered with extensive simulation on four realistic topologies, show our approach to be of high practical interest.

Affiliated with

Also associated with

No associations

Rating

Adaptive Probabilistic Flooding for Multipath Routing 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 Adaptive Probabilistic Flooding for Multipath Routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Probabilistic Flooding for Multipath Routing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-17898