Skip to main content

Advertisement

Log in

Packet-size aware scheduling algorithms in guard band for time sensitive networking

  • Review Paper
  • Published:
CCF Transactions on Networking

Abstract

As an emerging and promising technology, Time Sensitive Networking (TSN) can be widely used in many real-time systems such as Industrial Internet of Things (IIoT) and Cyber Physical System (CPS). TSN, while ensuring the bounded latency and jitter, exhibits the disadvantage of not being able to efficiently use the bandwidth resources in the guard band. In this paper, we propose an algorithm family named Packet-size Aware Shaping (PAS), which is inspired by abstracting the problem of utilizing the guard band to a classic Precedence-Constrained Knapsack Problem (PCKP). PAS works with the existing TSN standards, having achieved the goal of guaranteeing the end-to-end latency for scheduled time-sensitive applications while fully utilizing the available bandwidth in the guard band for others. Furthermore, we have proposed and implemented several hardware designs for both the current standard TSN scheduler and the programmable one. The simulation results show that the PAS family can achieve satisfying performance in maximizing the resource utilization in the guard band. The synthesis results on Xilinx Vivado show that our proposed Multi-group Push-In-First-Out (MPIFO) scheduler can achieve 100 Mpps scheduling rate for 1024 scheduling items, which is fast enough to support the high-speed TSN.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Notes

  1. In this paper, the term of packet actually refers to the Ethernet frame, but we do not distinguish between them, and use them interchangeably.

  2. The size refers to the real occupation of each packet on the wire, containing the Ethernet frame, eight-byte headers in the physical layer, and 12-byte Inter Frame Gap (IFG).

  3. This ordered rank setting obeys the SPS algorithm in the standard TSN scheduler, but it should be clear that our proposed three designs can support arbitrary rank settings.

