Queues

This is a classic book on Queues. First published in 1961 it is clearly and concisely introduces the theory of queueing systems and is still just as relevant today. The monograph is aimed at both students and operational research workers concerned with the practical investigations of queueing, although almost every statistician will find its contents of interest.

Queueing theory (the mathematical theory of waiting lines in all its configurations) continues to be a standard major area of operations research on the stochastic side. Therefore, universities with an active program in operations research sometimes will have an entire course devoted mainly or entirely to queueing theory, and the course is also taught in computer science, electrical engineering, mathematics, and industrial engineering programs. The basic course in queueing theory is often taught at first year graduate level, though can be taught at senior level undergraduate as well. This text evolved from the author’s preferred syllabus for teaching the course, presenting the material in a more logical order than other texts and so being more effective in teaching the basics of queueing theory. The first three chapters focus on the needed preliminaries, including exposition distributions, Poisson processes and generating functions, renewal theory, and Markov chains, Then, rather than switching to first-come first-served memoryless queues here as most texts do, Haviv discusses the M/G/1 model instead of the M/M/1, and then covers priority queues. Later chapters cover the G/M/1 model, thirteen examples of continuous-time Markov processes, open networks of memoryless queues and closed networks, queueing regimes with insensitive parameters, and then concludes with two-dimensional queueing models which are quasi birth and death processes. Each chapter ends with exercises.

Analysis of queues is used in a variety of domains including call centers, web servers, internet routers, manufacturing and production, telecommunications, transportation, hospitals and clinics, restaurants, and theme parks. Combining elements of classical queueing theory with some of the recent advances in studying stochastic networks, this book covers a broad range of applications. It contains numerous real-world examples and industrial applications in all chapters. The text is suitable for graduate courses, as well as researchers, consultants and analysts that work on performance modeling or use queueing models as analysis tools.

Probability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics. The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions. The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation. Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only). Numerous examples illuminate the mathematical theories Carefully detailed explanations of mathematical derivations guarantee a valuable pedagogical approach Each chapter concludes with an extensive set of exercises

A controversial interpretation of women's dramatic inroads into several male occupations.

Presents an introduction to differential equations, probability, and stochastic processes with real-world applications of queues with delay and delayed network queues Featuring recent advances in queueing theory and modeling, Delayed and Network Queues provides the most up-to-date theories in queueing model applications. Balancing both theoretical and practical applications of queueing theory, the book introduces queueing network models as tools to assist in the answering of questions on cost and performance that arise throughout the life of a computer system and signal processing. Written by well-known researchers in the field, the book presents key information for understanding the essential aspects of queues with delay and networks of queues with unreliable nodes and vacationing servers. Beginning with simple analytical fundamentals, the book contains a selection of realistic and advanced queueing models that address current deficiencies. In addition, the book presents the treatment of queues with delay and networks of queues, including possible breakdowns and disruptions that may cause delay. Delayed and Network Queues also features: Numerous examples and exercises with applications in various fields of study such as mathematical sciences, biomathematics, engineering, physics, business, health industry, and economics A wide array of practical applications of network queues and queueing systems, all of which are related to the appropriate stochastic processes Up-to-date topical coverage such as single- and multiserver queues with and without delays, along with the necessary fundamental coverage of probability and difference equations Discussions on queueing models such as single- and multiserver Markovian queues with balking, reneging, delay, feedback, splitting, and blocking, as well as their role in the treatment of networks of queues with and without delay and network reliability Delayed and Network Queues is an excellent textbook for upper-undergraduate and graduate-level courses in applied mathematics, queueing theory, queueing systems, probability, and stochastic processes. The book is also an ideal reference for academics and practitioners in mathematical sciences, biomathematics, operations research, management, engineering, physics, business, economics, health industry, and industrial engineering. Aliakbar Montazer Haghighi, PhD, is Professor and Head of the Department of Mathematics at Prairie View A&M University, USA, as well as founding Editor-in-Chief of Applications and Applied Mathematics: An International Journal (AAM). His research interests include probability, statistics, stochastic processes, and queueing theory. Among his research publications and books, Dr. Haghighi is the coauthor of Difference and Differential Equations with Applications in Queueing Theory (Wiley, 2013). Dimitar P. Mishev, PhD, is Professor in the Department of Mathematics at Prairie View A&M University, USA. His research interests include differential and difference equations and queueing theory. The author of numerous research papers and three books, Dr. Mishev is the coauthor of Difference and Differential Equations with Applications in Queueing Theory (Wiley, 2013).

