Title :
Comparing LP Bounds for Queueing Networks
Author :
Russell, Matthew C. ; Fraser, Jeff ; Rizzo, Stephen ; Veatch, Michael H.
Author_Institution :
Dept. of Math., Taylor Univ., Upland, IN, USA
Abstract :
We consider performance of open multiclass queueing networks under general scheduling policies. Two linear program (LP) performance bounds are compared, the achievable region method and the approximate linear program with quadratic approximation architecture. The latter is shown to give tighter upper and lower bounds.
Keywords :
approximation theory; linear programming; queueing theory; achievable region method; approximate linear program; general scheduling policies; linear program performance bounds; open multiclass queueing networks; quadratic approximation architecture; Communication networks; Costs; Job shop scheduling; Linear approximation; Linear programming; Manufacturing systems; Mathematics; Processor scheduling; Routing; Upper bound; Approximate linear programming (ALP); performance bounds; queueing networks;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.2009.2031582
