This tutorial covers various approaches for modeling and analyzing dynamic processes in networks. Modeling the dynamic performance as a stochastic process, we apply tools from discrete and continues timeMarkov processes theory, renewal theory and queueing theory to analyze the long term, steady state, performance of the processes. Nonstochastic approaches include adversarial queueing theory, an...

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

The literature on queueing with reneging is reviewed. Only random (Poisson) arrivals and unlimited capacity queues are considered, although some of the references also contain results for other arrival distributions or finite capacity queues. The paper focuses on the probability of service under steady state conditions; results for other metrics such as the expected waiting time may be found in...

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