The design of general finite multi-server queueing networks is a challenging problem that arises in many real-life situations, including computer networks, manufacturing systems, and telecommunication networks. In this paper, we examine the optimal routing problem in arbitrary configured acyclic queueing networks. The performance of the finite queueing network is evaluated with a known approxim...

In this paper we provide a framework for analyzing network traffic traces through trace-driven queueing. We also introduce several queueing metrics together with the associated visualization tools (some novel) that provide insight into the traffic features and facilitate comparisons between traces. Some techniques for non-stationary data are discussed. Applying our framework to both real and sy...

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

Dynamic scheduling problems consist of both challenging combinatorics, as found in classical scheduling problems, and stochastics due to uncertainty about the arrival times, resource requirements, and processing times of jobs. To address these two challenges, we investigate the integration of queueing theory and scheduling. The former reasons about long-run stochastic system characteristics, wh...

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to computer and communication queueing systems. Recent empirical studies show that fairness is highly important to queueing customers in actual situations. Despite this importance, queueing theory has devoted very little effo...

Network calculus is a theory dealing with queueing type problems encountered in computer networks, with particular focus on quality of service guarantee analysis. Queueing theory is the mathematical study of queues, proven to be applicable to a wide area of problems, generally concerning about the (average) quantities in an equilibrium state. Since both network calculus and queueing theory are ...

Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to computer and communication queueing systems. Recent empirical studies show that fairness is highly important to queueing customers in practical scenarios. Despite this importance, queueing theory has devoted very little ef...

In this paper, we derive worst case bounds on delay and backlog for non-preemptive priority queueing systems using network calculus. There are known results for the average behaviour of non-preemptive priority queueing systems from traditional queueing theory. By use of numerical investigations, we compare our worst case bounds to those average behaviour results in order to give a feel as to ho...

This paper studies effect of packet scheduling algorithms at routers on media synchronization quality in live audio and video transmission by experiment. In the experiment, we deal with four packet scheduling algorithms: First-In FirstOut, Priority Queueing, Class-Based Queueing and Weighted Fair Queueing. We assess the synchronization quality of both intra-stream and inter-stream with and with...

In this paper, we rst formally identify a FIFO uid network that corresponds to the queueing network under a rst-in rst-out (FIFO) service discipline, thus complementing the result of Dai (1995a) for the use of the uid model for the stability of a multiclass queueing network under a FIFO service discipline. Then we establish two suucient conditions for the stability of a multiclass FIFO queueing...