Effects of port congestion in the gate control list scheduling of time sensitive networks

摘要

Time Sensitive Networking (TSN) can provide deterministic traffic behavior over Ethernet networks, for time sensitive traffic, whilst also bound the delay/jitter. To do so, the IEEE TSN working group introduced a network-wide transmission port scheduling mechanism. The duration of this schedule is directly related with the delay; hence reducing it can be beneficial within the TSN paradigm. This paper investigates the effects of port congestion, in the duration of the network wide schedule. A congested port can make scheduling more complex, leading to longer network-wide schedules. To verify this, the same set of experiments was repeated, with and without considering port congestion during path allocation. The computed paths were given as input to an implementation of the shifting bottleneck heuristic algorithm. The shifting bottleneck heuristic, computed the network-wide gating schedule. The results show that with port congestion as a metric during path allocation the duration of the gating schedule in multipath networks can be reduced up to 26%.