This paper deals with stochastic processing networks (SPN). At the beginning of the paper the authors present a specific model of a closed single server queues network with multiclass customer flows. In this model only the average service rates at the servers are considered. The authors explain how to generate the corresponding SPN and formulate a dynamic control policy for the time sharing allocation of a server to different class incoming flows. The authors formulate a static planning problem equation assuming for the system the existence of a unique optimal solution. In this context they consider a generalized Brownian network that approximates the SPN, studying how the workload matrix of the Brownian network can be constructed from the static planning problem optimal solutions in the SPN. Leonardo Pasini
Recensione dell'articolo: (Harrison, J. M.; Williams, R. J. - " Workload interpretation for Brownian models of stochastic processing network " - Math.Oper.Res. 32 (2007), no.4, 808–820.)
PASINI, Leonardo
2009-01-01
Abstract
This paper deals with stochastic processing networks (SPN). At the beginning of the paper the authors present a specific model of a closed single server queues network with multiclass customer flows. In this model only the average service rates at the servers are considered. The authors explain how to generate the corresponding SPN and formulate a dynamic control policy for the time sharing allocation of a server to different class incoming flows. The authors formulate a static planning problem equation assuming for the system the existence of a unique optimal solution. In this context they consider a generalized Brownian network that approximates the SPN, studying how the workload matrix of the Brownian network can be constructed from the static planning problem optimal solutions in the SPN. Leonardo PasiniI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
