Consider the figure below, which shows the arrival of 11 messages
for transmission at different multiple access wireless nodes at times
t = <0.2, 1.1, 1.4, 1.7, 2.1, 2.2, 2.8, 3.1, 3.8, 3.9, 4.4> and each transmission requires exactly one time unit.
We gratefully acknowledge the programming and problem design work of John Broderick (UMass '21), which has really helped to substantially improve this site.
