Saddle policies for secure routing in communication networks

Proceedings of the IEEE Conference on Decision and Control

Volumn 2, Issue , 2002, Pages 1416-1421

  Bohacek, Stephan ^a   Hespanha, João P ^b   Obraczka, Katia ^c  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b University of California   (United States)

^c University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; LINEAR PROGRAMMING; PROBABILITY; RANDOM PROCESSES; ROUTERS;

PACKET INTERCEPTION; ROUTING ALGORITHMS; SADDLE POINT SOLUTION; STOCHASTIC ROUTING POLICIES; WIRELESS NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036991261     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. C. Hopps, "Analysis of an equal-cost multi-path algorithm," RFC 2992, Nov. 2000.
2. C. Villamizar, "OSPF optimized multipath (OSPF-OMP)," Internet-Draft (draft-ietf-ospf-omp-03), June 1999.
3. J. P. Hespanha and S. Bohacek, "Preliminary results in routing games," in Proc. of the 2001 Amer. Contr. Conf., June 2001.
4. A. Emmett, "VPNs," America Networks, May 1998.
5. IP Security Working Group, "IPsec," Available at: http://www.ietf.org/html.charters/ipsec-charter.html.
6. S. Bohacek, J. P. Hespanha, and K. Obraczka, "Saddle policies for secure routing in communication networks," tech. rep., University of California, Santa Barbara, Feb. 2002.