Finally, we fully characterize the network dynamics for both these switch scheduling algorithms.
We also show that the iSLIP switch scheduling algorithm achieves fairness among ports, instead of fairness among flows.
In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms.
For instance, we prove that this is the case for the MWM switch scheduling algorithm, even with a single router output and basic TCP flows.
We show that switch scheduling algorithms that were designed without taking into account these interactions can exhibit a completely different behavior when interacting with feedback-based Internet traffic.
Based on this result, all simulations henceforth will utilize the same switch schedule as the one used for this first set of simulations.
All task parameter sets are described as follows: active/inactive lever switch schedule, active lever response schedule, OLP response schedule (observing light duration), i.e., for the final training session, S30, the schedule was FT90s, VR10-20, OLP FR1 (15s).–20, OLP FR1 (15s).
"they're switching schedules and guidance counselors".
According to received schedule messages (Figure 4), nodes set up their own phase-switching schedules, which ensure them to switch to the same phase simultaneously.
Note that, based on schedule messages and nodes' local clocks, phase-switching schedules are supposed to be established at each node to ensure matching operations if no clock-drift.
