An Efficient Hypergraph-Based Routing Algorithm in Time-Sensitive Networks

Routing, working with scheduling cooperatively to ensure the deterministic low-latency communication, plays a critical role in Time-Sensitive Networking (TSN). The multi-level spatial correlation among network nodes may greatly impact the forwarding paths of flows and is yet to be well investigated to improve the paths selecting process. In this letter, hypergraph is first introduced to model the time-sensitive networks, which can capture group features and higher-dimensional relationships for nodes. Then, the forwarding process for flows on a hyperedge and the end-to-end hyperpaths of flows are analyzed and studied. Finally, a hypergraph-based routing algorithm is designed to provide efficient routing decisions for time-sensitive flows. Simulation results show that the proposed routing algorithm can enhance the efficiency of paths planning and provide satisfiable global schedule for time-sensitive networks.