Non-inferior Nash strategies for routing control in parallel-link communication networks

International Journal of Communication Systems

Volumn 18, Issue 4, 2005, Pages 347-361

  Liu, Yong ^a   Simaan, Marwan A ^b  

^a Ohio State University   (United States)

^b University of Pittsburgh   (United States)

Author keywords

Communication networks; Game theory; Nash strategies; Non inferior strategies; Parallel link networks; Routing control

Indexed keywords

DECISION MAKING; GAME THEORY; HIERARCHICAL SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; PACKET SWITCHING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

NASH STRATEGIES; NON-INFERIOR STRATEGIES; PARALLEL LINK NETWORKS; ROUTING CONTROL;

TELECOMMUNICATION NETWORKS;

EID: 18544362646     PISSN: 10745351     EISSN: None     Source Type: Journal    
DOI: 10.1002/dac.708     Document Type: Article

References (14)

1. Altman E, Basar T, Jimenez T, Shimkin N. Competitive routing in networks with polynomial costs. IEEE Transactions on Automatic Control 2002; 47(1):92-96.
2. Altman E, Basar T, Srikant R. Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users. IEEE Transactions on Automatic Control 2002; 47(6):917-930.
3. Sahin I, Simaan MA. Routing and flow control for parallel links communication networks and multiple competing users. Proceedings of the 15th IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications, Barcelona, Spain, 5-8 September 2004.
4. Yamaoka K, Sugawara S, Sakai Y. Connection oriented packet communication control method based on game theory. IEEE International Conference on Communications, Vancouver, Canada, vol. 2, 1999; 1346-1351.
5. Economides AA, Silvester JA, A game theory approach to cooperative and non-cooperative routing problems. IEEE International Telecommunication Symposium, Rio de Janeiro, Brazil, 1990; 597-601.
6. La RJ, Anantharam V. Optimal routing control: Repeated game approach. IEEE Transactions on Automatic Control 2003; 47(3):437-450.
7. Korilis YA, Lazar AA, Orda A. Achieving network optima using Stackelberg routing strategies. IEEE/ACM Transactions on Networking 1997; 5(1):161-173.
8. Basar T, Srikant R. A Stackelberg network fame with a large number of followers. Journal of Optimization Theory and Applications 2002; 115(3):479-490.
9. Boulogne T, Altman E, Kameda H, Pourtallier O. Mixed equilibrium (ME) for multiclass routing games. IEEE Transactions on Automatic Control 2002; 47(6):903-916.
10. Liu Y, Simaan MA. Noninferior Nash strategies for multi-team systems. Journal of Optimization Theory and Applications 2004; 120(1):29-51.
11. Daigle NJ. Queueing Theory for Telecommunications. Addison-Wesley: Reading, MA, 1992.
12. Kim KH, Roush FW. Team Theory. Halsted Press: New York, 1987.
13. Basar T, Olsder GJ. Dynamic Non-cooperative Game Theory. Academic Press: New York, 1995.
14. Dacunha NO, Polak E. Constrained minimization under vector-valued criteria in finite dimensional space. Journal of Mathematical Analysis and Applications 1967; 19:103-124.