Achieving network optima using Stackelberg routing strategies

IEEE/ACM Transactions on Networking

Volumn 5, Issue 1, 1997, Pages 161-173

  Korilis, Yannis A ^a,b   Lazar, Aurel A ^a,c   Orda, Ariel ^a,d  

^a IEEE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Department of Biomedical Engineering   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Nash equilibria; Network management; Networking games; Routing

Indexed keywords

CIRCUIT THEORY; CONGESTION CONTROL (COMMUNICATION); DECISION THEORY; NETWORK PROTOCOLS; OPTIMIZATION;

NASH EQUILIBRIA; STACKELBERG ROUTING STRATEGIES;

COMPUTER NETWORKS;

EID: 0031078380     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.554730     Document Type: Article

References (25)

1. R. B. Myerson, Game Theory: Analysis of Conflict. Cambridge, MA: Harvard Univ. Press, 1991.
2. D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA: MIT Press, 1992.
3. M.-T. T. Hsiao and A. A. Lazar, "Optimal decentralized flow control of markovian queueing networks with multiple controllers," Performance Evaluation, vol. 13, no. 3, pp. 181-204, 1991.
4. Z. Zhang and C. Douligeris, "Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment," IEEE Trans. Commun., vol. 40, pp. 1277-1281, Aug. 1992.
5. E. Altman, "Flow control using the theory of zero-sum Markov games," IEEE Trans. Automat. Contr., vol. 39, pp. 814-818, Apr. 1994.
6. Y. A. Korilis and A. A. Lazar, "On the existence of equilibria in noncooperative optimal flow control," J. ACM, vol. 42, pp. 584-613, May 1995.
7. A. A. Economides and J. A. Silvester, "Multiobjective routing in integrated services networks: A game theory approach," in Proc. INFOCOM'91, 1991, pp. 1220-1225.
8. A. Orda, R. Rom, and N. Shimkin, "Competitive routing in multiuser communication networks," IEEE/ACM Trans. Networking, vol. 1, pp. 510-521, Oct. 1993.
9. A. A. Lazar, A. Orda, and D. E. Pendarakis, "Virtual path bandwidth allocation in multiuser networks," in Proc. IEEE INFOCOM'95, Boston, MA, Apr. 1995, pp. 312-320.
10. P. Dubey, "Inefficiency of Nash equilibria," Math. Oper. Res., vol. 11, pp. 1-8, Feb. 1986.
11. R. Cocchi, S. Shenker, D. Estrin, and L. Zhang, "Pricing in computer networks: Motivation, formulation and example," IEEE/ACM Trans. Networking, vol. 1, pp. 614-627, Dec. 1993.
12. J. K. MacKie-Mason and H. R. Varian, "Pricing cognestible network resources," IEEE J. Select. Areas Commun., vol. 13, pp. 1141-1149, Sept. 1995.
13. S. J. Shenker, "Making greed work in networks: A game-theoretic analysis of switch service disciplines," IEEE/ACM Trans. Networking, vol. 3, pp. 819-831, Dec. 1995.
14. Y. A. Korilis, A. A. Lazar, and A. Orda, "Capacity allocation under noncooperative routing," IEEE Trans. Automat. Contr., to appear.
15. Information Sciences Institute, "Internet protocol," Univ. Southern California, Marina del Rey, CA, Tech. Rep. RFC 791, Sept. 1981.
16. S. Deering and R. Hinden, "Internet protocol version 6 specification," Internet Draft, IETF, Mar. 1995.
17. J. J. Garrahan, P. A. Russo, K. Kitami, and R. Kung, "Intelligent network overview," IEEE Commun. Mag., vol. 31, pp. 30-36, Mar. 1993.
18. P. A. Russo, K. Bechard, E. Brooks, R. L. Corn, R. Gove, W. L. Honig, and J. Young, "IN rollout in the United States," IEEE Commun. Mag., vol. 31, pp. 56-63, Mar. 1993.
19. C. Douligeris and R. Mazumdar, "Multilevel flow control of queues," in Proc. Johns Hopkins Conference on Information Sciences, Baltimore, MD, Mar. 1989.
20. A. A. Economides and J. A. Silvester, "Priority load sharing: An approach using Stackelberg games," in Proc. 28th Annu. Allerton Conf. Commun., Control, Computing, 1990.
21. M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Reading, MA: Addison-Wesley, 1987.
22. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992.
23. D. G. Luenberger, Linear and Nonlinear Programming. Reading, MA: Addison Wesley, 1984.
24. S. Shenker, "Service models and pricing policies for an integrated services internet," in Public Access to the Internet, B. Kahin and J. Keller, Eds. Cambridge, MA: MIT Press, 1993, pp. 315-337.
25. Y. A. Korilis, A. A. Lazar, and A. Orda, "Achieving network optima using Stackelberg routing strategies," Center for Telecommunications Research, Columbia University, NY, CTR Tech. Rep. 384-94-31, 1994.