基于软件定义的时间敏感网络跨域调度机制

doi:10.11959/j.issn.1000-436x.2021182

Abstract

Abstract:

For the cross domain scheduling problem of time-sensitive network, a software-defined cross-domain scheduling mechanism for time-sensitive networking was proposed, which was based on three kinds of wide area clock synchronization technology to ensure nanosecond inter-domain time synchronization.Then, a time slot conflict-free cross domain scheduling model was proposed to solve the problem of time slot alignment caused by inter-domain link delay.The time slot conflict-free constraints were used to strictly limit the arrival time of cross-domain traffic at the edge node.Finally, the gate control list of fusion domains for global scheduling was calculated online.The simulation results show that the model can schedule hundreds of time-sensitive traffic in a typical cross-domain remote control scenario, and has a feasible algorithm execution time in seconds.

Key words: time-sensitive networking, software-defined, cross-domain scheduling, gate-controlled list, QoS

CLC Number:

TP393

Shuo WANG, Yudong HUANG, Tao HUANG, Ru HUO, Yunjie LIU. Software-defined cross-domain scheduling mechanism for time-sensitive networking[J]. Journal on Communications, 2021, 42(10): 1-9.

Figures/Tables 7

参数表达式	参数说明
$E = {0, 1, 2, \dots}$	链路集合
$V = {0, 1, 2, \dots}$	节点集合
$A_{EE} \in {0, 1}^{\| E \| \times}^{\| E \|}$	稀疏邻边矩阵
$F_{cd} \subset ℕ$	跨域时间敏感流集合
$s_{F} \in V^{\| F \|}$	源节点向量，如果 $f \in F$ 开始于 $v \in V$ ，则 $s_{F} [f] = v$
$d_{F} \in V^{\| F \|}$	目的节点向量，如果 $f \in F$ 到达于 $v \in V$ ，则 $d_{F} [f] = v$
$p_{F} \in ℕ^{\| F \|}$	流发送周期向量，如果 $f \in F$ 有周期 $p_{f} \in ℕ$ ，则 $p_{F} [f] = p_{f}$
$t_{F} \in ℕ^{\| F \|}$	传输时延向量，如果 $f \in F$ 有 $t_{f} \in ℕ$ ，则 $t_{F} [f] = t_{f}$
$d l_{F} \in ℕ^{\| F \|}$	截止时间向量，如果 $f \in F$ 有 ${dl}_{f} \in ℕ$ ，则 $d l_{F} [f] = {dl}_{f}$
$h_{F} \in ℕ^{\| F \|}$	一跳时延向量，如果 $f \in F$ ， $h_{f} = t_{f} + t_{prop} + t_{proc}$
$h = LCM (p_{F})$	超周期，等于所有流周期的最小公倍数

References 24

[1]	NASRALLAH A , THYAGATURU A S , ALHARBI Z ,et al. Ultra-low latency (ULL) networks:the IEEE TSN and IETF DetNet standards and related 5G ULL research[J]. IEEE Communications Surveys ＆Tutorials, 2019,21(1): 88-145.
[2]	黄韬, 汪硕, 黄玉栋 ,等. 确定性网络研究综述[J]. 通信学报, 2019,40(6): 160-176.
	HUANG T , WANG S , HUANG Y D ,et al. Survey of the deterministic network[J]. Journal on Communications, 2019,40(6): 160-176.
[3]	IEC/IEEE. IEC/IEEE 60802 Time-sensitive networking profile for industrial automation[S]. IEEE, 2020.
[4]	DORR J , H?ME S , KERSCHBAUM S . TSN domain boundary considerations[S]. IEEE, 2020.
[5]	CHEN L . TSN configuration interaction[S]. IEEE, 2019.
[6]	B?HM M , OHMS J , WERMSER D . Multi-domain time-sensitive networks - an east-westbound protocol for dynamic TSN-stream configuration across domains[C]// Proceedings of 2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA). Piscataway:IEEE Press, 2019: 1363-1366.
[7]	BADAR A , LOU D Z , GRAF U ,et al. Intelligent edge control with deterministic-IP based industrial communication in process automation[C]// Proceedings of 2019 15th International Conference on Network and Service Management (CNSM). Piscataway:IEEE Press, 2019: 1-7.
[8]	HELLMANNS D , GLAVACKIJ A , FALK J ,et al. Scaling TSN scheduling for factory automation networks[C]// Proceedings of 2020 16th IEEE International Conference on Factory Communication Systems (WFCS). Piscataway:IEEE Press, 2020: 1-8.
[9]	赵廷, 李泽文, 邹彬 ,等. 卫星时钟与网络时钟互备的广域时间同步方法[J]. 电力系统自动化, 2017,41(14): 202-207.
	ZHAO T , LI Z W , ZOU B ,et al. Wide-area time synchronization method for mutual preparation of satellite clock and network clock[J]. Automation of Electric Power Systems, 2017,41(14): 202-207.
