DCQF: Differentiated Cyclic Queuing and Forwarding in Large-Scale Deterministic Networks

Mengyu Wang, Shuyong Zhu, Yujun Zhang

Abstract: Emerging time-sensitive applications impose demands on bounded latency and jitter of network transmission, introducing their deterministic scheduling problem. There are mainly two types of methods for it, fixed rate limit based and hyper-period based, which still face challenges in scheduling performance and run time. We also noticed that flows may experience redundant queuing delay at some hops because of current methods' inability to distinguish them with different arrival patterns, increasing their end-to-end latency. To address the above issues, we present a method based on Differentiated Cyclic Queuing and Forwarding for time-sensitive flows' deterministic scheduling in large-scale networks, called DCQF. It provides fast and slow transmission modes at each hop and forwards flows in the earliest feasible sending cycles according to their arrival patterns. Due to employing a relatively simple scheduling model and relaxing flows' constraints by reducing their queuing delay, DCQF demonstrates higher computational efficiency and provides lower latency for flows in experiments, reflecting its feasibility and advantages in solving the deterministic scheduling problem in large-scale networks.

External IDs:dblp:conf/iwqos/WangZZ25