A Jackson network under general regime

2019 ◽  
Vol 33 (3) ◽  
pp. 532-548
Author(s):  
Yair Y. Shaki
Keyword(s):  
Jackson Network

scholarly journals Robustness analysis of generalized Jackson network

2019 ◽  
Vol 16 (4) ◽  
pp. 697-714
Author(s):  
Joost Berkhout ◽  
Bernd Heidergott ◽  
Jennifer Sommer ◽  
Hans Daduna
Keyword(s):  
Robustness Analysis ◽  
Jackson Network

Realization probability in closed Jackson queueing networks and its application

1987 ◽  
Vol 19 (03) ◽  
pp. 708-738 ◽  
Author(s):  
X. R. Cao
Keyword(s):  
Steady State ◽  
Perturbation Analysis ◽  
Queueing Networks ◽  
Sample Path ◽  
Queueing Network ◽  
Jackson Network ◽  
The Mean ◽  
Service Times ◽  
A New Technique ◽  
Number Of Customers

Perturbation analysis is a new technique which yields the sensitivities of system performance measures with respect to parameters based on one sample path of a system. This paper provides some theoretical analysis for this method. A new notion, the realization probability of a perturbation in a closed queueing network, is studied. The elasticity of the expected throughput in a closed Jackson network with respect to the mean service times can be expressed in terms of the steady-state probabilities and realization probabilities in a very simple way. The elasticity of the throughput with respect to the mean service times when the service distributions are perturbed to non-exponential distributions can also be obtained using these realization probabilities. It is proved that the sample elasticity of the throughput obtained by perturbation analysis converges to the elasticity of the expected throughput in steady-state both in mean and with probability 1 as the number of customers served goes to This justifies the existing algorithms based on perturbation analysis which efficiently provide the estimates of elasticities in practice.

scholarly journals On the Effect of Finite Buffer Truncation in a Two-Node Jackson Network

2005 ◽  
Vol 42 (01) ◽  
pp. 199-222 ◽  
Author(s):  
Yutaka Sakuma ◽  
Masakiyo Miyazawa
Keyword(s):  
Stability Condition ◽  
Queue Length ◽  
Length Distribution ◽  
Buffer Size ◽  
Finite Buffer ◽  
Jackson Network ◽  
Numerical Examples ◽  
Queue Length Distribution ◽  
Special Cases ◽  
The Stability

We consider a two-node Jackson network in which the buffer of node 1 is truncated. Our interest is in the limit of the tail decay rate of the queue-length distribution of node 2 when the buffer size of node 1 goes to infinity, provided that the stability condition of the unlimited network is satisfied. We show that there can be three different cases for the limit. This generalizes some recent results obtained for the tandem Jackson network. Special cases and some numerical examples are also presented.

On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network

1992 ◽  
Vol 24 (02) ◽  
pp. 343-376 ◽  
Author(s):  
Arie Hordijk ◽  
Flora Spieksma
Keyword(s):  
Markov Chain ◽  
Product Form ◽  
Geometric Ergodicity ◽  
Two Dimensional ◽  
Marginal Distributions ◽  
Jackson Network ◽  
Strong Ergodicity ◽  
Key Theorem ◽  
Stieltjes Transforms

This paper gives an overview of recurrence and ergodicity properties of a Markov chain. Two new notions for ergodicity and recurrence are introduced. They are calledμ-geometric ergodicity andμ-geometric recurrence respectively. The first condition generalises geometric as well as strong ergodicity. Our key theorem shows thatμ-geometric ergodicity is equivalent to weakμ-geometric recurrence. The latter condition is verified for the time-discretised two-centre open Jackson network. Hence, the corresponding two-dimensional Markov chain isμ-geometrically and geometrically ergodic, but not strongly ergodic. A consequence ofμ-geometric ergodicity withμof product-form is the convergence of the Laplace-Stieltjes transforms of the marginal distributions. Consequently all moments converge.

Characterizations of Poisson traffic streams in Jackson queueing networks

1979 ◽  
Vol 11 (02) ◽  
pp. 422-438 ◽  
Author(s):  
Benjamin Melamed
Keyword(s):  
Queueing Networks ◽  
Simple Graph ◽  
Single Server ◽  
Jackson Network ◽  
Jackson Networks ◽  
Equilibrium Behavior ◽  
Poisson Arrivals ◽  
Stochastic Properties ◽  
Networks Of Queues ◽  
Traffic Processes