[10]	于佳亮, 施闯, 张东 ,等. 广域精确授时技术及其应用[J]. 电信工程技术与标准化, 2020,33(8): 82-87.
	YU J L , SHI C , ZHANG D ,et al. Wide-area precise timing technology and its application[J]. Telecom Engineering Technics and Standardization, 2020,33(8): 82-87.
[11]	李恩, 宋文忠, 罗青松 ,等. 光网络高精度授时体系建设策略研究[J]. 光通信技术, 2019,43(9): 58-62.
	LI E , SONG W Z , LUO Q S ,et al. Research on construction strategy of optical network high precision time service system[J]. Optical Communication Technology, 2019,43(9): 58-62.
[12]	朱瑾瑜, 程娜 . 时间敏感网络时间同步特性综述[J]. 信息通信技术与政策, 2019(12): 70-73.
	ZHU J Y , CHENG N . Overview of time-sensitive network time synchronization characteristics[J]. Information and Communications Technology and Policy, 2019(12): 70-73.
[13]	STEINER W , . An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks[C]// Proceedings of 2010 31st IEEE Real-Time Systems Symposium. Piscataway:IEEE Press, 2010: 375-384.
[14]	DüRR F , NAYAK N G . No-wait packet scheduling for IEEE Time-sensitive networks (TSN)[C]// Proceedings of Proceedings of the 24th International Conference on Real-Time Networks and Systems. New York:ACM Press, 2016: 203-212.
[15]	NAYAK N G , DüRR F , ROTHERMEL K . Incremental flow scheduling and routing in time-sensitive software-defined networks[J]. IEEE Transactions on Industrial Informatics, 2018,14(5): 2066-2075.
[16]	王敬超, 高先明, 黄玉栋 ,等. 时间敏感网络的控制架构[J]. 北京邮电大学学报, 2021,44(2): 95-101.
	WANG J C , GAO X M , HUANG Y D ,et al. Research of control framework in time-sensitive network[J]. Journal of Beijing University of Posts and Telecommunications, 2021,44(2): 95-101.
[17]	CRACIUNAS S S , OLIVER R S , CHMELíK M ,et al. Scheduling real-time communication in IEEE 802.1Qbv time sensitive networks[C]// Proceedings of the 24th International Conference on Real-Time Networks and Systems. New York:ACM Press, 2016: 183-192.
[18]	POZO F , STEINER W , RODRIGUEZ-NAVAS G ,et al. A decomposition approach for SMT-based schedule synthesis for time-triggered networks[C]// Proceedings of 2015 IEEE 20th Conference on Emerging Technologies ＆ Factory Automation (ETFA). Piscataway:IEEE Press, 2015: 1-8.
[19]	SCHWEISSGUTH E , TIMMERMANN D , PARZYJEGLA H ,et al. ILP-based routing and scheduling of multicast real-time traffic in time-sensitive networks[C]// Proceedings of 2020 IEEE 26th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). Piscataway:IEEE Press, 2020: 1-11.
[20]	ATALLAH A A , HAMAD G B , MOHAMED O A . Routing and scheduling of time-triggered traffic in time-sensitive networks[J]. IEEE Transactions on Industrial Informatics, 2020,16(7): 4525-4534.
[21]	FALK J , DURR F , ROTHERMEL K . Exploring practical limitations of joint routing and scheduling for TSN with ILP[C]// Proceedings of 2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). Piscataway:IEEE Press, 2018: 136-146.
[22]	YAN J L , QUAN W , JIANG X Y ,et al. Injection time planning:making CQF practical in time-sensitive networking[C]// Proceedings of IEEE INFOCOM 2020 - IEEE Conference on Computer Communications. Piscataway:IEEE Press, 2020: 616-625.
[23]	KROLIKOWSKI J , MARTIN S , MEDAGLIANI P ,et al. Joint routing and scheduling for large-scale deterministic IP networks[J]. Computer Communications, 2021,165: 33-42.
[24]	IETF DetNet. Deterministic networking use cases[S]. IEEE, 2019.

