scholarly journals Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks

2017 ◽  
Vol 51 (3) ◽  
pp. 823-840 ◽  
Author(s):  
Carolina Osorio ◽  
Jana Yamani
Keyword(s):  
Queueing Networks ◽  
Finite Capacity ◽  
Scalable Analysis

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.

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

2000 ◽  
Vol 32 (3) ◽  
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.

Stochastic control over finite capacity channels: Causality and feedback

2009 ◽  
Author(s):  
Charalambos D. Charalambous ◽  
Christos K. Kourtellaris ◽  
Photios Stavrou
Keyword(s):  
Stochastic Control ◽  
Finite Capacity
Sign in / Sign up

Export Citation Format

Share Document