From Markov Jump Processes to Spatial Queues aims to develop a unified theory of spatial queues that yields concrete results for the performance analysis of mobile communication networks. A particular objective is to develop the most natural generalization of existing concepts (e.g. the BMAP) toward the needs of mobile communication networks. To these belong the spatial distribution of batch arrivals and users in the system as well as time-inhomogeneous (e.g. periodic) arrival intensities and user movements. One of the major recent challenges for the stochastic modelling of communication systems is the emergence of wireless networks, which are used by more and more subscribers today. The main new feature of those, which is not covered by classical queuing theory, clearly is the importance of the user location within the area that is served by the base stations of the network. In the framework of queuing theory, this opens up the natural extension of classical queuing models towards queues with a structured space in which users are served. The present book is intended to introduce this extension under the name of spatial queues. The main point of view and the general approach will be that of Markov jump processes. We start with a closer look into the theory. Then we present new results for the theory of stochastic processes as well as for classical queuing theory. Finally we introduce the new concepts of spatial Markovian arrival processes and spatial queues. The main text is divided into three parts. The first part provides a new presentation of the theory of Markov jump processes. We derive a number of new results, especially for time-inhomogeneous processes, which have been neglected too much in the current textbooks on stochastic processes. For the first time, the class of Markov-additive jump processes is analysed in detail. This extends and unifies all Markovian arrival processes that have been proposed up to now (including arrivals for fluid queues) and provides a foundation for the subsequent introduction of spatial Markovian arrival processes. The second part contains new results for classical queues with BMAP input. These include the first explicit formulae for the distribution of periodic queues. The class of fluid Markovian arrival processes is introduced, and we give statistical estimates for the parameters of a BMAP. In the third part, the concepts of spatial Markovian arrival processes (abbreviated: SMAPs) and spatial queues are introduced. After that, periodic spatial Markovian queues are analysed as a model for the cells of a wireless communication network. From Markov Jump Processes to Spatial Queues is intended to reach queuing theorists, researchers in the field of communication systems, as well as engineers with some background in probability theory. Furthermore, it is suitable as a textbook for advanced queuing theory on the graduate or post-graduate level.

The book provides an extensive introduction to queueing models driven by Lévy-processes as well as a systematic account of the literature on Lévy-driven queues. The objective is to make the reader familiar with the wide set of probabilistic techniques that have been developed over the past decades, including transform-based techniques, martingales, rate-conservation arguments, change-of-measure, importance sampling, and large deviations. On the application side, it demonstrates how Lévy traffic models arise when modelling current queueing-type systems (as communication networks) and includes applications to finance. Queues and Lévy Fluctuation Theory will appeal to postgraduate students and researchers in mathematics, computer science, and electrical engineering. Basic prerequisites are probability theory and stochastic processes.

In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank matrix approximations; hybrid methods based on a combination of iterative procedures and best operator approximation; andmethods for information compression and filtering under condition that a filter model should satisfy restrictions associated with causality and different types of memory.As a result, the book represents a blend of new methods in general computational analysis,and specific, but also generic, techniques for study of systems theory ant its particularbranches, such as optimal filtering and information compression. - Best operator approximation,- Non-Lagrange interpolation,- Generic Karhunen-Loeve transform- Generalised low-rank matrix approximation- Optimal data compression- Optimal nonlinear filtering