Application-oriented flow control: Fundamentals, algorithms and fairness

被引：80

作者：

IEEE ^{[1
]}

不详 ^{[2
]}

不详 ^{[3
]}

机构：

[1] Department of Electrical and Electronic Engineering, University of Melbourne

[2] Departments of Computer Science and Electrical Engineering, California Institute of Technology, Pasadena

来源：

IEEE ACM Trans Networking | 2006年 / 6卷 / 1282-1291期

基金：

澳大利亚研究理事会;

关键词：

Congestion control; Quality of service; Real-time application; Resource allocation; Utility max-min fairness; Utility proportional fairness;

D O I：

10.1109/TNET.2006.886318

中图分类号：

学科分类号：

摘要：

This paper is concerned with flow control and resource allocation problems in computer networks in which real-time applications may have hard quality of service (QoS) requirements. Recent optimal flow control approaches are unable to deal with these problems since QoS utility functions generally do not satisfy the strict concavity condition in real-time applications. For elastic traffic, we show that bandwidth allocations using the existing optimal flow control strategy can be quite unfair. If we consider different QoS requirements among network users, it may be undesirable to allocate bandwidth simply according to the traditional max-min fairness or proportional fairness. Instead, a network should have the ability to allocate bandwidth resources to various users, addressing their real utility requirements. For these reasons, this paper proposes a new distributed flow control algorithm for multiservice networks, where the application's utility is only assumed to be continuously increasing over the available bandwidth. In this, we show that the algorithm converges, and that at convergence, the utility achieved by each application is well balanced in a proportionally (or max-min) fair manner. © 2006 IEEE.

引用

页码：1282 / 1291

页数：9

共 30 条

[1] Shenker S., Fundamental design issues for the future Internet, IEEE J. Sel. Areas Commun, 13, 7, pp. 1176-1188, (1995)
[2] Kelly F.P., Charging and rate control for elastic traffic, Eur. Trans. Telecommun, 8, pp. 33-37, (1997)
[3] Kelly F.P., Maulloo A., Tan D., Rate control for communication networks: Shadow prices, proportional fairness and stability, J. Oper. Res. Soc, 49, pp. 237-252, (1998)
[4] Gibbens R.J., Kelly F.P., Resource pricing and the evolution of congestion control, Automatica, 35, pp. 1969-1985, (1999)
[5] Low S.H., Lapsley D.E., Optimal flow control, I: Basic algorithm and convergence, IEEE/ACM Trans. Netw, 7, 6, pp. 861-874, (1999)
[6] Mo J., Walrand J., Fair end-to-end window-based congestion control, IEEE/ACM Trans. Netw, 8, 5, pp. 556-567, (2000)
[7] Yaiche H., Mazumber R.R., Rosenberg C., A game theoretic framework for bandwidth allocation and pricing in broadband networks, IEEE/ACM Trans. Netw, 8, 5, pp. 667-678, (2000)
[8] Low S.H., Paganini F., Doyle J.C., Internet congestion control, IEEE Contr. Syst. Mag, 22, 1, pp. 28-43, (2002)
[9] La R., Anantharam V., Utility-based rate control in the Internet for elastic traffic, IEEE/ACM Trans. Netw, 10, 2, pp. 272-286, (2002)
[10] Altman E., Basar T., Srikant R., Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users, IEEE Trans. Autom. Contr, 47, 6, pp. 917-930, (2002)

← 1 2 3 →