Network calculus is a deterministic queuing theory that has gained increasing attention in recent time. Founded on min-plus algebra it resorts to intuitive convolution formulae for efficient concatenation of servers and derivation of related performance bounds. Yet, the pessimistic worst-case analysis of deterministic network calculus gave rise to probabilistic counterparts that aim at utilizin...

A random walk that is skip-free to the left can only move down one level at a time but can skip up several levels. Such random walk features prominently in many places in applied probability including queuing theory and the theory of branching processes. This article exploits the special structure in this class of random walk to obtain a number of simplified derivations for results that are muc...

Previous covering models for emergency service consider all the calls to be of the same importance and impose the same waiting time constraints independently of the service's priority. This type of constraint is clearly inappropriate in many contexts. For example, in urban medical emergency services, calls that involve danger to human life deserve higher priority over calls for more routine inc...

A queuing system, is a dynamical system whose state evolves in time by the occurrence of events at possibly irregular time intervals. Placetransitions Petri nets (commonly called Petri nets) are a graphical and mathematical modeling tool applicable to queuing systems in order to represent its states evolution. Timed Petri nets are an extension of Petri nets, where now the timing at which the st...

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

The paper is devoted on computer simulation of rare event probability, which is a critical issue in areas such as reliabilities, telecommunications, aircraft management, etc. This means that it is necessary to evaluate probabilityties less than 10, which is unreasonable to be simulated with standard Monte Carlo approach. M/M/1/N queuing system and tandem queuing system are under investigation w...

In cellular systems there is usually an overlap cell coverage area (area covered by two or more base stations) which has valuable practical applications. Particularly, it permits the queuing of handover requests as a handover prioritization scheme. The modeling of the sojourn time in the overlap area is a topic which is not sufficiently explored, and even less is the effect it may have on the p...

In CT examination, the emergency patients (EPs) have highest priorities in the queuing system and thus the general patients (GPs) have to wait for a long time. This leads to a low degree of satisfaction of the whole patients. The aim of this study is to improve the patients' satisfaction by designing new queuing strategies for CT examination. We divide the EPs into urgent type and emergency typ...

We model some lossless queuing systems arising in guaranteed service networks as non-linear min-plus systems that can be bounded by linear systems. We introduce the distinction between space and time methods for such systems. Space methods are related to min-plus system theory, while time methods borrow from dynamic programming and exploit the causality of the operators. We apply this to the wi...