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

Lu, Y; Zhao, G; Xu, C; Yu, S

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

Lu, Y Zhao, G Xu, C Yu, S

Permalink

Publisher:: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Publication Type:: Journal Article
Citation:: IEEE Signal Processing Letters, 2024, 31, pp. 835-839
Issue Date:: 2024-01-01

Recently Added

	Filename	Description	Size
	1717241.pdf	Published version	725.22 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is new to OPUS and is not currently available.

Full metadata record

Field	Value	Language
dc.contributor.author	Lu, Y
dc.contributor.author	Zhao, G
dc.contributor.author	Xu, C
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.date.accessioned	2024-08-07T05:13:35Z
dc.date.available	2024-08-07T05:13:35Z
dc.date.issued	2024-01-01
dc.identifier.citation	IEEE Signal Processing Letters, 2024, 31, pp. 835-839
dc.identifier.issn	1070-9908
dc.identifier.issn	1558-2361
dc.identifier.uri	http://hdl.handle.net/10453/180285
dc.description.abstract	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.
dc.language	English
dc.publisher	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartof	IEEE Signal Processing Letters
dc.relation.isbasedon	10.1109/LSP.2024.3373262
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.subject	0801 Artificial Intelligence and Image Processing, 0906 Electrical and Electronic Engineering, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.subject.classification	4006 Communications engineering
dc.subject.classification	4009 Electronics, sensors and digital hardware
dc.subject.classification	4603 Computer vision and multimedia computation
dc.title	An Efficient Hypergraph-Based Routing Algorithm in Time-Sensitive Networks
dc.type	Journal Article
utslib.citation.volume	31
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	1005 Communications Technologies
pubs.organisational-group	University of Technology Sydney
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	University of Technology Sydney/Strength - CCSP - Centre for Cyber Security and Privacy
utslib.copyright.status	recently_added	*
dc.date.updated	2024-08-07T05:13:34Z
pubs.publication-status	Published
pubs.volume	31

Abstract:

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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/180285