Online pricing for bandwidth provisioning in multi-class networks

Computer Networks

Volumn 44, Issue 6, 2004, Pages 835-853

  Savagaonkar, Uday ^a   Chong, Edwin K P ^b   Givan, Robert L ^a  

^a PURDUE UNIVERSITY   (United States)

^b Department of Mechanical Engineering   (United States)

Author keywords

Infinitesimal perturbation analysis; Markov decision processes; Pricing; Resource allocation; Stochastic optimization

Indexed keywords

COMPUTER NETWORKS; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); DYNAMIC PROGRAMMING; MARKOV PROCESSES; MATHEMATICAL MODELS; RESOURCE ALLOCATION; THEOREM PROVING; VECTORS;

INFINITESIMAL PERTURBATION ANALYSIS; MARKOV DECISION PROCESSES; PRICING; STOCHASTIC OPTIMIZATION;

BANDWIDTH;

EID: 1542505995     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2003.12.011     Document Type: Article

References (26)

1. Gibbens R.J., Kelly F.P. Resource pricing and the evolution of congestion control. Automatica. 35:1999;1969-1985.
2. Marbach P. Pricing priority classes in a differentiated services network. Proceedings of the 37th Annual Allerton Conference on Communication, Control, and Computing. 1999;1075-1084 University of Illinois, Urbana-Champaign.
3. Low S.H., Varaiya P.P. A new approach to service provisioning in ATM networks. IEEE/ACM Transactions on Networking. 1(5):1993;547-553.
4. Yaiche H., Mazumdar R.R., Rosenberg C. A game-theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking. 8(5):2000;667-678.
5. X.-R. Cao, H.-X. Shen, Internet pricing with a game-theoretical approach: Concepts and examples, in: Proceedings of the 39th IEEE Conference on Decision and Control, vol. 3, Sydney, 2000, pp. 2284-2289.
6. P. Thomas, D. Teneketzis, J.K. MacKie-Mason, A market-based approach to optimal resource allocation in integrated-services connection-oriented networks, in: Proceedings of the Fifth INFORMS Telecommunications Conference, Boca Raton, FL, 2000.
7. Scarf H. The Computation of Economic Equilibria. 1973;Yale University Press, New Haven, CT.
8. Paschalidis I.C., Tsitsiklis J.N. Congestion-dependent pricing of network services. IEEE/ACM Transactions on Networking. 8(2):2000;171-184.
9. S.D. Patek, E. Campos-Náñez, Pricing of dialup services: an example of congestion-dependent pricing in the Internet, in: Proceedings of the 39th IEEE Conference on Decision, vol. 3, 2000, pp. 2296-2301.
10. Q. Wang, J.M. Peha, State-dependent pricing and its economic implications, in: Proceedings of the 7th International Conference on Telecommunication Systems Modeling and Analysis, Nashville, TH, 1999, pp. 61-71.
11. Kelly F.P. Charging and rate control for elastic traffic. European Transactions on Telecommunications. 8:1997;33-37.
12. Low S.H., Lapsley D.E. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking. 7(6):1999;861-874.
13. Luce R.D., Raffia H. Games and Decisions. 1957;Wiley, New York.
14. Hernández-Lerma O., Lasserre J.B. Error bounds for rolling-horizon policies in general markov control processes. IEEE Transactions on Automatic Control. 35(10):1990;1118-1124.
15. Chong E.K.P., Ramadge P.J. Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates. Discrete Event Dynamic Systems: Theory and Applications. 1(4):1992;339-372.
16. Chong E.K.P., Ramadge P.J. Optimization of queues using an infinitesimal perturbation analysis-based stochastic algorithm with general update times. SIAM Journal of Control and Optimization. 31(3):1993;698-732.
17. Ho Y.-C., Cao X.-R. Perturbation Analysis of Discrete Event Dynamic Systems. 1991;Kluwer Academic Publishers, Dordrecht.
18. Puterman M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming. 1994;Wiley, New York.
19. Bertsekas D.P., Tsitsiklis J.N. Neuro-dynamic Programming. 1996;Athena Scientific, Belmont, MA.
20. Marbach P., Tsitsiklis J.N. Simulation-based optimization of markov reward processes. IEEE Transactions on Automatic Control. 46(2):2001;191-209.
21. Bertsekas D.P., Castanon D.A. Rollout algorithms for stochastic scheduling problems. Journal of Heuristics. 5:1999;89-108.
22. E.K.P. Chong, R.L. Givan, H.-S. Chang, A framework for simulation-based network control via hindsight optimization, in: Proceedings of the 39th IEEE Conference on Decision and Control 2, 2000, pp. 1433-1438.
23. H.-S. Chang, On-line sampling-based control for network queuing, Ph.D. thesis, Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, July 2001.
24. Bertsekas D.P. Dynamic Programming and Optimal Control, vol. 1 and 2. 1995;Athena Scientific, Belmont, MA.
25. U. Savagaonkar, E.K.P. Chong, R.L. Givan, Sampling techniques for zero-sum, discounted markov games, in: Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, Allerton Park, IL, 2002, pp. 285-294.
26. U. Savagaonkar, Network pricing using sampling techniques for markov games, Ph.D. thesis, Department of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, September 2002.