ZTE Communications ›› 2024, Vol. 22 ›› Issue (2): 55-70.DOI: 10.12142/ZTECOM.202402008

• Review • Previous Articles     Next Articles

Review on Service Curves of Typical Scheduling Algorithms

GAO Yuehong1(), NING Zhi1, HE Jia1, ZHOU Jinfei1, GAO Chenqiang2,3, TANG Qingkun2,3, YU Jinghai2,3   

  1. 1.Beijing University of Posts and Telecommunications, Beijing 100876, China
    2.ZTE Corporation, Shenzhen 518057, China
    3.State Key Laboratory of Mobile Network and Mobile Multimedia Technology, Shenzhen 518055, China
  • Received:2024-01-03 Online:2024-06-28 Published:2024-06-25
  • About author:GAO Yuehong (yhgao@bupt.edu.cn) received her PhD degree from Beijing University of Posts and Telecommunications (BUPT), China in 2010. She is an associate professor with the School of Information and Communication Engineering, BUPT. Her research interests include network calculus theory and application, quality of service guarantees in communication networks, simulation methodology, and digital twin networks.
    NING Zhi received his BE degree in communication engineering from Beijing University of Posts and Telecommunications (BUPT), China in 2021. He is working towards his MS degree at BUPT. His research interests include wireless networks and deterministic networking.
    HE Jia received his BE degree in communication engineering from Beijing University of Posts and Telecommunications (BUPT), China in 2022. He is working towards his MS degree in communication engineering at BUPT. His research interests include network calculus, 5G network architecture, and deterministic networking.
    ZHOU Jinfei received his BE degree in communication engineering from Beijing University of Posts and Telecommunications (BUPT), China in 2023, where he is currently pursuing an MS degree. His research interests include wireless networks and deterministic networking.
    GAO Chenqiang works at in the Data System Department of ZTE Corporation. His research interests include network calculus theory and application, DetNet, TSN, and SDN.
    TANG Qingkun works at the Cable Software Platform Development Department of ZTE Corporation. His research interests include DetNet, TSN, and autonomous networks.
    YU Jinghai works at the Data System Department of ZTE Corporation. He has more than 20 years of experience in the research and design of data network products including BIER, DetNet, TSN, Switch and Router, Data Center and SDN. He has won the 21st China Patent Silver Award and the first prize of the Science and Technology Award of the China Communications Society.
  • Supported by:
    ZTE Industry?University-?Institute Cooperation Funds

Abstract:

In recent years, various internet architectures, such as Integrated Services (IntServ), Differentiated Services (DiffServ), Time Sensitive Networking (TSN) and Deterministic Networking (DetNet), have been proposed to meet the quality-of-service (QoS) requirements of different network services. Concurrently, network calculus has found widespread application in network modeling and QoS analysis. Network calculus abstracts the details of how nodes or networks process data packets using the concept of service curves. This paper summarizes the service curves for typical scheduling algorithms, including Strict Priority (SP), Round Robin (RR), Cycling Queuing and Forwarding (CQF), Time Aware Shaper (TAS), Credit Based Shaper (CBS), and Asynchronous Traffic Shaper (ATS). It introduces the theory of network calculus and then provides an overview of various scheduling algorithms and their associated service curves. The delay bound analysis for different scheduling algorithms in specific scenarios is also conducted for more insights.

Key words: network calculus, service curve, scheduling algorithm, QoS