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 条
  • [11] Alpcan T., Basar T., Distributed algorithms for Nash equilibria of flow control games, Annals of Dynamic Games, (2003)
  • [12] Alpcan T., Basar T., A utility-based congestion control scheme for Internet-style networks with delay, Proc. IEEE INFOCOM 2003, pp. 2039-2048
  • [13] Kelly F.P., Fairness and stability of end-to-end congestion control, Eur. J. Contr, 9, pp. 149-165, (2003)
  • [14] Kar K., Sarkar S., Tassiulas L., Optimization-based rate control for multipath sessions, (2001)
  • [15] Wang W.H., Palaniswami M., Low S.H., Optimal flow control and routing in multiple paths networks, Perform. Eval, 52, 2-3, pp. 119-132, (2003)
  • [16] Kar K., Sarkar S., Tassiulas L., A scalable low-overhead rate control algorithm for multirate multicast sessions, IEEE J. Sel. Areas Commun, 20, 8, pp. 1541-1557, (2002)
  • [17] Wang W.H., Palaniswami M., Low S.H., Necessary and sufficient conditions of optimal flow control in multirate multicast networks, Proc. Inst. Electr. Eng. - Commun, 150, pp. 385-390, (2003)
  • [18] Bertsekas D., Gallager R., Data Networks, (1992)
  • [19] Marbach P., Priority service and max-min fairness, IEEE/ACM Trans. Netw, 11, 10, pp. 733-746, (2003)
  • [20] Jacobson V., Karels M.J., Congestion avoidance and control, Proc. ACM SIGCOMM'88, pp. 314-329, (1988)
123