Abstract
In this paper we study the M/M/1 queueing model with retrial on network. We derive the steady state probability of customers in the network, the average number of customers in the all the three nodes in the system, the queue length, system length using little’s formula. The particular case is derived (no retrial). The numerical examples are given to test the correctness of the model.
Highlights
A queue is a waiting line of people or things to be handled in a sequential order
Queueing network can be described as a group of nodes, where each node represents a service facility
Queueing networks were first introduced by James
Summary
A queue is a waiting line of people or things to be handled in a sequential order. A.K. Queueing networks can be classified as open, closed and mixed networks. The concept of retrial queues was first introduced by Kosten [8] in 1947.Cohen [2] analyzed the basic problems of telephone traffic theory. In constant retrial policy the repeated customers form a queue in orbit and only the customer at the head of the orbit can request a service after a random retrial time. Santhakumaran and Shanmugasundaram [12] have discussed a single server retrial queue with feedback. Mohamed Boualem [10] et al have analyzed a single server feedback retrial queue. Shanmugasundaram and Vanitha [13] have analyzed an open queueing network system in healthcare .In this paper we consider an open queueing network with classical retrial policy
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
