Research on Wide Area Industrial Internet Scheduling Algorithm Based on Service Reachability

Zhiyuan HU; Wenqian HU; Xiang LI; Zhi MA; Wenli WANG; Xudong WANG; Chunyang LI; Tiancong HUANG

doi:10.11999/JEIT200583

Volume 43 Issue 9

Sep. 2021

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2021 > 43(9): 2608-2616

Zhiyuan HU, Wenqian HU, Xiang LI, Zhi MA, Wenli WANG, Xudong WANG, Chunyang LI, Tiancong HUANG. Research on Wide Area Industrial Internet Scheduling Algorithm Based on Service Reachability[J]. Journal of Electronics & Information Technology, 2021, 43(9): 2608-2616. doi: 10.11999/JEIT200583

Citation:

Zhiyuan HU, Wenqian HU, Xiang LI, Zhi MA, Wenli WANG, Xudong WANG, Chunyang LI, Tiancong HUANG. Research on Wide Area Industrial Internet Scheduling Algorithm Based on Service Reachability[J]. Journal of Electronics & Information Technology, 2021, 43(9): 2608-2616. doi: 10.11999/JEIT200583

Citation:

Zhiyuan HU, Wenqian HU, Xiang LI, Zhi MA, Wenli WANG, Xudong WANG, Chunyang LI, Tiancong HUANG. Research on Wide Area Industrial Internet Scheduling Algorithm Based on Service Reachability[J]. Journal of Electronics & Information Technology, 2021, 43(9): 2608-2616. doi: 10.11999/JEIT200583

PDF( 2294 KB)

Research on Wide Area Industrial Internet Scheduling Algorithm Based on Service Reachability

doi: 10.11999/JEIT200583

Zhiyuan HU^{1
,
,},
Wenqian HU^1
,,
Xiang LI^1
,,
Zhi MA^1
,,
Wenli WANG^2
,,
Xudong WANG^1
,,
Chunyang LI^1
,,
Tiancong HUANG^1
,

1.
College of Communication Engineering, Chongqing University, Chongqing 400044, China
2.
CISDI Chongqing Information Technology Co., Ltd. Chongqing 401120, China

Funds: The National Science and Technology Major Projects (2017ZX01030204), Chongqing Basic Research and Frontier Exploration (cstc2015jcyjA40021)

Received Date: 2020-07-16
Rev Recd Date: 2021-07-05

Available Online: 2021-07-16

Publish Date: 2021-09-16

Abstract

Abstract

In the large-scale and heterogeneous network environment, the industrial Internet service has the characteristics of small scale and certainty, so it is difficult to match the resources of the heterogeneous bearer network with the scheduling of the service and the orchestration of the function chain. Based on this, a multi-node joint scheduling model based on Non-workconserving is proposed. First, the full-path time coordination algorithm is adopted to extend the function chain from the spatial dimension topological orchestration to the space-time dimension; Then, aiming at the problem of synchronous scheduling in network nodes, a flow scheduling algorithm based on urgency is proposed to smooth delay jittering, furthermore, time-triggered scheduling is extended to large-scale, heterogeneous and non-synchronous bearer networks. A virtual arrival queue scheduling algorithm is proposed, which uses service synchronization mechanism instead of time synchronization to ensure the reachability requirements of service determination. Simulation results show that the algorithm proposed in this paper can improve the accessibility of the service and ensure service can reach in time, on time or cooperatively.
- Industrial internet,
- Deterministic network,
- Reachability,
- Business orchestration,
- Non-workconsering

FullText(HTML)

References(22)

References

