A Deterministic Switch with Perfect Resource Utilization and Guaranteed QoS
Yang Huang, Bing Hu, Yan Wang, Qi Su · 2019
With the rapid growth of communication demands, a large number of new applications have stringent quality-of-service (QoS) requirements and require that the network can provide guaranteed QoS. However, most commercial switches/routers are designed to achieve higher throughput and lower average delay for Internet best-effort traffic, whereas cannot provide guaranteed QoS. The problem of fully utilizing a switch while still guaranteeing delivery of a certain class of traffic is timeless. In this paper, we designed a deterministic switch that adopts a new hybrid queue structure and a novel slot-based iterative scheduling algorithm called Frame Reservation First (FRF). Our deterministic switch can not only reserve bandwidth for deterministic traffic, but also share the unused reserved bandwidth to all best-effort traffic to maximize the utilization of bandwidth resources. Simulation result shows that deterministic switch provides very low bounded latency for deterministic traffic and the best best-effort packet average delay performance among the existing scheduling algorithms for IQ switches.