Three management policies for a resource with partition constraints
Author(s)
Date
1999Source Title
Advances in Applied Probability
Print ISSN
0001-8678
Publisher
Cambridge University Press
Volume
31
Issue
3
Pages
795 - 818
Language
English
Type
ArticleItem Usage Stats
114
views
views
91
downloads
downloads
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.
Keywords
Admission controlHeavy 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