Matrix analysis
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
An auction algorithm for the max-flow problem
Journal of Optimization Theory and Applications
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Stochastic Shortest Path Games
SIAM Journal on Control and Optimization
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Journal of the ACM (JACM)
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
TCP-PR: TCP for Persistent Packet Reordering
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Sensor-centric energy-constrained reliable query routing for wireless sensor networks
Journal of Parallel and Distributed Computing
A survey on networking games in telecommunications
Computers and Operations Research
MIRO: multi-path interdomain routing
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Towards the world-wide quantum network
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
On the effectiveness of proactive path-diversity based routing for robustness to path failures
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Interplay between security providers, consumers, and attackers: a weighted congestion game approach
GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
| Hi-index | 0.00 |
We introduce the Game-Theoretic Stochastic Routing (GTSR) framework, a proactive alternative to today's reactive approaches to route repair. GTSR minimizes the impact of link and router failure by (1) computing multiple paths between source and destination and (2) selecting among these paths randomly to forward packets. Besides improving fault-tolerance, the fact that GTSR makes packets take random paths from source to destination also improves security. In particular, it makes connection eavesdropping attacks maximally difficult as the attacker would have to listen on all possible routes. The approaches developed are suitable for network layer routing as well as for application layer overlay routing and multi-path transport protocols such as SCTP.Through simulations, we validate our theoretical results and show how the resulting routing algorithms perform in terms of the security/fault-tolerance/delay/throughput trade-off. We also show that a beneficial side-effect of these algorithms is an increase in throughput, as they make use of multiple paths.