Notes on the stability of closed queueing networks

1989 ◽  
Vol 26 (3) ◽  
pp. 678-682 ◽  
Author(s):  
Karl Sigman
Keyword(s):  
Service Time ◽  
Continuous Time ◽  
Queueing Networks ◽  
Queue Length ◽  
Sufficient Conditions ◽  
Time Process ◽  
Closed Queueing Networks ◽  
The Stability ◽  
General Service ◽  
Residual Service

A new proof of the stability of closed Jackson-type queueing networks (with general service-time distributions) is given and sufficient conditions are given for obtaining Cesaro, weak and total variation convergence of the continuous-time joint queue length and residual service-time process to a limiting distribution. The result weakens the sufficient conditions (for stability) of Borovkov (1986) by allowing more general service-time distributions.

Notes on the stability of closed queueing networks

1989 ◽  
Vol 26 (03) ◽  
pp. 678-682 ◽  
Author(s):  
Karl Sigman
Keyword(s):  
Service Time ◽  
Continuous Time ◽  
Queueing Networks ◽  
Queue Length ◽  
Sufficient Conditions ◽  
Time Process ◽  
Closed Queueing Networks ◽  
The Stability ◽  
General Service ◽  
Residual Service

A new proof of the stability of closed Jackson-type queueing networks (with general service-time distributions) is given and sufficient conditions are given for obtaining Cesaro, weak and total variation convergence of the continuous-time joint queue length and residual service-time process to a limiting distribution. The result weakens the sufficient conditions (for stability) of Borovkov (1986) by allowing more general service-time distributions.

scholarly journals Stability and Stabilization of Continuous-Time Markovian Jump Singular Systems with Partly Known Transition Probabilities

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jumei Wei ◽  
Rui Ma
Keyword(s):  
Continuous Time ◽  
Controller Design ◽  
Partial Information ◽  
Transition Probabilities ◽  
Singular Systems ◽  
Sufficient Conditions ◽  
Linear Matrix ◽  
Markovian Jump ◽  
Stability And Stabilization ◽  
The Stability

This paper investigates the problem of the stability and stabilization of continuous-time Markovian jump singular systems with partial information on transition probabilities. A new stability criterion which is necessary and sufficient is obtained for these systems. Furthermore, sufficient conditions for the state feedback controller design are derived in terms of linear matrix inequalities. Finally, numerical examples are given to illustrate the effectiveness of the proposed methods.

scholarly journals Assessing an intuitive condition for stability under a range of traffic conditions via a generalised Lu-Kumar network

2000 ◽  
Vol 37 (03) ◽  
pp. 890-899 ◽  
Author(s):  
José Niño-Mora ◽  
Kevin D. Glazebrook
Keyword(s):  
Stability Condition ◽  
Queueing Networks ◽  
Sufficient Conditions ◽  
Rate Condition ◽  
Multiclass Queueing Networks ◽  
Traffic Conditions ◽  
Peak Rate ◽  
Multiclass Queueing ◽  
Service Stations ◽  
The Stability

We argue the importance both of developing simple sufficient conditions for the stability of general multiclass queueing networks and also of assessing such conditions under a range of assumptions on the weight of the traffic flowing between service stations. To achieve the former, we review a peak-rate stability condition and extend its range of application and for the latter, we introduce a generalisation of the Lu–Kumar network on which the stability condition may be tested for a range of traffic configurations. The peak-rate condition is close to exact when the between-station traffic is light, but degrades as this traffic increases.

Strong Approximations of Irreducible Closed Queueing Networks

1997 ◽  
Vol 29 (2) ◽  
pp. 498-522 ◽  
Author(s):  
Hanqin Zhang
Keyword(s):  
Queueing Networks ◽  
Queue Length ◽  
Rates Of Convergence ◽  
Closed Queueing Networks ◽  
Brownian Motions ◽  
Strong Approximations ◽  
Queue Lengths

A sequence of irreducible closed queueing networks is considered in this paper. We obtain that the queue length processes can be approximated by reflected Brownian motions. Using these approximations, we get rates of convergence of the distributions of queue lengths.

On stability of state-dependent queues and acyclic queueing networks

1989 ◽  
Vol 21 (3) ◽  
pp. 681-701 ◽  
Author(s):  
Nicholas Bambos ◽  
Jean Walrand
Keyword(s):  
Queueing Networks ◽  
Sufficient Conditions ◽  
Service Rate ◽  
Single Server ◽  
General Function ◽  
State Dependent ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Periodic Inputs ◽  
Networks Of Queues

We consider a single server first-come-first-served queue with a stationary and ergodic input. The service rate is a general function of the workload in the queue. We provide the necessary and sufficient conditions for the stability of the system and the asymptotic convergence of the workload process to a finite stationary process at large times. Then, we consider acyclic networks of queues in which the service rate of any queue is a function of the workloads of this and of all the preceding queues. The stability problem is again studied. The results are then extended to analogous systems with periodic inputs.

On stability of state-dependent queues and acyclic queueing networks

1989 ◽  
Vol 21 (03) ◽  
pp. 681-701 ◽  
Author(s):  
Nicholas Bambos ◽  
Jean Walrand
Keyword(s):  
Queueing Networks ◽  
Sufficient Conditions ◽  
Service Rate ◽  
Single Server ◽  
General Function ◽  
State Dependent ◽  
The Stability ◽  
Necessary And Sufficient ◽  
Periodic Inputs ◽  
Networks Of Queues

We consider a single server first-come-first-served queue with a stationary and ergodic input. The service rate is a general function of the workload in the queue. We provide the necessary and sufficient conditions for the stability of the system and the asymptotic convergence of the workload process to a finite stationary process at large times. Then, we consider acyclic networks of queues in which the service rate of any queue is a function of the workloads of this and of all the preceding queues. The stability problem is again studied. The results are then extended to analogous systems with periodic inputs.

scholarly journals Analysis of Closed Queueing Networks with Batch Service

2020 ◽  
Vol 20 (4) ◽  
pp. 527-533
Author(s):  
Elena P. Stankevich ◽  
◽  
Igor E. Tananko ◽  
Vitalii I. Dolgov ◽  
◽  
...  
Keyword(s):  
Markov Chain ◽  
Continuous Time ◽  
Queueing Networks ◽  
Manufacturing Systems ◽  
Queueing Network ◽  
Transport Systems ◽  
Batch Service ◽  
Single Server ◽  
Closed Queueing Networks ◽  
Number Of Customers

We consider a closed queuing network with batch service and movements of customers in continuous time. Each node in the queueing network is an infinite capacity single server queueing system under a RANDOM discipline. Customers move among the nodes following a routing matrix. Customers are served in batches of a fixed size. If a number of customers in a node is less than the size, the server of the system is idle until the required number of customers arrive at the node. An arriving at a node customer is placed in the queue if the server is busy. The batсh service time is exponentially distributed. After a batсh finishes its execution at a node, each customer of the batch, regardless of other customers of the batch, immediately moves to another node in accordance with the routing probability. This article presents an analysis of the queueing network using a Markov chain with continuous time. The qenerator matrix is constructed for the underlying Markov chain. We obtain expressions for the performance measures. Some numerical examples are provided. The results can be used for the performance analysis manufacturing systems, passenger and freight transport systems, as well as information and computing systems with parallel processing and transmission of information.

Sign in / Sign up

Export Citation Format

Share Document