Andrea Marin
Abstract
In this paper, we introduce a new product-form queueing network model where servers are always busy. This is obtained by defining a job movement policy that admits instantaneous migrations of jobs from non-empty waiting buffers to empty ones. Thus, the resulting routing scheme is statedependent. This class of networks tends to maximize the system throughput and can be used to model situations where successive refinements on jobs improve the processes quality but are not strictly required to obtain a result.
- S. Balsamo, P. G. Harrison, and A. Marin. A unifying approach to product-forms in networks with finite capacity constraints. In Proc. of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 25--36, 2010.Google Scholar
Digital Library
- E. Gelenbe. G-networks with triggered customer movement. Journal of Applied Probability, 30(3):742--748, 1993.Google ScholarCross Ref
- P. G. Harrison. Turning back time in markovian process algebra. Theor. Comput. Sci., 290(3):1947--1986, 2003.Google ScholarDigital Library
- P. G. Harrison and A. Marin. Product-forms in multi-way synchronizations. Comput. J., 57(11):1693--1710, 2014.Google ScholarCross Ref
- J. Hillston. A Compositional Approach to Performance Modelling. Cambridge University Press, USA, 2005.Google Scholar
- F. P. Kelly. Reversibility and Stochastic Networks. John Wiley & Sons, 1979.Google Scholar
- B. G. Pittel. Closed exponential networks of queues with saturation: The jackson-type stationary distribution and its asymptotic analysis. Math. Oper. Res., 4(4):357--378, 1979.Google ScholarDigital Library
Recommendations
A Product-form Network for Systems with Job Stealing Policies
In queueing networks, product-form solutions are of fundamental importance to efficiently compute performance metrics in complex models of computer systems. The product-form property entails that the steady-state probabilities of the joint stochastic ...
Closed-form waiting time approximations for polling systems
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focus on Poisson arrivals, whereas very few results are available for general arrivals. The current ...
Comments