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.

How do you get rid of unwanted guests? What do you do if there's a racket in the quiet carriage? How should you eat peas, and behave in queues? How to behave, like how to punctuate, is an aspect of life that many are no longer taught - and getting it wrong is the stuff of comedy at best and humiliation at worst. Thankfully, Sandi Toksvig has come to the rescue with her entertaining guide to modern manners,with tips on what to do whether you're talking to a bore, or forgot their name in the first place. (Just call them 'darling'.) The award-winning Radio 4 broadcaster and writer offers guidance on the social pitfalls of every phase of life, from christenings to condolence letters. With characteristic wit and perceptiveness, and revealing the trickiest of her encounters along the way, she highlights decency rather than convention and provides an essential guide to twenty-first century behaviour. Now this down-to-earth, hilarious guide is available in perfect pocket-sized paperback size.

Written with students and professors in mind, Analysis of Queues: Methods and Applications combines coverage of classical queueing theory with recent advances in studying stochastic networks. Exploring a broad range of applications, the book contains plenty of solved problems, exercises, case studies, paradoxes, and numerical examples. In addition to the standard single-station and single class discrete queues, the book discusses models for multi-class queues and queueing networks as well as methods based on fluid scaling, stochastic fluid flows, continuous parameter Markov processes, and quasi-birth-and-death processes, to name a few. It describes a variety of applications including computer-communication networks, information systems, production operations, transportation, and service systems such as healthcare, call centers and restaurants.

"Vladimir Sorokin’s first published novel, The Queue, is a sly comedy about the late Soviet “years of stagnation.” Thousands of citizens are in line for . . . nobody knows quite what, but the rumors are flying. Leather or suede? Jackets, jeans? Turkish, Swedish, maybe even American? It doesn’t matter–if anything is on sale, you better line up to buy it. Sorokin’s tour de force of ventriloquism and formal daring tells the whole story in snatches of unattributed dialogue, adding up to nothing less than the real voice of the people, overheard on the street as they joke and curse, fall in and out of love, slurp down ice cream or vodka, fill out crossword puzzles, even go to sleep and line up again in the morning as the queue drags on."--Amazon.com.

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.

The motivation for developing this synthesis lecture was to provide a tutorial on queuing and trunking, with extensions to networks of queues, suitable for supplementing courses in communications, stochastic processes, and networking. An essential component of this lecture is MATLAB-based demonstrations and exercises, which can be easily modified to enable the student to observe and evaluate the impact of changing parameters, arrival and departure statistics, queuing disciplines, the number of servers, and other important aspects of the underlying system model. Much of the work in this lecture is based on Poisson statistics, since Poisson models are useful due to the fact that Poisson models are analytically tractable and provide a useful approximation for many applications. We recognize that the validity of Poisson statistics is questionable for a number of networking applications and therefore we briefly discuss self-similar models and the Hurst parameter, long-term dependent models, the Pareto distribution, and other related topics. Appropriate references are given for continued study on these topics. The initial chapters of this book consider individual queues in isolation. The systems studied consist of an arrival process, a single queue with a particular queuing discipline, and one or more servers. While this allows us to study the basic concepts of queuing and trunking, modern data networks consist of many queues that interact in complex ways. While many of these interactions defy analysis, the final chapter introduces a model of a network of queues in which, after being served in one queue, customers may join another queue. The key result for this model is known as Jackson's Theorem. Finally, we state the BCMP Theorem, which can be viewed as a further extension of Jackson's Theorem and present Kleinrock's formula, which can be viewed as the network version of Little's Theorem. Table of Contents: Introduction / Poisson, Erlang, and Pareto Distributions / A Brief Introduction to Queueing Theory / Blocking and Delay / Networks of Queues