Capacity allocation under noncooperative routing

IEEE Transactions on Automatic Control

Volumn 42, Issue 3, 1997, Pages 309-325

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

^a IEEE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c Columbia University ^*  (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Capacity allocation; Nash games; Noncooperative networks; Routing

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; GAME THEORY; NETWORK PROTOCOLS; PERFORMANCE; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

CAPACITY ALLOCATION; NASH GAMES; NONCOOPERATIVE NETWORKS; ROUTING;

FREQUENCY ALLOCATION;

EID: 0031097909     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.557575     Document Type: Article

References (29)

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, "Multi-objective routing in integrated services networks A game theory approach," in Proc. INFOCOM'91, pp. 1220-1225.
8. E. Altman and N. Shimkin, "Worst-case and Nash routing policies in parallel queues with uncertain service allocations," IMA Preprint Series 1120, Institute for Mathematics and Applications, Univ. Minnesota, Minneapolis, 1993.
9. A. Orda, R. Rom, and N. Shimkin, "Competitive routing in multiuser communication networks," IEEE/ACM Trans Networking, vol. 1, pp. 510-521, Oct. 1993.
10. A. A. Lazar, A. Orda, and D. E. Pendarakis, "Virtual path bandwidth allocation in multi-user networks," in Proc. IEEE INFOCOM'95, Boston, MA, pp. 312-320.
11. 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.
12. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1992.
13. P. A. Humblet and S. R. Soloway, "Algorithms for data communication networks - Part 1," Codex Corp., Tech. Rep., 1986.
14. P. A. Humblet, S. R. Soloway, and B. Steinka, "Algorithms for data communication networks - Part 2," Codex Corp., Tech. Rep., 1986.
15. A. Kershenbaum, Telecommunications Network Design Algorithms New York: McGraw-Hill, 1993.
16. Information Sciences Institute, "Internet Protocol," Univ. Southern California, Marina del Rey, CA, Tech. Rep. RFC 791, Sept. 1981.
17. S. Deering and R. Hinden, "Internet protocol version 6 specification," Internet Draft, IETF, Mar. 1995.
18. J. J. Garrahan, P. A. Russo, K. Kitami, and R. Kung, "Intelligent network overview, " IEEE Commun. Mag., vol. 31, pp. 30-36, Mar. 1993.
19. 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.
20. M. Gerla and L. Kleinrock, "On the topological design of computer communication networks," IEEE Trans. Commun., vol. COM-25, no. 1, pp. 48-60, 1977.
21. W. I. Zangwill and C. B. Garcia, Pathways to Solutions, Fixed Points and Equilibria. Englewood Cliffs, NJ: Prentice-Hall, 1981.
22. J. E. Cohen and F. P. Kelly, "A paradox of congestion in a queuing network," J. Appl. Probability, vol. 27, pp. 730-734, 1990.
23. Y. A. Korilis, A. A. Lazar, and A. Orda, "Achieving network optima using Stackelberg routing strategies," in IEEE/ACM Trans. Networking, Feb. 1997. Available at URL http://www.ctr.columbia.edu/∼john/stackel.html.
24. J. K. MacKie-Mason and H. R. Varian, "Pricing cognestible network resources, " IEEE J. Select. Areas Commun., vol. 13, pp. 1141-1149, Sept. 1995.
25. M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Reading, MA: Addison-Wesley, 1987.
26. A. Ben-Israel, A. Ben-Tal, and S. Zlobec, Optimality in Nonlinear Programming: A Feasible Directions Approach. New York: Wiley, 1981.
27. W. Nicholson, Intermediate Microeconomics and its Applications, 6th ed. New York: Dryden, 1994.
28. Y. A. Korilis, A. A. Lazar, and A. Orda, "Capacity allocation under noncooperative routing," Center Telecommun. Res., Columbia Univ., New York, NY, Tech. Rep. 372-94-19, 1994. Available at URL http://www.ctr.columbia.edu/∼john/capacity.html.
29. H. L. Royden, Real Analysis, 3rd ed. New York: Macmillan, 1988.