Three management policies for a resource with partition constraints
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/25213
Advances in Applied Probability
- Research Paper 
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. © Applied Probability Trust 1999.