Abstract

To describe the congestion in large-scale service systems, we introduce and analyze a non-Markovian open network of many-server fluid queues with customer abandonment, proportional routing and time-varying model elements. A proportion of the fluid completing service at each queue is routed immediately to each other queue, while the fluid not routed to other queues leaves the network. The fluid queue network serves as an approximation for the corresponding non-Markovian open network of many-server queues with Markovian routing, where all model elements may be time varying. We establish the existence of a unique vector of (net) arrival rate functions at each queue and the associated time-varying performance. In doing so, we provide the basis for an efficient algorithm, even for networks with many queues. Key words: queues with time-varying arrivals; queueing networks; many-server queues; deterministic fluid model; customer abandonment; non-Markovian queues. History: Submitted on February 7, 2010 1.

Citations