A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A fast parametric maximum flow algorithm and applications
SIAM Journal on Computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
IEEE Transactions on Computers
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
ACM SIGMOBILE Mobile Computing and Communications Review
Introduction to Algorithms
Lexicographically optimal balanced networks
IEEE/ACM Transactions on Networking (TON)
Testing for Software Vulnerability Using Environment Perturbation
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Minimax Models for Diverse Routing
INFORMS Journal on Computing
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
The Power of Tuning: A Novel Approach for the Efficient Design of Survivable Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Trading Resiliency for Security: Model and Algorithms
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Countering DoS attacks with stateless multipath overlays
Proceedings of the 12th ACM conference on Computer and communications security
SOS: an architecture for mitigating DDoS attacks
IEEE Journal on Selected Areas in Communications
A trustworthiness-based QoS routing protocol for wireless ad hoc networks
IEEE Transactions on Wireless Communications
A survey on secure multipath routing protocols in WSNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the resource utilization and traffic distribution of multipath transmission control
Performance Evaluation
Energy Efficiency Routing with Node Compromised Resistance in Wireless Sensor Networks
Mobile Networks and Applications
Hi-index | 0.00 |
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 important properties that include: 1) routing decisions are made locally by network nodes without the centralized information of the entire network topology; 2) routing decisions minimize throughput loss under a single-link attack with respect to different session models; and 3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings.