Preliminary results in routing games

Proceedings of the American Control Conference

Volumn 3, Issue , 2001, Pages 1904-1909

  Hespanha, J P ^a   Bohacek, S ^a  

^a Univ of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA COMMUNICATION SYSTEMS; DYNAMIC PROGRAMMING; GAME THEORY; PACKET NETWORKS; ROUTERS; TELECOMMUNICATION LINKS;

MAXIMUM FLOW PROBLEM; PACKET INTERCEPTION; ROUTING ALGORITHMS; ROUTING GAMES; ZERO-SUM GAME;

TELECOMMUNICATION CONTROL;

EID: 0034852715     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2001.946017     Document Type: Conference Paper

References (12)

1. Flow control using the theory of zero-sum Markov games
2. Multi-user flow control as a nash game: Performance of various algorithms
3. Capacity allocation under noncooperative routing
4. Resource allocation as an evolving strategy
5. A new approach to preformance-oriented flow control
6. Competitive routing in multi-user communication networks
7. Making greed work in networks: A game-theoretic analysis of switch service disciplines
8. Competitive routing in networks with polynomial costs
9. Equilibrium flows, routing patterns and algorithms for store-and-forward networks
10. Stochastic shortest path games