Configuration of Guard Band and Offsets in Cyclic Queuing and Forwarding
Pages 598 - 612
Abstract
Cyclic Queuing and Forwarding (CQF) is a mechanism defined by IEEE TSN for providing low jitter in a deterministic network. CQF uses a common time cycle and two buffers per node output port: during one cycle incoming packets are stored in one buffer while packets in the other buffer are being transmitted; at the end of a cycle, the roles of the two buffers are exchanged. The cycle start times are determined by a time offset that may be different for every output buffer. A guard band at both cycle ends is devised in order to compensate for misalignment and timing inaccuracies. The proper operation of CQF requires that the guard band and the offsets are computed such that nodes are sufficiently time-aligned. First, we give necessary and sufficient conditions for this to be guaranteed. The sufficient conditions lend themselves to tractable computations and we show that they are close to optimal. Our conditions account for nonideal clocks and non-zero propagation times; we show that accounting for these two elements does matter. Second, we give a method for computing the minimal duration of the guard band, given prior choices of time offsets. Third, a judicious choice of time offsets can considerably decrease the required duration of the guard band: we give a practical algorithm, based on a Mixed Integer Linear Program, for computing offsets that minimize the guard band. We illustrate our results on several CQF network topologies with or without cyclic dependencies.
References
[1]
IEEE Standard for Local and Metropolitan Area Networks—Bridges and Bridged Networks—Amendment 29: Cyclic Queuing and Forwarding, IEEE Standard, 2017.
[2]
A. Nasrallah, V. Balasubramanian, A. S. Thyagaturu, M. Reisslein, and H. ElBakoury, “Cyclic queuing and forwarding for large scale deterministic networks: A survey,” 2019, arXiv:1905.08478.
[3]
B. Jonsson, S. Perathoner, L. Thiele, and W. Yi, “Cyclic dependencies in modular performance analysis,” in Proc. 8th ACM Int. Conf. Embedded Softw., 2008, pp. 179–188. 10.1145/1450058.1450083.
[4]
D. Starobinski, M. Karpovsky, and L. Zakrevski, “Application of network calculus to general topologies using turn-prohibition,” in Proc. 21st Annu. Joint Conf. IEEE Comput. Commun. Societies, Jun. 2002, pp. 411–421.
[5]
L. Thomas, J. Le Boudec, and A. Mifdaoui, “On cyclic dependencies and regulators in time-sensitive networks,” in Proc. IEEE Real-Time Syst. Symp. (RTSS), Dec. 2019, pp. 299–311. 10.1109/RTSS46320.2019.00035.
[6]
L. Thomas and J.-Y. Le Boudec, “On time synchronization issues in time-sensitive networks with regulators and nonideal clocks,” Proc. ACM Meas. Anal. Comput. Syst., vol. 4, no. 2, pp. 1–41, Jun. 2020.
[7]
IEEE Standard for Local and Metropolitan Area Networks—Bridges and Bridged Networks–Amendment 28: Per-Stream Filtering and Policing, IEEE, Standard, 2017.
[8]
IEEE Standard for Local and Metropolitan Area Networks—Bridges and Bridged Networks—Amendment 25: Enhancements for Scheduled Traffic, IEEE Standard, 2015.
[9]
IEEE Standard for Local and Metropolitan Area Networks—Bridges and Bridged Networks—Amendment 26: Frame Preemption, IEEE Standard, 2016.
[10]
D. Thiele and R. Ernst, “Formal worst-case performance analysis of time-sensitive Ethernet with frame preemption,” in Proc. IEEE 21st Int. Conf. Emerg. Technol. Factory Autom. (ETFA), Sep. 2016, pp. 1–9.
[11]
N. Finn. Mutiple Cyclic Queuing and Forwarding,” Standard IEEE 802.1, Sep. 2019. [Online]. Available: https://www.ieee802.org/1/files/public/docs2019/df-finn-multiple-CQF-0919-v01.pdf
[12]
IEEE/ISO/IEC International Standard for Information Technology—Telecommunications and Information Exchange Between Systems—Local and Metropolitan Area Networks—Part 1AS: Timing and Synchronization for Time-Sensitive Applications in Bridged Local Area Networks, ISO/IEC/IEEE Standard, 2021.
[13]
NXP. (Nov. 2016). SJA1105 5-Port Automot. Ethernet Switch. [Online]. Available: https://www.nxp.com/docs/en/data-sheet/SJA1105.pdf
[14]
(Jan. 2021). IntelEthernet Controller I210 Datasheet. [Online]. Available: https://www.intel.com/content/www/us/en/content-details/333016/intel-ethernet-controller-i210-datasheet.html
[15]
ARINC 664 P7-1: Aircraft Data Network, Part 7, Avionics Full-Duplex Switched Ethernet Network, Airlines Electron. Eng. Committee, AEEC, Annapolis, MD, USA, Sep. 2009.
[16]
IEEE Standard for Local and Metropolitan Area Networks—Bridges and Bridged Networks, Standard 802.1Q, 2018.
[17]
N. Finn, E. Mohammadpour, J. Zhang, and B. Varga, “Deterministic networking (DetNet) bounded latency,” Fremont, CA, USA, Tech. Rep. RFC 9320, 2022. [Online]. Available: https://www.rfc-editor.org/info/rfc9320
[18]
M. Seaman. (May 2019). Paternoster Policing and Scheduling. [Online]. Available: https://grouper.ieee.org/groups/802/1/files/public/docs2019/cr-seaman-paternoster-policing-scheduling-0519-v04.pdf
[19]
L. Qiang, X. Geng, B. Liu, T. Eckert, L. Geng, and G. Li. (2019). Large-Scale Deterministic IP Network. [Online]. Available: https://datatracker.ietf.org/doc/html/draft-qiang-detnet-large-scale-detnet-05
[20]
B. Liuet al., “Towards large-scale deterministic IP networks,” in Proc. IFIP Netw. Conf. (IFIP Networking), Jun. 2021, pp. 1–9.
[21]
M. G. Chen, G. Xuesong, and Z. Li. (May 2019). Segment Routing (SR) Based Bounded Latency. [Online]. Available: https://datatracker.ietf.org/doc/html/draft-chen-detnet-sr-based-bounded-latency-01
[22]
T. Eckert, S. Bryant, A. G. Malis, and G. Li. (Nov. 2022). Deterministic Networking (DetNet) Data Plane—Tagged Cyclic Queuing and Forwarding (TCQF) for Bounded Latency With Low Jitter in Large Scale DetNets. [Online]. Available: https://datatracker.ietf.org/doc/draft-eckert-detnet-tcqf/01/
[23]
Time-Sensitive Networking Profile for Industrial Automation, Standard IEEE, 2021.
[24]
S. S. Craciunas, R. S. Oliver, M. Chmelík, and W. Steiner, “Scheduling real-time communication in IEEE 802.1Qbv time sensitive networks,” in Proc. 24th Int. Conf. Real-Time Netw. Syst., Oct. 2016, pp. 183–192. 10.1145/2997465.2997470.
[25]
P.-J. Chaine and M. Boyer, “Shortening gate closing time to limit bandwidth waste when implementing time-triggered scheduling in TAS/TSN,” in Proc. 15th Junior Researcher Workshop Real-Time Comput., Paris, France, 2022, pp. 25–29. [Online]. Available: https://rtns2022.inria.fr/files/2022/06/proceedings_jrwrtc2022_final.pdf
[26]
Y. Huang, S. Wang, B. Wu, T. Huang, and Y. Liu, “TACQ: Enabling zero-jitter for cyclic-queuing and forwarding in time-sensitive networks,” in Proc. IEEE Int. Conf. Commun., Jun. 2021, pp. 1–6.
[27]
L. Leonardi, L. L. Bello, and G. Patti, “Performance assessment of the IEEE 802.1Qch in an automotive scenario,” in Proc. AEIT Int. Conf. Electr. Electron. Technol. Automot. (AEIT AUTOMOTIVE), Nov. 2020, pp. 1–6.
[28]
J. Yan, W. Quan, X. Jiang, and Z. Sun, “Injection time planning: Making CQF practical in time-sensitive networking,” in Proc. IEEE INFOCOM Conf. Comput. Commun., Jul. 2020, pp. 616–625.
[29]
W. Quan, J. Yan, X. Jiang, and Z. Sun, “On-line traffic scheduling optimization in IEEE 802.1Qch based time-sensitive networks,” in Proc. IEEE 22nd Int. Conf. High Perform. Comput. Commun., IEEE 18th Int. Conf. Smart City, IEEE 6th Int. Conf. Data Sci. Syst. (HPCC/SmartCity/DSS), Dec. 2020, pp. 369–376.
[30]
D. Guidolin-Pina, M. Boyer, and J.-Y. Le Boudec. (Sep. 2022). Configuration of Guard Band and Offsets in Cyclic Queuing and Forwarding. [Online]. Available: https://hal.science/hal-03772877
[31]
J. Liebeherr, “Duality of the max-plus and min-plus network calculus,” Found. Trends Netw., vol. 11, nos. 3–4, pp. 139–282, 2017.
Index Terms
- Configuration of Guard Band and Offsets in Cyclic Queuing and Forwarding
Index terms have been assigned to the content through auto-classification.
Recommendations
Dual Band U-Slotted Microstrip Patch Antenna for C Band and X Band Radar Applications
CICN '13: Proceedings of the 2013 5th International Conference on Computational Intelligence and Communication NetworksA compact dual band micro strip patch antenna is designed for C (4-8 GHz) band and X (8-12 GHz) band applications. The proposed antenna consists of a rectangular patch having four U-slots and one I-slot with H-shaped DGS (Defected Ground Structure). The ...
Modified Guard Band Power Detection for Coarse Carrier Frequency Offset Recovery in OFDM System
Conventional guard band power detection (GPD) method for orthogonal frequency division multiplexing (OFDM) coarse carrier frequency offset (CFO) estimation has to be operated after the fine CFO recovery due to its sensitivity to the inter-channel ...
Design of Compact Dual-Band/Tri-Band CPW-Fed Monopole Antennas for WLAN/WiMAX Applications
Two compact rupee shaped coplanar waveguide (CPW) fed monopole antennas for WLAN and WiMAX applications are proposed. One of the antennas has a dual band characteristic (measured impedance bandwidth from 2.92---3.7 and 4.6---6.0 GHz) while the other has ...
Comments
Information & Contributors
Information
Published In
1558-2566 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 27 July 2023
Published in TON Volume 32, Issue 1
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 15Total Downloads
- Downloads (Last 12 months)15
- Downloads (Last 6 weeks)4
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in