Scalable Techniques for Dense Multipath Routing
Multipath routing offers security by dispersing the traffic across multiple paths. When the multiple paths do not have a link or node in common, then no link or node would carry more than half the traffic between a source-destination pair. Our prior work involved establishing independent trees rooted at every destination such that the path from any node to the trees are link- or node-disjoint. However, such an approach would utilize at most N-1 directed edges in each tree. In this project, our goal is to develop scalable techniques for utilizing all possible links in the network to achieve multipath routing. As networks often require resiliency from link and node failures, our objective is to develop scalable multipath routing techniques that will: (a) utilize all possible links in the network; (b) provide guaranteed resiliency to (at least single) link/node failures; (c) decrease the probability of intruders obtaining entire traffic from a source by observing up to K links, and (d) achieve all the above goals with minimum per-packet overhead.Webmaster: Christian Collberg