[1]	王俊文. 未来工业互联网发展的技术需求[J]. 电信科学, 2019, 35(8): 26–38. doi: 10.11959/j.issn.1000-0801.2019201 WANG Junwen. Technical requirement of future industrial internet[J]. Telecommunications Science, 2019, 35(8): 26–38. doi: 10.11959/j.issn.1000-0801.2019201
[2]	黄韬, 汪硕, 黄玉栋, 等. 确定性网络研究综述[J]. 通信学报, 2019, 40(6): 160–176. doi: 10.11959/j.issn.1000-436x.2019119 HUANG Tao, WANG Shuo, HUANG Yudong, et al. Survey of the deterministic network[J]. Journal on Communications, 2019, 40(6): 160–176. doi: 10.11959/j.issn.1000-436x.2019119
[3]	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. doi: 10.1109/COMST.2018.2869350
[4]	CAO Jiuyue, ZHANG Yan, AN Wei, et al. VNF-FG design and VNF placement for 5G mobile networks[J]. Science China Information Sciences, 2017, 60(4): 040302. doi: 10.1007/s11432-016-9031-x
[5]	YE Zilong, CAO Xiaojun, WANG Jianpin, et al. Joint topology design and mapping of service function chains for efficient, scalable, and reliable network functions virtualization[J]. IEEE Network, 2016, 30(3): 81–87. doi: 10.1109/MNET.2016.7474348
[6]	BECK M T, BOTERO J F, and SAMELIN K. Resilient allocation of service function chains[C]. 2016 IEEE Conference on Network Function Virtualization and Software Defined Networks, Palo Alto, USA, 2016: 128–133. doi: 10.1109/NFV-SDN.2016.7919487.
[7]	MAXIM D and SONG Yeqiong. Delay analysis of AVB traffic in time-sensitive networks (TSN)[C]. The 25th International Conference on Real-Time Networks and Systems, Grenoble, France, 2017: 18–27. doi: 10.1145/3139258.3139283.
[8]	CAO Jingyue, CUIJPERS P J L, BRIL R J, et al. Tight worst-case response-time analysis for Ethernet AVB using eligible intervals[C]. 2016 IEEE World Conference on Factory Communication Systems, Aveiro, Portugal, 2016: 1–8. doi: 10.1109/WFCS.2016.7496507.
[9]	MOHAMMADPOUR E, STAI E, MOHIUDDIN M, et al. Latency and backlog bounds in time-sensitive networking with credit based shapers and asynchronous traffic shaping[C]. The 30th International Teletraffic Congress, Vienna, Austria, 2018: 1–6. doi: 10.1109/ITC30.2018.10053.
[10]	THIELE D, ERNST R, and DIEMER J. Formal worst-case timing analysis of Ethernet TSN's time-aware and peristaltic shapers[C]. Proceedings of 2015 IEEE Vehicular Networking Conference, Kyoto, Japan, 2015: 251–258. doi: 10.1109/VNC.2015.7385584.
[11]	CRACIUNAS S S, OLIVER R S, CHMELÍK M, et al. Scheduling real-time communication in IEEE 802.1Qbv time sensitive networks[C]. The 24th International Conference on Real-Time Networks and Systems, Brest, France, 2016: 183–192. doi: 10.1145/2997465.2997470.
[12]	NAYAK N G, DÜRR F, and ROTHERMEL K. Incremental flow scheduling and routing in time-sensitive software-defined networks[J]. IEEE Transactions on Industrial Informatics, 2018, 14(5): 2066–2075. doi: 10.1109/TII.2017.2782235
[13]	NOVAK A, SUCHA P, and HANZALEK Z. Efficient algorithm for jitter minimization in time-triggered periodic mixed-criticality message scheduling problem[C]. The 24th International Conference on Real-Time Networks and Systems, Brest, France, 2016: 23–31. doi: 10.1145/2997465.2997481.
[14]	WAN Tao and ASHWOOD-SMITH P. A performance study of CPRI over Ethernet with IEEE 802.1Qbu and 802.1Qbv enhancements[C]. 2015 IEEE Global Communications Conference, San Diego, USA, 2015: 1–6. doi: 10.1109/GLOCOM.2015.7417599.
[15]	CHITIMALLA D, KONDEPU K, VALCARENGHI L, et al. 5G fronthaul-latency and jitter studies of CPRI over Ethernet[J]. Journal of Optical Communications and Networking, 2017, 9(2): 172–182. doi: 10.1364/JOCN.9.000172
[16]	LIEBEHERR J and YILMAZ E. Workconserving vs. non-workconserving packet scheduling: An issue revisited[C]. 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354), London, UK, 1999: 248–256. doi: 10.1109/IWQOS.1999.766500.
[17]	HAN K E, SONG J, KIM D U, et al. Grant-aware scheduling algorithm for VOQ-based input-buffered packet switches[J]. ETRI Journal, 2018, 40(3): 337–346. doi: 10.4218/etrij.2017-0057
[18]	MEI Lichun, QIAO Lufeng, CHEN Qinghua, et al. A Packet Dispatching Scheme with Load Balancing Based on iSLIP for Satellite Onboard CIOQ Switches[M]. LIANG Qilian, MU Jiasong, WANG Wei, et al. Communications, Signal Processing, and Systems. Singapore: Springer, 2016: 77–85. doi: 10.1007/978-981-10-3229-5_9.
[19]	AKGÜNGÖR A P and KORKMAZ E. Investigating parameter interactions with the factorial design method: Webster's optimal cycle length model[J]. Tehnički Vjesnik, 2018, 25(S2): 391–395. doi: 10.17559/TV-20170908185847
[20]	KOLPAKOV R M and POSYPKIN M A. On the best choice of a branching variable in the subset sum problem[J]. Discrete Mathematics and Applications, 2018, 28(1): 29–34. doi: 10.1515/dma-2018-0004
[21]	MEDHAT A M, CARELLA G, LÜCK C, et al. Near optimal service function path instantiation in a multi-datacenter environment[C]. The 11th International Conference on Network and Service Management, Barcelona, Spain, 2015: 336–341. doi: 10.1109/CNSM.2015.7367379.
[22]	DIEMER J, THIELE D, and ERNST R. Formal worst-case timing analysis of Ethernet topologies with strict-priority and AVB switching[C]. The 7th IEEE International Symposium on Industrial Embedded Systems, Karlsruhe, Germany, 2012: 1–10. doi: 10.1109/SIES.2012.6356564.