Analysis of assembly/disassembly queueing networks with blocking after service and general service times

2014 ◽  
Vol 226 (1) ◽  
pp. 417-441 ◽  
Author(s):  
Michael Manitz
Keyword(s):  
Queueing Networks ◽  
General Service Times ◽  
Service Times ◽  
General Service

scholarly journals Cyclic queueing networks with subexponential service times

2004 ◽  
Vol 41 (03) ◽  
pp. 791-801
Author(s):  
H. Ayhan ◽  
Z. Palmowski ◽  
S. Schlegel
Keyword(s):  
Queueing Networks ◽  
Time Distribution ◽  
Waiting Times ◽  
Queueing Network ◽  
Service Time Distribution ◽  
Tail Behavior ◽  
Cycle Times ◽  
General Service Times ◽  
Service Times ◽  
General Service

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

scholarly journals Cyclic queueing networks with subexponential service times

2004 ◽  
Vol 41 (3) ◽  
pp. 791-801 ◽  
Author(s):  
H. Ayhan ◽  
Z. Palmowski ◽  
S. Schlegel
Keyword(s):  
Queueing Networks ◽  
Time Distribution ◽  
Waiting Times ◽  
Queueing Network ◽  
Service Time Distribution ◽  
Tail Behavior ◽  
Cycle Times ◽  
General Service Times ◽  
Service Times ◽  
General Service

For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.

Lower bounds for the probability of overload in certain queueing networks

1985 ◽  
Vol 22 (02) ◽  
pp. 429-436 ◽  
Author(s):  
Marek Kanter
Keyword(s):  
Queueing Networks ◽  
Stochastic Order ◽  
Temporal Development ◽  
Time Points ◽  
Open Queueing Networks ◽  
General Service Times ◽  
Finite Set ◽  
Initial Distributions ◽  
General Service ◽  
Markov Population Processes

Conservative estimates for the probability that open queueing networks are not overloaded during any finite set of time points are derived. The queueing networks have infinitely many servers at each queue and general service times. A key preliminary result is that for multidimensional Markov population processes, the correspondence between initial distributions and their temporal development preserves stochastic order.

Sign in / Sign up

Export Citation Format

Share Document