Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines

IEEE/ACM Transactions on Networking

Volumn 3, Issue 6, 1995, Pages 819-831

  Shenker, Scott J ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; MATHEMATICAL MODELS; PACKET NETWORKS; PACKET SWITCHING;

SWITCH SERVICE DISCIPLINES;

CONGESTION CONTROL (COMMUNICATION);

EID: 0029533860     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/90.477727     Document Type: Article

References (36)

1. A. Bovopoulos and A. Lazar, “Decentralized algorithms for flow control,” in Proc. 25th Allerton Conf. Commun., Control, and Computing, 1987.
2. E. Coffman Jr. and I. Mitrani, “A characterization of waiting time performance realizable by single server queues,” Operations Res., part II, vol. 28, no. 3, May-June 1980.
3. A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” lnternetworking: Research and Experience, vol. 1, pp. 3-26, 1990.
4. C. Douligeris and R. Mazumdar, “A game theoretic approach to flow control in an integrated environment,” J. Franklin Inst., vol. 329, no. 3, pp. 383-402, Mar. 1992.
5. C. Douligeris and R. Mazumdar, “On pareto optimal flow control in a multiclass environment,” in Proc. 25th Allerton Conf. Commun., Control, and Computing, 1987.
6. C. Douligeris and R. Mazumdar, “More on pareto optimal flow control,” in Proc. 25th Allerton Conf. Commun., Control, and Computing, 1988.
7. D. Ferguson, C. Nikolaou, and Y. Yemini, “An economy for flow control in computer networks,” presented at IEEE INFOCOM, 1989.
8. E. Friedman and S. Shenker, “Learning by distributed automata,” preprint, 1993 (available from parcftp.parc.xerox.com as pub/net-research/learning. ps).
9. E. Hahne, “Round-robin scheduling for max-min fairness in data networks,” IEEE J. Select. Areas Commun., vol. 9, pp. 1024-1039, 1991.
10. M. T. Hsiao and A. Lazar, “A game theoretic approach to decentralized flow control of markovian queueing networks,” in Performance ’87, P.J. Courtois andG. Latouche, Eds. Amsterdam: North-Holland, 1988.
11. V. Jacobson, “Congestion avoidance and control,” in ACM Sigcomm Proc., pp. 314-329, 1988.
12. J. Jaffe, “Bottleneck flow control,” IEEE Trans. Commun., vol. 29, no. 7, pp. 954-962, July 1981.
13. R. Jain and K. K. Ramakrishrian, “Congestion avoidance in computer networks with a connectionless network layer: concepts, goals, and alternatives,” in Proc. Comp. Networking Symp., pp. 134-143, 1988.
14. R. Jain, “A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks,” Comp. Commun. Rev., vol. 19, no. 5, pp. 56-71, 1989.
15. M. Katevenis, “Fast switching and fair control of congested flow in broadband networks,” IEEE J. Select. Areas Commun., vol. 5, pp. 1315-1326, 1987.
16. S. Keshav, “A mechanism for congestion control in computer networks,” preprint, 1989 (available from research.att.com as di s t /qos /mechani sm. ps).
17. Y. Korilis and A. Lazar, “Why is flow control hard: optimality, fairness, partial and delayed information,” preprint, 1992 (available from ftp.ctr.colunibia.edu as CTR-Research/ comet/public/papers/92/KOR92. ps. z).
18. Y. Korilis and A. Lazar, “On the existence of equilibria in noncooperative optimal flow control,” in Proc. ITC Workshop, pp. 243-251, 1993 (also available from ftp.ctr.columbia.edu as CTR-Research/comet/public/papers/93/KOR93.ps.gz).
19. E. Maskin, “The theory of implementation in nash equilibrium,” in Social Goals and Organization: Essays in Memory of Elisha Pazner, Hurwicz, Schmeidler, and Sonnenschein, Eds. Cambridge, UK: Cambridge University Press, 1985.
20. M. Miller and K. Drexler, “Markets and computation: agoric open systems,” in The Ecology of Computation, B. Huberman, Ed. Amsterdam: North-Holland, 1988.
21. H. Moulin, “Joint ownership of a convex technology: comparison of three solutions,” Rev. Economic Studies, vol. 57, pp. 439-452, 1990.
22. H. Moulin, “Uniform externalities: two axioms for uniform allocation,” J. Public Economics, vol. 43, pp. 305-326, 1990.
23. H. Moulin and S. Shenker, “Serial cost sharing,” Econometrica, vol. 60, pp. 1009-1037.
24. H. Moulin and S. Shenker, “Average cost pricing versus serial cost sharing: an axiomatic comparison,” J. Economic Theory, vol. 64, no. 1, pp. 178-201, 1994.
25. H. Moulin, “Cost sharing under increasing returns,” Games and Economic Behavior, forthcoming.
26. J. Nagle, “On packet switches with infinite storage,” IEEE Trans. Commun., vol. 35, pp. 435-438, 1987.
27. K. K. Ramakrishnan and R. Jain, “A binary feedback scheme for congestion avoidance in computer networks,” ACM Trans. Comp. Syst., vol. 8, pp. 158-181, 1990.
28. J. Regnier, “Priority assignment in integrated services networks,” Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA, Report LIDS-TH-1565, Dec., 1986, Econometrica, vol. 49, no. 6.
29. B. Sanders, “An asynchronous distributed flow control algorithm for rate allocation in computer networks,” IEEE Trans. Comp., vol. 37, no. 7, pp. 779-787, July 1988.
30. B. Sanders, “An incentive compatible flow control algorithm for rate allocation in computer networks,” IEEE Trans. Comp., vol. 37, no. 9, pp. 1067-1072, Sept. 1988.
31. M. Satterthwaite and H. Sonnenschein, “Strategy-proof allocation mechanisms at differentiable points,” Rev. Economic Studies, vol. 48, pp. 587-597, 1981.
32. S. Shenker, “A theoretical analysis of feedback flow control,” in Proc. SIGCOMM, 1990.
33. S. Shenker, “Efficient network allocations with selfish users,” in Proc. Performance, 1990.
34. S. Shenker, “On the strategy-proof and smooth allocation of private goods in a production economy,” preprint, 1993 (available from parcftp.parc.xerox.com as pub/net-research/ otss.ps).
35. S. Shenker, “Some technical results on continuity, strategy-proofness, and related strategic concepts,” preprint, 1993. (available from parcftp.parc.xerox.com as pub/net-research/str.ps).
36. W. Thomson and H. Varian, “Theories of justice based on symmetry,” in Social Goals and Organization: Essays in Memory of Elisha Pazner, Hurwicz, Schmeidler, and Sonnenschein, Eds. Cambridge, UK: Cambridge University Press, 1985.