This paper presents a new approach to real-time system scheduling. The approach, called real-time queueing theory, includes customer timing requirements into queueing models. With real-time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead-tame profile process where lead-time = deadline minus current time. In spite of the injinite dimensionality o...

Modeling Service Oriented Architecture (SOA) PublishSubscribe (Pub/Sub) message patterns using queueing models is challenging for several reasons. Due to the single source to multiple destination nature of Pub-Sub message distribution. Most queueing models assume a work conserving approach where a pass-thru server does not create jobs. However in the Pub-Sub message pattern, a message can be du...

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

This is a survey of some academic research on telephone call centers. The surveyed research has its origin in, or is related to, queueing theory. Indeed, the “queueing-view” of call centers is both natural and useful. Accordingly, queueing models have served as prevalent standard support tools for call center management. However, the modern call center is a complex socio-technical system. It th...

We use a mathematical model of an open queueing network in heavy traffic. The law of the iterated logarithm for the extreme virtual waiting time of a customer in heavy traffic in open queueing networks has been presented. Finally, we present an application of the theorem a reliability model from computer network practice. Key–Words: mathematical models of technical systems, performance evaluati...

We introduce queueing network models for characterizing and modeling the performance of graph programs. We show that graph programs can be modelled as a queuing network whose behaviour can be mapped to a queueing network of the underlying architecture. Operational analysis of these queueing networks allows us to systematically analyze performance and identify performance bottlenecks. We demonst...

Conventional analysis techniques of queueing systems typically assume that the stochastic process under study is already in steady state. This assumption is, however, not valid if the life cycle of the process is not large enough. Previous work in transient analysis of queueing systems usually focuses on Markov models. This paper, in contrast, presents an analysis technique for investigating tr...

An M/G/1 retrial queueing system with breakdowns have been studied in fuzzy environment. The arrival rate,retrial rate, service rate,failure rate and repair rate of server are all fuzzy numbers. For this model we obtain some system characteristics such as mean orbit size ,mean normal queue size and mean system size. The α cut approach is used to transform fuzzy queues with an unreliable server ...

In this paper we investigate some relations between the Petri net formalism and the queueing networks with blocking. This type of queueing network models are used to represent systems with finite capacity resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in the literature to represent the different behaviours of real syst...

In this paper, we consider a discrete-time multiserver queueing system with infinite buffer size, geometric service times and a FCFS (first-come-first-served) queueing discipline. A relationship between the probability distributions of the system contents and the packet delay is established. The relationship is general in the sense that it doesn’t require knowledge of the exact nature of the ar...