Metrics

Recommended 0

No Suggested Reading articles found!

Software-defined cross-domain scheduling mechanism for time-sensitive networking

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 7

References 24

Related Articles 15

Metrics

Recommended 0

[1]	Hongrui NIE, Shaosheng LI, Yong LIU. Optimized scheduling mechanism based on IEEE 802.1Qch standard in time-sensitive networking [J]. Journal on Communications, 2022, 43(9): 12-26.
[2]	Changchuan YIN, Yanjue LI, Hailong ZHU, Xinxin HE, Wenxuan HAN. HSTC: hybrid traffic scheduling mechanism in time-sensitive networking [J]. Journal on Communications, 2022, 43(6): 119-132.
[3]	Weijing QI, Qingyang SONG, Lei GUO. Dual time scale resource allocation for RAN slicing in software-defined oriented polymorphic IoV [J]. Journal on Communications, 2022, 43(4): 60-70.
[4]	Ping WU, Chaowen CHANG, Zhibin ZUO, Yingying MA. Address overloading-based packet forwarding verification in SDN [J]. Journal on Communications, 2022, 43(3): 88-100.
[5]	Jun’e LI, Qiuyu LU, Jian LIU, Kai YUAN, Wei TIAN, Bijun PENG. Communication service priority in smart substation and its queue scheduling method [J]. Journal on Communications, 2021, 42(7): 25-40.
[6]	Ping WU, Chaowen CHANG, Yingying MA. Port address overloading based packet forwarding verification in SDN [J]. Journal on Communications, 2021, 42(7): 70-83.
[7]	Chaowen CHANG, Jianshu JIN, Peisheng HAN, Xianwei ZHU. Software-defined network packet forwarding verification scheme based on attribute-based signatures identification [J]. Journal on Communications, 2021, 42(6): 131-144.
[8]	Lei SUN, Jianquan WANG, Shangjing LIN, Zhangchao MA, Wei LI, Liang Qilian, Rong HUANG. Research on 5G-TSN joint scheduling mechanism based on radio channel information [J]. Journal on Communications, 2021, 42(12): 65-75.
[9]	Ruozhou LIANG, Xibin ZHAO, Hai WAN. Deterministic local multi-point fault detection method for industrial control topology [J]. Journal on Communications, 2021, 42(10): 10-22.
[10]	Yueping CAI, Dong LI, Chi XU, Zhen WANG, Xiaowen ZHANG. Integrating 5G-U with time-sensitive networking for industrial Internet: architectures and technologies [J]. Journal on Communications, 2021, 42(10): 43-54.
[11]	Xiaolan XIE, Lanying ZENG, Qinghai ZHAI. QoS aware evaluation model supporting service correlation in manufacturing cloud service composition [J]. Journal on Communications, 2021, 42(1): 118-129.
[12]	Lan YAO,Julong LAN. Adaptive SDN switch migration mechanism based on coalitional game [J]. Journal on Communications, 2020, 41(8): 1-10.
[13]	Yi LU,Mengying XU,Jie ZHOU. Multi-constraints QoS routing optimization based on improved immune clonal shuffled frog leaping algorithm [J]. Journal on Communications, 2020, 41(5): 141-149.
[14]	Yingxu LAI,Yewei PU,Jing LIU. Research on switch migration method based on minimum cost path [J]. Journal on Communications, 2020, 41(2): 131-142.
[15]	Lei GUO,Xu ZHANG,Weigang HOU,Yejun LIU,Qihan ZHANG,Zizheng CAO. Research progress and prospect of software-defined multi-dimensional optical network [J]. Journal on Communications, 2020, 41(1): 152-161.