Three management policies for a resource with partition constraints
Date
1999
Authors
Alanyalı, M.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Advances in Applied Probability
Print ISSN
0001-8678
Electronic ISSN
Publisher
Cambridge University Press
Volume
31
Issue
3
Pages
795 - 818
Language
English
Type
Journal Title
Journal ISSN
Volume Title
Citation Stats
Attention Stats
Usage Stats
0
views
views
13
downloads
downloads
Series
Abstract
Management of a bufferless resource is considered under non-homogeneous demand consisting of one-unit and two-unit requests. Two-unit requests can be served only by a given partition of the resource. Three simple admission policies are evaluated with regard to revenue generation. One policy involves no admission control and two policies involve trunk reservation. A limiting regime in which demand and capacity increase in proportion is considered. It is shown that each policy is asymptotically optimal for a certain range of parameters. Limiting dynamical behavior is obtained via a theory developed by Hunt and Kurtz. The results also point out the remarkable effect of partition constraints.
Course
Other identifiers
Book Title
Keywords
Admission control, Heavy traffic, Loss networks, Multirate networks, Partition constraints, Resource management, Time-scale separation, Trunk reservation, Asymptotic stability, Constraint theory, Inventory control, Resource allocation, Multirate networks, Partition constraints, Resource management, Probability distributions