/i Dewey Working Paper Alfred P. Sloan School of Management Some Badly Behaved Closed Queueing Networks Some Badly Behaved Closed Queueing Networks Received Some Badly Behaved Closed Queueing Networks

نویسندگان

  • Michael Harrison
  • Vien Nguyen
چکیده

We study several variations of a multiclass closed queueinp network model, all closely related to the open priority network of Lu and Kumar. Foi each of our examples it is shown that, as the population size n —• oo, the long-run utilization rate of each server approaches a limit strictly less than one. Thus no "bottleneck station" emerges in the heavy traffic limit. This is analogous to the "bad behavio' ' of open network examples developed by Bramson and by Lu and Kumar, among others, in which queue sizes grow without bound even though each service static^.; has a traffic intensity parameter less than one. Two of the three examples considered here have preemptive-resume priority service disciplines at each station, as in the Lu-Kumar open network example, and one has FIFO service at each station, as in Bramson's open network examples.

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

ثبت نام

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

منابع مشابه

Hd28 .m414 I* Dewey Working Paper Alfred P. Sloan School of Management Heavy Traffic Analysis of a Transportation Network Model Heavy Traffic Analysis of a Transportation Network Model Heavy Traffic Analysis of a Transportation Network Model

We study a model of a stochastic transportation system introduced by Crane. By adapting constructions of multidimensional reflected Brownian motion (RBM) that have since been developed for feedforward queueing networks, we generalize Crane's original functional central limit theorem results to a full \ector setting, giving an explicit development for the case in which all terminals in the model...

متن کامل

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

OPTIMUM SHAPE DESIGN OF DOUBLE-LAYER GRIDS BY QUANTUM BEHAVED PARTICLE SWARM OPTIMIZATION AND NEURAL NETWORKS

In this paper, a methodology is presented for optimum shape design of double-layer grids subject to gravity and earthquake loadings. The design variables are the number of divisions in two directions, the height between two layers and the cross-sectional areas of the structural elements. The objective function is the weight of the structure and the design constraints are some limitations on str...

متن کامل

Some Exact Results on Closed Queueing Networks with Blocking

We obtain equivalencies between closed queueing networks with blocking with respect to buffer capacities and the number of customers in the network. These results can be used in approximations, in the buffer allocation problem as well as to explain the behavior of closed queueing networks with finite buffers. We also present exact efficient solutions for special cases.

متن کامل

Closed queueing networks with finite capacity queues: approximate analysis

Queueing networks with finite capacity queues and blocking are applied to model systems with finite resources and population constraints, such as computer and communication systems, as well as traffic, production and manufacturing systems. Various blocking types can be defined to represent different system behaviors. When a customer attempts to enter a full capacity queue blocking occurs. The a...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008