Queueing analysis is a vital tool used in the evaluation of system performance. Applications of queueing analysis cover a wide spectrum from bank automated teller machines to transportation and communications data networks. Fully revised, this second edition of a popular book contains the significant addition of a new chapter on Flow & Congestion Control and a section on Network Calculus among other new sections that have been added to remaining chapters. An introductory text, Queueing Modelling Fundamentals focuses on queueing modelling techniques and applications of data networks, examining the underlying principles of isolated queueing systems. This book introduces the complex queueing theory in simple language/proofs to enable the reader to quickly pick up an overview to queueing theory without utilizing the diverse necessary mathematical tools. It incorporates a rich set of worked examples on its applications to communication networks. Features include: Fully revised and updated edition with significant new chapter on Flow and Congestion Control as-well-as a new section on Network Calculus A comprehensive text which highlights both the theoretical models and their applications through a rich set of worked examples, examples of applications to data networks and performance curves Provides an insight into the underlying queuing principles and features step-by-step derivation of queueing results Written by experienced Professors in the field Queueing Modelling Fundamentals is an introductory text for undergraduate or entry-level post-graduate students who are taking courses on network performance analysis as well as those practicing network administrators who want to understand the essentials of network operations. The detailed step-by-step derivation of queueing results also makes it an excellent text for professional engineers.

The definitive guide to queueing theory and its practical applications—features numerous real-world examples of scientific, engineering, and business applications Thoroughly updated and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fifth Edition presents the statistical principles and processes involved in the analysis of the probabilistic nature of queues. Rather than focus narrowly on a particular application area, the authors illustrate the theory in practice across a range of fields, from computer science and various engineering disciplines to business and operations research. Critically, the text also provides a numerical approach to understanding and making estimations with queueing theory and provides comprehensive coverage of both simple and advanced queueing models. As with all preceding editions, this latest update of the classic text features a unique blend of the theoretical and timely real-world applications. The introductory section has been reorganized with expanded coverage of qualitative/non-mathematical approaches to queueing theory, including a high-level description of queues in everyday life. New sections on non-stationary fluid queues, fairness in queueing, and Little’s Law have been added, as has expanded coverage of stochastic processes, including the Poisson process and Markov chains. • Each chapter provides a self-contained presentation of key concepts and formulas, to allow readers to focus independently on topics relevant to their interests • A summary table at the end of the book outlines the queues that have been discussed and the types of results that have been obtained for each queue • Examples from a range of disciplines highlight practical issues often encountered when applying the theory to real-world problems • A companion website features QtsPlus, an Excel-based software platform that provides computer-based solutions for most queueing models presented in the book. Featuring chapter-end exercises and problems—all of which have been classroom-tested and refined by the authors in advanced undergraduate and graduate-level courses—Fundamentals of Queueing Theory, Fifth Edition is an ideal textbook for courses in applied mathematics, queueing theory, probability and statistics, and stochastic processes. This book is also a valuable reference for practitioners in applied mathematics, operations research, engineering, and industrial engineering.

Waiting in lines is a staple of everyday human life. Without really noticing, we are doing it when we go to buy a ticket at a movie theater, stop at a bank to make an account withdrawal, or proceed to checkout a purchase from one of our favorite department stores. Oftentimes, waiting lines are due to overcrowded, overfilling, or congestion; any time there is more customer demand for a service than can be provided, a waiting line forms. Queuing systems is a term used to describe the methods and techniques most ideal for measuring the probability and statistics of a wide variety of waiting line models. This book provides an introduction to basic queuing systems, such as M/M/1 and its variants, as well as newer concepts like systems with priorities, networks of queues, and general service policies. Numerical examples are presented to guide readers into thinking about practical real-world applications, and students and researchers will be able to apply the methods learned to designing queuing systems that extend beyond the classroom. Very little has been published in the area of queuing systems, and this volume will appeal to graduate-level students, researchers, and practitioners in the areas of management science, applied mathematics, engineering, computer science, and statistics.

This accessible book aims to collect in a single volume the essentials of stochastic networks. Stochastic networks have become widely used as a basic model of many physical systems in a diverse range of fields. Written by leading authors in the field, this book is meant to be used as a reference or supplementary reading by practitioners in operations research, computer systems, communications networks, production planning, and logistics.

This is a graduate level textbook that covers the fundamental topics in queuing theory. The book has a broad coverage of methods to calculate important probabilities, and gives attention to proving the general theorems. It includes many recent topics, such as server-vacation models, diffusion approximations and optimal operating policies, and more about bulk-arrival and bull-service models than other general texts. - Current, clear and comprehensive coverage - A wealth of interesting and relevant examples and exercises to reinforce concepts - Reference lists provided after each chapter for further investigation

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems. It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered. Applied Discrete-Time Queues targets researchers, advanced-level students and analysts in the field of telecommunication networks. It is suitable as a reference book and can also be used as a secondary text book in computer engineering and computer science. Examples and exercises are included.

Written with computer scientists and engineers in mind, this book brings queueing theory decisively back to computer science.