Consider a queueing network with N nodes in which queue lengths are balanced through meanfield interaction. When N is large, we study the performance of such a network in terms of limiting results as N goes to infinity.

No abstract

Motivated by applications in manufacturing systems and computer networks, in this paper, we consider a tandem queue with feedback. In this model, the i.i.d. interarrival times and the i.i.d. service times are both exponential and independent. Upon completion of a service at the second station, the customer either leaves the system with probability p or goes back, together with all customers currently waiting in the second queue, to the first queue with probability 1 − p. For any fixed number of customers in one queue (either queue 1 or queue 2), using newly developed methods we study properties of the exactly geometric tail asymptotics as the number of customers in the other queue increases to infinity. We hope that this work can serve as a demonstration of how to deal with a block generating function of GI/M/1 type, and an illustration of how the boundary behaviour can affect the tail decay rate.

Consider a queueing network with a large number [Formula: see text] nodes, in which each queue has a dedicated input stream, and, in addition, there is an extra input stream, balancing the network load by directing its arrivals to the shortest queue(s). A mean field interaction model is set up to study the performance of this network in terms of limiting results. One of our results shows that the stationary behavior of any of the queues is approximated by that of the [Formula: see text] queue with a modified arrival rate when the queue length is around zero.