scholarly journals Discrete-time queueing networks with geometric release probabilities

1992 ◽  
Vol 24 (1) ◽  
pp. 229-233 ◽  
Author(s):  
W. Henderson ◽  
P. G. Taylor

This note is concerned with the continuing misconception that a discrete-time network of queues, with independent customer routing and the number of arrivals and services in a time interval following geometric and truncated geometric distributions respectively, has a product-form equilibrium distribution.

1992 ◽  
Vol 24 (01) ◽  
pp. 229-233
Author(s):  
W. Henderson ◽  
P. G. Taylor

This note is concerned with the continuing misconception that a discrete-time network of queues, with independent customer routing and the number of arrivals and services in a time interval following geometric and truncated geometric distributions respectively, has a product-form equilibrium distribution.


1996 ◽  
Vol 10 (2) ◽  
pp. 287-297 ◽  
Author(s):  
Richard J. Boucherie

This paper shows that the equilibrium distribution of a queueing network with batch routing continues to be of product form if a batch that cannot enter its destination — for example, as a consequence of capacity constraints — immediately triggers a new transition that takes up the whole batch.


Author(s):  
Richard J. Boucherie

AbstractThis note introduces quasi-local-balance for discrete-time Markov chains with absorbing states. From quasi-local-balance product-form quasi-stationary distributions are derived by analogy with product-form stationary distributions for Markov chains that satisfy local balance.


1991 ◽  
Vol 28 (02) ◽  
pp. 409-421 ◽  
Author(s):  
W. Henderson ◽  
P. G. Taylor

Product-form equilibrium distributions in networks of queues in which customers move singly have been known since 1957, when Jackson derived some surprising independence results. A product-form equilibrium distribution has also recently been shown to be valid for certain queueing networks with batch arrivals, batch services and even correlated routing. This paper derives the joint equilibrium distribution of states immediately before and after a batch of customers is released into the network. The results are valid for either discrete- or continuous-time queueing networks: previously obtained results can be seen as marginal distributions within a more general framework. A generalisation of the classical ‘arrival theorem' for continuous-time networks is given, which compares the equilibrium distribution as seen by arrivals to the time-averaged equilibrium distribution.


2016 ◽  
Vol 30 (3) ◽  
pp. 345-360 ◽  
Author(s):  
Andrea Marin

The introduction of the class of queueing networks called G-networks by Gelenbe has been a breakthrough in the field of stochastic modeling since it has largely expanded the class of models which are analytically or numerically tractable. From a theoretical point of view, the introduction of the G-networks has lead to very important considerations: first, a product-form queueing network may have non-linear traffic equations; secondly, we can have a product-form equilibrium distribution even if the customer routing is defined in such a way that more than two queues can change their states at the same time epoch. In this work, we review some of the classes of product-forms introduced for the analysis of the G-networks with special attention to these two aspects. We propose a methodology that, coherently with the product-form result, allows for a modular analysis of the G-queues to derive the equilibrium distribution of the network.


Author(s):  
Jean Walrand

AbstractThis chapter provides the derivations of the results in the previous chapter. It also develops the theory of continuous-time Markov chains.Section 6.1 proves the results on the spreading of rumors. Section 6.2 presents the theory of continuous-time Markov chains that are used to model queueing networks, among many other applications. That section explains the relationships between continuous-time and related discrete-time Markov chains. Sections 6.3 and 6.4 prove the results about product-form networks by using a time-reversal argument.


Sign in / Sign up

Export Citation Format

Share Document