Target-pursuing policies for open multiclass queueing networks

A new parametric class of scheduling and routing policies for open multiclass queueing networks is proposed. We establish their stability and show they are amenable to distributed implementation using localized state information. We exploit our earlier work in (Ref.1) to select appropriate parameter values and outline how optimal parameter values can be computed. We report numerical results indicating that we obtain near-optimal policies (when the optimal can be computed) and significantly outperform heuristic alternatives.