Skip to main content

Abstract

In this paper, we present the DelayLyzer which is a tool for the calculation of delay bounds using network calculus. It respects the specifics of Industrial Ethernet by implementing not only STP and RSTP but also MRP as forwarding mechanism. The tool allows to specify failure scenarios and alternate forwarding protocols for which delay bounds can also be computed.

This work was funded by Hirschmann Automation and Control GmbH. The authors alone are responsible for the content of the paper.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bouillard, A., Jouhet, L., Thierry, E.: Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks. In: IEEE Infocom (March 2010)

    Google Scholar 

  2. Chang, C.S.: Performance Guarantees in Communications Networks. Springer

    Google Scholar 

  3. Cruz, R.L.: A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Transactions on Information Theory 37(1), 114–131 (1991)

    Article  MathSciNet  Google Scholar 

  4. Cruz, R.L.: A Calculus for Network Delay, Part II: Network Analysis. IEEE Transactions on Information Theory 37(1), 132–141 (1991)

    Article  MathSciNet  Google Scholar 

  5. IEC: IEC 62439-2: Industrial communication networks - High availability automation networks - Part 2: Media Redundancy Protocol (MRP) (2010)

    Google Scholar 

  6. IEEE: IEEE 802.1D: IEEE Standard for Local and metropolitan area networks: Media Access Control (MAC) Bridges (2004)

    Google Scholar 

  7. Le Boudec, J.Y., Thiran, P.: Network Calculus. Springer (2004)

    Google Scholar 

  8. Lenzini, L., Martorini, L., Stea, G.: Tight End-to-End per-Flow Delay Bounds in FIFO Multiplexing Sink-Tree Networks. Performance Evaluation 63(9) (October 2006)

    Google Scholar 

  9. Lenzini, L., Mingozzi, E., Stea, G.: A Methodology for Computing End-to-End Delay Bounds in FIFO-Multiplexing Tandems. Performance Evaluation 65(11-12)

    Google Scholar 

  10. Schmitt, J.B., Zdarsky, F.A.: The DISCO Network Calculator – A Toolbox for Worst Case Analysis. In: VALUETOOLS (2006)

    Google Scholar 

  11. Schmitt, J.B., Zdarsky, F.A., Fidler, M.: Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch... In: IEEE Infocom

    Google Scholar 

  12. Schmitt, J.B., Zdarsky, F.A., Martinovic, I.: Performance Bounds in Feed-Forward Networks under Blind Multiplexing. Tech. rep., University of Kaiserslautern

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Schmidt, M., Veith, S., Menth, M., Kehrer, S. (2014). DelayLyzer: A Tool for Analyzing Delay Bounds in Industrial Ethernet Networks. In: Fischbach, K., Krieger, U.R. (eds) Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. MMB&DFT 2014. Lecture Notes in Computer Science, vol 8376. Springer, Cham. https://doi.org/10.1007/978-3-319-05359-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05359-2_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05358-5

  • Online ISBN: 978-3-319-05359-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics