This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...

Queueing Networks are a widely used performance modeling tool that has been successfully applied to evaluate many kind of systems. In this paper we describe the queueing package, a collection of numerical solution algorithms for Queueing Networks and Markov chains written in GNU Octave (an interpreted language for numerical computations). The queueing package allows users to compute steady-stat...

Queueing networks are important models of complex systems, such as packet routing networks, manufacturing systems, and time shared computer systems. In this paper, we investigate the question of stability of multiclass queueing networks within the adversarial queueing theory model, where workload is induced by an adversary. Prior work in the adversarial model considers only a special case of qu...

Queueing is an essential element of traffic management, but the only queueing discipline used in traditional UNIX systems is simple FIFO queueing. This paper describes ALTQ, a queueing framework that allows the use of a set of queueing disciplines. We investigate the issues involved in designing a generic queueing framework as well as the issues involved in implementing various queueing discipl...

Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. By combining the modeling power and expressiveness of queueing networks and stochastic Petri nets, queueing Petri nets provide a number of advantages. In this paper, we present our tool QPME (Queueing Petri net Modeling Environment) for modeling an...

| A digital communication network can be modeled as an adversarial queueing network. An adversarial queueing network is deened to be stable if the number of packets stays bounded over time. A central question is to determine which adversarial queueing networks are stable under every work-conserving packet routing policy. Our main result is that stability of an adversarial queueing network is im...

The product form results recently published for Stochastic Petri Nets are combined with the well known product form results for Queueing Networks in the model formalism of Queueing Petri Nets yielding the class of product form Queueing Petri Nets. This model class includes Stochastic Petri Nets with product form solution and BCMP Queueing Networks as special cases. We introduce an arrival theor...