基于价格的拥塞控制模型扩展
收稿日期: 2009-01-07
修回日期: 2009-04-30
网络出版日期: 2011-02-25
基金资助
国家自然科学基金资助项目（60603064）
Development of a PriceBased Congestion Control Model
Received date: 2009-01-07
Revised date: 2009-04-30
Online published: 2011-02-25
基于价格的拥塞控制模型将网络拥塞控制问题抽象为聚合效用最大化的优化问题，已经成为拥塞控制机制设计和分析的一般框架。然而简化的线性模型与现实网络环境有一定差距，不能准确有效地指导新协议的设计与分析。因此,近年来研究人员正试图结合新的技术和应用，扩展完善基于价格的模型，建立更为准确有效的模型来反映现实的网络环境。为了系统地了解该领域研究工作的进展，本文首先简要回顾了基于价格的模型，分析其不足，介绍近年来在模型扩展方面的研究工作，最后指出几个有意义的研究方向。
关键词： 拥塞控制; 网络效用最大化; 基于价格的拥塞控制模型
彭立宏,张鹤颖,姜新文,窦文华 . 基于价格的拥塞控制模型扩展[J]. 计算机工程与科学, 2011 , 33(2) : 7 -11 . DOI: 10.3969/j.issn.1007130X.2011.
The congestion control problem in communication networks has been abstracted as an aggregate utility maximization problem in pricebased congestion control model. Pricebased model has become the general framework to design and analyze congestion control mechanisms. However, a pricebased model is different from real network environments since it is a simplified linear model. In recent years, research efforts are made to extend and improve the pricebased model. In order to systemicaly understand the development of this research area, we first briefly review the concept of pricebased model, and analyzes its limitation, then summarizes the research efforts. Finally, we provide some further interesting research directions.
［1］Jacobson V. Congestion Avoidance and Control ［J］.ACM Computer Communication Review, 1988, 18(4):314329.
［2］Chui D, Jain R. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks ［J］.Computer Networks and ISDN Systems, 1989,17(1):114.
［3］Hollot C, Misra V, Towsley D,et al.A Control Theoretic Analysis of RED ［C］∥Proc of IEEE INFOCOM’01, 2001:15101519.
［4］Firoiu V, Borden M. A Study of Active Queue Management for Congestion Control ［C］ ∥ Proc of IEEE INFOCOM’00, 2000:14351444.
［5］Kelly F. Changing and Rate Control for Elastic Traffic ［J］.European Trans on Telecommunications, 1997,8(1):3337.
［6］Kelly F, Maulloo A, Tan D. Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability ［J］.Journal of the Operations Research Society, 1998,49(3):237252.
［7］Shenker S. Fundamental Design Issues for the Future Internet ［J］.IEEE Selected Areas Commun, 1995,13:11761188.
［8］Mamatas L, Harks T, Tsaoussidis V. Approaches to Congestion Control in Packet Networks ［J］.Journal of Internet Engineering, 2007,1(1):2233.
［9］Cao Z, Zegura E. Utility MaxMin: An ApplicationOriented Bandwidth Allocation Sheme ［C］ ∥Proc of IEEE INFOCOM’99, 1999:793801.
［10］http://skype.com/products/explained.html.
［11］Cohen B. Incentives Built Robustness in BitTorrent ［C］ ∥Proc of P2P Economics Workshop, 2003.
［12］Lan T, Lin X, Chiang M,et al.How Bad is Suboptimal Rate Allocation ［C］ ∥Proc of IEEE INFOCOM’08, 2008:321325.
［13］Lin X, Shroff B. The Impact of Imperfect Scheduling on CrossLayer Congestion Control in Wireless Networks ［J］.IEEE/ACM Trans on Networking, 2006,14(2):302315.
［14］Tang A, Wang J, Low S H, et al. Equilibrium of Heterogeneous Congestion Control Protocols ［C］∥Proc of IEEE INFOCOM’05, 2005:13381349.
［15］Lee J, Mazumdar R, Shroff N. NonConvex Optimization and Rate Control for MultiClass Services in the Internet ［J］.IEEE/ACM Trans on Networking, 2005(13):10631092.
［16］Hande P, Zhang S, Chiang M. Distributed Rate Allocation for Inelastic Flows ［J］.IEEE/ACM Trans on Networking, 2007,15(6):12401253.
［17］Cho J, Chong S. Utility MaxMin Flow Control Using Slope Restricted Utility Functions ［J］.IEEE Trans on Communications, 2007,55(5):963972.
［18］Miller K, Harks T. Utility MaxMin Fair Congestion Control with TimeVarying Delays ［C］ ∥Proc of IEEE INFOCOM’08, 2008:331335.
［19］Liu J, Proutiere A, Yi Y,et al. FlowLevel Stability of Data Networks with NonConvex and TimeVarying Rate Regions ［C］ ∥Proc of ACM Sigmetrics, 2007:239250.
［20］Han H, Shakkottai S. Overlay TCP for MultiPath Routing and Congestion Control ［C］ ∥ The IMA Workshop on Measurements and Modeling of the Internet, 2004.
［21］Lin X , Shroff N B. Utility Maximization for Communication Networks with MultiPath Routing［J］.IEEE Trans on Automatic Control, 2006, 51(5):766781.
［22］Wang J, Li L, Low S, et al.CrossLayer Optimization in TCP/IP Networks ［J］.IEEE/ACM Trans on Networking, 2005, 13(3):582568.
［23］Key P, Massoulié L, Towsley D. Path Selection and Multipath Congestion Control ［C］∥Proc of IEEE INFOCOM’07, 2007:143151.
［24］Chen L, Low S, Doyle J. CrossLayer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks ［C］ ∥Proc of IEEE INFOCOM’06, 2006: 113.
［25］Chiang M, Low S, Calderbank A,et al.Layering As Optimization Decomposition: A Mathematical Theory of Network Architectures ［J］.Proc of IEEE, 2007,95(1):255312.
［26］Lin X,Shroff N B,Srikant R. On the Connection Level Stability of CongestionControlled Communication Networks ［J］.IEEE Trans on Information Theory, 2008(5):23172338.
［27］Tang A, Wang J, Hegde S,et al. Equilibrium and Fairness of Networks Shared by TCP Reno and Vegas/FAST ［C］ ∥Proc of Telecommunications SystemsSpecial Issue on High Speed Transport Protocols, 2005:417439.
/
| 〈 |
|
〉 |