2 research outputs found
Adaptive Probabilistic Flooding for Multipath Routing
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.Comment: 6 pages, 6 figure