DocumentCode
847880
Title
A private good/public good decomposition for optimal flow control of an 
queue
Author
Sanders, Beverly A.
Author_Institution
University of Maryland, College Park, MD, USA
Volume
30
Issue
11
fYear
1985
fDate
11/1/1985 12:00:00 AM
Firstpage
1143
Lastpage
1145
Abstract
Flow control for an queue with several users conceptually consists of two parts: determining the total throughput (and thus mean delay) and determining the rate allocated to each individual user. An incentive compatible hill climbing algorithm that determines the optimal rate allocation is presented. It is shown that the algorithm can be viewed as a public good algorithm that determines the total, and a private good algorithm that determines the allocation, operating simultaneously.
queue with several users conceptually consists of two parts: determining the total throughput (and thus mean delay) and determining the rate allocated to each individual user. An incentive compatible hill climbing algorithm that determines the optimal rate allocation is presented. It is shown that the algorithm can be viewed as a public good algorithm that determines the total, and a private good algorithm that determines the allocation, operating simultaneously.Keywords
Flow control; Queuing analysis; Computer science; Costs; Delay effects; Iterative algorithms; Optimal control; Research and development management; Throughput;
fLanguage
English
Journal_Title
Automatic Control, IEEE Transactions on
Publisher
ieee
ISSN
0018-9286
Type
jour
DOI
10.1109/TAC.1985.1103835
Filename
1103835
Link To Document