基于计费的网络资源分配的研究
摘要
近年来因特网的发展呈现出网络资源相对稀缺、应用多样化和商业化几大特点。在商业化环境下仅仅通过超量供给来解决网络资源稀缺和满足不同类型用户的服务要求不可行。所以如何合理分配相对稀缺的网络资源、激励用户选择合适的服务类型, 从而优化网络整体的效益, 便成为一个重要的研究课题。传统的网络资源分配方法大多数从工程方面来研究怎么来提高网络效率,而没有从用户的角度来分析,所以不能达到资源的充分利用。近年来,国外的研究者开始尝试着把微观经济学研究方法引入网络资源分配中,为这一领域的研究提供了崭新的思路。这种新方法在网络资源分配中引入用户效用的概念,利用供求相互作用机制、价格调节机制等微观经济学理论来求得网络资源的最优分配。这一方法在网络资源分配中可以起到在以下四个方面的作用:(1)建立相对统一的网络资源分配评价指标; (2)计费与网络速率控制机制相结合作为一种优化网络资源分配的手段; (3)计费在多服务提供中激励用户行为; (4)计费是网络商业化运行的基础。
当前大部分网络带宽优化分配的工作基本只适于单播环境,组播网络的异构性问题使得组播网络中的资源优化分配问题要比单播环境复杂得多,组播的优化带宽尚未得到很好的解决; 而当前互联网将由提供单一的尽力而为服务向提供区分服务的方向发展,多服务网络计费在建模方面和机制设计方面尚有许多工作需要展开。本文将计费机制应用于网络资源分配中,围绕组播网络中的带宽优化分配机制和优先级网络中的优先级分配和计费机制展开了研究。本文的工作得到国家自然科学基金“基于Internet 的交互式流媒体分发技术研究”(No.60302004)的资助。
本文取得的研究成果包括如下几个方面:
(1) 提出了一种单速率组播速率控制与修剪算法。从经济而不是工程的观点来分析组播内部公平性,提出了一种基于效用的组播内部公平性标准。从速率控制和组播树修剪两方面来最大化组播会话的净收益,在分枝节点效用的基础上提出了一种基于动态规划的单速率组播速率控制与修剪算法,该算法具有可扩展性。
In recent years, the development of Internet takes on three important features: the scarcity of resources, a wide variety of applications and commercialization. Overprovision can neither solve the problem of resource scarcity and nor meet differentiate service requirements,so how to optimally allocate the scarce network resources and incent users to select appropriate service types is an important issue. Traditional research on of network resource allocation focused on the improvement of engineering efficiency, but not took the satisfaction of users into consideration. As a result the network resource is not optimally utilized. The recent research on network resource allocation based on microeconomic theory brings us a new approach, where utility is introduced as an important concept. Optimal resource allocation is realized by the demand-supply mechanism and pricing mechanism. The new approach can be utilized in the following four aspects. First, utility based evaluation can be used as a comparatively unified evaluation criterion for network resource allocation. Secondly, combined with rate control and call admission control, pricing can be used as an optimal resource allocation mechanism. Thirdly, pricing can incent users to choose the appropriate service in a network with service differentiation. Finally pricing is the base of a commercial network.
Up to now, however, most research on pricing-based rate control deals with the unicast scenario. The optimal rate control of multicast scenario is more complex because of the heterogeneity of multicast receivers. Today’s Internet only provides best effort service, and it is becoming more and more a multi-service network, the modeling and mechanism design of multi-service pricing are important issues to be dealt with. This thesis addresses on bandwidth allocation in multicast network and priority allocation in multi-service network, where pricing mechanism plays an important role. The work in this thesis has been supported by the National Science Foundation of China “Internet-based interactive streaming delivery technique”(No.60302004). The dissertation contributes in the following
aspects. (1) A rate control and pruning algorithm for single-rate multicast sessions is proposed. Unlike the previous inter-receiver fairness criteria, a utility based fairness criterion is proposed. Based on the utility of junction node, a rate control and pruning algorithm is proposed to maximize the net benefit of the session. The algorithm is dynamic programming based and scalable. (2) A convex model is proposed for the bandwith allocation of network both with unicast and multirate muticast sessions, and an optimal multi-rate multicast rate control algorithm is proposed based on the utility of junction node. The optimal object of resource allocation is to maximize the social welfare. The algorithm is based on dual theory and gradient projection algorithm, where price is used to transfer congestion information to users. Compared with previous related work, the cost of links and discrete receiver rate of multicast are considered. An important step in the resource allocation iterative algorithm is to obtain the optimal rates which maximize the group net benefit. To address this problem a dynamic programming based algorithm is proposed based on the utility of junction node. The algorithm is distributed and scalable. (3) The incentive compatible problem of priority service is discussed. The optimal pricing strategy of preemptive priorities and non preemptive priorities is analyzed. It is proved that the optimal pricing strategy in implicit supply model is incentive compatible when the service is explicitly supplied. Compared with others’work, it indicates that the incentive compatible pricing is related with the user model. (4) Two auction-based priority allocation mechanisms are proposed. An infinite priority auction mechanism is proposed to solve the problem of priority allocation problem when users are with a continuous distribution of delay cost. The equilibrium bidding strategy and reserve price are discussed. An incentive compatible aggregate priority auction mechanism is proposed. Every user’s strategy-proof strategy is to announce the true value in the mechanism. The higher priorities are allocated to delay-sensitive users, and as a
result, the total delay cost of all users is minimized.
当前大部分网络带宽优化分配的工作基本只适于单播环境,组播网络的异构性问题使得组播网络中的资源优化分配问题要比单播环境复杂得多,组播的优化带宽尚未得到很好的解决; 而当前互联网将由提供单一的尽力而为服务向提供区分服务的方向发展,多服务网络计费在建模方面和机制设计方面尚有许多工作需要展开。本文将计费机制应用于网络资源分配中,围绕组播网络中的带宽优化分配机制和优先级网络中的优先级分配和计费机制展开了研究。本文的工作得到国家自然科学基金“基于Internet 的交互式流媒体分发技术研究”(No.60302004)的资助。
本文取得的研究成果包括如下几个方面:
(1) 提出了一种单速率组播速率控制与修剪算法。从经济而不是工程的观点来分析组播内部公平性,提出了一种基于效用的组播内部公平性标准。从速率控制和组播树修剪两方面来最大化组播会话的净收益,在分枝节点效用的基础上提出了一种基于动态规划的单速率组播速率控制与修剪算法,该算法具有可扩展性。
In recent years, the development of Internet takes on three important features: the scarcity of resources, a wide variety of applications and commercialization. Overprovision can neither solve the problem of resource scarcity and nor meet differentiate service requirements,so how to optimally allocate the scarce network resources and incent users to select appropriate service types is an important issue. Traditional research on of network resource allocation focused on the improvement of engineering efficiency, but not took the satisfaction of users into consideration. As a result the network resource is not optimally utilized. The recent research on network resource allocation based on microeconomic theory brings us a new approach, where utility is introduced as an important concept. Optimal resource allocation is realized by the demand-supply mechanism and pricing mechanism. The new approach can be utilized in the following four aspects. First, utility based evaluation can be used as a comparatively unified evaluation criterion for network resource allocation. Secondly, combined with rate control and call admission control, pricing can be used as an optimal resource allocation mechanism. Thirdly, pricing can incent users to choose the appropriate service in a network with service differentiation. Finally pricing is the base of a commercial network.
Up to now, however, most research on pricing-based rate control deals with the unicast scenario. The optimal rate control of multicast scenario is more complex because of the heterogeneity of multicast receivers. Today’s Internet only provides best effort service, and it is becoming more and more a multi-service network, the modeling and mechanism design of multi-service pricing are important issues to be dealt with. This thesis addresses on bandwidth allocation in multicast network and priority allocation in multi-service network, where pricing mechanism plays an important role. The work in this thesis has been supported by the National Science Foundation of China “Internet-based interactive streaming delivery technique”(No.60302004). The dissertation contributes in the following
aspects. (1) A rate control and pruning algorithm for single-rate multicast sessions is proposed. Unlike the previous inter-receiver fairness criteria, a utility based fairness criterion is proposed. Based on the utility of junction node, a rate control and pruning algorithm is proposed to maximize the net benefit of the session. The algorithm is dynamic programming based and scalable. (2) A convex model is proposed for the bandwith allocation of network both with unicast and multirate muticast sessions, and an optimal multi-rate multicast rate control algorithm is proposed based on the utility of junction node. The optimal object of resource allocation is to maximize the social welfare. The algorithm is based on dual theory and gradient projection algorithm, where price is used to transfer congestion information to users. Compared with previous related work, the cost of links and discrete receiver rate of multicast are considered. An important step in the resource allocation iterative algorithm is to obtain the optimal rates which maximize the group net benefit. To address this problem a dynamic programming based algorithm is proposed based on the utility of junction node. The algorithm is distributed and scalable. (3) The incentive compatible problem of priority service is discussed. The optimal pricing strategy of preemptive priorities and non preemptive priorities is analyzed. It is proved that the optimal pricing strategy in implicit supply model is incentive compatible when the service is explicitly supplied. Compared with others’work, it indicates that the incentive compatible pricing is related with the user model. (4) Two auction-based priority allocation mechanisms are proposed. An infinite priority auction mechanism is proposed to solve the problem of priority allocation problem when users are with a continuous distribution of delay cost. The equilibrium bidding strategy and reserve price are discussed. An incentive compatible aggregate priority auction mechanism is proposed. Every user’s strategy-proof strategy is to announce the true value in the mechanism. The higher priorities are allocated to delay-sensitive users, and as a
result, the total delay cost of all users is minimized.
引文
[1] M. Falkner, M. Devetsikiotis, and I. Lambadaris. An Overview of Pricing Concepts for Broadband IP Networks, IEEE Communications Review, 2000, 3(2).
[2] L. A. DaSilva, Pricing for QoS-Enabled Networks: A Survey, IEEE Communications Review, 2000, 3(2).
[3] Nicola Blefari-Melazzi, Dario Di Sorteand Gianluca Reali, Accounting and pricing: a forecast of the scenario of the next generation Internet. Computer Communications. 2003,26(18): 2037~2051
[4] 陈晓梅,卢锡城,王怀民.基于微观经济学方法的网络资源分配研究.计算机研究与发展, 2001, 38: 1345~1353
[5] S. J. Shenker. Fundamental Design Issues for the Future Internet. IEEE Journal on Selected Areas in Communications, Sept. 199513(7): 1176~1188.
[6] 魏蛟龙,张驰.基于拍卖的网络带宽分配方法的研究[J].电子学报,2003,31(6): 891~894
[7] J. Altmann, H. Daanen, H. Oliver. A. Sanchez-Beato Suarez, How to Market-Manage a QoS Network. Proceedings of 21th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), v 1, 2002: 284~293
[8] 高鸿业.西方经济学.北京:中国人民大学出版社,2001
[9] R. Cocchi et al. Pricing in Computer Networks: Motivation, Formulation and Example. IEEE/ACM Transactions on Networking, Dec 1993, 1(6): 614~27
[10] L. A. DaSilva, D. W. Petr, and N. Akar. Equilibrium Pricing in Multiservice Priority-Based Networks. Proc. IEEE GLOBECOM, Phoenix, AZ, Nov. 1997: S38.6.1~5
[11] H. Ji, J. Y. Hui, and E. Karasan. QoS–Based Pricing and Resource Allocation for Multimedia Broadband Networks. Proc. IEEE INFOCOM, 1996: 1020~027
[12] H. Jiang and S. Jordan. A Pricing Model for High-Speed Networks with Guaranteed QoS. Proc. IEEE INFOCOM, 1996: 888~95
[13] L. Murphy, J. Murphy, and J. K. MacKie-Mason. Feedback and Efficiency in ATM Networks. Proc. IEEE ICC, Dallas, TX, June 1996:1045~49
[14] Z. Cao and E. W. Zegura. Utility Max-Min: An Application-Oriented Bandwidth Allocation Scheme. Proc. IEEE INFOCOM,vol. 2, 1999: 793~801
[15] L. A. DaSilva, D. W. Petr, and N. Akar. Static Pricing and Quality of Service in Multiple Service Networks. Proc. 5th Joint Conf. Information Sciences, Feb. 27–Mar. 3, 2000, Atlantic City, NJ, vol. 1:355~58
[16] F. P. Kelly. Charging and Rate Control for Elastic Traffic. European Transactions on Communications.1997, 8 :33~37
[17] J. Murphy and L. Murphy. Bandwidth Allocation by Pricing in ATM Networks. IFIP Transactions C: Communication Sys-tems, no. C-24, 1994, available from URL http://www.eeng.dcu. ie/~murphyj/publ/publ.html, pp. 333~51
[18] J. Sairamesh, D. F. Ferguson, and Y. Yemini. An Approach to Pricing, Optimal Allocation, and Quality of Service Provisioning in High-Speed Packet Networks. Proc. IEEE INFOCOM, Boston, MA, Apr. 1995:1111~19
[19] 谢识予, 经济博弈论, 复旦大学出版社, 2001
[20] D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1987.
[21] F. Kelly, et al.. Rate control for communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research society. 1998, 49:237~252
[22] L. Massoulie and J. Roberts. Bandwidth sharing: objectives and algorithms. IEEE/ACM Transactions on Networking, June 2002,10(3):320~328
[23] R. Jain, D.M. Chiu, and W. Hawe. A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems. Technical report, DEC Research Report TR-301, September 1984.
[24] Chiu, Dah-Ming, Jain, R. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks. Computer Networks and ISDN Systems, 1989, 17(1): 1~14
[25] Sally Floyd and Kevin Fall. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking, Aug. 1999, 7(4): 458~472
[26] Chiu, Dah-Ming. Some observations on fairness of bandwidth sharing. Tech. Rep. TR-99-80, Sun Microsystems Labs, September 1999.
[27] Jean-Yves Le Boudec. Rate adaptation, congestion control and fairness: A tutorial, December 2000
[28] 罗万明, 林闯, 阎保平. TCP/IP 拥塞控制研究. 计算机学报, 2001, 24(1):1~18
[29] Hasegawa G. Matsuo T.K. Murata M. and Miyahara H. Comparisons of packet scheduling algorithms for fair service among connections on the Internet. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v 3, 2000: 1253~1262
[30] Van Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 1988, 18(4): 314~329
[31] Nagle J.Congestion Control in IP/TCP Internetworks.RFC 896,1984
[32] Widmer; J., Denda, R., Mauve, M. A survey on TCP-friendly congestion control. IEEE Network, 2001,15(3):28~37
[33] Jamshid Mahdavi and Sally Floyd. TCP-Friendly Unicast Rate-based Flow Control. Technical note sent to end-2-end interest mailing list, http://www.psc.edu/networking/papers/tcp friendly.html, January 1997.
[34] Floyd, S., Fall, K., Router Mechanisms to support End-to-End Congestion Control, Technical Report, 1997. URL ftp://ftp.ee.lbl.gov/papers/collapse.ps
[35] T. Ott, J. Kemperman and M. Mathis. Window Size Behavior in TCP/IP with Constant Loss Probability. in Proc. of IEEE HPCS'97, June 1997..
[36] Padhye, J., Firoiu, V., Towsley, D., et al. Modeling TCP throughput: a simple model and its empirical validation. In: Oran, D., ed. Proceedings of the SIGCOMM. Vancouver: ACM Press, 1998:303~314
[37] V. Jacobson. Modified TCP congestion avoidance algorithm. Note sent to end2end-interest mailing list, 1990.
[38] W. Stevens. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC2001, Jan 1997.
[39] 魏蛟龙,张驰.Internet 拥塞控制和资源分配中的对策论分析框架[J].电子学报,2003,31(10):1452~1455
[40] J. Mo and J. Walrand. Fair end-to-end window-based congestion control.IEEE/ACM Transactions on Networking, October 2000, 8(5):556~567
[41] J. MacKie-Mason and H. Varian. Pricing the Internet. Public Access to the Internet, B. Kahin and J. Keller, Eds., Prentice–Hall, 1994.
[42] J. MacKie-Mason and H. Varian. Pricing Congestible Network Resources. IEEE Journal on Selected Areas in Communications, vol. 13, no. 7, Sept. 1995: 1141~49
[43] A. M. Odlyzko, A modest proposal for preventing Internet congestion, AT&T Research Lab, Tech Report, 1997.
[44] A. Odlyzko. Paris Metro Pricing: The minimalist differentiated services solution. Proceedings 1999 Seventh International Workshop on Quality of Service (IWQoS ’ 99), IEEE: 159~161
[45] A. Odlyzko, Paris metro pricing for the Internet, Proceedings of ACM Conference on Electronic Commerce (EC 1999), 1999:140~147
[46] Yezekael Hayel, David Ros and Bruno Tuffin. Less-than-Best-Effort Services Pricing and Scheduling. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 1, 7-11 March 2004:66~75
[47] R. Cocchi, D. Estrin, S. Shenker, L. Zhang, A study of priority pricing in multiple service class network, Proceedings of ACM SIGCOMM 1991, Zurich, Switzerland, September, 1991:123~130
[48] A. Gupta et al. Priority Pricing of Integrated Services Networks. Internet Economics, L. W. McKnight and J. P. Bailey,Eds., Cambridge, Massachusetts, 1997, MIT Press :323~52
[49] D. D. Clark. Internet Cost Allocation and Pricing. Internet Economics, L. W. McKnight and J. P. Bailey, Eds., Cambridge, Massachusetts, 1997, MIT Press: 216~52
[50] S. Kalyanaraman and T. Ravichandran. Dynamic Capacity Contracting: A framework for Pricing the Differentiated Services Internet. 1st Int’l. Conf. Information and Computation Economics, May 1998
[51] J. MacKie-Mason, L. Murphy, and J. Murphy. Responsive Pricing in the Internet. Internet Economics, L. W. McKnight and J. P. Bailey, Eds., Cambridge, Massachusetts, 1997, MIT Press: 279~303
[52] L. Murphy and J. Murphy. Feedback and Pricing in ATM Net-works. Proc. IFIP TC6 3rd Wksp. Perf. Modelling and Evalua-tion of ATM Networks, Ilkley, England, July 1995: 68/1~12
[53] L. Murphy and J. Murphy. Pricing for ATM Network Efficiency. Proc. 3rd Int’l. Conf. Telecommunication Systems Mod-elling and Analysis, Nashville, USA, Mar. 1995 :349~56
[54] J. Murphy, L. Murphy, and E. C. Posner. Distributed Pricing for Embedded ATM Networks. Proc. Int’l. Teletraffic Congress ITC-14, Antibes, France, June 1994: 1053~63.
[55] F. Kelly. On Tariffs, Policing, and Admission Control for Multiservice Networks. Operations Research Letters, 1994, 15:1~9
[56] F. Kelly. Tariffs and Effective Bandwidths in Multiservice Networks. Int’l. Teletraffic Conf. ITC ’14, 1994: 401~10
[57] F. Kelly. Charging and Accounting for Bursty Connections. Internet Economics, L. W. McKnight and J. P. Bailey, Eds., Cambridge, Massachusetts, 1997, MIT Press: 253~78
[58] C. Courcoubetis, F. Kelly, and R. Weber. Measurement-based Usage Charges in Communication Networks. Statistical Laboratory Research Report 1997-19, University of Cambridge
[59] C. Courcoubetis and V. A. Siris. An Evaluation of Pricing Schemes that are Based on Effective Usage. Proc. IEEE International Conference on Communications 1998. vol.1,pt. 1: 265~9
[60] C.Courcoubetis and V.A. Sins, Managing and pricing service level agreements for differentiated services. 1999 Seventh International Workshop on Quality of Service. IWQoS'99: 165~73
[61] V. A. Siris et al. Usage-based Charging using Effective Bandwidths: Studies and Reality. Proceedings of the International Teletraffic Congress -ITC-16. Vol.3b, 1999, pt. 2:929~40
[62] H. Jiang and S. Jordan. Connection Establishment in High-Speed Networks. IEEE Journal on Selected Areas in Communications, Sept. 1995, 9(7) : 1150~61
[63] H. Jiang and S. Jordan. The Role of Price in the Connection Establishment Process. European Transactions on Telecommunications, July-Aug. 1995, 6( 4): 421~9
[64] R. Guerin, H. Ahmadi, and M. Naghshineh. Equivalent Capacity And Its Application To Bandwidth Allocation in High Speed Networks. IEEE Journal on Selected Areas in Communications, 1991, 9(7): 968~981
[65] R. J. Gibbens and F. P. Kelly. Resource Pricing and the Evolution of Congestion Control. Automatica. Dec. 1999,35(12):1969~85
[66] Steven H.Low and David E.Lapsley. Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking. December 1999, 7(6): 861~874
[67] C. Courcoubetis, G. D. Stamoulis, C. Manolakis, and F. P. Kelly. An intelligent agent for optimizing QoS-for-money in priced ABR connections. Telecommunications Systems, Special Issue on Network Economics, 2000.
[68] P.B. Key. D.R. McAuley. Differential QoS and pricing in networks where flow-control meets game theory. IEE Proceedings: Software, 1999,146(1): 39~43
[69] M.D. Biddiscombe, J.E. Midwinter, S.Sabesan. Application of free-market principles to telecoms resource allocations. IEE Electronic Letters, Volume 35, Issue 4, 18 Feb. 1999:264~266
[70] A. Lazar, N. Semret. Auctions for Network Resource Sharing. CTR Technical Report, Columbia University New York, U.S.A., February 1997.
[71] A. Lazar ,N. Semret t. Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing. Telecommunications Systems, Special Issue on Network Economics, 1999
[72] P. Mailléand B. Tuffin. Multi-Bid Auctions for Bandwidth Allocation in Communication Networks. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 1, 7-11 March 2004:54~65
[73] Bhattacharyya , S., Towsleu, D. The loss path multiplicity problem in multicast congestion control. In: Doshi, B., ed. Proceedings of the IEEE INFOCOM 1999, vol.2 :856~863
[74] T. Jiang, M. Ammar, and E.Zegura. Inter-Receiver Fairness: A Novel Performance Measure for Multicast ABR Sessions. ACM SIGMETRICS Performance Evaluation Review, v 26, n1, Jun, 1998:202~211
[75] T. Jiang, E. Zegura, and M. Ammar. Inter-Receiver Fair Multicast Communication Over the Internet. in Proceedings of NOSSDAV’99, June 1999:103~14
[76] T.Jiang, M.Ammar, and E.Zegura. On the Use of Destination Set Grouping to Improve Inter-receiver Fairness for Multicast ABR Sessions. in Proceedings of IEEE INFOCOM, v 2, 1996:553~560
[77] Y. Yang, M. Kim and S. Lam. Optimal partitioning of multicast receivers. Proc. IEEE ICNP, 2000:129~140
[78] D M Chiu, M Kadansky, J Provino, J Wesley, H Zhu. Pruning Algorithms for Multicast Flow Control. Proceedings of NGC, 2000: 83~92
[79] 石峰, 吴建平. 多播拥塞控制综述[J]. 软件学报, 2002, 13(8):1441~1449
[80] 苏晓丽,郑明春,孟强.多播拥塞控制研究进展.通信学报, 2003, 24 (5):94~104.
[81] McCanne, S., Jacobson, V., Vetterli, M. Receiver-Driven layered multicast. In: Deering, S., ed. Proceedings of the ACM SIGCOMM. Stanford: ACM Press, 1996: 117~130
[82] Vicisano, L., Rizzo, L., Crowcroft, J. TCP-Like congestion control for layered multicast data transfer. In: Charny, A., ed.Proceedings of the IEEE INFOCOM. San Francisco: IEEE Communications Society, 1998: 996~1003
[83] Byers, J., Frumin, M., Horn, G., et al. FLID-DL: congestion control for layered multicast. In: Fdida, S., ed. Proceedings of the 2nd International Workshop on Networked Group Communication (NGC 2000). Palo Alto: ACM Press, 2000: 71~81
[84] D. Sisalem, A. Wolisz. MLDA: A TCP-friendly congestion control framework for heterogeneous multicast environments. Proceedings of Eighth International Workshop on Quality of Service (IWQOS). 2000: 65~74
[85] Legout, A., Biersack, E.W. PLM: Fast convergence for cumulative layered multicast transmission schemes. In: Drushel, P., ed. Proceedings of the ACM Sigmetrics. Santa Clara, CA: ACM Press, 2000:13~22
[86] 董谦, 谢剑英. 单播与多速率组播共存网络中的公平资源分配.系统工程与电子技术,2004, 26(2):253~257,263
[87] E. Graves, R. Srikant, D. Towsley. Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows. Proceedings of Tyrrhenian International Workshop on Digital Communications (IWDC) 2001: 326~42
[88] D. Rubenstein, J. Kurose, D. Towsley. The Impact of Multicast Layering on Network Fairness. Computer Communication Review. Oct 1999, 29(4): 27~38
[89] S. Sarkar, L. Tassiulas. Fair Allocation of Utilities in Multirate Multicast Networks. Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing, 1999.
[90] S. Sarkar, L. Tassiulas. Distributed Algorithms for Computation of Fair Rates in Multirate Multicast Trees. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v1, 2000: 52~61
[91] S. Sarkar, L. Tassiulas. Fair Allocation of Discrete Bandwidth Layers in Multicast Networks. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v3, 2000:1491~1500
[92] K. Kar, S. Sarkar, L. Tassiulas. A Simple Rate Control Algorithm for Maximizing Total User Utility. Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), v1, 2001:133~141
[93] R. J. La and V. Ananthram. Charge-sensitive TCP and rate control in the internet. in Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), vol. 3, Mar. 2000:1166~1175
[94] R. J. La , Venkat Anantharam, Utility-based rate control in the Internet for elastic traffic, IEEE/ACM Transactions on Networking, April 2002, 10 n(2) :272~86
[95] S. Kunniyur, R. Srikant. End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v3, 2000:1323~1332
[96] K. Kar, S. Sarkar, L. Tassiulas. Optimization Based Rate Control for Multirate Multicast Sessions. Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), v1, 2001:123~132
[97] K. Kar, S. Sarkar, L. Tassiulas. A Scalable, Low-Overhead Rate Control Algorithm for Multirate Multicast Sessions. IEEE Journal on Selected Areas in Communications, October 2002,20(8):1541~1557
[98] K. Kar, L. Tassiulas, Multicast Rate Control using Lagrangian Relaxation and Dynamic Programming, Proceedings of the 43rd IEEE Conf. On Decision and Control, Atlantis, Bahamas, December 2004.
[99] S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. in Proc. IEEE Conf. Decision and Control, Dec. 2001 : 1911~1916
[100] S. Deb and R. Srikant. Convergence of distributed congestion control schemes in networks with multicast and unicast sessions. in Proc. Conf. Information Sciences and Systems, 2001.
[101] S. Deb. Deterministic fluid models for Internet congestion control. Ph.D. dissertation, Electr. Comput. Eng. Dept., Univ. Illinois, Urbana-Champaign, 2003.
[102] T. Stoenescu, M. Liu, and D. Teneketzis. A pricing mechanism for optimal rate allocation in multicast service provisioning. Technical Report CGR 04-09, University of Michigan, Ann Arbor, MI, July 2004.
[103] D.P.Bertsekas, Nonlinear Programming. New York: Athena Scientific, 1995.
[104] D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
[105] D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[106] Michel Mandjes. Pricing strategies under heterogeneous service requirements. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:1210~1220
[107] H.Mendelson and S.Whang. Optimal incentive-compatible priority pricing for the M/M/1 queue.Operations Research.1990, 38:870~883
[108] Jun Shu, Pravin Varaiya. Pricing Network Services. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:1221~1230
[109] Lui, F. T. An equilibrium queuing model of bribery. Journal of Political Economy, 93(4):760~781
[110] Philipp Afeche and Haim Mendelson. Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure. Management Science, 2004, 50(7): 869~882
[111] Kittsteiner and Moldovanu. Priority Auctions and Queue Disciplines that Depend on Processing Time. Management Science, v51, n2, Feb. 2005, p236~48
[112] Kleinrock, L. Optimum bribing for queue position. Operations Research, April 1967,15 :304~318
[113] W. Vickrey. Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance. March 1961, 16(1): 8~37
[114] E. H. Clarke. Multipart Pricing of Public Goods. Public Choice. 1971,2: 19~33
[115] T. Groves. Incentives in Teams. Econometrica, 1973,41: 617~31
[116] Jiantao Wang, Lun Li, Steven H. Low, John Doyle. Can Shortest-path Routing and TCP Maximize Utility. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 3, 30 March-3 April 2003:2049~2056
[117] J. Wang, L. Li, S. H. Low and J. C. Doyle. Cross-layer Optimization in TCP/IP Networks. IEEE/ACM Transactions on Networking, Volume 13, Issue 3, June 2005:582~595
[118] M. Chiang. To layer or not to layer: balancing transport and physical layers in wirless multihop networks. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 4, 7-11 March 2004:2525~2536
[119] Y. Xue, B. Li, and K. Nahrstedt. Price-based Resource Allocation in Wireless Ad Hoc Networks. In Proceedings of the Eleventh International Workshop on Quality of Service (IWQoS 2003).
[120] Lijun Chen, Steven H. Low and John C. Doyle. Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks. Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Volume 3, 13-17 March 2005:2212~2222
[121] Vikram Srinivasan, Cooperation in Wireless Ad Hoc Networks. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:808~817
[122] Ying Qiu ,Peter Marbach ,Bandwidth Allocation in Ad Hoc Networks: A Price-Based Approach. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:797~807
[123] Liangzhong Yin and Guohong Cao. Supporting Cooperative Caching in Ad Hoc Networks. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 4, 7-11 March 2004:2537~2547
[124] Selwyn Yuen, Baochun Li. Strategyproof Mechanisms for Dynamic Multicast Tree Formation in Overlay Networks. Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Volume 3, 13-17 March 2005:2135~2146
[2] L. A. DaSilva, Pricing for QoS-Enabled Networks: A Survey, IEEE Communications Review, 2000, 3(2).
[3] Nicola Blefari-Melazzi, Dario Di Sorteand Gianluca Reali, Accounting and pricing: a forecast of the scenario of the next generation Internet. Computer Communications. 2003,26(18): 2037~2051
[4] 陈晓梅,卢锡城,王怀民.基于微观经济学方法的网络资源分配研究.计算机研究与发展, 2001, 38: 1345~1353
[5] S. J. Shenker. Fundamental Design Issues for the Future Internet. IEEE Journal on Selected Areas in Communications, Sept. 199513(7): 1176~1188.
[6] 魏蛟龙,张驰.基于拍卖的网络带宽分配方法的研究[J].电子学报,2003,31(6): 891~894
[7] J. Altmann, H. Daanen, H. Oliver. A. Sanchez-Beato Suarez, How to Market-Manage a QoS Network. Proceedings of 21th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), v 1, 2002: 284~293
[8] 高鸿业.西方经济学.北京:中国人民大学出版社,2001
[9] R. Cocchi et al. Pricing in Computer Networks: Motivation, Formulation and Example. IEEE/ACM Transactions on Networking, Dec 1993, 1(6): 614~27
[10] L. A. DaSilva, D. W. Petr, and N. Akar. Equilibrium Pricing in Multiservice Priority-Based Networks. Proc. IEEE GLOBECOM, Phoenix, AZ, Nov. 1997: S38.6.1~5
[11] H. Ji, J. Y. Hui, and E. Karasan. QoS–Based Pricing and Resource Allocation for Multimedia Broadband Networks. Proc. IEEE INFOCOM, 1996: 1020~027
[12] H. Jiang and S. Jordan. A Pricing Model for High-Speed Networks with Guaranteed QoS. Proc. IEEE INFOCOM, 1996: 888~95
[13] L. Murphy, J. Murphy, and J. K. MacKie-Mason. Feedback and Efficiency in ATM Networks. Proc. IEEE ICC, Dallas, TX, June 1996:1045~49
[14] Z. Cao and E. W. Zegura. Utility Max-Min: An Application-Oriented Bandwidth Allocation Scheme. Proc. IEEE INFOCOM,vol. 2, 1999: 793~801
[15] L. A. DaSilva, D. W. Petr, and N. Akar. Static Pricing and Quality of Service in Multiple Service Networks. Proc. 5th Joint Conf. Information Sciences, Feb. 27–Mar. 3, 2000, Atlantic City, NJ, vol. 1:355~58
[16] F. P. Kelly. Charging and Rate Control for Elastic Traffic. European Transactions on Communications.1997, 8 :33~37
[17] J. Murphy and L. Murphy. Bandwidth Allocation by Pricing in ATM Networks. IFIP Transactions C: Communication Sys-tems, no. C-24, 1994, available from URL http://www.eeng.dcu. ie/~murphyj/publ/publ.html, pp. 333~51
[18] J. Sairamesh, D. F. Ferguson, and Y. Yemini. An Approach to Pricing, Optimal Allocation, and Quality of Service Provisioning in High-Speed Packet Networks. Proc. IEEE INFOCOM, Boston, MA, Apr. 1995:1111~19
[19] 谢识予, 经济博弈论, 复旦大学出版社, 2001
[20] D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice Hall, 1987.
[21] F. Kelly, et al.. Rate control for communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research society. 1998, 49:237~252
[22] L. Massoulie and J. Roberts. Bandwidth sharing: objectives and algorithms. IEEE/ACM Transactions on Networking, June 2002,10(3):320~328
[23] R. Jain, D.M. Chiu, and W. Hawe. A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems. Technical report, DEC Research Report TR-301, September 1984.
[24] Chiu, Dah-Ming, Jain, R. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks. Computer Networks and ISDN Systems, 1989, 17(1): 1~14
[25] Sally Floyd and Kevin Fall. Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking, Aug. 1999, 7(4): 458~472
[26] Chiu, Dah-Ming. Some observations on fairness of bandwidth sharing. Tech. Rep. TR-99-80, Sun Microsystems Labs, September 1999.
[27] Jean-Yves Le Boudec. Rate adaptation, congestion control and fairness: A tutorial, December 2000
[28] 罗万明, 林闯, 阎保平. TCP/IP 拥塞控制研究. 计算机学报, 2001, 24(1):1~18
[29] Hasegawa G. Matsuo T.K. Murata M. and Miyahara H. Comparisons of packet scheduling algorithms for fair service among connections on the Internet. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v 3, 2000: 1253~1262
[30] Van Jacobson. Congestion avoidance and control. ACM Computer Communication Review, 1988, 18(4): 314~329
[31] Nagle J.Congestion Control in IP/TCP Internetworks.RFC 896,1984
[32] Widmer; J., Denda, R., Mauve, M. A survey on TCP-friendly congestion control. IEEE Network, 2001,15(3):28~37
[33] Jamshid Mahdavi and Sally Floyd. TCP-Friendly Unicast Rate-based Flow Control. Technical note sent to end-2-end interest mailing list, http://www.psc.edu/networking/papers/tcp friendly.html, January 1997.
[34] Floyd, S., Fall, K., Router Mechanisms to support End-to-End Congestion Control, Technical Report, 1997. URL ftp://ftp.ee.lbl.gov/papers/collapse.ps
[35] T. Ott, J. Kemperman and M. Mathis. Window Size Behavior in TCP/IP with Constant Loss Probability. in Proc. of IEEE HPCS'97, June 1997..
[36] Padhye, J., Firoiu, V., Towsley, D., et al. Modeling TCP throughput: a simple model and its empirical validation. In: Oran, D., ed. Proceedings of the SIGCOMM. Vancouver: ACM Press, 1998:303~314
[37] V. Jacobson. Modified TCP congestion avoidance algorithm. Note sent to end2end-interest mailing list, 1990.
[38] W. Stevens. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC2001, Jan 1997.
[39] 魏蛟龙,张驰.Internet 拥塞控制和资源分配中的对策论分析框架[J].电子学报,2003,31(10):1452~1455
[40] J. Mo and J. Walrand. Fair end-to-end window-based congestion control.IEEE/ACM Transactions on Networking, October 2000, 8(5):556~567
[41] J. MacKie-Mason and H. Varian. Pricing the Internet. Public Access to the Internet, B. Kahin and J. Keller, Eds., Prentice–Hall, 1994.
[42] J. MacKie-Mason and H. Varian. Pricing Congestible Network Resources. IEEE Journal on Selected Areas in Communications, vol. 13, no. 7, Sept. 1995: 1141~49
[43] A. M. Odlyzko, A modest proposal for preventing Internet congestion, AT&T Research Lab, Tech Report, 1997.
[44] A. Odlyzko. Paris Metro Pricing: The minimalist differentiated services solution. Proceedings 1999 Seventh International Workshop on Quality of Service (IWQoS ’ 99), IEEE: 159~161
[45] A. Odlyzko, Paris metro pricing for the Internet, Proceedings of ACM Conference on Electronic Commerce (EC 1999), 1999:140~147
[46] Yezekael Hayel, David Ros and Bruno Tuffin. Less-than-Best-Effort Services Pricing and Scheduling. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 1, 7-11 March 2004:66~75
[47] R. Cocchi, D. Estrin, S. Shenker, L. Zhang, A study of priority pricing in multiple service class network, Proceedings of ACM SIGCOMM 1991, Zurich, Switzerland, September, 1991:123~130
[48] A. Gupta et al. Priority Pricing of Integrated Services Networks. Internet Economics, L. W. McKnight and J. P. Bailey,Eds., Cambridge, Massachusetts, 1997, MIT Press :323~52
[49] D. D. Clark. Internet Cost Allocation and Pricing. Internet Economics, L. W. McKnight and J. P. Bailey, Eds., Cambridge, Massachusetts, 1997, MIT Press: 216~52
[50] S. Kalyanaraman and T. Ravichandran. Dynamic Capacity Contracting: A framework for Pricing the Differentiated Services Internet. 1st Int’l. Conf. Information and Computation Economics, May 1998
[51] J. MacKie-Mason, L. Murphy, and J. Murphy. Responsive Pricing in the Internet. Internet Economics, L. W. McKnight and J. P. Bailey, Eds., Cambridge, Massachusetts, 1997, MIT Press: 279~303
[52] L. Murphy and J. Murphy. Feedback and Pricing in ATM Net-works. Proc. IFIP TC6 3rd Wksp. Perf. Modelling and Evalua-tion of ATM Networks, Ilkley, England, July 1995: 68/1~12
[53] L. Murphy and J. Murphy. Pricing for ATM Network Efficiency. Proc. 3rd Int’l. Conf. Telecommunication Systems Mod-elling and Analysis, Nashville, USA, Mar. 1995 :349~56
[54] J. Murphy, L. Murphy, and E. C. Posner. Distributed Pricing for Embedded ATM Networks. Proc. Int’l. Teletraffic Congress ITC-14, Antibes, France, June 1994: 1053~63.
[55] F. Kelly. On Tariffs, Policing, and Admission Control for Multiservice Networks. Operations Research Letters, 1994, 15:1~9
[56] F. Kelly. Tariffs and Effective Bandwidths in Multiservice Networks. Int’l. Teletraffic Conf. ITC ’14, 1994: 401~10
[57] F. Kelly. Charging and Accounting for Bursty Connections. Internet Economics, L. W. McKnight and J. P. Bailey, Eds., Cambridge, Massachusetts, 1997, MIT Press: 253~78
[58] C. Courcoubetis, F. Kelly, and R. Weber. Measurement-based Usage Charges in Communication Networks. Statistical Laboratory Research Report 1997-19, University of Cambridge
[59] C. Courcoubetis and V. A. Siris. An Evaluation of Pricing Schemes that are Based on Effective Usage. Proc. IEEE International Conference on Communications 1998. vol.1,pt. 1: 265~9
[60] C.Courcoubetis and V.A. Sins, Managing and pricing service level agreements for differentiated services. 1999 Seventh International Workshop on Quality of Service. IWQoS'99: 165~73
[61] V. A. Siris et al. Usage-based Charging using Effective Bandwidths: Studies and Reality. Proceedings of the International Teletraffic Congress -ITC-16. Vol.3b, 1999, pt. 2:929~40
[62] H. Jiang and S. Jordan. Connection Establishment in High-Speed Networks. IEEE Journal on Selected Areas in Communications, Sept. 1995, 9(7) : 1150~61
[63] H. Jiang and S. Jordan. The Role of Price in the Connection Establishment Process. European Transactions on Telecommunications, July-Aug. 1995, 6( 4): 421~9
[64] R. Guerin, H. Ahmadi, and M. Naghshineh. Equivalent Capacity And Its Application To Bandwidth Allocation in High Speed Networks. IEEE Journal on Selected Areas in Communications, 1991, 9(7): 968~981
[65] R. J. Gibbens and F. P. Kelly. Resource Pricing and the Evolution of Congestion Control. Automatica. Dec. 1999,35(12):1969~85
[66] Steven H.Low and David E.Lapsley. Optimization flow control, I: basic algorithm and convergence. IEEE/ACM Transactions on Networking. December 1999, 7(6): 861~874
[67] C. Courcoubetis, G. D. Stamoulis, C. Manolakis, and F. P. Kelly. An intelligent agent for optimizing QoS-for-money in priced ABR connections. Telecommunications Systems, Special Issue on Network Economics, 2000.
[68] P.B. Key. D.R. McAuley. Differential QoS and pricing in networks where flow-control meets game theory. IEE Proceedings: Software, 1999,146(1): 39~43
[69] M.D. Biddiscombe, J.E. Midwinter, S.Sabesan. Application of free-market principles to telecoms resource allocations. IEE Electronic Letters, Volume 35, Issue 4, 18 Feb. 1999:264~266
[70] A. Lazar, N. Semret. Auctions for Network Resource Sharing. CTR Technical Report, Columbia University New York, U.S.A., February 1997.
[71] A. Lazar ,N. Semret t. Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing. Telecommunications Systems, Special Issue on Network Economics, 1999
[72] P. Mailléand B. Tuffin. Multi-Bid Auctions for Bandwidth Allocation in Communication Networks. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 1, 7-11 March 2004:54~65
[73] Bhattacharyya , S., Towsleu, D. The loss path multiplicity problem in multicast congestion control. In: Doshi, B., ed. Proceedings of the IEEE INFOCOM 1999, vol.2 :856~863
[74] T. Jiang, M. Ammar, and E.Zegura. Inter-Receiver Fairness: A Novel Performance Measure for Multicast ABR Sessions. ACM SIGMETRICS Performance Evaluation Review, v 26, n1, Jun, 1998:202~211
[75] T. Jiang, E. Zegura, and M. Ammar. Inter-Receiver Fair Multicast Communication Over the Internet. in Proceedings of NOSSDAV’99, June 1999:103~14
[76] T.Jiang, M.Ammar, and E.Zegura. On the Use of Destination Set Grouping to Improve Inter-receiver Fairness for Multicast ABR Sessions. in Proceedings of IEEE INFOCOM, v 2, 1996:553~560
[77] Y. Yang, M. Kim and S. Lam. Optimal partitioning of multicast receivers. Proc. IEEE ICNP, 2000:129~140
[78] D M Chiu, M Kadansky, J Provino, J Wesley, H Zhu. Pruning Algorithms for Multicast Flow Control. Proceedings of NGC, 2000: 83~92
[79] 石峰, 吴建平. 多播拥塞控制综述[J]. 软件学报, 2002, 13(8):1441~1449
[80] 苏晓丽,郑明春,孟强.多播拥塞控制研究进展.通信学报, 2003, 24 (5):94~104.
[81] McCanne, S., Jacobson, V., Vetterli, M. Receiver-Driven layered multicast. In: Deering, S., ed. Proceedings of the ACM SIGCOMM. Stanford: ACM Press, 1996: 117~130
[82] Vicisano, L., Rizzo, L., Crowcroft, J. TCP-Like congestion control for layered multicast data transfer. In: Charny, A., ed.Proceedings of the IEEE INFOCOM. San Francisco: IEEE Communications Society, 1998: 996~1003
[83] Byers, J., Frumin, M., Horn, G., et al. FLID-DL: congestion control for layered multicast. In: Fdida, S., ed. Proceedings of the 2nd International Workshop on Networked Group Communication (NGC 2000). Palo Alto: ACM Press, 2000: 71~81
[84] D. Sisalem, A. Wolisz. MLDA: A TCP-friendly congestion control framework for heterogeneous multicast environments. Proceedings of Eighth International Workshop on Quality of Service (IWQOS). 2000: 65~74
[85] Legout, A., Biersack, E.W. PLM: Fast convergence for cumulative layered multicast transmission schemes. In: Drushel, P., ed. Proceedings of the ACM Sigmetrics. Santa Clara, CA: ACM Press, 2000:13~22
[86] 董谦, 谢剑英. 单播与多速率组播共存网络中的公平资源分配.系统工程与电子技术,2004, 26(2):253~257,263
[87] E. Graves, R. Srikant, D. Towsley. Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows. Proceedings of Tyrrhenian International Workshop on Digital Communications (IWDC) 2001: 326~42
[88] D. Rubenstein, J. Kurose, D. Towsley. The Impact of Multicast Layering on Network Fairness. Computer Communication Review. Oct 1999, 29(4): 27~38
[89] S. Sarkar, L. Tassiulas. Fair Allocation of Utilities in Multirate Multicast Networks. Proceedings of the 37th Annual Allerton Conference on Communication, Control and Computing, 1999.
[90] S. Sarkar, L. Tassiulas. Distributed Algorithms for Computation of Fair Rates in Multirate Multicast Trees. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v1, 2000: 52~61
[91] S. Sarkar, L. Tassiulas. Fair Allocation of Discrete Bandwidth Layers in Multicast Networks. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v3, 2000:1491~1500
[92] K. Kar, S. Sarkar, L. Tassiulas. A Simple Rate Control Algorithm for Maximizing Total User Utility. Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), v1, 2001:133~141
[93] R. J. La and V. Ananthram. Charge-sensitive TCP and rate control in the internet. in Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), vol. 3, Mar. 2000:1166~1175
[94] R. J. La , Venkat Anantharam, Utility-based rate control in the Internet for elastic traffic, IEEE/ACM Transactions on Networking, April 2002, 10 n(2) :272~86
[95] S. Kunniyur, R. Srikant. End-to-End Congestion Control Schemes: Utility Functions, Random Losses and ECN Marks. Proceedings of Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000), v3, 2000:1323~1332
[96] K. Kar, S. Sarkar, L. Tassiulas. Optimization Based Rate Control for Multirate Multicast Sessions. Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), v1, 2001:123~132
[97] K. Kar, S. Sarkar, L. Tassiulas. A Scalable, Low-Overhead Rate Control Algorithm for Multirate Multicast Sessions. IEEE Journal on Selected Areas in Communications, October 2002,20(8):1541~1557
[98] K. Kar, L. Tassiulas, Multicast Rate Control using Lagrangian Relaxation and Dynamic Programming, Proceedings of the 43rd IEEE Conf. On Decision and Control, Atlantis, Bahamas, December 2004.
[99] S. Deb and R. Srikant. Congestion control for fair resource allocation in networks with multicast flows. in Proc. IEEE Conf. Decision and Control, Dec. 2001 : 1911~1916
[100] S. Deb and R. Srikant. Convergence of distributed congestion control schemes in networks with multicast and unicast sessions. in Proc. Conf. Information Sciences and Systems, 2001.
[101] S. Deb. Deterministic fluid models for Internet congestion control. Ph.D. dissertation, Electr. Comput. Eng. Dept., Univ. Illinois, Urbana-Champaign, 2003.
[102] T. Stoenescu, M. Liu, and D. Teneketzis. A pricing mechanism for optimal rate allocation in multicast service provisioning. Technical Report CGR 04-09, University of Michigan, Ann Arbor, MI, July 2004.
[103] D.P.Bertsekas, Nonlinear Programming. New York: Athena Scientific, 1995.
[104] D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed. Reading, MA: Addison-Wesley, 1984.
[105] D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation. Englewood Cliffs, NJ: Prentice-Hall, 1989.
[106] Michel Mandjes. Pricing strategies under heterogeneous service requirements. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:1210~1220
[107] H.Mendelson and S.Whang. Optimal incentive-compatible priority pricing for the M/M/1 queue.Operations Research.1990, 38:870~883
[108] Jun Shu, Pravin Varaiya. Pricing Network Services. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:1221~1230
[109] Lui, F. T. An equilibrium queuing model of bribery. Journal of Political Economy, 93(4):760~781
[110] Philipp Afeche and Haim Mendelson. Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure. Management Science, 2004, 50(7): 869~882
[111] Kittsteiner and Moldovanu. Priority Auctions and Queue Disciplines that Depend on Processing Time. Management Science, v51, n2, Feb. 2005, p236~48
[112] Kleinrock, L. Optimum bribing for queue position. Operations Research, April 1967,15 :304~318
[113] W. Vickrey. Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance. March 1961, 16(1): 8~37
[114] E. H. Clarke. Multipart Pricing of Public Goods. Public Choice. 1971,2: 19~33
[115] T. Groves. Incentives in Teams. Econometrica, 1973,41: 617~31
[116] Jiantao Wang, Lun Li, Steven H. Low, John Doyle. Can Shortest-path Routing and TCP Maximize Utility. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 3, 30 March-3 April 2003:2049~2056
[117] J. Wang, L. Li, S. H. Low and J. C. Doyle. Cross-layer Optimization in TCP/IP Networks. IEEE/ACM Transactions on Networking, Volume 13, Issue 3, June 2005:582~595
[118] M. Chiang. To layer or not to layer: balancing transport and physical layers in wirless multihop networks. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 4, 7-11 March 2004:2525~2536
[119] Y. Xue, B. Li, and K. Nahrstedt. Price-based Resource Allocation in Wireless Ad Hoc Networks. In Proceedings of the Eleventh International Workshop on Quality of Service (IWQoS 2003).
[120] Lijun Chen, Steven H. Low and John C. Doyle. Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks. Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Volume 3, 13-17 March 2005:2212~2222
[121] Vikram Srinivasan, Cooperation in Wireless Ad Hoc Networks. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:808~817
[122] Ying Qiu ,Peter Marbach ,Bandwidth Allocation in Ad Hoc Networks: A Price-Based Approach. Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). Volume 2, 30 March-3 April 2003:797~807
[123] Liangzhong Yin and Guohong Cao. Supporting Cooperative Caching in Ad Hoc Networks. Proceedings of Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004). Volume 4, 7-11 March 2004:2537~2547
[124] Selwyn Yuen, Baochun Li. Strategyproof Mechanisms for Dynamic Multicast Tree Formation in Overlay Networks. Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Volume 3, 13-17 March 2005:2135~2146