Title :
Threshold policies minimizing customer mean flow time in simple (out-tree) queueing networks
Author :
Aicardi, M. ; Minciardi, R. ; Pesenti, R.
Author_Institution :
Dipartimento di Inf., Sistemistica e Telematica, Genova Univ., Italy
Abstract :
An optimization problem concerning deterministic queuing networks is considered. The optimization problem examined is relevant to the routing policy of incoming customers which have to flow through the network. The cost functional is the customer mean flow time. The authors survey all the results previously obtained for the simplest case, and propose further results concerning more complex queuing networks
Keywords :
graph theory; minimisation; queueing theory; customer mean flow time minimisation; deterministic queuing networks; routeing; routing policy; simple out-tree queueing networks; threshold policies; Complex networks; Context-aware services; Cost function; Infinite horizon; Intelligent networks; Manufacturing; Network servers; Optimal control; Routing; Stochastic processes;
Conference_Titel :
Decision and Control, 1991., Proceedings of the 30th IEEE Conference on
Conference_Location :
Brighton
Print_ISBN :
0-7803-0450-0
DOI :
10.1109/CDC.1991.261432