Routing into two parallel links: Game-theoretic distributed algorithms

Journal of Parallel and Distributed Computing

Volumn 61, Issue 9, 2001, Pages 1367-1381

  Altman, Eitan ^a   Başar, Tamer ^b   Jiménez, Tania ^a,c   Shimkin, Nahum ^d  

^a INRIA   (France)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c UNIVERSIDAD DE LOS ANDES   (Venezuela)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Greedy algorithms; Noncooperative equilibria; Nonzero sum games; Routing

Indexed keywords

EID: 0035180277     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2001.1754     Document Type: Article

References (21)

1. Multi-user rate-based flow control
2. Asynchronous iterative algorithms for optimal load balancing
3. Decentralized algorithms for flow control in networks
4. On some traffic equilibrium theory paradoxes
5. A game-theoretic approach to flow control in an integrated environment
6. Multi-objective routing in integrated services networks: A game theory approach
7. On the relationship between Nash-Cournot and Wardrop equilibria
8. Optimal decentralized flow control of Markovian queueing networks with multiple controllers
9. A case where a paradox like Braess's occurs in the Nash equilibrium but does not occur in the Wardrop equilibrium - A situation of load balancing in distributed computer systems
10. Anomalous relations among various performance objectives in distributed computer systems
11. Architecting noncooperative networks
12. Optimal routing control: Game theoretic approach
13. Fairness in network optimal flow control: Optimality of product forms
14. Competitive routing in multiuser communication networks
15. Making greed work in networks: A game-theoretic analysis of switch service disciplines
16. Some theoretical aspects of road traffic research
17. Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment