Making greed work in networks: A game-theoretic analysis of switch service disciplines

Proceedings of the Conference on Communications Architectures, Protocols and Applications, SIGCOMM 1994

Volumn , Issue , 1994, Pages 47-57

  Shenker, Scott ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; GAME THEORY; INTERNET PROTOCOLS;

ADMINISTRATIVE CONTROLS; EXPONENTIAL SERVERS; GAME THEORETIC ANALYSIS; GAME-THEORETIC PERSPECTIVES; OPERATING POINTS; OPTIMAL EFFICIENCY; SELF-OPTIMIZATION; SERVICE DISCIPLINES;

NETWORK ARCHITECTURE;

EID: 3843079945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/190314.190319     Document Type: Conference Paper

References (37)

1. A. Bovopoulos and A. Lazar, "Decentralized Algorithms for Flow Control", Proceedings of the 25th Aller-ton Conference on Communication, Control, and Computing, University of Illinois at Urbana-Champaign, October 1987.
2. E. Coffman Jr. and I. Mitrani, "A Characterization of Waiting Time Performance Realizable by Single Server Queues", Operations Research, Vol. 28, No. 3 part II , May-June 1980.
3. A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm", Internetworking: 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 Environ- ment", Journal of the Franklin Institute, Vol. 329, No. 3, pp. 383-402, March 1992.
5. C. Douligeris and R. Mazumdar, "On Pareto Optimal Flow Control in a Multiclass Environment", Proceedings of the 25th Allerton Conference on Communication, Control, and Computing, University of Illinois at Urbana-Champaign, October 1987.
6. C. Douligeris and R. Mazumdar, "More on Pareto Optimal Flow Control", Proceedings of the 25th Allerton Conference on Communication, Control, and Computing, University of Illinois at Urbana-Champaign, October 1988.
7. D. Ferguson, C. Nikolaou, and Y. Yemini, "An Economy for Flow Control in Computer Networks", 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 SAC, 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. Cour-tois and G. Latouche eds., North Holland, 1988.
11. V. Jacobson, "Congestion Avoidance and Control", ACM Sigcomm Proceedings, pp. 314-329, 1988.
12. J. Jaffe, "Bottleneck Flow Control". IEEE Transactions on Communications, Vol. 29, No. 7, pp. 954-962, July 1981.
13. R. Jain and K. K. Ramakrishnan, "Congestion Avoidance in Computer Networks with a Connectionless Network Layer: Concepts, Goals, and Alternatives", Proceedings of the Computer Networking Symposium, pp. 134-143, 1988.
14. R. Jain, "A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks", Computer Communications Review, Vol. 19, No.5, pp. 56-71, 1989.
15. M. Katevenis, "Fast Switching and Fair Control of Congested Flow in Broadband Networks", IEEE J SAC, 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 dist/qos/mechanism.ps)
17. Y. Korilis and A. Lazar, "Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information", preprint, 1992. (available from ftp.ctr.columbia.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", Proceedings of ITC Workshop (Bangalore, India), 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 University Press, 1985.
20. M. Miller and K. Drexler, "Markets and Computation: Agoric Open Systems", in The Ecology of Computation, B. Huberman editor., North Holland, 1988.
21. H. Moulin, "Joint Ownership of a Convex Technology: Comparison of Three Solutions", Review of Economic Studies, Vol. 57, pp. 439-452, 1990.
22. H. Moulin, "Uniform Externalities: Two Axioms for Uniform Allocation", Journal of 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", Journal of Economic Theory, forthcoming.
25. H. Moulin, "Cost Sharing under Increasing Returns", Games and Economic Behavior, forthcoming.
26. J. Nagle, "On Packet Switches with Infinite Storage", IEEE Transactions on Communications, Vol. 35, pp. 435-438, 1987.
27. K. K. Ramakrishnan and R. Jain, "An Binary Feedback Scheme for Congestion Avoidance in Computer Networks", ACM Transactions on Computer Systems, Vol. 8, pp. 158-181, 1990.
28. J. Regnier, "Priority Assignment in Integrated Services Networks", Report LIDS-TH-1565, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts, December, 1986.
29. R. Rob, "A Condition Guaranteeing the Optimality of Public Choice", Econometrica, Vol. 49, No. 6 , pp. 1605-1613, November 1981.
30. B. Sanders, "An Asynchronous Distributed Flow Control Algorithm for Rate Allocation in Computer Networks", IEEE Transactions on Computers, Vol. 37, No. 7, pp. 779-787, July 1988.
31. B. Sanders, "An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks", IEEE Transactions on Computers, Vol. 37, No. 9, pp. 1067-1072, September 1988.
32. M. Satterthwaite and H. Sonnenschein, "Strategy-Proof Allocation Mechanisms at Differentiable Points", Review of Economic Studies, Vol. 48 , pp. 587-597, 1981.
33. S. Shenker, "A Theoretical Analysis of Feedback Flow Control", Sigcomm '90, 1990.
34. S. Shenker, "Efficient Network Allocations with Selfish Users", Performance '90, 1990.
35. 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)
36. 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)
37. 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 University Press, 1985.