Modeling and performance prediction are becoming increasingly important issues in the design and operation of computer communications systems. Complexities in their configuration and sophistications in resource sharing found in today’s computer communications demand our intensive ffort to enhance the modeling capability. The present paper is intended to review the state of affairs of analytic m...

In many queueing systems the server processes several customers simultaneously. Although the capacity of a batch, that is the number of customers that can be processed simultaneously, is often variable in practice, nearly all batch-service queueing models in literature consider a constant capacity. In this paper, we extend previous work on a batch-service queueing model with variable server cap...

During the last two decades, several authors have identified several classes of queueing networks (with batch movements, negative customers, signals etc.) that have product-form stationary distributions. On the contrary, there is a very slow progress in the analytic investigation of queueing networks with retrials and there does not exist a single example of such a network with a product-form s...

In this paper we consider a queueing model extension for a manufacturing cell composed of a machining center and several parallel downstream production stations under a rotation rule. A queueing model is extended with the arrival processes of negative customers to take into account failures of production stations, reorganization of works and disasters in the manufacturing cell. We present an ex...

In this paper, we propose the use of a control theoretical approach for a fast and robust fair share computation for a class of fair queueing algorithms based on the Scalable Core (SCORE)/Dynamic Packet State (DPS) architecture. Our proposed approach is generic and can be applied to other SCORE/DPS fair queueing algorithms with little modifications. For purpose of illustration, we applied the L...

Instability in packet-switching networks is normally associated with overload conditions, since queueing network models show that, in simple configurations, only overload generates instability. However, some results showing that instability can happen also in underloaded queueing networks appeared in the recent literature. Underload instabilities can be produced by complex scheduling algorithms...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy STOCHASTIC OPTIMIZATION AND ITS APPLICATION TO COMMUNICATION NETWORKS AND THE SMART GRID By Zongrui Ding August 2012 Chair: Dapeng Wu Major: Electrical and Computer Engineering The scheduling of some practical systems is highly affected ...

In most queueing systems the server may be subjected to lengthy and unpredictable breakdowns while serving a customer. For instance, in manufacturing systems the machine may breakdown due to malfunction or job related problems; in computer systems, the machine may be subject to scheduled backups and predicted failures. In these systems, server breakdown results in a period of server unavailabil...

Blocking in queueing network models with nite capacities can lead to deadlock situations. In this paper, deadlock properties are investigated in queueing networks with multiple routing chains. The necessary and suucient conditions for deadlock-free queueing networks with blocking are provided. An optimization algorithm is presented for nding deadlock-free capacity assignments with the least tot...

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be presented in the network can not exceed a given value K. Customers arriving at the queueing network when there are more than K customers are forced to wait in an external queue. The arrival process to the queueing network is assumed to be arbitrary. We sho...