Paper Info
Title
A distributed utility max-min flow control algorithm
Abstract
A fair allocation of utility (application-layer performance) is essential in providing QoS (Quality of Service) guarantee. However, there have been few researches in the literature of utility-fair network resource allocation scheme. In this paper, we propose a distributed utility max–min flow control algorithm which accommodates application diversity in that it does not require the concavity of utility functions, and is scalable in that it does not require any per-flow operation in the network. The algorithm is proved to be convergent under the assumption that there exists a single bottleneck link and the communication delay between any two links in the network is bounded. Although the convergence of the algorithm is analyzed only for the case of a single bottleneck link, we show through simulations that the proposed algorithm works as designed for the case of multiple bottleneck links as well.
Year
DOI
Venue
2006
10.1016/j.comnet.2005.07.018
Computer Networks: The International Journal of Computer and Telecommunications Networking
Keywords
DocType
Volume
distributed algorithms,telecommunication networks,multiple bottleneck,utility function,quality of service,single bottleneck link,telecommunication congestion control,utility-fair network resource allocation scheme,minimax techniques,utility-fair network resource allocation,distributed utility max-min flow control algorithm,qos,proposed algorithm,utility max-min flow control,application-layer performance,application diversity,fair allocation,communication delay,algorithm design and analysis,resource management,jitter,flow control,convergence,channel allocation,resource allocation,bandwidth
Journal
50
Issue
ISSN
Citations 
11
1389-1286
5
PageRank 
References 
Authors
0.55
9
2
Name
Order
Citations
PageRank
Hyang-Won Lee123721.45
Song Chong22113143.72