• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

Development of a PriceBased Congestion Control Model

Expand
  • (School of Computer Science,National University of Defense Technology,Changsha 410073,China)

Received date: 2009-01-07

  Revised date: 2009-04-30

  Online published: 2011-02-25

Abstract

The congestion control problem in communication networks has been abstracted as an aggregate utility maximization problem in pricebased congestion control model. Pricebased model has become the general framework to design and analyze congestion control mechanisms. However, a pricebased 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 pricebased model. In order to systemicaly understand the development of this research area, we first briefly review the concept of pricebased model, and analyzes its limitation, then summarizes the research efforts. Finally, we provide some further interesting research directions.

Cite this article

PENG Lihong,ZHANG Heying,JIANG Xinwen,DOU Wenhua . Development of a PriceBased Congestion Control Model[J]. Computer Engineering & Science, 2011 , 33(2) : 7 -11 . DOI: 10.3969/j.issn.1007130X.2011.

References

[1]Jacobson V. Congestion Avoidance and Control [J].ACM Computer Communication Review, 1988, 18(4):314329.
[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):114.
[3]Hollot C, Misra V, Towsley D,et al.A Control Theoretic Analysis of RED [C]∥Proc of IEEE INFOCOM’01, 2001:15101519.
[4]Firoiu V, Borden M. A Study of Active Queue Management for Congestion Control [C] ∥ Proc of IEEE INFOCOM’00, 2000:14351444.
[5]Kelly F. Changing and Rate Control for Elastic Traffic [J].European Trans on Telecommunications, 1997,8(1):3337.
[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):237252.
[7]Shenker S. Fundamental Design Issues for the Future Internet [J].IEEE Selected Areas Commun, 1995,13:11761188.
[8]Mamatas L, Harks T, Tsaoussidis V. Approaches to Congestion Control in Packet Networks [J].Journal of Internet Engineering, 2007,1(1):2233.
[9]Cao Z, Zegura E. Utility MaxMin: An ApplicationOriented Bandwidth Allocation Sheme [C] ∥Proc of IEEE INFOCOM’99, 1999:793801.
[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:321325.
[13]Lin X, Shroff B. The Impact of Imperfect Scheduling on CrossLayer Congestion Control in Wireless Networks [J].IEEE/ACM Trans on Networking, 2006,14(2):302315.
[14]Tang A, Wang J, Low S H, et al. Equilibrium of Heterogeneous Congestion Control Protocols [C]∥Proc of IEEE INFOCOM’05, 2005:13381349.
[15]Lee J, Mazumdar R, Shroff N. NonConvex Optimization and Rate Control for MultiClass Services in the Internet [J].IEEE/ACM Trans on Networking, 2005(13):10631092.
[16]Hande P, Zhang S, Chiang M. Distributed Rate Allocation for Inelastic Flows [J].IEEE/ACM Trans on Networking, 2007,15(6):12401253.
[17]Cho J, Chong S. Utility MaxMin Flow Control Using Slope Restricted Utility Functions [J].IEEE Trans on Communications, 2007,55(5):963972.
[18]Miller K, Harks T. Utility MaxMin Fair Congestion Control with TimeVarying Delays [C] ∥Proc of IEEE INFOCOM’08, 2008:331335.
[19]Liu J, Proutiere A, Yi Y,et al. FlowLevel Stability of Data Networks with NonConvex and TimeVarying Rate Regions [C] ∥Proc of ACM Sigmetrics, 2007:239250.
[20]Han H, Shakkottai S. Overlay TCP for MultiPath 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 MultiPath Routing[J].IEEE Trans on Automatic Control, 2006, 51(5):766781.
[22]Wang J, Li L, Low S, et al.CrossLayer Optimization in TCP/IP Networks [J].IEEE/ACM Trans on Networking, 2005, 13(3):582568.
[23]Key P, Massoulié L, Towsley D. Path Selection and Multipath Congestion Control [C]∥Proc of IEEE INFOCOM’07, 2007:143151.
[24]Chen L, Low S, Doyle J. CrossLayer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks [C] ∥Proc of IEEE INFOCOM’06, 2006: 113.
[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):255312.
[26]Lin X,Shroff N B,Srikant R. On the Connection Level Stability of CongestionControlled Communication Networks [J].IEEE Trans on Information Theory, 2008(5):23172338.
[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 SystemsSpecial Issue on High Speed Transport Protocols, 2005:417439.

Outlines

/