References

  • Alcoz, AG., Dietmüller, A., Vanbever, L.: SPPIFO: Approximating push-in first-out behaviors using strict-priority queues. In: USENIX Symposium on Networked Systems Design and Implementation (NSDI) (2020)

  • Barefoot Networks: Barefoot Tofino. http://barefootnetworks.com/ (2017)

  • Bennett, JC., Zhang, H.: \(\text{WF}^2\)Q: worst-case fair weighted fair queueing. In: Proceedings of IEEE INFOCOM’96. Conference on Computer Communications, IEEE, vol. 1, pp 120–128 (1996)

  • Bhagwan, R., Lin, B.: Fast and scalable priority queue architecture for high-speed network switches. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), IEEE, vol. 2, pp. 538–547 (2000)

  • Bosshart, P., Daly, D., Gibb, G., Izzard, M., McKeown, N., Rexford, J., Schlesinger, C., Talayco, D., Vahdat, A., Varghese, G., et al.: P4: Programming protocol-independent packet processors. ACM Spec. Inter. Group Data Commun. (SIGCOMM) Comput. Commun. Rev. 44(3), 87–95 (2014)

    Article  Google Scholar 

  • Brown, R.: Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem. Commun. ACM 31(10), 1220–1227 (1988)

    Article  Google Scholar 

  • Caida: Packet size distribution comparison between Internet links in 1998 and 2008. (2019) https://www.caida.org/research/traffic-analysis

  • Chandra, R., Sinnen, O.: Improving application performance with hardware data structures. In: Proceeding of the IEEE International Symposium on Parallel & Distributed Processing, pp. 1–4. Workshops and Phd Forum (IPDPSW), IEEE (2010)

  • Craciunas, SS., Oliver, RS., Chmelík, M., Steiner, W.: Scheduling real-time communication in IEEE 802.1 Qbv time sensitive networks. In: Proceedings of the ACM International Conference on Real-Time Networks and Systems, ACM, pp. 183–192 (2016)

  • Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: the ACM Special Interest Group on Data Communication (SIGCOMM) Computer Communication Review, ACM, vol 19, pp. 1–12 (1989)

  • Dürr, F., Nayak, NG.: No-wait packet scheduling for IEEE time-sensitive networks (TSN). In: Proceedings of the ACM International Conference on Real-Time Networks and Systems, ACM, pp. 203–212 (2016)

  • Heilmann, F., Fohler, G.: Size-based queuing: an approach to improve bandwidth utilization in TSN networks. ACM Spec. Intere. Group Embed. Syst. Rev. 16(1), 9–14 (2019)

    Google Scholar 

  • Huang, M., Lim, K., Cong, J.: A scalable, high-performance customized priority queue. In: Proceedings of the IEEE International Conference on Field Programmable Logic and Applications (FPL), IEEE, pp. 1–4 (2014)

  • International Organization for Standardization: ISO 11898: Road vehicles - Controller area network (CAN). ISO, Geneva (2003)

    Google Scholar 

  • International Organization for Standardization: ISO 17458: Road Vehicles - FlexRay Communications System, 1st edn. ISO, Geneva (2013)

    Google Scholar 

  • Ioannou, A., Katevenis, M.G.: Pipelined heap (priority queue) management for advanced scheduling in high-speed networks. IEEE/ACM Trans. Netw. (ToN) 15(2), 450–461 (2007)

    Article  Google Scholar 

  • Jansen, D., Buttner, H.: Real-time Ethernet: the EtherCAT solution. Comput. Control Eng. 15(1), 16–21 (2004)

    Article  Google Scholar 

  • Kopetz, H., Ademaj, A., Grillinger, P., Steinhammer, K.: The time-triggered Ethernet (TTE) design. In: Proceedings of the IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC), IEEE, pp. 22–33 (2005)

  • Kopetz, H., Bauer, G.: The time-triggered architecture. Proc. IEEE 91(1), 112–126 (2003)

    Article  Google Scholar 

  • LAN/MAN Standards Committee: IEEE Standard for Ethernet Amendment 5: Specification and Management Parameters for Interspersing Express Traffic. IEEE Std pp. 1–58 (2016a)

  • LAN/MAN Standards Committee: IEEE Standard for Local and metropolitan area networks – Bridges and Bridged Networks – Amendment 26: Frame Preemption. IEEE Std pp. 1–52 (2016b)

  • LAN/MAN Standards Committee: IEEE Standard for Local and metropolitan area networks–Bridges and Bridged Networks - Amendment 25: Enhancements for Scheduled Traffic. IEEE Std pp. 1–57 (2016c)

  • LAN/MAN Standards Committee: IEEE Standard for Local and metropolitan area networks–Bridges and Bridged Networks–Amendment 28: Per-Stream Filtering and Policing. IEEE Std pp. 1–65 (2017)

  • LAN/MAN Standards Committee: IEEE standard for local and metropolitan area networks–timing and synchronization for time-sensitive applications in bridged local area networks. IEEE Std pp. 1–274 (2011)

  • LAN/MAN Standards Committee: IEEE Standard for Local and metropolitan area networks–Virtual Bridged Local Area Networks Amendment 12: Forwarding and Queuing Enhancements for Time-Sensitive Streams. IEEE Std pp. 1–71 (2009)

  • Le Boudec, J.Y., Thiran, P.: Network Calculus: a Theory of Deterministic Queuing Systems for the Internet, vol. 2050. Springer Science and Business Media, Berlin (2001)

    Book  Google Scholar 

  • Li, Z., Wan, H., Zhao, B., Deng, Y., Gu, M.: Dynamically optimizing end-to-end latency for time-triggered networks. In: Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM) Workshop on Networking for Emerging Applications and Technologies, ACM, pp. 36–42 (2019)

  • McKenney, PE.: Stochastic fairness queueing. In: Proceedings. IEEE INFOCOM’90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@ m\_The Multiple Facets of Integration, IEEE, pp. 733–740 (1990)

  • Meyer, P., Steinbach, T., Korf, F., Schmidt, TC.: Extending IEEE 802.1 AVB with time-triggered scheduling: a simulation study of the coexistence of synchronous and asynchronous traffic. In: Proceedings of the IEEE Vehicular Networking Conference, IEEE, pp. 47–54 (2013)

  • Mittal, R., Agarwal, R., Ratnasamy, S., Shenker, S.: Universal packet scheduling. In: USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 501–521 (2016)

  • Moon, S., Rexford, J., Shin, K.G.: Scalable hardware priority queue architectures for high-speed packet switches. IEEE Trans. Comput. (TOC) 49(11), 1215–1227 (2000)

    Article  Google Scholar 

  • Oliver, RS., Craciunas, SS., Steiner, W.: IEEE 802.1 Qbv gate control list synthesis using array theory encoding. In: Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), IEEE, pp. 13–24 (2018)

  • Pedreiras, P., Gai, P., Almeida, L., Buttazzo, G.C.: FTT-Ethernet: a flexible real-time communication protocol that supports dynamic QoS management on Ethernet-based systems. IEEE Trans. Ind. Inform. 1(3), 162–172 (2005)

    Article  Google Scholar 

  • Radhakrishnan, S., Geng, Y., Jeyakumar, V., Kabbani, A., Porter, G., Vahdat, A.: SENIC: Scalable NIC for end-host rate limiting. In: USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 475–488 (2014)

  • Saeed, A., Dukkipati, N., Valancius, V., Contavalli, C., Vahdat, A., et al.: Carousel: Scalable traffic shaping at end hosts. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, ACM, pp. 404–417 (2017)

  • Shreedhar, M., Varghese, G.: Efficient fair queuing using deficit round-robin. IEEE/ACM Trans. Netw. 3, 375–385 (1996)

    Article  Google Scholar 

  • Shrivastav, V.: Fast, scalable, and programmable packet scheduler in hardware. In: Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM), ACM, pp 367–379 (2019)

  • Sivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, ST., Agrawal, A., Balakrishnan, H., Edsall, T., Katti, S., McKeown, N.: Programmable packet scheduling at line rate. In: Proceedings of the ACM Special Interest Group on Data Communication (SIGCOMM), ACM, pp. 44–57 (2016)

  • Specht, J., Samii, S.: Urgency-based scheduler for time-sensitive switched Ethernet networks. In: Proceedings of the IEEE Euromicro Conference on Real-Time Systems (ECRTS), IEEE, pp. 75–85 (2016)

  • Steiner, W.: An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In: Proceedings of the Real-Time Systems Symposium, IEEE, pp. 375–384 (2010)

  • Wikipedia: System Verilog. (2020) https://en.wikipedia.org/wiki/SystemVerilog

  • Wikipedia: Wikipedia. Token Bucket. (2020) https://en.wikipedia.org/wiki/Token_bucket

  • Xilinx (2020) Virtex-7. https://www.xilinx.com/products/silicon-devices/fpga/virtex-7.html

  • Zhao, L., Pop, P., Craciunas, S.S.: Worst-case latency analysis for IEEE 802.1 Qbv time sensitive networks using network calculus. IEEE Access 6, 41803–41815 (2018)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by the Guangdong Basic and Applied Basic Research Foundation (No. 2019B1515120031), the Key-Area Research and Development Program of Guangdong Province (No. 2019B121204009), National Natural Science Foundations of China (No. 61432009, 61872420, 68172213), the project of “FANet: PCL Future Greater-Bay Area Network Facilities for Large-scale Experiments and Applications (No. LZC0019)”. This work is also partially supported by the NSF Award (No. 1646458) and any opinions, findings, and conclusions or recommendations expressed in this paper are those of the author(s) and do not necessarily reflect the views of the sponsors of the research.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi Wang.

Ethics declarations

Conflict of interest

On behalf of all authors, the corresponding author states that there is no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, C., Wang, Y., Yao, R. et al. Packet-size aware scheduling algorithms in guard band for time sensitive networking. CCF Trans. Netw. 3, 4–20 (2020). https://doi.org/10.1007/s42045-020-00031-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s42045-020-00031-0

Keywords

Navigation