DocumentCode
307184
Title
On the optimality of complete sharing policies of resource allocation
Author
Yang, Shih-Tsung ; Ephremides, Anthony
Author_Institution
Maryland Univ., MD, USA
Volume
1
fYear
1996
fDate
11-13 Dec 1996
Firstpage
299
Abstract
In this paper, we prove that when the reward rates for all types of users are equal, the policy of complete sharing is optimal within the class of coordinate-convex policies in multiple-service single-resource service (MSSR) systems
Keywords
circuit switching; minimisation; multi-access systems; probability; resource allocation; stochastic processes; telecommunication congestion control; circuit switched communication networks; complete sharing policies; coordinate-convex policies; multiple-service single-resource service systems; optimality; resource allocation; reward rates; Admission control; Circuits; Communication networks; Mathematical model; Resource management; Satellites;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1996., Proceedings of the 35th IEEE Conference on
Conference_Location
Kobe
ISSN
0191-2216
Print_ISBN
0-7803-3590-2
Type
conf
DOI
10.1109/CDC.1996.574320
Filename
574320
Link To Document