Details
Stochastic Modeling and Analysis of Telecom Networks
1. Aufl.
|
173,99 € |
|
| Verlag: | Wiley |
| Format: | EPUB |
| Veröffentl.: | 27.12.2012 |
| ISBN/EAN: | 9781118563014 |
| Sprache: | englisch |
| Anzahl Seiten: | 387 |
DRM-geschütztes eBook, Sie benötigen z.B. Adobe Digital Editions und eine Adobe ID zum Lesen.
Beschreibungen
<p>This book addresses the stochastic modeling of telecommunication networks, introducing the main mathematical tools for that purpose, such as Markov processes, real and spatial point processes and stochastic recursions, and presenting a wide list of results on stability, performances and comparison of systems.<br /> The authors propose a comprehensive mathematical construction of the foundations of stochastic network theory: Markov chains, continuous time Markov chains are extensively studied using an original martingale-based approach. A complete presentation of stochastic recursions from an ergodic theoretical perspective is also provided, as well as spatial point processes.<br /> Using these basic tools, stability criteria, performance measures and comparison principles are obtained for a wide class of models, from the canonical M/M/1 and G/G/1 queues to more sophisticated systems, including the current “hot topics” of spatial radio networking, OFDMA and real-time networks.</p> <p>Contents</p> <p>1. Introduction.<br /> Part 1: Discrete-time Modeling<br /> 2. Stochastic Recursive Sequences.<br /> 3. Markov Chains.<br /> 4. Stationary Queues.<br /> 5. The M/GI/1 Queue.<br /> Part 2: Continuous-time Modeling<br /> 6. Poisson Process.<br /> 7. Markov Process.<br /> 8. Systems with Delay.<br /> 9. Loss Systems.<br /> Part 3: Spatial Modeling<br /> 10. Spatial Point Processes.</p>
<p>Preface ix</p> <p><b>Chapter 1. Introduction 1</b></p> <p>1.1. Traffic, load, Erlang, etc1</p> <p>1.2. Notations and nomenclature 7</p> <p>1.3. Lindley and Bene¡s 10</p> <p>1.4. Notes and comments 18</p> <p><b>PART 1: DISCRETE-TIME MODELING 21</b></p> <p><b>Chapter 2. Stochastic Recursive Sequences 23</b></p> <p>2.1. Canonical space 24</p> <p>2.2. Loynes’s scheme 30</p> <p>2.3. Coupling 34</p> <p>2.4. Comparison of stochastic recursive sequences 40</p> <p>2.5. Notes and comments 43</p> <p><b>Chapter 3. Markov Chains 45</b></p> <p>3.1. Definition and examples 45</p> <p>3.2. Strong Markov property 49</p> <p>3.3. Classification of states 52</p> <p>3.4. Invariant measures and invariant probability 60</p> <p>3.5. Effective calculation of the invariant probability 75</p> <p>3.6. Problems 77</p> <p>3.7. Notes and comments 80</p> <p><b>Chapter 4. Stationary Queues 83</b></p> <p>4.1. Single server queues 84</p> <p>4.2. Processor sharing queue 104</p> <p>4.3. Parallel queues 106</p> <p>4.4. The queue with S servers 117</p> <p>4.5. Infinite servers queue 124</p> <p>4.6. Queues with impatient customers 127</p> <p>4.7. Notes and comments 146</p> <p><b>Chapter 5. The M/GI/1 Queue 149</b></p> <p>5.1. The number of customers in the queue 149</p> <p>5.2. Pollacek-Khinchin formulas 153</p> <p>5.3. Sojourn time 156</p> <p>5.4. Tail distribution of the waiting time 158</p> <p>5.5. Busy periods 160</p> <p><b>PART 2: CONTINUOUS-TIME MODELING 167</b></p> <p><b>Chapter 6. Poisson Process 169</b></p> <p>6.1. Definitions 170</p> <p>6.2. Properties 176</p> <p>6.3. Discrete analog: the Bernoulli process 181</p> <p>6.4. Simulation of the Poisson process 183</p> <p>6.5. Non-homogeneous Poisson process 185</p> <p>6.6. Cox processes 189</p> <p>6.7. Problems 189</p> <p>6.8. Notes and comments 191</p> <p><b>Chapter 7. Markov Process 193</b></p> <p>7.1. Preliminaries 193</p> <p>7.2. Pathwise construction 195</p> <p>7.3. Markovian semi-group and infinitesimal generator 199</p> <p>7.4. Martingale problem 215</p> <p>7.5. Reversibility and applications 220</p> <p>7.6. Markov Modulated Poisson Processes 226</p> <p>7.7. Problems 232</p> <p>7.8. Notes and comments 234</p> <p><b>Chapter 8. Systems with Delay 237</b></p> <p>8.1. Little’s formula 237</p> <p>8.2. Single server queue 241</p> <p>8.3. Multiple server queue 245</p> <p>8.4. Processor sharing queue 252</p> <p>8.5. The M/M/∞ queue 253</p> <p>8.6. The departure process 254</p> <p>8.7. Queuing networks 255</p> <p>8.8. Problems 265</p> <p>8.9. Notes and comments 268</p> <p><b>Chapter 9. Loss Systems 271</b></p> <p>9.1. General 271</p> <p>9.2. Erlang model 274</p> <p>9.3. The M/M/1/1 + C queue 276</p> <p>9.4. The “trunk” effect 279</p> <p>9.5. Engset model 280</p> <p>9.6. IPP/M/S/S queue 281</p> <p>9.7. Generalized Erlang models 285</p> <p>9.8. Hierarchical networks 289</p> <p>9.9. A model with balking 294</p> <p>9.10. A call center with impatient customers 301</p> <p>9.11. Problems 303</p> <p>9.12. Notes and comments 304</p> <p><b>PART 3: SPATIAL MODELING 307</b></p> <p><b>Chapter 10. Spatial Point Processes 309</b></p> <p>10.1. Preliminary 309</p> <p>10.2. Stochastic geometry 310</p> <p>10.3. Poisson process 311</p> <p>10.4. Stochastic analysis 326</p> <p>10.5. Problems 336</p> <p>10.6. Notes and comments 337</p> <p><b>Appendix A. Mathematical Toolbox 339</b></p> <p>A.1. Probability spaces and processes 339</p> <p>A.2. Conditional expectation 347</p> <p>A.3. Vector spaces and orders 352</p> <p>A.4. Bounded variation processes 356</p> <p>A.5. Martingales 363</p> <p>A.6. Laplace transform 378</p> <p>A.7. Notes and comments 379</p> <p>Bibliography 381</p> <p>Index 385</p>
<p><strong>Pascal Moyal</strong> is an associate Professor in the Applied Math. Department of Université de Technologie de Compi&egave;gne, France.
Diese Produkte könnten Sie auch interessieren:
