Computer Networks Lecture 28: Queueing Theory
Geoffrey Messier · 72:48
Erlang-style queuing theory (an M/M/1-type birth–death model) lets you estimate how likely a router buffer is to overflow and how big a buffer you need for a target drop rate. In the HP ProCurve example, a small buffe...