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

被引:0
|
作者
Lu, Yinzhi [1 ]
Zhao, Guofeng [1 ]
Xu, Chuan [1 ]
Yu, Shui [2 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
[2] Univ Technol Sydney, Sch Comp Sci, Sydney, NSW 2007, Australia
基金
中国国家自然科学基金;
关键词
Global schedule; hypergraph; routing; time-sensitive networking (TSN);
D O I
10.1109/LSP.2024.3373262
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:835 / 839
页数:5
相关论文
共 50 条
  • [41] A HYPERGRAPH-BASED LEARNING ALGORITHM FOR CLASSIFYING ARRAYCGH DATA WITH SPATIAL PRIOR
    Tian, Ze
    Hwang, TaeHyun
    Kuang, Rui
    2009 IEEE INTERNATIONAL WORKSHOP ON GENOMIC SIGNAL PROCESSING AND STATISTICS (GENSIPS 2009), 2009, : 184 - 187
  • [42] Time-Sensitive Overlay Routing via Segment Routing with Failure Correction
    Zheng, Zengwei
    Zhao, Chenwei
    Zhang, Jianwei
    2021 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2021,
  • [43] Joint Routing and Scheduling Optimization of In-Vehicle Time-Sensitive Networks Based on Improved Grey Wolf Optimizer
    Sun, Wenjing
    Zou, Yuan
    Zhang, Xudong
    Wen, Ya
    Du, Guodong
    Liu, Jiahui
    Wu, Jinming
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (04): : 7093 - 7106
  • [44] A hypergraph-based algorithm for image restoration from salt and pepper noise
    Dharmarajan, R.
    Kannan, K.
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2010, 64 (12) : 1114 - 1122
  • [45] Time-Sensitive Utility-Based Routing in Duty-Cycle Wireless Sensor Networks with Unreliable Links
    Xiao, Mingjun
    Wu, Jie
    Huang, Liusheng
    2012 31ST INTERNATIONAL SYMPOSIUM ON RELIABLE DISTRIBUTED SYSTEMS (SRDS 2012), 2012, : 311 - 320
  • [46] Improving the Scalability of Online Social Networks with Hypergraph-Based Data Placement
    Zhou, Jingya
    Fan, Jianxi
    JOURNAL OF INTERNET TECHNOLOGY, 2016, 17 (06): : 1173 - 1185
  • [47] Time-predictable routing algorithm for Time-Sensitive Networking: Schedulable guarantee of Time-Triggered streams
    Chang, Shih-Hung
    Chen, Huan
    Cheng, Bo-Chao
    COMPUTER COMMUNICATIONS, 2021, 172 : 183 - 195
  • [48] An optimal GTS scheduling algorithm for time-sensitive transactions in IEEE 802.15.4 networks
    Na, Chewoo
    Yang, Yaling
    Mishra, Amitabh
    COMPUTER NETWORKS, 2008, 52 (13) : 2543 - 2557
  • [49] Joint Algorithm of Message Fragmentation and No-Wait Scheduling for Time-Sensitive Networks
    Xi Jin
    Changqing Xia
    Nan Guan
    Peng Zeng
    IEEE/CAA Journal of Automatica Sinica, 2021, 8 (02) : 478 - 490
  • [50] FlowerCast: Efficient Time-sensitive Multicast in Wireless Sensor Networks with Link Uncertainty
    Tang, Jianzhi
    Fu, Luoyi
    Liang, Shiyu
    Long, Fei
    Zhou, Lei
    Wang, Xinbing
    Zhou, Chenghu
    ACM TRANSACTIONS ON SENSOR NETWORKS, 2024, 20 (01)