Lyapunov matrix based necessary and sufficient stability condition by finite number of mathematical operations for retarded type systems

Automatica ◽  
2019 ◽  
Vol 108 ◽  
pp. 108475 ◽  
Author(s):  
Marco A. Gomez ◽  
Alexey V. Egorov ◽  
Sabine Mondié
Keyword(s):  
Finite Number ◽  
Stability Condition ◽  
Type Systems ◽  
Sufficient Stability Condition ◽  
Sufficient Stability ◽  
Lyapunov Matrix ◽  
Necessary And Sufficient ◽  
Mathematical Operations

Stability condition for a single-server retrial queue

1993 ◽  
Vol 25 (03) ◽  
pp. 690-701 ◽  
Author(s):  
Huei-Mei Liang ◽  
V. G. Kulkarni
Keyword(s):  
Stability Condition ◽  
Service Time ◽  
Retrial Queue ◽  
Arrival Rate ◽  
Retrial Queues ◽  
Single Server ◽  
Sufficient Stability Condition ◽  
Sufficient Stability ◽  
The Mean ◽  
The Stability

A single-server retrial queue consists of a primary queue, an orbit and a single server. Assume the primary queue capacity is 1 and the orbit capacity is infinite. Customers can arrive at the primary queue either from outside the system or from the orbit. If the server is busy, the arriving customer joins the orbit and conducts a retrial later. Otherwise, he receives service and leaves the system. We investigate the stability condition for a single-server retrial queue. Let λ be the arrival rate and 1/μ be the mean service time. It has been proved that λ / μ < 1 is a sufficient stability condition for the M/G /1/1 retrial queue with exponential retrial times. We give a counterexample to show that this stability condition is not valid for general single-server retrial queues. Next we show that λ /μ < 1 is a sufficient stability condition for the stability of a single-server retrial queue when the interarrival times and retrial times are finite mixtures of Erlangs.

Sign in / Sign up

Export Citation Format

Share Document