• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Wang, Xiaolong (Wang, Xiaolong.) | Yao, Haipeng (Yao, Haipeng.) | Mai, Tianle (Mai, Tianle.) | Xiong, Zehui (Xiong, Zehui.) | Wang, Fu (Wang, Fu.) | Liu, Yunjie (Liu, Yunjie.)

Indexed by:

EI Scopus SCIE

Abstract:

Various Industrial Internet of Things (IIoT) devices and their compelling applications have witnessed exponential growth over the past few years. Compared to the consumer internet, the industrial IoT often faces tough communication latency boundaries and low packet loss. Recently, time-sensitive networks (TSN) technique has been considered the most promising solution to tackle these issues, providing deterministic communication guarantees for time-sensitive applications. In TSN, to achieve bounded low latency, it introduces the Cyclic Queuing and Forwarding (CQF) mechanism to shape and regulate the transmission selection to provide the protected transmission window for time-triggered (TT) flows. Currently, a considerable amount of literature has explored traffic scheduling with the CQF mechanism in TSN. However, these methods ignore the impact of routing policy on scheduling optimization. In this paper, we design two algorithms to tackle the problem of joint routing and scheduling optimization with the CQF mechanism for TSN. We propose a TT flow sorting algorithm (JDPS) to measure the scheduling priority weight of each TT flow, which uses the normalization method to calculate the weight based on the flow's deadline, period, and size. Then, we propose a joint routing and scheduling optimization with load balance algorithm (JRS-LB) to improve the scheduling success radio and the network resource utilization, which jointly considers the injection time slot offset, scheduling, and routing of TT traffic. The evaluation results mainly focus on the scheduling success ratio, execution time, and resource utilization for the proposed algorithm compared to the Tabu and Naive algorithms. Extensive simulations indicate that the proposed JDPS and JRS-LB algorithms can improve the scheduling success radio compared with the other algorithms.

Keyword:

Optimization Jitter Job shop scheduling Switches joint routing and scheduling Time-sensitive networking (TSN) Logic gates Schedules cyclic queuing and forwarding (CQF) Routing

Author Community:

  • [ 1 ] [Wang, Xiaolong]Beijing Univ Technol, Fac Informat Technol, Beijing 100124, Peoples R China
  • [ 2 ] [Liu, Yunjie]Beijing Univ Technol, Fac Informat Technol, Beijing 100124, Peoples R China
  • [ 3 ] [Yao, Haipeng]Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
  • [ 4 ] [Mai, Tianle]Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
  • [ 5 ] [Wang, Fu]Beijing Univ Posts & Telecommun, Sch Elect Engn, Beijing 100876, Peoples R China
  • [ 6 ] [Xiong, Zehui]Singapore Univ Technol & Design, Pillar Informat SystemsTechnol & Design, Singapore 487372, Singapore

Reprint Author's Address:

  • [Yao, Haipeng]Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China;;

Show more details

Related Keywords:

Related Article:

Source :

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY

ISSN: 0018-9545

Year: 2023

Issue: 3

Volume: 72

Page: 3793-3804

6 . 8 0 0

JCR@2022

ESI Discipline: ENGINEERING;

ESI HC Threshold:19

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 1

Affiliated Colleges:

Online/Total:1577/10993984
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.