Virtual partitioning -- dynamic priorities for unbuffered resources
Ilze Ziedins, University of Auckland
Thursday, November 11, 1999, 10.10 a.m., AP&M 6218.

Virtual partitioning is a scheme for sharing capacity between various call types (or, more generally, for sharing an unbuffered resource between various service classes). Call admission depends on the state of the system. Each call type is assigned a nominal capacity, and while it exceeds this capacity, arrivals of that type are admitted to the system only if the resulting free capacity in the system will be greater than or equal to some reservation parameter. The scheme can be thought of as a dynamic priority or dynamic trunk reservation scheme with those call types that exceed their nominal capacities having lower priority.
This talk will describe the virtual partioning control, give examples of its behaviour, and give the limiting dynamics in the heavy traffic limiting regime, as the capacity and arrival rates increase together. This is joint work with Debasis Mitra and Stan Zachary.