The authors deal with optimal control problems of deterministic queuing networks. The class of networks considered is characterized by a single-class population of customers, each of which has to undergo the same sequence of operations. The network is composed of a number of identically structured islands, where a decisional node has to route incoming customers to one between two different servers. With reference to the minimization of the mean flow time in the overall network, the optimality of an informationally decentralized, threshold-type, and quasi-stationary policy is proved.
Optimal decentralized routing policies for a class of queueing networks
PESENTI, Raffaele
1992-01-01
Abstract
The authors deal with optimal control problems of deterministic queuing networks. The class of networks considered is characterized by a single-class population of customers, each of which has to undergo the same sequence of operations. The network is composed of a number of identically structured islands, where a decisional node has to route incoming customers to one between two different servers. With reference to the minimization of the mean flow time in the overall network, the optimality of an informationally decentralized, threshold-type, and quasi-stationary policy is proved.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
