The aim of the present paper is to give a collection of some important results of finite-source queueing systems and their applications in solving several practical problems. Its main contribution is the bibliography of recent papers and books collected from diŽerent databases and private sources. It concentrates on both theoretical and practical developments and tries to supplement of several review papers devoted mainly to cyclic queues or manufacturing system modeling.

Traffic Theory and Queueing Systems

Traffic Theory and Queueing Systems

Traffic Theory and Queueing Systems 2

I2DES: Cassandras & Lafortune: 'Introduction to Discrete Event Systems' Boudec: Jean-Yves Le Boudec and Patrick Thiran: 'NETWORK CALCULUS, A Theory of Deterministic Queueing Systems for the Internet' Chang: Cheng-Shang Chang: 'Performance Guarantees in Communication networks'

Queueing Notes

average customer in queue q N and the mean residual time R as seen by an arriving customer are also equal to the average number in queue and mean residual time seen by an outside observer at a random time.

Single Queueing Systems

In computer communication networks standard packages called cells are transmitted over links from one switch to the next. In each switch incoming cells can be buered when the incoming demand exceeds the link capacity. Once the buer is full incoming cells will be lost.

Network Calculus: A Theory of Deterministic Queuing Systems for the Internet

Network Calculus: A Theory of Deterministic Queuing Systems for the Internet