Kihong Park
- 1.T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, second edition, 1995.Google Scholar
- 2.A. Bovopoulous and A. Lazar. Decentralized algorithms for optimal flow control. In Proc. 25th Allerion Conference on Communication, Control and Computing, 1987.Google Scholar
- 3.A. Campbell, C. Aurrecoechea, and L. Hauw. A review of QoS architectures. To appear in A CM Multimedia Systems Journal, 1996.Google Scholar
- 4.S. Chert and K. Park. An architecture for noncooperative QoS provision in many-switch systems. Technical Report CSD-TR-98-013, Department of Computer Sciences, Purdue University, 1998.Google Scholar
- 5.S. Chen and K. Park. A distributed protocol for multi-class QoS provision in noncooperative manyswitch systems. To appear in Proc. International Conference on Network Protocols, 1998. Google ScholarDigital Library
- 6.Scott Clearwater, editor. Market-Based Control: A Paradigm for Distribuled Resource Allocation, Scott Clearwater. World Scientific, ttong Kong, 1996. Google ScholarDigital Library
- 7.R. Cocchi, S. Shenker, D. Estrin, and L. Zhang. Pricing in computer networks: motivation, formulation, and example. IEEE/A CM Trans. Nelworking, 1(6):614-627, 1993. Google ScholarDigital Library
- 8.R. L. Cruz. A calculus for network delay, part I: network elements in isolation. IEEE Trans. Inform. Theory, 37(1):114-131, 1991.Google ScholarDigital Library
- 9.K.L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE J. Select Areas Commun., 13(6):1048-1056, 1995. Google ScholarDigital Library
- 10.G. de Veciana, G. Kesidis, and J. Walrand. Resource management in wide-area ATM networks using effective bandwidths. IEEE J. Select. Areas Commun., 13(6):1081-1090,1995. Google ScholarDigital Library
- 11.A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Journal of lnternetworking: Res. Exper., 1:3-26, 1990.Google Scholar
- 12.A. Elwalid and D. Mitra. Effective bandwidth of general Markovian traffic sources and admission control in high speed networks. IEEE/A CM Trans. NeiworISng, 1(3), 1993. Google ScholarDigital Library
- 13.A. Elwalid and D. Mitra. Analysis, approxSmations and admission control of a multi-service multiplexing system with priorities. In Proc. IEEE INFO- COM '95, pages 463-472, 1995. Google ScholarDigital Library
- 14.D. Ferguson, C. Nikolaou, :I. Sairamesh, and Y. Yemini. Economic models for allocating resources in computer systems. In Scott Clearwater, editor, Market-Based Conlrol: A Paradigm for Distributed #esoitrce Allocation, Scott Clearwaler. World Scientific, Hong Kong, 1996. Google ScholarDigital Library
- 15.D. Ferguson, C- Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Proc. IEEE 1NFOCOM '89, pages 110-118, 1989-Google ScholarCross Ref
- 16.D. Ferguson, Y. Yemini, and C. Nikolaou. Microeconomic algorithms for load balancing in distributed computer systems. In Proc. 8th international Conference on Distributed Computing Systems, pages 491-499, 1988.Google ScholarCross Ref
- 17.:I. W. Friedman. Game Theory with Applications to Economics. Oxford University Press, 1986.Google Scholar
- 18.L. Georgiadis, R. Gu#rin, V. Peris, and K. Stratajan. Efficient network QoS provisioning based on per node traffic shaping. IEEE/A CM Transactions on Networking, 4(4):482-501, 1996. Google ScholarDigital Library
- 19.A. Heddaya and K. Park. Parallel computing on high-speed wide-area networks: a pricing policy for its communication needs. In Proc. 3rd IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, pages 188-191# 1995.Google ScholarCross Ref
- 20.Man-Tung T. Itsiao and Aurel A. Lazar. Optimal flow control of multi-class queueing networks with decentralized information. In Proc. IEEE INFO- COM '87, pages 652-661, 1987.Google Scholar
- 21.Y. Korilis and A. Lazar. Why is flow control hard: Optimality, fairness, partial and delayed information. In Proc. 2nd ORSA Telecommunications Conference, March 1992.Google Scholar
- 22.Y. Korilis and A. Lazar. On the existence of equilibria in noncooperative optimal flow control. Journal of #he A CM, 42(3):584-613, 1995. Google ScholarDigital Library
- 23.Y. Korilis, A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE J. Select. Areas Commun., 13(7):1241-1251, 1995. Google ScholarDigital Library
- 24.Y. Korilis, A. Lazar, and A. Orda. Achieving network optima using Stackelberg routing strategies. IEEE/A CM Trans. Networking, 5(1):161-173, 1997. Google ScholarDigital Library
- 25.H. T. Kung, T. Blackwell, and A. Chapman. Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation, and statistical multiplexing. In Proc. SIGCOMM '9#, pages 101-114, 1994. Google ScholarDigital Library
- 26.J. Kurose and R. Simha. A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Trans. on Computers, 38(5):705-717, 1989. Google ScholarDigital Library
- 27.Jim Kurose. Open issues and challenges in providing quality of service guarantees in high-speed networks. Computer Communication Review, 23(1):6- 15, 1993. Google ScholarDigital Library
- 28.A. Lazar and G. Pacifici. Control of resources in broadband networks with quality of service guarantees. IEEE Network Magazine, pages 66-73, October 1991.Google ScholarDigital Library
- 29.W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson. On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Transactions on Networking, 2:1-15, 1994. Google ScholarDigital Library
- 30.S. Low and P. Varaiya. A new approach to service provisioning in ATM networks. IEEE/A CM Trans. Networking, 1(5):547-553, 1993. Google ScholarDigital Library
- 31.S. Low and P. Varaiya. An algorithm for optimal service provisioning using resource pricing. In Proc. IEEE INFOCOM '94, pages 368-373, 1994.Google ScholarCross Ref
- 32.John-Francis Mergen. Personal communication.Google Scholar
- 33.R. Nagarajan and J. Kurose. On defining, computing and guaranteeing quality-of-service in highspeed networks. In Proc. IEEE INFOCOM 'go, pages 2016-2025, 1992. Google ScholarDigital Library
- 34.A. Orda, R. Rom, and N. Shimkin. Competitive routing in multiuser communication networks. IEEE/ACM Trans. Networking, 1(5):510- 521, 1993. Google ScholarDigital Library
- 35.A. Parekh and R. Gallager. A generalized processor sharing approach .to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Networking, 1(3):344-357, 1993. Google ScholarDigital Library
- 36.A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Networking, 2(2):137- 150, 1994. Google ScholarDigital Library
- 37.K. Park, G. Kim, and M. Crovella. On the relationship between file sizes, transport protocols, and self-similar network traffic. In Proc. IEEE Inter- #ational Conference on Network Protocols, pages 171-180, October 1996. Google ScholarDigital Library
- 38.K. Park, M. Sitharam, and S- Chen. Quality of service provision in noncooperative network: heterogeneous preferences, multi-dimensional QoS vectors, and burstiness. Technical Report CSD-TR- 97-039A, Department of Computer Sciences, Purdue University, 1998.Google ScholarDigital Library
- 39.Kihong Park. Self-organized multi-class QoS provision for ABR traffic in ATM networks. In Proc. 15th IEEE In#ernational Phoenix Conference on Computers and Communications, pages 446-453, 1996.Google ScholarCross Ref
- 40.V. Paxson and S. Floyd. Wide-area traffic: the failure of Poisson modeling. In Proc. A CM SIGCOMM '94, pages 257-268, 1994. Google ScholarDigital Library
- 41.:I. B. Rosen. Existence and uniqueness of equilibrium points for concave n-person games. Economelrica, 33(3):520-534, 1965.Google ScholarCross Ref
- 42.J. Rosenmfiller. The Theory of Games and Markets. North-Holland, 1981.Google Scholar
- 43.J. Sairamesh, D. Ferguson, and Y. Yemini. An approach to pricing, optimal allocation and quality of service provisioning in high-speed networks. In Proc. IEEE INFOCOM "95, pages 1111-1119, 1995. Google ScholarDigital Library
- 44.Scott Shenker. -Making greed work in networks: a game-theoretic analysis of switch service disciplines. In Proc. A CM SIGCOMM '94, pages 47-57, 1994. Google ScholarDigital Library
- 45.H. R. Varian. Microeconomic Analysis. Norton Press, 1993.Google Scholar
- 46.N. N. Vorob'ev. Game Theory. Springer-Verlag, 1977.Google Scholar
- 47.C. Waldspurger, T. Hogg, B. Huberman, 3. Kephart, and W. Stornetta. Spawn: a distributed computational economy. IEEE Trans. Software Engineering, 18(2):103-117, 1992. Google ScholarDigital Library
- 48.Michael P. Wellman. A market-oriented programming environment and its application to distributed multicommodity flow problems. Journal of Artificial Intelligence Research, 1:1-23, 1993.Google ScholarDigital Library
- 49.Michael P. Wellman. Market-oriented programming: some early lessons. In S. H. Clearwater, editor, Market-based control: a paradigm for distributed resource allocation, chapter 4. World Scientific, 1995. Google ScholarDigital Library
- 50.W. Willinger, M. Taqqu, R. Sherman, and D. Wilson. Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level. In Proc. A CM SIGCOMM '95, pages 100- 113, 1995. Google ScholarDigital Library
- 51.Yechiam Yemini. Selfish optimization in computer networks, in Proc. IEEE Conference on Decision and Control, pages 281-285, 1981.Google ScholarCross Ref
Index Terms
- Quality of service provision in noncooperative networks: heterogenous preferences, multi-dimensional QoS vectors, and burstiness
Comments