Algorithms for Time-Varying Networks of Many-Server Fluid Queues

نویسندگان

  • Yunan Liu
  • Ward Whitt
چکیده

Motivated by large-scale service systems with network structure and non-exponential customer abandonment, in a previous paper we introduced a non-Markovian time-varying open network of many-server fluid queues with customer abandonment from each queue and timevarying proportional routing among the queues, and showed how performance functions can be determined. The deterministic fluid model serves as an approximation for the corresponding non-Markovian stochastic network of many-server queues with Markovian routing, experiencing periods of overloading at the queues. In this paper we develop a new algorithm for the previous model and generalize the model to include non-exponential service-time distributions. In this paper we report results of implementing the algorithms and studying their computational complexity. We also conduct simulation experiments to confirm that the algorithms are effective in computing the performance functions and that these performance functions provide useful approximations for the corresponding stochastic models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Network of Time-Varying Many-Server Fluid Queues with Customer Abandonment

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 ...

متن کامل

Many-Server Queues with Time-Varying Arrivals, Customer Abandonment and Non-Exponential Distributions

Many-Server Queues with Time-Varying Arrivals, Customer Abandonment and Non-Exponential Distributions Yunan Liu This thesis develops deterministic heavy-traffic fluid approximations for many-server stochastic queueing models. The queueing models, with many homogenous servers working independently in parallel, are intended to model large-scale service systems such as call centers and health care...

متن کامل

Time-Varying Queues

Service systems abound with queues, but the most natural direct models are often timevarying queues, which require nonstandard analysis methods beyond stochastic textbooks. This paper surveys the literature on time-varying queues. Most of the literature concerns manyserver queues, which arise in large-scale service systems, such as in customer contact centers and hospital emergency departments,...

متن کامل

Linear Stochastic Fluid Networks

We introduce open stochastic fluid networks that can be regarded as continuous analogs or fluid limits of open networks of infinite-server queues. Random exogenous input may come to any of the queues. At each queue, a cdf-valued stochastic process governs the proportion of the input processed by a given time after arrival. The routing may be deterministic (a specified sequence of successive que...

متن کامل

Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations

In this paper, we consider time-varying multi-server queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multi-server queues even if the number of servers is large. To address that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • INFORMS Journal on Computing

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2014