Network Bottleneck-Link Simulation

This illustrates four nodes communicating over three network links, with A sending packets to B, then B forwarding them to C. This uses store-and-forward routing, rather than cut-through routing. Try making the middle link a bottleneck by reducing its bandwidth compared to the edge links, then send multiple packets back to back and see what happens.

A-B Bandwidth R(AB): 0 kb/sec, the rate at which A transmits bits to B.
A-B Delay D(AB)_prop: 0 ms, the delay of the wire connecting A and B.

B-C Bandwidth R(BC): 0 kb/sec, the rate at which B transmits bits to C.
B-C Delay D(BC)_prop: 0 ms, the delay of the wire connecting B and C.

C-D Bandwidth R(CD): 0 kb/sec, the rate at which C transmits bits to D.
C-D Delay D(CD)_prop: 0 ms, the delay of the wire connecting C and D.
Packet Size L: 0 bytes, the length of the packet.

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}$
Total Delay for each packet $D_packet = D(AB)_xmit + D(AB)_prop + D(BC)_xmit + D(BC)_prop + D(DC)_xmit + D(DC)_prop = {Dtotal:ms}$