|
|
|
|
| LEADER |
08556nmm a2200685 u 4500 |
| 001 |
EB001916976 |
| 003 |
EBX01000000000000001079878 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 020 |
|
|
|a 1119022142
|
| 020 |
|
|
|a 9781119022152
|
| 020 |
|
|
|a 9781119022145
|
| 020 |
|
|
|a 1119022150
|
| 050 |
|
4 |
|a TK5105.5487
|
| 100 |
1 |
|
|a Haghighi, Aliakbar Montazer
|
| 245 |
0 |
0 |
|a Delayed and network queues
|c Aliakbar Montazer Haghighi, Prairie View A & M University, member of Texas A & M University System, Prairie View, Texas, USA, Dimitar P. Mishev, Prairie View A & M University, member of Texas A & M University System, Prairie View, Texas
|
| 260 |
|
|
|a Hoboken, New Jersey
|b John Wiley & Sons
|c 2016
|
| 300 |
|
|
|a 1 online resource
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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)
|
| 505 |
0 |
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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)
|
| 653 |
|
|
|a COMPUTERS / Computer Science / bisacsh
|
| 653 |
|
|
|a Routage (Gestion des réseaux d'ordinateurs) / Mathématiques
|
| 653 |
|
|
|a COMPUTERS / Data Processing / bisacsh
|
| 653 |
|
|
|a Réseaux de files d'attente (Transmission des données)
|
| 653 |
|
|
|a COMPUTERS / Machine Theory / bisacsh
|
| 653 |
|
|
|a Computer networks / Mathematical models
|
| 653 |
|
|
|a Telecommunication / Traffic / http://id.loc.gov/authorities/subjects/sh85133289
|
| 653 |
|
|
|a Queuing networks (Data transmission) / http://id.loc.gov/authorities/subjects/sh2007002386
|
| 653 |
|
|
|a Computer networks / Mathematical models / fast
|
| 653 |
|
|
|a Télécommunications / Trafic
|
| 653 |
|
|
|a COMPUTERS / Hardware / General / bisacsh
|
| 653 |
|
|
|a COMPUTERS / Reference / bisacsh
|
| 653 |
|
|
|a Telecommunication / Traffic / fast
|
| 653 |
|
|
|a Réseaux d'ordinateurs / Modèles mathématiques
|
| 653 |
|
|
|a COMPUTERS / Computer Literacy / bisacsh
|
| 653 |
|
|
|a Routing (Computer network management) / Mathematics
|
| 653 |
|
|
|a Queuing networks (Data transmission) / fast
|
| 653 |
|
|
|a COMPUTERS / Information Technology / bisacsh
|
| 700 |
1 |
|
|a Mishev, D. P.
|e author
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 776 |
|
|
|z 1119022134
|
| 776 |
|
|
|z 9781119022138
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781119022138/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 384
|
| 082 |
0 |
|
|a 331
|
| 082 |
0 |
|
|a 004.601/51982
|
| 082 |
0 |
|
|a 510
|
| 082 |
0 |
|
|a 658
|
| 082 |
0 |
|
|a 500
|
| 520 |
|
|
|a 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.
|
| 520 |
|
|
|a 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,
|
| 520 |
|
|
|a In addition, the book presents the treatment of queues with delay and networks of queues, including possible breakdowns and disruptions that may cause delay.
|
| 520 |
|
|
|a 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)
|
| 520 |
|
|
|a 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.
|