Quality of service provision in noncooperative networks with diverse user requirements

Decision Support Systems

Volumn 28, Issue 1, 2000, Pages 101-122

  Park, K ^a   Sitharam, M ^b   Chen, S ^a  

^a Purdue University   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY; PARETO PRINCIPLE; PROGRAM PROCESSORS; REQUIREMENTS ENGINEERING; RESOURCE ALLOCATION; ROUTERS; THEOREM PROVING; USER INTERFACES;

HETEROGENEOUS USER REQUIREMENTS; NONCOOPERATIVE NETWORK GAME; PACKET SCHEDULING; QUALITY OF SERVICE;

PACKET NETWORKS;

EID: 0033889714     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9236(99)00078-0     Document Type: Article

References (49)

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