A path-breaking account of Markov decision processes-theory and computation This book's clear presentation of theory, numerous chapter-end problems, and development of a unified …
The objective of this book is to collect in a single volume the essentials of stochastic networks, from the classical product-form theory to the more re cent developments such as …
Communication networks underpin our modern world, and provide fascinating and challenging examples of large-scale stochastic systems. Randomness arises in …
Provides a modern mathematical approach to the design of communication networks for graduate students, blending control, optimization, and stochastic network theories. A broad …
RR Weber, S Stidham - Advances in applied probability, 1987 - cambridge.org
We prove a monotonicity result for the problem of optimal service rate control in certain queueing networks. Consider, as an illustrative example, a number of·/M/1 queues which …
This handbook aims to highlight fundamental, methodological and computational aspects of networks of queues to provide insights and to unify results that can be applied in a more …
We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of …
We consider open and closed multiclass queueing networks, with Poisson arrivals (for open networks), exponentially distributed class dependent service times and class dependent …
We consider the problems of performance analysis and stability/instability determination of queuing networks and scheduling policies. We exhibit a strong duality relationship between …