its service time dictates the throughput along the path.
Node-by-node analysis such as that in table II for several paths shows that the analysis presented correctly identifies the bottleneck node along the path.
Examination of the queues at each node along the paths simulated shows that, as expected, the queues are continually full until the bottleneck, the node with the highest average service time.
Beyond this bottleneck, the queues at subsequent nodes are close to empty.