References
- J. K. MacKie Mason and H. R. Varian, Pricing the Internet, in Public Access to the Internet, NJ: Prentice-Hall, 1994
- F. P. Kelly, 'Charging and rate control for elastic traffic,' Eur. Trans. Telecommun., vol. 8, pp. 33-37, 1997 https://doi.org/10.1002/ett.4460080106
- F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, 'Rate control for communication networks: Shadow prices, proportional fairness and stability,' Oper. Res. Soc., vol. 49, pp. 237-252,1998
- R. J. Gibbens and F. P. Kelly, 'Resource pricing and the evolution of congestion control,' Automatica, vol. 35, no. 12, pp. 1969-1985, 1999 https://doi.org/10.1016/S0005-1098(99)00135-1
- S. Kunniyur and R. Srikant, 'End-to-end congestion control: Utility functions, random losses, and ECN marks,' in Proc. INFOCOM 2000, 2000, pp. 1323-1332
- R. J. La and V. Anantharam, 'Utility-based rate control in the internet for elastic traffic,' IEEE/ACM Trans. Networking, vol. 10, pp. 272-286, Apr. 2002 https://doi.org/10.1109/90.993307
- S. H. Low, 'Equilibrium bandwidth and buffer allocations for elastic traffics,' IEEE/ACM Trans. Networking, vol. 8, pp. 373-383, June 2000 https://doi.org/10.1109/90.851983
- I. Ch. Paschalidis and J. N. Tsitsiklis, 'Congestion dependent pricing of network services,' IEEE/ACM Trans. Networking, vol. 8, pp. 171-184, Apr. 2000. https://doi.org/10.1109/90.842140
- I. Ch. Paschalidis and Yong Liu, 'Pricing in multiservice loss networks: Static pricing, asymptotic optimality, and demand substitution effects,' IEEE/ACM Trans. Networking, vol. 10, pp. 425-438, June 2002 https://doi.org/10.1109/TNET.2002.1012372
- F. P. Kelly, Notes on Effective Bandwidths, in Stochastic Networks: Theory and Applications, Oxford Univ. Press
- I. Ch. Paschalidis, 'Class-specific quality of service guarantees in multimedia communication networks,' Auiomatica, vol. 35, no. 12, pp. 1951-1968, 1999.
- F. P. Kelly, 'On tariffs, policing, and admission control for multiservice networks,' Oper. Res. Lett., vol. 15, pp. 1-9, 1994 https://doi.org/10.1016/0167-6377(94)90008-6
- C. Courcoubetis, F. P. Kelly, and R. Weber, 'Measurement based usage charges in communications networks,' Oper. Res., vol. 48, no. 4, pp. 535-548,2000. https://doi.org/10.1287/opre.48.4.535.12424
- A. Orda, R. Rom, and N. Shimkin, 'Competitive routing in multiuser communication networks,' IEEE/ACM Trans. Networking, vol, 1, no. 5, pp. 510-521, Oct. 1993 https://doi.org/10.1109/90.251910
- Y. Korilis, A. Lazar, and A. Orda, 'Architecting noncooperative networks,' IEEE J. Select. Areas Commun., vol. 13, pp. 1241-251, 1995 https://doi.org/10.1109/49.414643
- Y. A. Korilis, A. A. Lazar, and A. Orda, 'Achieving network optima using Stackelberg routing strategies,' IEEE/ACM Trans. Networking, vol. 5, pp. 161-173, Feb. 1997 https://doi.org/10.1109/90.554730
- R. J. La and V. Anantharam, 'Optimal routing control: A game theoretic approach,' in Proc. Decision and Control, San Diego, CA, Dec. 1997
- E. Altman, T. Basar, and R. Srikant, 'Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users,' IEEE Trans. Automat. Contr., vol. 47, pp. 917-930, June 2002 https://doi.org/10.1109/TAC.2002.1008358
- E. Altman et al., 'Competitive routing in networks with polynomial costs,' IEEE Trans. Automat. Contr., vol. 47, pp. 92-96, Jan. 2002 https://doi.org/10.1109/9.981725
- T. Basar and R. Srikant, 'Revenue-maximizing pricing and capacity expansion in a many-users regime,' in Proc. INFOCOM 2002, vol. 1, 2002, pp.294-301
- A. K. Parekh and R. G. Gallager, 'A generalized processor sharing approach to flow control in integrated services networks: The single node case,' IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993 https://doi.org/10.1109/90.234856
- J. C. R. Bennett and H. Zhang, 'WF2Q : Worst-case fair weighted fair queueing,' in Proc. INFOCOM'96, 1996
- A. Demers, S. Keshav, and S. Shenker, 'Analysis and Simulation of a fair queueing algorithm,' in Proc. SIGCOM'89, 1989, pp. 1-12
- N. Matsufuru and R. Aibara, 'Efficient fair queueing for ATM network using uniform round robin,' in Proc. INFOCOM'99, 1999, pp. 389-397
- H. M. Chaskar and U. Madhow, 'Fair scheduling with tunable latency: A round robin approach,' in Proc. GLOBECOM'99, 1999, pp. 1328-1333
- J.-S. Kim and D. C. Lee, 'Weighted round robin packet scheduler using relative service share,' inProc. MILCOM 2001, vol. 2, 2001, pp. 988-992
- J. Joutsensalo and T. Harnalainen, 'QoS-aware adaptive pricing for network Services,' , vol. 4, 2001, pp. 2455-2459
- J. Joutsensalo and T. Harnalainen, 'Optimal link allocation and revenue maximization,' J. Commun. Networks, vol. 4, no. 2, pp. 136-147, June 2002. https://doi.org/10.1109/JCN.2002.6596896
- T. Hamalainen and J. Joutsensalo, 'Link allocation and revenue optimization for future networks,' in Proc. GLOBECOM 2002, Taiwan, Nov. 2002
- J. Joutsensalo, et al., 'Adaptive weighted fair scheduling method for channel allocation,' in Proc. ICC 2003, Anchorage, Alaska, 2003