Delayed and network queues
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 Profess...
Main Authors: | , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Hoboken, New Jersey
John Wiley & Sons
2016
|
Subjects: | |
Online Access: | |
Collection: | O'Reilly - Collection details see MPG.ReNa |
Table of Contents:
- 4.10.3 Transient Solution of the M/M/1 by Lattice Path Method4.11 Stationary M/M/C Queueing Process; 4.11.1 A Stationary Multiserver Queue; Exercises; Chapter 5 Queues With Delay; 5.1 Introduction; 5.2 A Queuing System with Delayed Service; 5.3 An M/G/1 Queue with Server Breakdown and with Multiple Working Vacation; 5.3.1 Mathematical Formulation of the Model; 5.3.2 Steady-State Mean Number of Tasks in the System; 5.3.3 A Special Case; 5.4 A Bulk Queuing System Under N-Policy with Bilevel Service Delay Discipline and Start-Up Time; 5.4.1 Analysis of the Model
- 4.7 Stationary M/M/1 and M/M/1/K Queueing Processes with Feedback4.7.1 Stationary Distribution of the Sojourn Time of a Task; 4.7.2 Distribution of the Total Time of Service by a Task; 4.7.3 Stationary Distribution of the Feedback Queue Size; 4.7.4 Stationary Distribution of n (Sojourn Time of the nth task); 4.8 Queues with Bulk Arrivals and Batch Service; 4.9 A Priority Queue with Balking and Reneging; 4.10 Discrete Time M/M/1 Queueing Process, Combinatorics Method (Lattice Paths); 4.10.1 The Basic Ballot Problem; 4.10.2 Ballot Problem (based on Takács 1997)
- Includes bibliographical references and index
- Cover; Title Page; Copyright; Dedication; Contents; Preface; Chapter 1 Preliminaries; 1.1 Basics of Probability; 1.1.1 Introduction; 1.1.2 Conditional Probability; 1.2 Discrete Random Variables and Distributions; 1.3 Discrete Moments; 1.4 Continuous Random Variables, Density, and Cumulative Distribution Functions; 1.5 Continuous Random Vector; 1.6 Functions of Random Variables; 1.7 Continuous Moments; 1.8 Difference Equations; 1.8.1 Introduction; 1.8.2 Basic Definitions and Properties; 1.9 Methods of Solving Linear Difference Equations with Constant Coefficients
- 3.4 Pure Death Process (Poisson Death Process)Exercises; Chapter 4 Standard Queues; 4.1 Introduction of Queues (General Birth and Death Process); 4.1.1 Mechanism, Characteristics, and Types of Queues; 4.2 Remarks on Non-Markovian Queues; 4.2.1 Takács's Waiting Time Paradox; 4.2.2 Virtual Waiting Time and Takács's Integro-Differential Equation; 4.2.3 The Unfinished Work; 4.3 Stationary M/M/1 Queueing Process; 4.4 A Parallel M/M/C/K with Baking and Reneging; 4.5 Stationary M/M/1/K Queueing Process; 4.6 Busy Period of an M/M/1/K Queue
- 1.9.1 Characteristic Equation Method1.9.2 Recursive Method; 1.9.3 Generating Function Method; 1.9.4 Laplace Transform Method; Exercises; Chapter 2 Stochastic Processes; 2.1 Introduction and Basic Definitions; 2.2 Markov Chain; 2.2.1 Classification of States; 2.3 Markov Process; 2.3.1 Markov Process with Discrete Space State; 2.4 Random Walk; 2.5 Up-and-Down Biased Coin Design as a Random Walk; Exercises; Chapter 3 Birth and Death Processes; 3.1 Overviews of the Birth and Death Processes; 3.2 Finite B-D Process; 3.3 Pure Birth Process (Poisson Process)