Multi-path overlay routing to improve latency while tolerating intrusions
Andrew J. Newell, Endadul Hoque, Cristina Nita-Rotaru · Annual Information Security Symposium · 2012
Many online services require better latency guarantees than offered by the general internet infrastucture, and previous work has shown this is achievable with overlay networks. We consider mission-critical network services which need to maintain these latency guarantees despite outages or intrusions of overlay nodes. Our approach is to route data along multiple node-disjoint paths to ensure data delivery along at least one path. We consider a new routing problem which optimizes the worst path out of a set of chosen paths which are node-disjoint. We formulate a Mixed Integer Program to solve this optimization problem, and we experiment on a real-world dataset to test the feasibility of our solution.