Analysis of Unreliable Jackson-Type Queueing Networks with Dynamic Routing

2016 ◽  
Author(s):  
Elmira Yu. Kalimulina
Keyword(s):  
Queueing Networks ◽  
Dynamic Routing ◽  
Jackson Type

Overall station balance and decomposability for non-Markovian queueing networks

1998 ◽  
Vol 30 (03) ◽  
pp. 870-887 ◽  
Author(s):  
D. Fakinos ◽  
A. Economou
Keyword(s):  
Queueing Networks ◽  
Sufficient Conditions ◽  
Queueing Network ◽  
Necessary And Sufficient Conditions ◽  
Jackson Type ◽  
Necessary And Sufficient ◽  
Markovian Queueing Networks

Introducing the concept of overall station balance which extends the notion of station balance to non-Markovian queueing networks, several necessary and sufficient conditions are given for overall station balance to hold. Next the concept of decomposability is introduced and it is related to overall station balance. A particular case corresponding to a Jackson-type queueing network is considered in some more detail.

Overall station balance and decomposability for non-Markovian queueing networks

1998 ◽  
Vol 30 (3) ◽  
pp. 870-887 ◽  
Author(s):  
D. Fakinos ◽  
A. Economou
Keyword(s):  
Queueing Networks ◽  
Sufficient Conditions ◽  
Queueing Network ◽  
Necessary And Sufficient Conditions ◽  
Jackson Type ◽  
Necessary And Sufficient ◽  
Markovian Queueing Networks

Introducing the concept of overall station balance which extends the notion of station balance to non-Markovian queueing networks, several necessary and sufficient conditions are given for overall station balance to hold. Next the concept of decomposability is introduced and it is related to overall station balance. A particular case corresponding to a Jackson-type queueing network is considered in some more detail.

scholarly journals Analysis and Dynamic Routing Implementation of Hierarcical Healthcare Referral System

2017 ◽  
Vol 1 (1) ◽  
Author(s):  
Khairurizal Alfathdyanto
Keyword(s):  
Patient Preferences ◽  
Queueing Networks ◽  
Queuing Theory ◽  
Community Health Center ◽  
Arrival Rate ◽  
Dynamic Routing ◽  
User Preference ◽  
Referral System ◽  
Maximum Utility ◽  
Routing Performance

Abstract—Hierarchical Healthcare Referral System (HHRS) is implemented by National Insurance Providing Agency (BPJS) as part of the healthcare insurance policies. Patients who want to get health insurance in a hospital should get a referral from the community health center in which they are registered. Congestion of patients happens in certain hospital as there is no policy implemented to govern the referral system. In this paper, HHRS is modeled as a network of queuing system and is analyzed for its queue performances. Analysis of queuing network performances shows the influence patient preferences to buildup congestion of patients in hospitals. Referral is then controlled by means of dynamic routing with considering patient preferences. Estimation of arrival rate is done with hypercube queuing theory which concerns user preference. Simulation shows that patient preferences affect the arrival rate at each hospital, the application of dynamic routing can reduce the maximum utility and reduce the average waiting time, prioritization of patients improve dynamic routing performance on systems with a high workload.Keywords—dynamic routing; hierarchical healthcare referral system; patient priority; queueing networks;

Ergodicity of Jackson-type queueing networks

1994 ◽  
Vol 17 (1-2) ◽  
pp. 5-72 ◽  
Author(s):  
Fran�ois Baccelli ◽  
Serguei Foss
Keyword(s):  
Queueing Networks ◽  
Jackson Type

Dynamic routing for computer queueing networks

1988 ◽  
Vol 19 (6) ◽  
pp. 967-977 ◽  
Author(s):  
N. U. AHMED ◽  
T. E. DABBOUS ◽  
Y. W. LEE
Keyword(s):  
Queueing Networks ◽  
Dynamic Routing
Sign in / Sign up

Export Citation Format

Share Document