Stochastic Processes and Queues
Abstract
Traffic as offered to a network is stochastic and described by stochastic processes. Similarly, nodes processing traffic are described by queues. The by far most important models of traffic are based on the Poisson distribution, which is discussed in some detail.
A large class of queues and networks can be treated by Markov chain analysis—at least in principle—but the state space grows very fast with system size. We show some fundamental results and an approximation method where evaluation by randomization is applied to a truncated state space.
The frequently used Erlang formulas are discussed with focus on computational issues and some generalizations are presented. Analysis of a simple two-stage ...
Get Design of Modern Communication Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
