Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks
Pages 2902 - 2917
Abstract
In time-sensitive networks, bounds on worst-case delays are typically obtained by using network calculus and assuming that flows are constrained by bit-level arrival curves. However, in IEEE TSN or IETF DetNet, source flows are constrained on the number of packets rather than bits. A common approach to obtain a delay bound is to derive a bit-level arrival curve from a packet-level arrival curve. However, such a method is not tight: we show that better bounds can be obtained by directly exploiting the arrival curves expressed at the packet level. Our analysis method also obtains better bounds when flows are constrained with g-regulation, such as the recently proposed Length-Rate Quotient rule. It can also be used to generalize some recently proposed network-calculus delay-bounds for a service curve element with known transmission rate.
References
[1]
IEEE Standard for Local and Metropolitan Area Networks—Audio Video Bridging (AVB) Systems, IEEE Standard. [Online]. Available: https://ieeexplore.ieee.org/document/6032690
[2]
Time-Sensitive Networking Profile for Industrial Automation, Standard IEC/IEEE 60802, (D1.1), 2019. [Online]. Available: https://www.ieee802.org/1/files/private/60802-drafts/d1/60802-d1-1.pdf
[3]
Draft Standard for Local and Metropolitan Area Networks—Time-Sensitive Networking Profile for Automotive In-Vehicle Ethernet Communications. IEEE Standard, Oct. 2019. [Online]. Available: https://www.ieee802.org/1/files/private/dg-drafts/d1/802-1DG-d1-1.pdf
[4]
T. Ferrandiz, F. Frances, and C. Fraboul, “Using network calculus to compute end-to-end delays in SpaceWire networks,” ACM SIGBED Rev., vol. 8, no. 3, pp. 44–47, Sep. 2011. 10.1145/2038617.2038627.
[5]
T. Wong, N. Finn, and X. Wang. TSN Profile for Service Provider Networks. Accessed: Apr. 2022. [Online]. Available: https://www.ieee802.org/1/files/public/docs2018/new-tsn-wangtt-TSN-profile-for-service-provider-network-0718.pdf
[6]
Representative Use Cases and Key Network Requirements for Network 2030, Standard 3000, 2020. [Online]. Available: https://www.itu.int/rec/T-REC-Y.Sup67-202007-I
[7]
Deterministic Networking (DetNet). Accessed: Apr. 2022. [Online]. Available: https://datatracker.ietf.org/wg/detnet/about/
[8]
Time-Sensitive Networking (TSN) Task Group. Accessed: Apr. 2022. [Online]. Available: https://1.ieee802.org/tsn/
[9]
J.-Y. Le Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, vol. 2050. Berlin, Germany: Springer, 2001.
[10]
A. Bouillard, M. Boyer, and E. Le Corronc, Deterministic Network Calculus: From Theory to Practical Implementation. Hoboken, NJ, USA: Wiley, 2018.
[11]
E. Mohammadpour, E. Stai, and J.-Y. Le Boudec, “Improved delay bound for a service curve element with known transmission rate,” IEEE Netw. Lett., vol. 1, no. 4, pp. 156–159, Dec. 2019.
[12]
B. Varga, J. Farkas, R. Cummings, Y. Jiang, and D. Fedyk, Flow and Service Information Model for Deterministic Networking (DetNet), Standard 9016, 2021. [Online]. Available: https://www.rfc-editor.org/rfc/rfc9016.html
[13]
IEEE Standard for Local and Metropolitan Area Network—Bridges and Bridged Networks. IEEE Standard, (Revision of IEEE Standard 802.1Q-2014, pp. 1–1993, 2018.
[14]
N. Finn, J.-Y. Le Boudec, E. Mohammadpour, J. Zhang, B. Varga, and J. Farkas. (2021). DetNet Bounded Latency Draft. Accessed: Dec. 15, 2021. [Online]. Available: https://www.ietf.org/archive/id/draft-ietf-detnet-bounded-latency-07.html
[15]
H. Daigmorte, M. Boyer, and L. Zhao. (Jun. 2018). Modelling in Network Calculus a TSN Architecture Mixing Time-Triggered, Credit Based Shaper and Best-Effort Queues. [Online]. Available: https://hal.archives-ouvertes.fr/hal-01814211
[16]
L. Maile, K. Hielscher, and R. German, “Network calculus results for TSN: An introduction,” in Proc. Inf. Commun. Technol. Conf. (ICTC), May 2020, pp. 131–140.
[17]
K. Eriksson, D. Estep, C. Johnson, and J. Hoffman, Applied Mathematics: Body and Soul. Berlin, Germany: Springer, 2004.
[18]
C.-S. Chang, Performance Guarantees in Communication Networks. New York, NY, USA: Springer-Verlag, 2000.
[19]
J. Specht and S. Samii, “Urgency-based scheduler for time-sensitive switched Ethernet networks,” in Proc. 28th Euromicro Conf. Real-Time Syst. (ECRTS), Jul. 2016, pp. 75–85.
[20]
E. Mohammadpour, E. Stai, M. Mohiuddin, and J. Le Boudec, “Latency and backlog bounds in time-sensitive networking with credit based shapers and asynchronous traffic shaping,” in Proc. 30th Int. Teletraffic Congr. (ITC), Sep. 2018, pp. 1–6.
[21]
S. M. Tabatabaee and J.-Y.-L. Boudec, “Deficit Round-Robin: A second network calculus analysis,” in Proc. IEEE 27th Real-Time Embedded Technol. Appl. Symp. (RTAS), May 2021, pp. 171–183.
[22]
S. M. Tabatabaee, J.-Y. Le Boudec, and M. Boyer, “Interleaved weighted round-robin: A network calculus analysis,” IEICE Trans. Commun., vol. 104, no. 12, pp. 1479–1493, 2021.
[23]
Y. Jiang, “Some properties of length rate quotient shapers,” 2021, arXiv:2107.05021.
[24]
R. L. Cruz, “Quality of service guarantees in virtual circuit switched networks,” IEEE J. Sel. Areas Commun., vol. 13, no. 6, pp. 1048–1056, Aug. 1995.
[25]
L. Zhao, P. Pop, Z. Zheng, and Q. Li, “Timing analysis of AVB traffic in TSN networks using network calculus,” in Proc. IEEE Real-Time Embedded Technol. Appl. Symp. (RTAS), Apr. 2018, pp. 25–36.
[26]
M. Boyer, G. Stea, and W. M. Sofack, “Deficit round Robin with network calculus,” in Proc. 6th Int. Conf. Perform. Eval. Methodologies Tools, 2012, pp. 138–147.
[27]
A. Finzi, A. Mifdaoui, F. Frances, and E. Lochin, “Network calculus-based timing analysis of AFDX networks with strict priority and TSN/BLS shapers,” in Proc. IEEE 13th Int. Symp. Ind. Embedded Syst. (SIES), Jun. 2018, pp. 1–10.
[28]
W. M. Sofack and M. Boyer, “Non preemptive static priority with network calculus: Enhancement,” in Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. Berlin, Germany: Springer, 2012, pp. 258–272.
[29]
A. Burchard and J. Liebeherr, “A general per-flow service curve for GPS,” in Proc. 30th Int. Teletraffic Congr. (ITC), vol. 2, Sep. 2018, pp. 31–36.
[30]
J. Liebeherr, “Duality of the max-plus and min-plus network calculus,” Found. Trends Netw., vol. 11, nos. 3–4, pp. 139–282, 2017.
[31]
J. Le Boudec, “A theory of traffic regulators for deterministic networks with application to interleaved regulators,” IEEE/ACM Trans. Netw., vol. 26, no. 6, pp. 2721–2733, Dec. 2018.
[32]
Y. Jiang, “A basic result on the superposition of arrival processes in deterministic networks,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Dec. 2018, pp. 1–6.
[33]
RealTime-at-Work Online Min-Plus Interpreter for Network Calculus. Accessed: Apr. 2022. [Online]. Available: https://www.realtimeatwork.com/minplus-playground, accessed: year-month-day
[34]
M. Boyer and P. Roux. (May 2016). A Common Framework Embedding Network Calculus and Event Stream Theory. [Online]. Available: https://hal.archives-ouvertes.fr/hal-01311502
Index Terms
- Improved Network-Calculus Nodal Delay-Bounds in Time-Sensitive Networks
Index terms have been assigned to the content through auto-classification.
Recommendations
Network calculus delay bounds in queueing networks with exact solutions
ITC20'07: Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networksThe purpose of this paper is to shed light on the accuracy of probabilistic delay bounds obtained with network calculus. In particular, by comparing calculus bounds with exact results in a series of M/M/1 queues with cross traffic, we show that ...
Worst-case delay bounds with fixed priorities using network calculus
VALUETOOLS '11: Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and ToolsWorst-case delay bounds are an important issue for applications with hard-time constraints. Network calculus is a useful theory to study worst-case performance bounds in networks. In this article, we focus on networks with a fixed priority service ...
Estimating the worst-case delay in FIFO tandems using network calculus
ValueTools '08: Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and ToolsThis paper addresses the problem of estimating the worst-case end-to-end delay for a flow in a tandem of FIFO multiplexing nodes, following up our previous work [12]. We show that, contrary to the expectations, the state-of-the-art method for computing ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.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: 05 June 2023
Published in TON Volume 31, Issue 6
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 11Total Downloads
- Downloads (Last 12 months)11
- Downloads (Last 6 weeks)1
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in