A simple framework of utility max-min flow control using sliding mode approach

Authors:
Jiong Jin;Wei-Hua Wang;Marimuthu Palaniswami
Affiliations:
Department of Electrical and Electronic Engineering, The University of Melbourne, Victoria, Australia;Department of Electrical and Electronic Engineering, The University of Melbourne, Victoria, Australia;Department of Electrical and Electronic Engineering, The University of Melbourne, Victoria, Australia
Venue:
IEEE Communications Letters
Year:
2009

Citing 3
Cited 1

Adaptive control algorithms for decentralized optimal traffic engineering in the internet

IEEE/ACM Transactions on Networking (TON)
Non-convex optimization and rate control for multi-class services in the Internet

IEEE/ACM Transactions on Networking (TON)
Application-oriented flow control: fundamentals, algorithms and fairness

IEEE/ACM Transactions on Networking (TON)

Rate control for heterogeneous wireless sensor networks: Characterization, algorithms and performance

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the limitations of current optimal flow control approach, we develop a new utility max-min flow control framework using classic sliding mode control. It consists of a source algorithm and a binary congestion feedback mechanism, in which only the sources with the highest utility at each congested link are required to reduce their transmission rates. It can be directly applied to a multi-service network with heterogeneous applications that have different QoS characteristics. The proposed framework achieves the utility max-min fairness among applications efficiently in the sense of low overhead and rapid convergence. Rigorously, the system is proven to be asymptotically stable by means of Lyapunov's theorem.