Search

This is a complete update of the first edition of Level Crossing Methods in Stochastic Models, which was published in 2008. Level crossing methods are a set of sample-path based mathematical tools used in applied probability to establish reliable probability distributions. Since the basis for solving any applied probability problem requires a reliable probability distribution, Level Crossing Methods in Stochastic Models, Second Edition is a useful tool for all researchers working on stochastic application problems, including inventory control, queueing theory, reliability theory, actuarial ruin theory, renewal theory, pharmacokinetics, and related Markov processes.The second edition includes a new section with a novel derivation of the Beneš series for M/G/1 queues. It provides new results on the service time for three M/G/I queueing models with bounded workload. It analyzes new applications of queues where zero-wait customers getexceptional service, including several examples on M/G/1 queues, and a new section on G/M/1 queues. Additionally, there are two other important new sections: on the level-crossing derivation of the finite time-t probability distributions of excess, age, and total life, in renewal theory; and on a level-crossing analysis of a risk model in Insurance.The original Chapter 10 has been split into two chapters: the new chapter 10 is on renewal theory, and the first section of the new Chapter 11 is on a risk model. More explicit use is made of the renewal reward theorem throughout, and many technical and editorial changes have been made to facilitate readability.Percy H. Brill, Ph.D., is a Professor emeritus at the University of Windsor, Canada. Dr. Brill is the creator of the level crossing method for analyzing stochastic models. He has published extensively in stochastic processes, queueing theory and related models, especially using level crossing methods.

Updated to integrate the management of associated information processes, expand some application discussions, and provide additional reference material, the intent of this monograph is to help business professionals use waiting line (queuing) analysis methods to improve both service and manufacturing business applications of queuing situations. Emphasis is given to discussing the caveats in applying waiting line theory and becoming aware of the assumptions used in developing that theory. The importance of accounting for variability in waiting line processes is discussed in some detail because the basic queuing equations provide only average performance data under steady-state conditions. Understanding how much variability can exist for a given waiting line scenario provides a manager with the insight required to reduce these effects and develop innovative solutions for improving service while reducing operating costs. In general the mathematical tone of the book is focused on applications, not the derivation of the formulas presented. The few derivation exceptions illustrate some approaches not commonly discussed in textbooks-for example, the use of state diagrams and random number approximations of the probability distributions for use in simple simulation models. To aid in understanding the material presented, some practical examples are given at appropriate points in the text and some simulation approaches using common spreadsheet software are described.

This monograph provides a detailed analysis on fair queueing rules from a normative, a strategic, and a non-cooperative viewpoint. The queueing problem is concerned with the following situation: There is a group of agents who must be served in a facility. The facility can handle only one agent at a time and agents incur waiting costs. The problem is to find the order in which to serve agents and monetary transfers they should receive. The queueing problem has been studied extensively in the recent literature.

​The book presents different models for the simultaneous optimization problem of capacity investment and work release rule parameterization. The overall costs are minimized either including backorder costs or considering a service level constraint. The available literature is extended with the integration of a distributed customer required lead time in addition to the actual demand distribution. Furthermore, an endogenous production lead time is introduced. Different models for make-to-order production systems with one or multiple serial processing stages are developed. Capacity investment is linked to the processing rates of the machines or to the number of the machines. Results are equations for service level, tardiness, and FGI lead time in such a production system. For special cases with M/M/1 and M/M/s queues explicit solutions of the optimization problems or optimality conditions concerning capacity investment and work release rule parameterization are provided.

Mit dieser Arbeit wird ein völlig neuer Ansatz zur Produktionsplanung bei Kleinserienfertigung (Werkstattfertigung) vorgestellt, der die Integrationsprobleme der streng hierarchisch aufgebauten PPS-Systeme vermeidet. Die wichtigen Elemente Kapazitäts-, Losgrößen-, und Terminplanung werden ganzheitlich betrachtet. Über die Verwendung warteschlangentheoretischer Ergebnisse gelingt die Berücksichtigung der Charakteristika der Kleinserienfertigung in Produktionsprogramm- und Betriebsauftragsplanung. Die Losgrößenrechnung bezieht die Kapazitätsauslastung ein und erfolgt mit dem Ziel der Minimierung der Durchlaufzeiten. Da in die Terminierung bereits mittlere Wartezeiten einbezogen werden, ist in der Ablaufplanung lediglich das Ziel der Termintreue zu beachten. Somit gelingt zum einen eine integrierte Betriebsauftragsplanung, zum anderen erfolgt eine wesentlich verbesserte Abstimmung zwischen Produktionsprogramm-, Betriebsauftrags- und Ablaufplanung.

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.

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.

