Title :
Piecewise linear test functions for stability of queueing networks
Author :
Down, D. ; Meyn, S.P.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Abstract :
Presents an algorithm that allows the computer automation of the analysis of the stability of re-entrant lines. Through various examples, it is suggested that this method may completely characterise the region of stability for the types of networks considered. For the class of non-idling and buffer priority policies, piecewise linear functions of low complexity are constructed. To construct such functions for other policies such as FIFO appears to be more difficult in general, due to the complex state representation of such models
Keywords :
graph theory; linear programming; piecewise-linear techniques; queueing theory; buffer priority policies; nonidling policies; piecewise linear test functions; queueing networks; re-entrant lines; region of stability; Ear; Functional programming; Lyapunov method; Network servers; Piecewise linear techniques; Processor scheduling; Stability analysis; Steady-state; Stochastic processes; Testing;
Conference_Titel :
Decision and Control, 1994., Proceedings of the 33rd IEEE Conference on
Conference_Location :
Lake Buena Vista, FL
Print_ISBN :
0-7803-1968-0
DOI :
10.1109/CDC.1994.411432
