Enhancing security via stochastic routing

Proceedings - International Conference on Computer Communications and Networks, ICCCN

Volumn 2002-January, Issue , 2002, Pages 58-62

  Bohacek, Stephan ^a   Hespanha, João P ^b   Obraczka, Katia ^c   Lee, Junsoo ^d   Lim, Chansook ^d  

^a UNIVERSITY OF DELAWARE   (United States)

^b University of California   (United States)

^c University of California Santa Cruz   (United States)

^d University of Southern California   (United States)

Author keywords

Computer science; Data engineering; Data security; Delay; Game theory; Internet; Redundancy; Routing; Stochastic processes; Throughput

Indexed keywords

COMPUTER GAMES; COMPUTER SCIENCE; ECONOMIC AND SOCIAL EFFECTS; GAME THEORY; INTERNET; RANDOM PROCESSES; REDUNDANCY; SECURITY OF DATA; SECURITY SYSTEMS; THROUGHPUT;

ALTERNATIVE PATH; DATA ENGINEERING; DELAY; ROUTING; ROUTING POLICIES; ROUTING SECURITY; SHORTEST PATH ROUTING; STOCHASTIC METHODS;

STOCHASTIC SYSTEMS;

EID: 84948684681     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2002.1043046     Document Type: Conference Paper

References (19)

1. Y. Zhang, V. Paxson, and S. Shenker, The stationarity of internet path properties: Routing, loss, and throughput, tech. rep., ACIRI, May, 2000
2. C. Hopps, Analysis of an equal-cost multi-path agorithmn, RFC 2992, Nov. 2000
3. C. Villamizar, Ospf optimized multipath (ospf-omp), draft-ietf-ospfomp-03, p. 46, June 1999
4. J. Saltzer, D. Reed, and D. Clark, End-to-end arguments in system design, AMC Trans. on Computer Systems, vol. 2, no. 4, pp. 195-206, 1984
5. A. Emmett, VPNs, America Networks, May, 1998
6. S. Kent, Security architecture for the internet protocol. Request for Comments (RFC) 2401, 1998
7. S. Kent, C. Lynn, J. Mikkelson, and K. Seo, Secure border gateway protocol (s-BGP)-real world performance and deployment issues, in Proceedings of NDSS 2000, 2000
8. P. F. Syverson, M. G. Reed, and D. M. Goldschlag, Onion routing access configurations, in DISCEX 2000: Proceedings of the DARPA Information Survivability Conference and Exposition, vol. I, pp. 34-40, Jan. 2000
9. R. Stone, CenterTrack: An IP overlay network for tracking DoS floods, in 9th USENIX Security Symposium, 2000
10. S. Savage, D. Wetherall, A. Karlin, and T. Anderson, Practical network support for IP traceback, in Proceedings of the 2000 ACM SIGCOMM Conference, (Stockholm, Sweden), pp. 295-306, August, 2000
11. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, Resilient overlay networks, in Proc. 18th ACM SOSP, (Banff, Canada), 2001
12. M. K. Reiter and A. D. Rubin, Crowds: Anonymity forWeb transactions, ACM Trans. on Information and System Security, vol. 1, pp. 66-92, 1998
13. J. P. Hespanha and S. Bohacek, Preliminary results in routing games, in Proc. Of the 2001 American Control Conference, June, 2001
14. S. D. Patek and D. P. Bertsekas, Stochastic shortest path games, SIAM J. Contr. Optimization, vol. 37, pp. 803-824, 1999
15. The VINT Project, a collaboration between UC Berkeley, LBL, USC/ISI and Xerox PARC, The ns manual (formerly ns Notes and Documentation). http://www.isi.edu/nsnam/ns/ns-documentation.html, Oct. 2000
16. K. Sollins, The TFTP protocol. RFC 1350, 1992
17. D. Thaler and C. Hopps, Multipath issues in unicast and multicast nexthop selection, RFC 2991, Nov. 2000
18. A. Goldberg and R. Tarjan, A new approach to the maximum-flowproblem, Journal of the ACM, vol. 35, pp. 921-940, 1988
19. R. Perlman, Network Layer Protocols with Byzantine Robustness. PhDthesis, MIT, 1988