Delayed and network queues:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Hoboken, New Jersey
John Wiley & Sons
2016
|
| Schlagworte: | |
| Beschreibung: | Description based on print version record and CIP data provided by publisher |
| Beschreibung: | 1 online resource |
| ISBN: | 9781119022145 1119022142 9781119022152 1119022150 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV044360926 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170620s2016 |||| o||u| ||||||eng d | ||
| 020 | |a 9781119022145 |c pdf |9 978-1-119-02214-5 | ||
| 020 | |a 1119022142 |c pdf |9 1-119-02214-2 | ||
| 020 | |a 9781119022152 |c epub |9 978-1-119-02215-2 | ||
| 020 | |a 1119022150 |c epub |9 1-119-02215-0 | ||
| 035 | |a (ZDB-4-NLEBK)ocn948671050 | ||
| 035 | |a (OCoLC)948671050 | ||
| 035 | |a (DE-599)BVBBV044360926 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 004.601/51982 |2 23 | |
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 100 | 1 | |a Haghighi, Aliakbar Montazer |e Verfasser |4 aut | |
| 245 | 1 | 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 |
| 264 | 1 | |a Hoboken, New Jersey |b John Wiley & Sons |c 2016 | |
| 300 | |a 1 online resource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Description based on print version record and CIP data provided by publisher | ||
| 505 | 8 | |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 | 8 | |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) | |
| 505 | 8 | |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 | 8 | |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 | 8 | |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 | 8 | |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. | |
| 505 | 8 | |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. | |
| 505 | 8 | |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, | |
| 505 | 8 | |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. | |
| 505 | 8 | |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) | |
| 650 | 7 | |a COMPUTERS / Computer Literacy |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Computer Science |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Data Processing |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Hardware / General |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Information Technology |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Machine Theory |2 bisacsh | |
| 650 | 7 | |a COMPUTERS / Reference |2 bisacsh | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Mathematisches Modell | |
| 650 | 4 | |a Routing (Computer network management) |x Mathematics |a Computer networks |x Mathematical models |a Telecommunication |x Traffic |a Queuing networks (Data transmission) | |
| 650 | 0 | 7 | |a Stochastischer Prozess |0 (DE-588)4057630-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mathematisches Modell |0 (DE-588)4114528-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Telekommunikationsnetz |0 (DE-588)4133586-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Telekommunikationsnetz |0 (DE-588)4133586-7 |D s |
| 689 | 0 | 2 | |a Stochastischer Prozess |0 (DE-588)4057630-9 |D s |
| 689 | 0 | 3 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 0 | 4 | |a Mathematisches Modell |0 (DE-588)4114528-8 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Mishev, D. P. |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Haghighi, Aliakbar Montazer, author |t Delayed and network queues |d Hoboken, New Jersey : John Wiley & Sons, 2016 |z 9781119022138 |
| 912 | |a ZDB-4-NLEBK | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029763557 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804177609700933632 |
|---|---|
| any_adam_object | |
| author | Haghighi, Aliakbar Montazer |
| author_facet | Haghighi, Aliakbar Montazer |
| author_role | aut |
| author_sort | Haghighi, Aliakbar Montazer |
| author_variant | a m h am amh |
| building | Verbundindex |
| bvnumber | BV044360926 |
| classification_rvk | SK 970 |
| collection | ZDB-4-NLEBK |
| contents | 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 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) 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 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) 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 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) |
| ctrlnum | (ZDB-4-NLEBK)ocn948671050 (OCoLC)948671050 (DE-599)BVBBV044360926 |
| dewey-full | 004.601/51982 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.601/51982 |
| dewey-search | 004.601/51982 |
| dewey-sort | 14.601 551982 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>09133nmm a2200757zc 4500</leader><controlfield tag="001">BV044360926</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170620s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781119022145</subfield><subfield code="c">pdf</subfield><subfield code="9">978-1-119-02214-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1119022142</subfield><subfield code="c">pdf</subfield><subfield code="9">1-119-02214-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781119022152</subfield><subfield code="c">epub</subfield><subfield code="9">978-1-119-02215-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1119022150</subfield><subfield code="c">epub</subfield><subfield code="9">1-119-02215-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-4-NLEBK)ocn948671050</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)948671050</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044360926</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.601/51982</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Haghighi, Aliakbar Montazer</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Delayed and network queues</subfield><subfield code="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</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hoboken, New Jersey</subfield><subfield code="b">John Wiley & Sons</subfield><subfield code="c">2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on print version record and CIP data provided by publisher</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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. </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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. </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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, </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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. </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Literacy</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Computer Science</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Data Processing</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Hardware / General</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Information Technology</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Machine Theory</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS / Reference</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing (Computer network management)</subfield><subfield code="x">Mathematics</subfield><subfield code="a">Computer networks</subfield><subfield code="x">Mathematical models</subfield><subfield code="a">Telecommunication</subfield><subfield code="x">Traffic</subfield><subfield code="a">Queuing networks (Data transmission)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Stochastischer Prozess</subfield><subfield code="0">(DE-588)4057630-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Stochastischer Prozess</subfield><subfield code="0">(DE-588)4057630-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mishev, D. P.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Haghighi, Aliakbar Montazer, author</subfield><subfield code="t">Delayed and network queues</subfield><subfield code="d">Hoboken, New Jersey : John Wiley & Sons, 2016</subfield><subfield code="z">9781119022138</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-NLEBK</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029763557</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV044360926 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:50:47Z |
| institution | BVB |
| isbn | 9781119022145 1119022142 9781119022152 1119022150 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029763557 |
| oclc_num | 948671050 |
| open_access_boolean | |
| physical | 1 online resource |
| psigel | ZDB-4-NLEBK |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | John Wiley & Sons |
| record_format | marc |
| spelling | Haghighi, Aliakbar Montazer Verfasser aut Delayed and network queues 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 Hoboken, New Jersey John Wiley & Sons 2016 1 online resource txt rdacontent c rdamedia cr rdacarrier Description based on print version record and CIP data provided by publisher 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 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) 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 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) 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 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) COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Informatik Mathematik Mathematisches Modell Routing (Computer network management) Mathematics Computer networks Mathematical models Telecommunication Traffic Queuing networks (Data transmission) Stochastischer Prozess (DE-588)4057630-9 gnd rswk-swf Mathematisches Modell (DE-588)4114528-8 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Telekommunikationsnetz (DE-588)4133586-7 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Telekommunikationsnetz (DE-588)4133586-7 s Stochastischer Prozess (DE-588)4057630-9 s Warteschlangentheorie (DE-588)4255044-0 s Mathematisches Modell (DE-588)4114528-8 s 1\p DE-604 Mishev, D. P. Sonstige oth Erscheint auch als Druck-Ausgabe Haghighi, Aliakbar Montazer, author Delayed and network queues Hoboken, New Jersey : John Wiley & Sons, 2016 9781119022138 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Haghighi, Aliakbar Montazer Delayed and network queues 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 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) 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 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) 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 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) COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Informatik Mathematik Mathematisches Modell Routing (Computer network management) Mathematics Computer networks Mathematical models Telecommunication Traffic Queuing networks (Data transmission) Stochastischer Prozess (DE-588)4057630-9 gnd Mathematisches Modell (DE-588)4114528-8 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Rechnernetz (DE-588)4070085-9 gnd |
| subject_GND | (DE-588)4057630-9 (DE-588)4114528-8 (DE-588)4255044-0 (DE-588)4133586-7 (DE-588)4070085-9 |
| title | Delayed and network queues |
| title_auth | Delayed and network queues |
| title_exact_search | Delayed and network queues |
| title_full | Delayed and network queues 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 |
| title_fullStr | Delayed and network queues 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 |
| title_full_unstemmed | Delayed and network queues 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 |
| title_short | Delayed and network queues |
| title_sort | delayed and network queues |
| topic | COMPUTERS / Computer Literacy bisacsh COMPUTERS / Computer Science bisacsh COMPUTERS / Data Processing bisacsh COMPUTERS / Hardware / General bisacsh COMPUTERS / Information Technology bisacsh COMPUTERS / Machine Theory bisacsh COMPUTERS / Reference bisacsh Informatik Mathematik Mathematisches Modell Routing (Computer network management) Mathematics Computer networks Mathematical models Telecommunication Traffic Queuing networks (Data transmission) Stochastischer Prozess (DE-588)4057630-9 gnd Mathematisches Modell (DE-588)4114528-8 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd Rechnernetz (DE-588)4070085-9 gnd |
| topic_facet | COMPUTERS / Computer Literacy COMPUTERS / Computer Science COMPUTERS / Data Processing COMPUTERS / Hardware / General COMPUTERS / Information Technology COMPUTERS / Machine Theory COMPUTERS / Reference Informatik Mathematik Mathematisches Modell Routing (Computer network management) Mathematics Computer networks Mathematical models Telecommunication Traffic Queuing networks (Data transmission) Stochastischer Prozess Warteschlangentheorie Telekommunikationsnetz Rechnernetz |
| work_keys_str_mv | AT haghighialiakbarmontazer delayedandnetworkqueues AT mishevdp delayedandnetworkqueues |