.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Global schedule
hypergraph
routing
time-sensitive networking (TSN)
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
Learning-Based Scalable Scheduling and Routing Co-Design With Stream Similarity Partitioning for Time-Sensitive Networking具有流相似性划分的基于学习的可扩展调度和路由协同设计，用于时间敏感网络
PREAI
分享收藏Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research超低延迟 (ULL) 网络: IEEE TSN和IETF DetNet标准以及相关的5g ULL研究
OAAI
OAAI分享收藏Unbiasing Enhanced Sampling on a High-Dimensional Free Energy Surface with a Deep Generative Model
OAAI
OAAI分享收藏Adaptive Group Routing and Scheduling in Multicast Time-Sensitive Networks多播时间敏感网络中的自适应组路由和调度.png)
IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容