Distributed algorithms for secure multipath routing

— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several crucial properties that differentiate itself from previous approaches. They include (1) distributed routing decisions: routing decisions are made without the centralized information of the entire network topology, (2) bandwidth-constraint adaptation: the worst-case link attack is mitigated for any feasible session throughput subject to the linkbandwidth constraints, and (3) lexicographic protection: severe link attacks are suppressed based on lexicographic optimization. We devise two algorithms for the solution, termed the BoundControl algorithm and the Lex-Control algorithm, and prove their convergence to the respective optimal solutions. Experiments show that the Bound-Control algorithm is more effective...

• Type: Conference
• Year: 2005
• Where: INFOCOM
• Authors: Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
• Keywords: Communications, Distributed Secure Multipath, INFOCOM 2005, Lex-Control Algorithm, Secure Multipath Solution