Simulation of Response Times in Finite-Capacity Open Networks of Queues

1978 ◽  
Vol 26 (5) ◽  
pp. 896-914 ◽  
Author(s):  
Donald L. Iglehart ◽  
Gerald S. Shedler
Keyword(s):  
Response Times ◽  
Finite Capacity ◽  
Open Networks ◽  
Networks Of Queues

PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION

2017 ◽  
Vol 31 (4) ◽  
pp. 420-435 ◽  
Author(s):  
J.-M. Fourneau ◽  
Y. Ait El Majhoub
Keyword(s):  
Steady State ◽  
Product Form ◽  
Processor Sharing ◽  
Service Capacity ◽  
Steady State Distribution ◽  
State Distribution ◽  
Signal Arrival ◽  
Open Networks ◽  
Networks Of Queues

We consider open networks of queues with Processor-Sharing discipline and signals. The signals deletes all the customers present in the queues and vanish instantaneously. The customers may be usual customers or inert customers. Inert customers do not receive service but the servers still try to share the service capacity between all the customers (inert or usual). Thus a part of the service capacity is wasted. We prove that such a model has a product-form steady-state distribution when the signal arrival rates are positive.

Open Networks of Queues with Blocking: Split and Merge Configurations:

1986 ◽  
Vol 18 (3) ◽  
pp. 251-261 ◽  
Author(s):  
Tayfur Altiok ◽  
H. G. Perros
Keyword(s):  
Open Networks ◽  
Split And Merge ◽  
Networks Of Queues

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

Finite Capacity Queue with Postponed Customers

2018 ◽  
Vol 9 (11) ◽  
pp. 1671-1680
Author(s):  
Rinsy Thomas ◽  
Susha D.
Keyword(s):  
Finite Capacity ◽  
Finite Capacity Queue
Sign in / Sign up

Export Citation Format

Share Document