This paper studies the instability of multiclass queueing networks. We prove that if a uid limit model of the queueing network is weakly unstable, then the queueing network is unstable in the sense that the total number of customers in the queueing network diverges to innnity with probability one as time t ! 1. Our result provides a converse to a recent result of Dai 2] which states that a queu...

Determination of the stability behavior of a queueing network is an important part of analyzing such systems. In Gamarnik and Hasenbein (2005) it is shown if a fluid network has the finite decomposition property (FDP) and is not weakly stable, then any queueing network associated with the fluid network is not rate stable. In that paper the FDP was demonstrated for two station queueing networks ...

Fair queueing has long been a popular paradigm for providing bounded delay channel access and separation between ows in wireline networks. However, adapting fair queueing to the wireless domain is non-trivial because of the unique problems in wireless channels such as location-dependent and bursty channel error. In this article, we identify the key issues in wireless fair queueing, deene a wire...

1 Fundamental Concepts of Queueing Theory. Culate the main performance measures immediately by using the pdf version of the book in a WWW. Ivo Adan and Jacques Resing. Department of Mathematics and Computing Science. Queueing theory is the study of waiting in all these various guises. departure project pdf format process queueing theory Refers to the order in which members of the project manage...

Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to invert probability generating functions, since most important distributions in discrete-time queueing systems can be determined in the form of probability generating functions. In this paper, we calculate the tail probabil...

This paper gives an overview of those aspects of simulation methodology that are (to some extent) peculiar to the simulation of queueing systems. A generalized semi-Markov process framework for describing queueing systems is used through much of the paper. The main topics covered are: output analysis for simulation of transient and steady-state quantities, variance reduction methods that exploi...

The subject of this paper is stability properties of adversarial queueing networks. Such queueing systems are used to model packet switch communication networks, in which packets are generated and routed dynamically, and have become a subject of research focus recently. Adversarial queueing networks are defined to be stable, if the number of packets stays bounded over time. A central question i...

In this paper, an overview of different analytic queueing models for traffic on road networks is presented. In the literature, it has been shown that queueing models can be used to adequately model uninterrupted traffic flows. This paper gives a broad review on this literature. Moreover, it is shown that the developed published methodologies (which are mainly single node oriented) can be extend...

The classical Erlang and Engset loss models have been used extensively in the traffic engineering of traditional telephone exchanges. More recently, these models have been generalized to the so-called loss networks, which provide models for resource sharing in multiservice telecommunication networks. In this paper, we introduce a new generalized class of models, queueing-loss networks, which ca...