The equilibrium behavior of Jackson queueing networks (Poisson arrivals, exponential servers and Bernoulli switches) has recently been investigated in some detail. In particular, it was found that in equilibrium, the traffic processes on the so-called exit arcs of a Jackson network with single server nodes constitute Poisson processes—a result extending Burke's theorem from single queues to networks of queues. A conjecture made by Burke and others contends that the traffic processes on non-exit arcs cannot be Poisson in equilibrium. This paper proves this conjecture to be true for a variety of Jackson networks with single server nodes. Subsequently, a number of characterizations of the equilibrium traffic streams on the arcs of open Jackson networks emerge, whereby Poisson-related stochastic properties of traffic streams are shown to be equivalent to a simple graph-theoretical property of the underlying arcs. These results then help to identify some inherent limitations on the feasibility of equilibrium decompositions of Jackson networks, and to point out conditions under which further decompositions are ‘approximately’ valid.

A tandem Jackson network with feedback to the first node

1991 ◽  
Vol 9 (4) ◽  
pp. 337-351 ◽  
Author(s):  
Jonathan Brandon ◽  
Uri Yechiali
Keyword(s):  
Jackson Network

Stochastic Monotonicities in Jackson Queueing Networks

1997 ◽  
Vol 11 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Torgny Lindvall
Keyword(s):  
Queueing Networks ◽  
Queueing Network ◽  
Zero Point ◽  
Monotonicity Property ◽  
Stochastic Monotonicity ◽  
Property A ◽  
Jackson Network ◽  
Queueing Process ◽  
Network Process ◽  
Number Of Customers

When starting from 0, a standard M/M/k queueing process has a second-order stochastic monotonicity property of a strong kind: its increments are stochastically decreasing (the SDI property). A first attempt to generalize this to the Jackson queueing network fails. This gives us reason to reexamine the underlying theory for stochastic monotonicity of Markov processes starting from a zero-point, in order to find a condition on a function of a Jackson network process to have the SDI property. It turns out that the total number of customers at time t has the desired property, if the network is idle at time O. We use couplings in our analysis; they are also of value in the comparison of two networks with different parameters.

The synchronization of Poisson processes and queueing networks with service and synchronization nodes

2000 ◽  
Vol 32 (03) ◽  
pp. 824-843 ◽  
Author(s):  
Balaji Prabhakar ◽  
Nicholas Bambos ◽  
T. S. Mountford
Keyword(s):  
Queueing Networks ◽  
Queue Length ◽  
Poisson Processes ◽  
Finite Capacity ◽  
Random Input ◽  
Jackson Network ◽  
Limiting Behavior ◽  
Network Output ◽  
Poisson Arrivals ◽  
Buffer Capacities

This paper investigates the dynamics of a synchronization node in isolation, and of networks of service and synchronization nodes. A synchronization node consists of M infinite capacity buffers, where tokens arriving on M distinct random input flows are stored (there is one buffer for each flow). Tokens are held in the buffers until one is available from each flow. When this occurs, a token is drawn from each buffer to form a group-token, which is instantaneously released as a synchronized departure. Under independent Poisson inputs, the output of a synchronization node is shown to converge weakly (and in certain cases strongly) to a Poisson process with rate equal to the minimum rate of the input flows. Hence synchronization preserves the Poisson property, as do superposition, Bernoulli sampling and M/M/1 queueing operations. We then consider networks of synchronization and exponential server nodes with Bernoulli routeing and exogenous Poisson arrivals, extending the standard Jackson network model to include synchronization nodes. It is shown that if the synchronization skeleton of the network is acyclic (i.e. no token visits any synchronization node twice although it may visit a service node repeatedly), then the distribution of the joint queue-length process of only the service nodes is product form (under standard stability conditions) and easily computable. Moreover, the network output flows converge weakly to Poisson processes. Finally, certain results for networks with finite capacity buffers are presented, and the limiting behavior of such networks as the buffer capacities become large is studied.

Sign in / Sign up

Export Citation Format

Share Document