The book is composed of two main parts: mathematical background and queueing systems with applications. The mathematical background is a self containing introduction to the stochastic processes of the later studies queueing systems. It starts with a quick introduction to probability theory and stochastic processes and continues with chapters on Markov chains and regenerative processes. More recent advances of queueing systems are based on phase type distributions, Markov arrival processes and quasy birth death processes, which are introduced in the last chapter of the first part. The second part is devoted to queueing models and their applications. After the introduction of the basic Markovian (from M/M/1 to M/M/1//N) and non-Markovian (M/G/1, G/M/1) queueing systems, a chapter presents the analysis of queues with phase type distributions, Markov arrival processes (from PH/M/1 to MAP/PH/1/K). The next chapter presents the classical queueing network results and the rest of this part is devoted to the application examples. There are queueing models for bandwidth charing with different traffic classes, slotted multiplexers, ATM switches, media access protocols like Aloha and IEEE 802.11b, priority systems and retrial systems. An appendix supplements the technical content with Laplace and z transformation rules, Bessel functions and a list of notations. The book contains examples and exercises throughout and could be used for graduate students in engineering, mathematics and sciences.

Advances in Queueing Theory and Network Applications presents several useful mathematical analyses in queueing theory and mathematical models of key technologies in wired and wireless communication networks such as channel access controls, Internet applications, topology construction, energy saving schemes, and transmission scheduling. In sixteen high quality chapters, this work provides novel ideas, new analytical models, and simulation and experimental results by experts in the field of queueing theory and network applications. The text serves as a state-of-the-art reference for a wide range of researchers and engineers engaged in the fields of queueing theory and network applications, and can also serve as supplemental material for advanced courses in operations research, queueing theory, performance analysis, traffic theory, as well as theoretical design and management of communication networks.

Queueing Theory deals with systems where there is contention for resources, but the demands are only known probabilistically. This book can be considered to be a monograph or a textbook, and thus is aimed at two audiences: those who already know Queueing Theory but would like to know more of the Linear Algebraic Approach; and as a rst course for students who don't already have a strong background in probability, and feel more comfortable with algebraic arguments. Also, the equations are well suited to easy computation. In fact, there is much discussion on how various properties can be easily computed in any language that has automatic matrix operations (e.g., MATLAB). To help with physical insight, there are over 80 gures, numerous examples and exercises distributed throughout the book. There are, perhaps 50 books on QT that are available today, and most practitioners have several of them on their shelves. This book would be a good addition, as well as a good supplement to another text. This second edition has been updated throughout including a new chapter on Semi Markov Processes and new material on matrix representations of distributions and Power-tailed distribution. Lester Lipsky is a Professor in the Department of Computer Science and Engineering at the University of Connecticut.

The application of auto-repeat facilities in telephone systems, as well as the use of random access protocols in computer networks, have led to growing interest in retrial queueing models. Since much of the theory of retrial queues is complex from an analytical viewpoint, with this book the authors give a comprehensive and updated text focusing on approximate techniques and algorithmic methods for solving the analytically intractable models. Retrial Queueing Systems: A Computational Approach also Presents motivating examples in telephone and computer networks. Establishes a comparative analysis of the retrial queues versus standard queues with waiting lines and queues with losses. Integrates a wide range of techniques applied to the main M/G/1 and M/M/c retrial queues, and variants with general retrial times, finite population and the discrete-time case. Surveys basic results of the matrix-analytic formalism and emphasizes the related tools employed in retrial queues. Discusses a few selected retrial queues with QBD, GI/M/1 and M/G/1 structures. Features an abundance of numerical examples, and updates the existing literature. The book is intended for an audience ranging from advanced undergraduates to researchers interested not only in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering. The prerequisite is a graduate course in stochastic processes, and a positive attitude to the algorithmic probability.

'This book is a highly recommendable survey of mathematical tools and results in applied probability with special emphasis on queueing theory....The second edition at hand is a thoroughly updated and considerably expended version of the first edition.... This book and the way the various topics are balanced are a welcome addition to the literature. It is an indispensable source of information for both advanced graduate students and researchers.'--MATHEMATICAL REVIEWS