‡ Swansea University, Wales, UK
Queueing theory has been successful for performance analysis of circuit-switched and packet-switched networks. Historically, queueing theory can be traced back to Danish mathematician A. K. Erlang who developed the well-known Erlang B and Erlang C formulas relating the capacity of telephone switches to the probability of call blocking. Since the emergence of packet switching in the late 1960s, queueing theory has become the primary mathematical apparatus for modeling and analysis of computer networks including the Internet. For packet-switched networks, the main performance metrics of interest are usually packet loss and packet delays.
Simple and intermediate ...
Get Mathematical Foundations for Signal Processing, Communications, and Networking 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.
