Three-Hop Network Bottleneck and Queue Simulation

This illustrates a few nodes connected by links, where the middle nodes have finite-sized packet queues. Vary the queue capacities and bandwidths, then send some packets and see what happens.

Bandwidth

$R(AB) = {RAB:KBps}$
$R(BC) = {RBC:KBps}$
$R(CD) = {RCD:KBps}$
Queue Capacity

$Q(B)_cap = {QB}$ packets
$Q(C)_cap = {QC}$ packets

Packet Size $L = {L:KB}$
Propagation Delay $D_prop = {Dprop:ms}$
A-B Transmission Delay $D(AB)_xmit = L / R(AB) = {DABxmit:ms}$
B-C Transmission Delay $D(BC)_xmit = L / R(BC) = {DBCxmit:ms}$
C-D Transmission Delay $D(CD)_xmit = L / R(CD) = {DCDxmit:ms}$
Best-case end-to-end delay $D_packet = D(AB)_xmit + D_prop + D(BC)_xmit + D_prop + D(DC)_xmit + D_prop = {Dtotal:ms}$


Size:
Spacing: