Network Traffic Engineering

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.

Auteur

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.

Contenu
Preface xv

Acronyms xvii

Part I Models for Service Systems

1 Introduction 3

1.1 Network Traffic Engineering: what, why, how 3

1.2 The art of modeling 7

1.3 An example: delay equalization 11

1.3.1 Model setting 12

1.3.2 Analysis by equations 13

1.3.3 Analysis by simulation 16

1.3.4 Takeaways 18

1.4 Outline of the book 18

1.4.1 Plan 18

1.4.2 Use 21

1.4.3 Notation 23

1.5 Further readings 24

Problems 25

2 Service systems and queues 27

2.1 Service system structure 27

2.2 Arrival and service processes 28

2.3 The queue as a service system model 32

2.4 Queues in equilibrium 33

2.4.1 Queues and stationary processes 33

2.4.2 Little's law 37

2.5 Palm's distributions for a queue 40

2.6 The traffic process 44

2.7 Performance metrics 46

2.7.1 Throughput 47

2.7.2 Utilization 49

2.7.3 Loss 49

2.7.4 Delay 51

2.7.5 Age of Information 51

Problems 54

3 Stochastic models for network traffic 59

3.1 Introduction 59

3.2 The Poisson process 60

3.2.1 Light versus heavy tails 65

3.2.2 Inhomogeneous Poisson process 66

3.2.3 Poisson process in multidimensional spaces 70

3.2.4 Testing for Poisson 80

3.3 The Markovian Arrival Process 83

3.4 Renewal processes 86

3.4.1 Residual interevent time and renewal paradox 91

3.4.2 Superposition of renewal processes 93

3.4.3 Alternating renewal processes 94

3.4.4 Renewal reward processes 95

3.5 Birthdeath processes 97

3.6 Branching processes 102 Problems 107

Part II Queues

4 Single server queues 113

4.1 Introduction and notation 113

4.2 The Embedded Markov Chain analysis of the M/G/1 queue 114

4.2.1 Queue length 116

4.2.2 Waiting time 120

4.2.3 Busy period and idle time 123

4.2.4 Remaining service time 126

4.2.5 Output process 127

4.2.6 Evaluation of the probabilities {ak}k∈129

4.3 The M/G/1/K queue 130

4.3.1 Exact solution 130

4.3.2 Asymptotic approximation for large K 133

4.4 Numerical evaluation of the queue length PDF 141

4.5 A special case: the M/M/1 queue 143

4.6 Optimization of a single server queue 145

4.6.1 Maximization of net profit 146

4.6.2 Minimization of age of information 149

4.7 The G/M/1 queue 152

4.8 Matrixgeometric queues 159

4.8.1 Quasi BirthDeath (QBD) processes 159

4.8.2 M/G/1 and G/M/1 structured processes 161

4.9 A general result on single server queues 164

Problems 167

5 Multiserver queues 171

5.1 Introduction 171

5.2 The Erlang loss system 173

5.2.1 Insensitivity property of the Erlang loss system 182

5.2.2 A finite population model 183

5.2.3 NonPoisson input traffic 184

5.2.4 Multiclass Erlang loss system 189

5.3 Application of the Erlang loss model to cellular radio access network 192

5.3.1 Cell dimensioning under Quality of Service constraints 193

5.3.2 Number of handoffs in a connection lifetime 198

5.3.3 Blocking in a cell with user mobility 199

5.3.4 Tradeoff between location updating and paging 201

5.3.5 Dimensioning of a cell with two service classes 202

5.4 The M/M/m queue 204

5.4.1 Finite queue size model 209

5.4.2 Resource sharing versus isolation 209

5.5 Infinite server queues 212

5.5.1 Analysis of message propagation in a linear network 216

Problems 221 **6 Priorities and scheduling 2...