B.2. Basic Queuing Systems, Notation, and Little’s Law
In this section, we start by introducing the components of a queuing system, and then explain the employed notation. Then, fundamental stochastic processes and simple but useful results, e.g. Little’s law, are presented.
B.2.1. Elements of a Queuing System
The simplest queuing system is shown in Fig. B.1. It consists of two distinct components, namely, a generic queue (buffer space) and a generic server. The queue/buffer provides storage space for the customers that enter the system and cannot be served immediately (delayed in the system), while the server corresponds to the processing (service) required by each customer. For example, if customers correspond to network packets, the processing ...
Get Malware Diffusion Models for Modern Complex 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.
