A Damper Scheduling Mechanism Based on Network Calculus Theory

doi:10.13190/j.jbupt.2020-128

Journal of Beijing University of Posts and Telecommunications ›› 2021, Vol. 44 ›› Issue (2): 26-32.doi: 10.13190/j.jbupt.2020-128

• The Special Issue on Future Network Architecture and Key Technologies • Previous Articles Next Articles

A Damper Scheduling Mechanism Based on Network Calculus Theory

REN Shou-shou, LIU Bing-yang, WANG Chuang, MENG Rui, LIU Xuan

Beijing Huawei Digital Technologies Company Limited, Beijing 100195, China

Received:2020-08-20 Online:2021-04-28 Published:2021-04-28

Abstract

Abstract: A new packet scheduling mechanism, which can provide bounded latency and jitter for Internet protocol (IP) network, is proposed. With the guidance of network calculus, the Damper scheduling mechanism performs per-hop shaping by actively holding packets in the damper module per-hop and thereby eliminating the delay deterioration. The Damper mechanism requires neither time synchronization among network devices, nor per-flow status maintenance on core devices. It supports large-scale transmission distances and thus can be extended on large-scale IP networks.

Key words: deterministic latency, deterministic jitter, network calculus, Damper

CLC Number:

TN911.22

REN Shou-shou, LIU Bing-yang, WANG Chuang, MENG Rui, LIU Xuan. A Damper Scheduling Mechanism Based on Network Calculus Theory[J]. Journal of Beijing University of Posts and Telecommunications, 2021, 44(2): 26-32.

References

[1] 3GPP. 3GPP Release 15:TR 21. 915-2019[S/OL]. 2019[2020-08-12]. https://www.3gpp.org/release-15.
[2] Popovski P, Trillingsgaard K F, Simeone O, et al. 5G wireless network slicing for eMBB, URLLC, and mMTC:a communication-theoretic view[J]. IEEE Acces 6, 2018:55765-55779.
[3] Fettweis G, Boche H, Wiegand T, et al. The tactile internet-ITU-T technology watch report[R]. Geneva:ITU, 2014.
[4] 3GPP. 3GPP technical specification group services and system aspects:service requirements for the 5G system:2017[S/OL].[2020-08-10]. https://www.3gpp.org/ftp/Specs/archive/22_series/22.261/.
[5] 左旭彤, 王莫为, 崔勇. 低时延网络:架构, 关键场景与研究展望[J]. 通信学报, 2019, 40(8):22-35. Zuo Xutong, Wang Mowei, Cui Yong. Low-latency networking:architecture, key scenarios and research prospect[J]. Journal on Communications, 2019, 40(8):22-35.
[6] Verma D. Guaranteeing delay jitter bounds in packet switching networks[C]//Proceedings of IEEE TriCom'91. Chapel Hill:[s. n.], 1991.
[7] Braden R, Clark D, Shenker S. RFC1633:integrated services in the Internet architecture:an overview[R/OL]. (1994-09-16)[2020-08-14]. http://www.doc88.com/p-1364841430117.html.
[8] 王重钢, 隆克平, 龚向阳, 等. 分组交换网络中队列调度算法的研究及其展望[J]. 电子学报, 2001, 29(4):553-559. Wang Chonggang, Long Keping, Gong Xiangyang, et al. The study and perspective of queue scheduling algorithms in packet switching networks[J]. Chinese Journal of Electronics, 2001, 29(4):553-559.
[9] Le Boudec J Y, Thiran P. Network calculus:a theory of deterministic queuing systems for the Internet[M].[S. l.]:Springer Science and Business Media, 2001.
[10] Blake S, Black D, Carlson M, et al. RFC 2475:an architecture for differentiated services[R/OL]. (1998-09-16)[2020-08-10].http://www.doc88.com/p-6833728128856.html.
[11] Specht J, Samii S. Urgency-based scheduler for time-sensitive switched ethernet networks[C]//2016 28th Euromicro Conference on Real-Time Systems (ECRTS). Toulouse:IEEE, 2016:75-85.
[12] Finn N, Thubert P, Varga B, et al. Deterministic networking architecture, draft-ietf-detnet-architecture-02[J]. IETF Internet-Draft, 2017:1-43.
[13] Li Z, Wan H, Zhao B, et al. Dynamically optimizing end-to-end latency for time-triggered networks[C]//Proceedings of the ACM SIGCOMM 2019 Workshop on Networking for Emerging Applications and Technologies. Beijing:ACM, 2019:36-42.
[14] Zhang J, Chen L, Wang T, et al. Analysis of TSN for industrial automation based on network calculus[C]//2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA). Zaragoza:IEEE, 2019:240-247.
[15] Grigorjew A, Metzger F, Hoβfeld T, et al. Bounded latency with bridge-local stream reservation and strict priority queuing[C]//2020 11th International Conference on Network of the Future (NoF).[S. l.]:IEEE, 2020:55-63.
[16] Grigorjew A, Metzger F, Hoβfeld T, et al. Technical report on bridge-local guaranteed latency with strict priority scheduling[R]. Berlin:[s.n.], 2020:1-10.
[17] Charny A, Le Boudec J Y. Delay bounds in a network with aggregate scheduling[C]//International Workshop on Quality of Future Internet Services. Berlin:Springer, 2000:1-13.
[18] Zhang Z L, Duan Z, Hou Y T. Fundamental trade-offs in aggregate packet scheduling[C]//Proceedings Ninth International Conference on Network Protocols.[S.l.]:IEEE, 2001:129-137.

A Damper Scheduling Mechanism Based on Network Calculus Theory

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 5

Recommended Articles

Metrics

Comments

[1]	LI Song, WANG Xinrong, WANG Bowen, SUN Yanjing, CHEN Ruirui. Performance Analysis of Vehicular Edge Computing Based on Stochastic Network Calculus [J]. Journal of Beijing University of Posts and Telecommunications, 2022, 45(5): 16-22.
[2]	YANG Peng, ZHANG Yi-fu, LI Zhi-du, WU Da-peng, WANG Ru-yan. Latency Guarantee Model for Reliable Edge-Node Cooperation [J]. Journal of Beijing University of Posts and Telecommunications, 2021, 44(2): 47-53.
[3]	ZHAO Lei-lei, YU Yue-wei, ZHOU Chang-cheng, YANG Fu-xing. Effect of Seat Damper Bidirectional Ratio on Impact Dynamic Behaviors of Human-Seat for Logistic Vehicles [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(6): 14-19.
[4]	WANG Bin, CHEN Bin, ZHANG Xiao-dong, DING We. A Fair Queueing Scheduling Algorithm for Multi-Channel Based on Signal [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2006, 29(2): 70-73.
[5]	WANG Bin,DING Wei. A Scheduling Algorithm for Fair Queueing Based on Multi-Channel [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2005, 28(2): 12-15.