.png){kind=icon}
Return
An Efficient Hypergraph-Based Routing Algorithm in Time-Sensitive Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2024.3373262.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Global schedule
hypergraph
routing
time-sensitive networking (TSN)
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveUltra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research
OAAI
OAAIShareSaveUnbiasing Enhanced Sampling on a High-Dimensional Free Energy Surface with a Deep Generative Model
OAAI
OAAIShareSaveShareSave
View more