Abstract
Length Rate Quotient (LRQ) is the first algorithm of interleaved shaping – a novel concept proposed to provide per-flow shaping for a flow aggregate without per-flow queuing. This concept has been adopted by Time-Sensitive Networking (TSN) and Deterministic Networking (DetNet). In this paper, we investigate basic properties of LRQ interleaved shapers. One is the so-called “shaping-for-free” property, which is, when an LRQ interleaved shaper is appended to a FIFO system, it does not increase the worst-case delay of the system. The other basic properties include conformance, output characterization, a sufficient and necessary condition for bounded delay, Guaranteed Rate characterization, and delay and backlog bounds for LRQ interleaved shapers as stand-alone elements. The derived properties of LRQ shed new insights on understanding interleaved shaping, which may be further exploited to achieve bounded delay in TSN/DetNet networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Specht, J., Samii, S.: Urgency-based scheduler for time-sensitive switched ethernet networks. In: 28th Euromicro Conference on Real-Time Systems (2016)
IEEE. 802.1q - IEEE standard for local and metropolitan area networks - bridges and bridged networks. IEEE Standards (2018)
Finn, N., Thubert, P., Varga, B., Farkas, J.: Deterministic networking architecture. IETF RFC 8655, October 2019
IEEE. IEEE standard for local and metropolitan area networks-bridges and bridged networks - Amendment 34: Asynchronous traffic shaping. IEEE Std 802.1Qcr-2020, pp. 1–151 (2020)
Finn, N., Le Boudec, J.-Y., Mohammadpour, E., Zhang, J., Varga, B., Farkas, J.: Detnet bounded latency. IETF Internet Draft: draft-ietf-detnet-bounded-latency-05, April 2021
Le Boudec, J.-Y.: A theory of traffic regulators for deterministic networks with application to interleaved regulators. IEEE/ACM Trans. Netw. 26(6), 2721–2733 (2018)
Goyal, P., Lam, S.S., Vin, H.M.: Determining end-to-end delay bounds in heterogeneous networks. In: Proceedings of the Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 1995), pp. 287–298, April 1995
Goyal, P., Vin, H.M.: Generalized guaranteed rate scheduling algorithms: a framework. IEEE/ACM Trans. Netw. 5(4), 561–571 (1997)
Chang, C.-S.: Performance Guarantees in Communication Networks. Springer-Verlag, Heidelberg (2000). https://doi.org/10.1007/978-1-4471-0459-9
Xie, J., Jiang, Y.: Stochastic network calculus models under max-plus algebra. In: IEEE Global Telecommunications Conference (GLOBECOM), pp. 1–6 (2009)
Liebeherr, J.: Duality of the max-plus and min-plus network calculus. Found. Trends Netw. 11(3–4), 139–282 (2017)
Le Boudec, J.-Y., Thiran, P.: Network Calculus: A Theory of Deterministic Queueing Systems for the Internet. Springer-Verlag, Heidelberg (2001). https://doi.org/10.1007/3-540-45318-0
Cruz, R.L.: A calculus for network delay, part I and part II. IEEE Trans. Inf. Theory 37(1), 114–141 (1991)
Jiang, Y.: Relationship between guaranteed rate server and latency rate server. Comput. Netw. 43(3), 307–315 (2003)
Zhao, L., Pop, P., Steinhorst, S.: Quantitative performance comparison of various traffic shapers in time-sensitive networking. CoRR, abs/2103.13424 (2021)
Jiang, Y.: Some properties of length rate quotient shapers. CoRR, abs/2107.05021 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Jiang, Y. (2023). Some Basic Properties of Length Rate Quotient. In: Hyytiä, E., Kavitha, V. (eds) Performance Evaluation Methodologies and Tools. VALUETOOLS 2022. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 482. Springer, Cham. https://doi.org/10.1007/978-3-031-31234-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-031-31234-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-31233-5
Online ISBN: 978-3-031-31234-2
eBook Packages: Computer ScienceComputer Science (R0)