Daqian Liu, Zhewei Zhang, Yuntao Shi, Yingying Wang, Zhenwu Lei
{"title":"A novel fuzzy-logic-based adaptive gate-controlled scheduling algorithm for time-aware shaper in TSN","authors":"Daqian Liu, Zhewei Zhang, Yuntao Shi, Yingying Wang, Zhenwu Lei","doi":"10.1016/j.comcom.2025.108268","DOIUrl":null,"url":null,"abstract":"<div><div>Time-sensitive networking (TSN) is critical for real-time, industrial, and mission-critical applications that require deterministic communication. Scheduling time-triggered flows in TSN’s time-aware shaper (TAS) mechanism constitute an NP-hard problem, where the inherent trade-off between computational complexity and scheduling optimality persists. Exact algorithms achieve precision via exhaustive search mechanisms at prohibitive costs, while heuristic algorithms sacrifice fidelity to accelerate execution under complex network scenarios. This paper addresses these challenges through a novel rule-based framework that employs a fuzzy logic system to dynamically select algorithms, ensuring adaptation to complex requirements in diverse scenarios. In addition, a dynamic switching algorithm is proposed to intelligently select the most suitable scheduling method based on real-time network conditions and task requirements. Compared with traditional exact algorithms, our approach reduces computation time by over 35% in large-scale networks while meeting time constraints. In small-scale networks, it increases the scheduling success ratio by 20% compared to heuristic methods, particularly when higher accuracy is required. The proposed framework establishes an innovative analytical perspective for TAS traffic scheduling challenges by enabling self-adaptive algorithm matching across varying scheduling demands, rather than constraining specific algorithms to predefined operational scenarios.</div></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"241 ","pages":"Article 108268"},"PeriodicalIF":4.3000,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366425002257","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Time-sensitive networking (TSN) is critical for real-time, industrial, and mission-critical applications that require deterministic communication. Scheduling time-triggered flows in TSN’s time-aware shaper (TAS) mechanism constitute an NP-hard problem, where the inherent trade-off between computational complexity and scheduling optimality persists. Exact algorithms achieve precision via exhaustive search mechanisms at prohibitive costs, while heuristic algorithms sacrifice fidelity to accelerate execution under complex network scenarios. This paper addresses these challenges through a novel rule-based framework that employs a fuzzy logic system to dynamically select algorithms, ensuring adaptation to complex requirements in diverse scenarios. In addition, a dynamic switching algorithm is proposed to intelligently select the most suitable scheduling method based on real-time network conditions and task requirements. Compared with traditional exact algorithms, our approach reduces computation time by over 35% in large-scale networks while meeting time constraints. In small-scale networks, it increases the scheduling success ratio by 20% compared to heuristic methods, particularly when higher accuracy is required. The proposed framework establishes an innovative analytical perspective for TAS traffic scheduling challenges by enabling self-adaptive algorithm matching across varying scheduling demands, rather than constraining specific algorithms to predefined operational scenarios.
期刊介绍:
Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms.
Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.