Andrea Baiocchi

Network Traffic Engineering

Stochastic Models and Applications

• Gebundenes Buch

Produktbeschreibung

A comprehensive guide to the concepts and applications of queuing theory and traffic theory

Network Traffic Engineering: Models and Applications provides an advanced level queuing theory guide for students with a strong mathematical background who are interested in analytic modeling and performance assessment of communication networks.

The text begins with the basics of queueing theory before moving on to more advanced levels. The topics covered in the book are derived from the most cutting-edge research, project development, teaching activity, and discussions on the subject. They include applications of queuing and traffic theory in:
_ LTE networks
_ Wi-Fi networks
_ Ad-hoc networks
_ Automated vehicles
_ Congestion control on the Internet
The distinguished author seeks to show how insight into practical and real-world problems can be gained by means of quantitative modeling. Perfect for graduate students of computer engineering, computer science, telecommunication engineering, and electrical engineering, Network Traffic Engineering offers a supremely practical approach to a rapidly developing field of study and industry.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Wiley / Wiley & Sons
• Artikelnr. des Verlages: 1W119632430
• 1. Auflage
• Seitenzahl: 816
• Erscheinungstermin: 1. September 2020
• Englisch
• Abmessung: 231mm x 155mm x 46mm
• Gewicht: 1236g
• ISBN-13: 9781119632436
• ISBN-10: 1119632439
• Artikelnr.: 58503451

Autorenporträt

ANDREA BAIOCCHI, PhD, is a Full Professor in the Department of Information Engineering, Electronics and Telecommunications of the University of Roma "La Sapienza". He has published over 160 papers on international journals and conference proceedings. He has participated to the Technical Program Committees of more than seventy international conferences. He served in the editorial board of the telecommunications technical journal published by Telecom Italia (currently TIM) for ten years.

Inhaltsangabe

Preface xvii

Acronyms xix

Part I Models for Service Systems 1

1 Introduction 3

1.1 Network Traffic Engineering: What, Why, How 3

1.2 The Art of Modeling 8

1.3 An Example: Delay Equalization 13

1.3.1 Model Setting 14

1.3.2 Analysis by Equations 15

1.3.3 Analysis by Simulation 19

1.3.4 Takeaways 21

1.4 Outline of the Book 21

1.4.1 Plan 21

1.4.2 Use 25

1.4.3 Notation 27

1.5 Further Readings 29

Problems 30

2 Service Systems and Queues 33

2.1 Service System Structure 33

2.2 Arrival and Service Processes 35

2.3 The Queue as a Service System Model 38

2.4 Queues in Equilibrium 40

2.4.1 Queues and Stationary Processes 40

2.4.2 Little's Law 45

2.5 Palm's Distributions for a Queue 49

2.6 The Traffic Process 53

2.7 Performance Metrics 56

2.7.1 Throughput 56

2.7.2 Utilization 59

2.7.3 Loss 59

2.7.4 Delay 61

2.7.5 Age of Information 62

Summary and Takeaways 63

Problems 65

3 Stochastic Models for Network Traffic 71

3.1 Introduction 71

3.2 The Poisson Process 72

3.2.1 Light versus Heavy Tails 78

3.2.2 Inhomogeneous Poisson Process 79

3.2.3 Poisson Process in Multidimensional Spaces 84

3.2.3.1 Displacement 89

3.2.3.2 Mapping 89

3.2.3.3 Thinning 90

3.2.3.4 Distances 91

3.2.3.5 Sums and Products on Point Processes 92

3.2.3.6 Hard Core Processes 94

3.2.4 Testing for Poisson 96

3.3 The Markovian Arrival Process 100

3.4 Renewal Processes 103

3.4.1 Residual Inter-Event Time and Renewal Paradox 108

3.4.2 Superposition of Renewal Processes 110

3.4.3 Alternating Renewal Processes 111

3.4.4 Renewal Reward Processes 113

3.5 Birth-Death Processes 115

3.6 Branching Processes 121

Summary and Takeaways 125

Problems 126

Part II Queues 131

4 Single-Server Queues 133

4.1 Introduction and Notation 133

4.2 The Embedded Markov Chain Analysis of the M/G/1 Queue 134

4.2.1 Queue Length 136

4.2.2 Waiting Time 141

4.2.3 Busy Period and Idle Time 145

4.2.4 Remaining Service Time 148

4.2.5 Output Process 149

4.2.6 Evaluation of the Probabilities {ak}k element of Z 151

4.3 The M/G/1/K Queue 152

4.3.1 Exact Solution 153

4.3.2 Asymptotic Approximation for Large K 157

4.4 Numerical Evaluation of the Queue Length PDF 166

4.5 A Special Case: the M/M/1 Queue 168

4.6 Optimization of a Single-Server Queue 170

4.6.1 Maximization of Net Profit 171

4.6.2 Minimization of Age of Information 174

4.6.2.1 General Expression of the Average Age of Information 175

4.6.2.2 Minimization of the Age of Information for an M/M/1 Model 177

4.7 The G/M/1 Queue 178

4.8 Matrix-Geometric Queues 185

4.8.1 Quasi Birth-Death (QBD) Processes 186

4.8.2 M/G/1 and G/M/1 Structured Processes 188

4.9 A General Result on Single-Server Queues 192

Summary and Takeaways 194

Problems 195

5 Multi-Server Queues 199

5.1 Introduction 199

5.2 The Erlang Loss System 201

5.2.1 Insensitivity Property of the Erlang Loss System 211

5.2.2 A Finite Population Model 213

5.2.3 Non-Poisson Input