Steady State Analysis Of (M/M/1):(Fcfs/K/∞) Queueing Network With Feedback Retrial And Blocking

Abstract

In this research, we study a single server retrial feedback queueing network with blocking. If there is room, external consumers join the queue with probability s; if not, they go to orbit with probability 1-s; if they receive service at node, either the node with probability 1-p or the node with probability p is reached. Similarly, he can choose to leave the system with probability q or join node with probability 1-q after receiving service in node. In the case of node, after obtaining the service (feedback), he either moves to node with the probability 1-r or leaves the system with the probability r.Here, we look at the length of the queue and the waiting time for each of the four nodes. We also examine the scenario both with and without blocking in the steady state. To verify that the model is accurate, numerical examples are provided.