Fairness-optimal initial shaping rate for HSDPA transport network congestion control
作者： Pal L. Palyi , Sandor Racz , Szilveszter Nadas
DOI: 10.1109/ICCS.2008.4737416
关键词:
摘要: In the HSDPA (high-speed downlink packet access) Iub transport network (TN) which connects radio controller with base stations (node Bs), congestion control is needed. Because of TN?s often narrow resources, fairness resource sharing an important issue. Basic Additive Increase multiplicative decrease (AIMD) guarantees convergence to in long run; all flows converge equal share resources steady state, where no join or leave. However, incoming level fairness, that why transient should be taken into account as well. This paper proposes a method provides fairness-optimal initial rate for flows. The proposed improves average fairness. can applied based same bottleneck. also gives general solution case second-order measures.
sci-hub.se 参考文章(11)
Jean G. Dhombres, J. Aczél, Functional Equations in Several Variables: With Applications to Mathematics, Information Theory and to the Natural and Social Sciences ,(1989)
A.-B. Garcia, M. Alvarez-Campana, E. Vazquez, G. Guenon, J. Berrocal, ATM transport between UMTS base stations and controllers: supporting topology and dimensioning decisions personal, indoor and mobile radio communications. ,vol. 3, pp. 2176- 2180 ,(2004) , 10.1109/PIMRC.2004.1368383
Michael Welzl, Max Mühlhäuser, CAVT ACM SIGCOMM Computer Communication Review. ,vol. 33, pp. 95- 101 ,(2003) , 10.1145/956993.957005
Szilveszter Nadas, Sandor Racz, Zoltan Nagy, Sandor Molnar, Providing Congestion Control in the Iub Transport Network for HSDPA global communications conference. pp. 5293- 5297 ,(2007) , 10.1109/GLOCOM.2007.1003
H. Sirisena, A. Haider, M. Hassan, K. Fawlikowski, Transient fairness of optimized end-to-end window control global communications conference. ,vol. 7, pp. 3979- 3983 ,(2003) , 10.1109/GLOCOM.2003.1258976
P.C. Attie, A. Lahanas, V. Tsaoussidis, Beyond AIMD: explicit fair-share calculation international symposium on computers and communications. pp. 727- 734 ,(2003) , 10.1109/ISCC.2003.1214204
Tobias Harks, Lefteris Mamatas, Vassilis Tsaoussidis, Approaches to Congestion Control in packet networks Journal of Internet Engineering. ,vol. 1, ,(2007)
J. Mo, J. Walrand, Fair end-to-end window-based congestion control IEEE ACM Transactions on Networking. ,vol. 8, pp. 556- 567 ,(2000) , 10.1109/90.879343
Dah-Ming Chiu, Raj Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks Computer Networks and Isdn Systems. ,vol. 17, pp. 1- 14 ,(1989) , 10.1016/0169-7552(89)90019-6
E. Altman, K. E. Avrachenkov, B. J. Prabhu, Fairness in MIMD Congestion Control Algorithms Telecommunication Systems. ,vol. 30, pp. 387- 415 ,(2005) , 10.1007/S11235-005-5498-2