Distributed algorithms for secure multipath routing in attack-resistant networks

IEEE/ACM Transactions on Networking

Volumn 15, Issue 6, 2007, Pages 1490-1501

  Lee, Patrick P C ^a   Misra, Vishal ^a   Rubenstein, Dan ^a  

^a Department of Earth and Environmental Sciences   (United States)

Author keywords

Attack resistant networks; Maximum flow problems; Multipath channels; Multipath routing; Optimization; Preflow push; Resilience; Routing; Security; Telecommunication security

Indexed keywords

ACCESS CONTROL; MULTIPATH PROPAGATION; NETWORK ARCHITECTURE; OPTIMIZATION; PARALLEL ALGORITHMS; ROUTING PROTOCOLS;

ATTACK-RESISTANT NETWORKS; BOUND-CONTROL ALGORITHM; LEX-CONTROL ALGORITHM;

NETWORK SECURITY;

EID: 37549009866     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.897956     Document Type: Article

References (33)

1. R. K. Ahuja, "Algorithms for the minimax transportation problem," Naval Research Logistics Quarterly, vol. 33, pp. 725-740, 1986.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithm, and Applications. Englewood Cliffs, NJ: Prentice Hall, 1993.
3. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proc. 18th ACM Symp. Operating Systems Principles (SOSP), Oct. 2001, pp. 131-145.
4. R. Banner and A. Orda, "The power of tuning: A novel approach for the efficient design of survivable networks," in Proc. 12th IEEE Int. Conf. Network Protocols (ICNP 2004), Oct. 2004, pp. 2-11.
5. S. Bohacek, J. P. Hespanha, K. Obraczka, J. Lee, and C. Lim, "Enhancing security via stochastic routing," in Proc. 11th Int. Conf. Computer Communications and Networks (ICCCN'02), Oct. 2002, pp. 58-62.
6. J. P. Brumbaugh-Smith and D. R. Shier, "Minimax models for diverse routing," INFORMS J. Comput., vol. 14, no. 1, pp. 81-95, Winter, 2002.
7. T. Bu, S. Norden, and T. Woo, "Trading resiliency for security: Model and algorithms," in Proc. 12th IEEE Int. Conf. Network Protocols (ICNP 2004), Oct. 2004, pp. 218-227.
8. J. Byers, M. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using Tornado codes to speed up downloads," in Proc. IEEE INFOCOM, Mar. 1999, pp. 275-283.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press, 2001.
10. W. Du and A. P. Mathur, "Testing for software vulnerability using environment perturbation," in Proc. Int. Conf. Dependable Systems and Networks (DSN 2000), Jun. 2000, pp. 603-612.
11. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, "A fast parametric maximum flow algorithm and applications," SIAM J. Comput., vol. 18, no. 1, pp. 30-55, Feb. 1989.
12. D. Ganesan, R. Govindan, S. Shenker, and D. Estrin, "Highly-resilient, energy-efficient multipath routing in wireless sensor networks," ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 5, no. 4, pp. 11-25, Oct. 2001.
13. L. Georgiadis, P. Georgatsos, K. Floros, and S. Sartzetakis, "Lexicographically optimal balanced networks," IEEE/ACM Trans. Networking, vol. 10, no. 6, pp. 818-829, Dec. 2002.
14. S. Ghosh, A. Gupta, and S. V. Pemmaraju, "A self-stabilizing algorithm for the maximum flow problem," Distrib. Comput., vol. 10, no. 3, pp. 167-180, 1997.
15. B. Gnedenko and I. A. Ushakov, Probabilistic Reliability Engineering New York: Wiley, 1995.
16. A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum-flow problem," J. Assoc. Comput. Machin. (ACM), vol. 35, no. 4, pp. 921-940, Oct. 1988.
17. C.-C. Han, K. G. Shin, and S. K. Yun, "On load balancing in multicomputer/distributed systems equipped with circuit or cut-through switching capability," IEEE Trans. Comput., vol. 49, no. 9, pp. 947-957, Sep. 2000.
18. J. Hespanha and S. Bohacek, "Preliminary results in routing games," in Proc. 2001 Amer. Control Conf., Jun. 2001, vol. 3, pp. 1904-1909.
19. B. Hong and V. K. Prasanna, "Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput," in Proc. 18th Int. Parallel and Distributed Processing Symp. (IPDPS 2004 Apr. 2004, pp. 52-61.
20. A. Keromytis, V. Misra, and D. Rubenstein, "SOS: An architecture for mitigating DDoS attacks," IEEE J. Sel. Areas Commun., Special Issue on Service Overlay Networks, vol. 22, no. 1, Jan. 2004.
21. M. Kodialam and T. V. Lakshman, "Detecting network intrusions via sampling: A game theoretic approach," in Proc. IEEE INFOCOM, 2003, pp. 1880-1889.
22. P. Lee, V. Misra, and D. Rubenstein, "Distributed algorithms for secure multipath routing," in Proc. IEEE INFOCOM, 2005, pp. 1952-1963.
23. P. Lee, V. Misra, and D. Rubenstein, "Distributed algorithms for secure multipath routing in attack-resistant networks," Dept. Comput. Sci. Columbia Univ., New York, Tech. Rep. CUCS-010-07, Feb. 2007.
24. S. Lee, Y. Yu, S. Nelakuditi, Z.-L. Zhang, and C.-N. Chuah, "Proactive vs reactive approaches to failure resilient routing," in Proc. IEEE INFOCOM, 2004, pp. 176-186.
25. D. Loguinov and H. Radha, "End-to-end Internet video traffic dynamics: Statistical study and analysis," in Proc. IEEE INFOCOM, 2002, pp. 723-732.
26. W. Lou, W. Liu, and Y. Fang, "SPREAD: Enhancing data confidentiality in mobile ad hoc networks," in Proc. IEEE INFOCOM, 2004, pp. 2404-2413.
27. G. Malkin, "RIP Version 2," RFC 2453, Nov. 1998.
28. N. Maxemchuk, "Dispersity routing," in Proc. Int. Communications Conf. (ICC'75), San Francisco, CA, Jun. 1975, pp. 41.10-41.13.
29. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An approach to universal topology generation," in Proc. MASCOTS, 2001, p. 346.
30. J. Moy, "OSPF Version 2," RFC 2328, Apr. 1998.
31. A. Stavrou and A. D. Keromytis, "Countering DoS attacks with stateless multipath overlays," in Proc. ACM Conf. Computer and Communications Security (CCS), Nov. 2005, pp. 249-259.
32. D. Thaler and C. Hopps, "Multipath issues in unicast and multicast next-hop selection," RFC 2991, Nov. 2000.
33. J. Yang and S. Papavassiliou, "Improving network security by multi-path traffic dispersion," in IEEE MILCOM, 2001, pp. 34-38.