Skip to main content

DEBORAH: A Tool for Worst-Case Analysis of FIFO Tandems

  • Conference paper
Leveraging Applications of Formal Methods, Verification, and Validation (ISoLA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6415))

Abstract

Recent results on Network Calculus applied to FIFO networks show that, in the general case, end-to-end delay bounds cannot be computed in a closed form, whereas solving non-linear programming problems is instead required. Furthermore, it has been shown that these bounds may be larger than the actual worst-case delay, which also calls for computing lower bounds on the latter. This paper presents DEBORAH (Delay Bound Rating AlgoritHm), a tool for computing upper and lower bounds to the worst-case delay in FIFO tandem networks. DEBORAH can analyze tandems of up to several tens of nodes in reasonable time on off-the-shelf hardware. We overview the various algorithms used by DEBORAH to perform the various steps of the computations, and describe its usage.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bisti, L., Lenzini, L., Mingozzi, E., Stea, G.: Estimating the Worst-case Delay in FIFO Tandems Using Network Calculus. In: VALUETOOLS 2008, Athens, GR, October 21-23 (2008)

    Google Scholar 

  2. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. IETF RFC 2475 (1998)

    Google Scholar 

  3. Le Boudec, J.-Y., Thiran, P.: Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  4. Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. IETF RFC 3031 (January 2001)

    Google Scholar 

  5. 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  MATH  Google Scholar 

  6. Cruz, R.L.: A calculus for network delay, part ii: Network analysis. IEEE Transactions on Information Theory 37(1), 132–141 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Agrawal, R., Cruz, R.L., Okino, C., Rajan, R.: Performance Bounds for Flow Control Protocols. IEEE/ACM Trans. on Networking 7(3), 310–323 (1999)

    Article  Google Scholar 

  8. Chang, C.S.: Performance Guarantees in Communication Networks. Springer, New York (2000)

    Book  MATH  Google Scholar 

  9. Lenzini, L., Mingozzi, E., Stea, G.: Delay Bounds for FIFO Aggregates: a Case Study. Elsevier Computer Communications 28(3), 287–299 (2005)

    Article  Google Scholar 

  10. Lenzini, L., Martorini, L., Mingozzi, E., Stea, G.: Tight End-to-end Per-flow Delay Bounds in FIFO Multiplexing Sink-tree Networks. Performance Evaluation 63, 956–987 (2006)

    Article  Google Scholar 

  11. Lenzini, L., Mingozzi, E., Stea, G.: A Methodology for Computing End-to-end Delay Bounds in FIFO-multiplexing Tandems. Performance Evaluation 65, 922–943 (2008)

    Article  Google Scholar 

  12. Schmitt, J.B., Zdarsky, F.A.: The DISCO Network Calculator - A Toolbox for Worst Case Analysis. In: Proc. of VALUETOOLS 2006, Pisa, Italy. ACM, New York (October 2006)

    Google Scholar 

  13. Bouillard, A., Thierry, É.: An Algorithmic Toolbox for Network Calculus. Journal of Discrete Event Dynamic Systems 18(1), 3/49 (2008)

    Google Scholar 

  14. Website of the Computer Networking Group at the University of Pisa, continuously updated, http://cng1.iet.unipi.it/wiki/index.php/Deborah

  15. Bouillard, A., Johuet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proc. INFOCOM 2010, San Diego, US, March 14-19 (2010)

    Google Scholar 

  16. Fidler, M.: A Survey of Deterministic and Stochastic Service Curve Models in the Network Calculus. IEEE Communications Surveys and Tutorials 12(1), 59–86 (2010)

    Article  Google Scholar 

  17. Bisti, L., Lenzini, L., Mingozzi, E., Stea, G.: Computation and Tightness assessment of delay bounds in FIFO-multiplexing tandems. Technical Report, Pisa (May 2010), http://info.iet.unipi.it/~stea/

  18. Wandeler, E., Thiele, L.: Real-Time Calculus (RTC) Toolbox,(2006), http://www.mpa.ethz.ch/Rtctoolbox

  19. Schioler, H., Schwefel, H.P., Hansen, M.B.: CyNC – a MATLAB/Simulink Toolbox for Network Calculus. In: Proc. VALUETOOLS 2007, Nantes, FR (October 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bisti, L., Lenzini, L., Mingozzi, E., Stea, G. (2010). DEBORAH: A Tool for Worst-Case Analysis of FIFO Tandems. In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification, and Validation. ISoLA 2010. Lecture Notes in Computer Science, vol 6415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16558-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16558-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16557-3

  • Online ISBN: 978-3-642-16558-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics