A Heuristic Online Algorithm for Routing in Large-Scale Deterministic Networks

Large-scale Deterministic Network (LDN) is presented to achieve deterministic transmission in the Wide Area Networks (WAN), which provides bounded delay and jitter with the Cycle Specified Queuing and Forwarding (CSQF) and shaping mechanisms. However, routing of time-sensitive flows in LDN still proves to be challenging. As flows’ rates are adjusted by the shapers at ingress nodes, leading to uncertainty of delay and bandwidth constraints, traditional routing algorithms used to solve the Multi-Constrained Path (MCP) problem cannot be directly applied in LDN, which might encounter the early rejection of flows and have overlong runtime for online scenarios. In this paper, we propose a Heuristic Online Algorithm based on a PathBook called PB-HOA, which computes paths in advance and uses a metric at the path level that considers the variable flows’ rates to select routes. Our experiments show that PB-HOA can successfully generate routes for most flows at a fast execution speed, confirming its feasibility for routing in LDN.