Skip to main content

Analysis of QoS Schemes and Shaping Strategies for Large Scale IP Networks Based on Network Calculus

  • Conference paper
  • First Online:
  • 418 Accesses

Abstract

IP network experts and engineers have been working on solutions for decades to promote the network QoS. Latency guarantee, as one of the key aspects of the QoS, is attracting increasing attentions with requirements from time-critical applications and the vision of building a fully connected, intelligent world. Meanwhile, Network Calculus is a theory that focuses on performance bound analysis for communication networks, and has been used in avionic networks. However, because of the extremely large scale and high complexity of IP networks, few works gave theoretically modeling and systematically analyzing for the QoS (i.e., latency bound) of IP networks. In this paper, three QoS schemes for IP networks are summarized and the performance on the perspective of efficiency is analyzed. The effect of ingress shaping is also investigated, and results show that a proper ingress shaping could benefit the overall network latency performance, and could be adapted to all three QoS schemes. An IP network use case is given with different QoS schemes applied and the performance is evaluated by using Network Calculus.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    Operator \(\otimes \) is defined as \((f\otimes g)(t)=\inf _s\{ f(s)+g(t-s) \}\).

  2. 2.

    This property gives more freedom in the design of reshaping in networks, since the output of a service node does not conform to the traffic regulation at source \(\alpha \), that the output arrival curve is updated to \(\alpha ^*=\alpha \oslash \beta \), which is larger than \(\alpha \). While one can reshape the flow’s arrival curve back to \(\alpha \) without deteriorate the delay upper-bound, one should note that a shaper violating \(\sigma \ge \alpha \) may cause additional worst-case latency.

References

  1. Braden, R.: Integrated Services in the Internet Architecture: an Overview, RFC 1633 (1994)

    Google Scholar 

  2. G. Armitage, B. Carpenter, A. Casati, et al.: A Delay Bound alternative revision of RFC 2598, RFC 3248 (2002)

    Google Scholar 

  3. IEEE 802.1. IEEE 802.1Q-2018 - IEEE Standard for Local and Metropolitan Area Networks-Bridges and Bridged Networks, IEEE WG 802.1, July 2018. http://www.ieee802.org/1/

  4. Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45318-0

    Book  MATH  Google Scholar 

  5. Fgee, E., Phillips, W.J., Robertson, W., Elhounie, A., Smeda, A.: A scalable mathematical QoS model for IP networks. In: 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications, Damascus, pp. 1–5 (2008)

    Google Scholar 

  6. Kim, H., Hou, J.C.: Network calculus based simulation for TCP congestion control: theorems, implementation and evaluation. In: IEEE INFOCOM 2004, Hong Kong, vol. 4, pp. 2844–2855 (2004)

    Google Scholar 

  7. Jiang, Y.: A basic result on the superposition of arrival processes in deterministic networks. In: IEEE Global Communications Conference (GLOBECOM), Abu Dhabi, United Arab Emirates, pp. 1–6 (2018)

    Google Scholar 

  8. Mohammadpour, E., Stai, E., Le Boudec, J.: Improved credit bounds for the credit-based shaper in time-sensitive networking. IEEE Netw. Lett. 1(3), 136–139 (2019)

    Article  Google Scholar 

  9. Kreifeldt, R.: AVB for Professional A/V Use, AVnu Alliance White Paper (2009)

    Google Scholar 

  10. Wikipedia. Avionics Full-Duplex Switched Ethernet

    Google Scholar 

  11. Finn, N.: Multiple Cyclic Queuing and Forwarding, IEEE 802.1 public files (2019)

    Google Scholar 

  12. TTTech, Time-Triggered Ethernet - A Powerful Network Solution for Multiple Purpose

    Google Scholar 

  13. PROFINET University, Isochronous Real-Time (IRT) Communication. https://profinetuniversity.com/profinet-basics/isochronous-real-time-irt-communication/

  14. OIF. Flex Ethernet 2.0 Implementation Agreement (2018)

    Google Scholar 

  15. Boyer, M.: Deficit round robin with network calculus. In: 6th International ICST Conference on Performance Evaluation Methodologies and Tools (2012)

    Google Scholar 

  16. Boyer, M.: Combining static priority and weighted round-robin like packet scheduling in AFDX for incremental certification and mixed-criticality support. In: 5th European Conference for Aeronautics and Space Sciences (2013)

    Google Scholar 

  17. 3GPP TS 23.501. Technical Specification Group Services and System Aspects, System Architecture for the 5G SYstem (2019)

    Google Scholar 

  18. Huawei, Cloud VR Network Solution White Paper (2018)

    Google Scholar 

  19. Schmitt, J.: Improving performance bounds in feed-forward networks by paying multiplexing only once. In: 14th GI/ITG Conference - Measurement, Modelling and Evaluation of Computer and Communication Systems (2008)

    Google Scholar 

  20. RealTime-at-Work. http://www.realtimeatwork.com/software/rtaw-pegase/

  21. Fidler, M., Rizk, A.: A guide to the stochastic network calculus. IEEE Commun. Surv. Tutor. 17(1), 92–105 (2014)

    Article  Google Scholar 

  22. Bondorf, S.: Quality and cost of deterministic network calculus - design and evaluation of an accurate and fast analysis. In: Measurement and Analysis of Computing Systems, no. 16 (2017)

    Google Scholar 

  23. Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proceedings IEEE INFOCOM, San Diego, CA, pp. 1–9 (2010)

    Google Scholar 

  24. Schmitt, J.B., Zdarsky, F.A., Fidler, M.: Delay bounds under arbitrary multiplexing: when network calculus leaves you in the lurch. In: IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, Phoenix, AZ, pp. 1669–1677 (2008)

    Google Scholar 

  25. Geyer, F., Bondorf, S.: DeepTMA: predicting effective contention models for network calculus using graph neural networks. In: IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, Paris, France, pp. 1009–1017 (2019)

    Google Scholar 

  26. Schmitt, J., Zdarsky, F., Fidler, M.: Delay bounds under arbitrary multiplexing: when network calculus leaves you in the lurch. In: IEEE INFOCOM 2008-The 27th Conference on Computer Communications (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lihao Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, L., Zhang, J., Gao, T., Wang, T. (2021). Analysis of QoS Schemes and Shaping Strategies for Large Scale IP Networks Based on Network Calculus. In: Gao, H., J. Durán Barroso, R., Shanchen, P., Li, R. (eds) Broadband Communications, Networks, and Systems. BROADNETS 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 355. Springer, Cham. https://doi.org/10.1007/978-3-030-68737-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68737-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68736-6

  • Online ISBN: 978-3-030-68737-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics