Skip to main content
SpringerLink
Log in

Searching for Tight Performance Bounds in Feed-Forward Networks

  • Conference paper
Book cover Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance (MMB&DFT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5987))

Abstract

Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently it was even shown to be NP-hard [1]. We now address this problem in a heuristic fashion, building on a procedure for computing provably tight bounds under simple traffic and server models. We use a decomposition of a complex problem with more general traffic and server models into a set of simpler problems with simple traffic and server models. This set of problems can become prohibitively large, and we therefore resort to heuristic methods such as Monte Carlo. This shows interesting tradeoffs between performance bound quality and computational effort.

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

Access this chapter

Log in via an institution
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. Tech. Rep. RR-7012, Unité de recherche INRIA Rennes (2009)

    Google Scholar 

  2. Cruz, R.L.: A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory 37, 114–131 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cruz, R.L.: A calculus for network delay, Part II: Network analysis. IEEE Transactions on Information Theory 37, 132–141 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications 13, 1048–1056 (1995)

    Article  Google Scholar 

  5. Sariowan, H., Cruz, R.L., Polyzos, G.C.: Scheduling for quality of service guarantees via service curves. In: Proc. IEEE ICCCN, September 1995, pp. 512–520 (1995)

    Google Scholar 

  6. Chang, C.-S.: On deterministic traffic regulation and service guarantees: A systematic approach by filtering. IEEE Transactions on Information Theory 44, 1097–1110 (1998)

    Article  MATH  Google Scholar 

  7. Le Boudec, J.-Y.: Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory 44, 1087–1096 (1998)

    Article  MATH  Google Scholar 

  8. Agrawal, R., Cruz, R.L., Okino, C., Rajan, R.: Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking 7, 310–323 (1999)

    Article  Google Scholar 

  9. Ciucu, F., Burchard, A., Liebeherr, J.: A network service curve approach for the stochastic analysis of networks. In: Proc. ACM SIGMETRICS, June 2005, pp. 279–290 (2005)

    Google Scholar 

  10. Le Boudec, J.-Y., Thiran, P.: Calculus A Theory of Deterministic Queuing Systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2001)

    Google Scholar 

  11. Baccelli, F., Cohen, G., Olsder, G.J., Quadrat, J.-P.: Synchronization and Linearity: An Algebra for Discrete Event Systems. Probability and Mathematical Statistics. John Wiley & Sons Ltd., Chichester (1992)

    MATH  Google Scholar 

  12. Chang, C.-S.: Performance Guarantees in Communication Networks. Telecommunication Networks and Computer Systems. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  13. Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: an Overview. RFC 1633, Informational (June 1994)

    Google Scholar 

  14. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Service. RFC 2475 (Informational). Updated by RFC 3260 (December 1998)

    Google Scholar 

  15. Schmitt, J., Roedig, U.: Sensor network calculus - a framework for worst case analysis. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 141–154. Springer, Heidelberg (2005)

    Google Scholar 

  16. Koubaa, A., Alves, M., Tovar, E.: Modeling and worst-case dimensioning of cluster-tree wireless sensor networks. In: Proc. IEEE RTSS, pp. 412–421 (2006)

    Google Scholar 

  17. Skeie, T., Johannessen, S., Holmeide, O.: Timeliness of real-time ip communication in switched industrial ethernet networks. IEEE Transactions on Industrial Informatics 2, 25–39 (2006)

    Article  Google Scholar 

  18. Chakraborty, S., Kuenzli, S., Thiele, L., Herkersdorf, A., Sagmeister, P.: Performance evaluation of network processor architectures: Combining simulation with analytical estimation. Computer Networks 42(5), 641–665 (2003)

    Article  Google Scholar 

  19. Kim, H., Hou, J.: Network calculus based simulation: theorems, implementation, and evaluation. In: Proc. IEEE INFOCOM (March 2004)

    Google Scholar 

  20. Chang, C.-S.: Stability, queue length and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control 39, 913–931 (1994)

    Article  MATH  Google Scholar 

  21. Andrews, M.: Instability of fifo in session-oriented networks. In: Proc. SODA, March 2000, pp. 440–447 (2000)

    Google Scholar 

  22. Charny, A., Le Boudec, J.-Y.: Delay bounds in a network with aggregate scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 1–13. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  23. Jiang, Y.: Delay bounds for a network of guaranteed rate servers with fifo aggregation. Computer Networks 40(6), 683–694 (2002)

    Article  Google Scholar 

  24. Zhang, Z.-L., Duan, Z., Hou, Y.T.: Fundamental trade-offs in aggregate packet scheduling. In: Proc. ICNP, November 2001, pp. 129–137 (2001)

    Google Scholar 

  25. Starobinski, D., Karpovsky, M., Zakrevski, L.A.: Application of network calculus to general topologies using turn-prohibition. IEEE/ACM Transactions on Networking 11(3), 411–421 (2003)

    Article  Google Scholar 

  26. Fidler, M., Sander, V.: A parameter based admission control for differentiated services networks. Computer Networks 44(4), 463–479 (2004)

    Article  Google Scholar 

  27. 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(9), 956–987 (2006)

    Article  Google Scholar 

  28. Urvoy-Keller, G., Hébuterne, G., Dallery, Y.: Traffic engineering in a multipoint-to-point network. IEEE Journal on Selected Areas in Communications 20, 834–849 (2002)

    Article  Google Scholar 

  29. Le Boudec, J.-Y., Charny, A.: Packet scale rate guarantee for non-fifo nodes. In: Proc. IEEE INFOCOM, June 2002, pp. 23–26 (2002)

    Google Scholar 

  30. Le Boudec, J.-Y., Rizzo, G.: Pay bursts only once does not hold for non-fifo guaranteed rate nodes. Performance Evaluation 62(1-4), 366–381 (2005)

    Article  Google Scholar 

  31. Echagüe, J., Cholvi, V.: Worst case burstiness increase due to arbitrary aggregate multiplexing. In: Proc. of VALUETOOLS. ACM, New York (2006)

    Google Scholar 

  32. Rajagopal, S., Reisslein, M., Ross, K.W.: Packet multiplexers with adversarial regulated traffic. In: Proc. IEEE INFOCOM, March 1998, pp. 347–355 (1998)

    Google Scholar 

  33. Schmitt, J., Zdarsky, F.: The DISCO Network Calculator - a toolbox for worst case analysis. In: Proc. of VALUETOOLS. ACM, New York (2006)

    Google Scholar 

  34. Bouillard, A., Thierry, E.: An algorithmic toolbox for network calculus. Tech. Rep. RR-6094, Unité de recherche INRIA Rennes (2007)

    Google Scholar 

  35. Schmitt, J.B., Zdarsky, F.A., Martinovic, I.: Improving Performance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once. In: 14th GI/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB 2008), Dortmund, Germany, GI/ITG (March 2008)

    Google Scholar 

  36. Schmitt, J.B., Zdarsky, F.A., Fidler, M.: Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch... In: 27th IEEE International Conference on Computer Communications (INFOCOM 2008), Phoenix, AZ, USA (April 2008)

    Google Scholar 

  37. Schmitt, J., Zdarsky, F., Fidler, M.: Delay bounds under arbitrary multiplexing. Technical Report 360/07, University of Kaiserslautern, Germany (July 2007)

    Google Scholar 

  38. Hooke, R., Jeeves, T.A.: ”‘Direct Search’” Solution of Numerical and Statistical Problems. J. ACM 8(2), 212–229 (1961)

    Article  MATH  Google Scholar 

  39. Gollan, N., Zdarsky, F.A., Martinovic, I., Schmitt, J.B.: The DISCO Network Calculator. In: 14th GI/ITG Conference on Measurement, Modeling, and Evaluation of Computer and Communication Systems (MMB 2008), Dortmund, Germany, GI/ITG (2008)

    Google Scholar 

  40. Zdarsky, F., Schmitt, J., Gollan, N.: The DISCO Network Calculator, http://disco.informatik.uni-kl.de/content/Network_Calculator (last accessed 2009-10-09)

  41. Eikland, K., Notebaert, P., et al.: lp_solve: A Mixed Integer Linear Programming (MILP) solver, http://sourceforge.net/projects/lpsolve/ (last accessed 2009-10-09)

  42. Shenker, S., Partridge, C., Guerin, R.: Specification of Guaranteed Quality of Service. RFC 2212 (Proposed Standard) (September 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Distributed Computer Systems Lab (DISCO), TU Kaiserslautern, Germany

    Andreas Kiefer, Nicos Gollan & Jens B. Schmitt

Authors
  1. Andreas Kiefer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicos Gollan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jens B. Schmitt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science and Business Information Systems, University of Duisburg-Essen, Schützenbahn 70, 45127, Essen, Germany

    Bruno Müller-Clostermann  & Klaus Echtle  & 

  2. Institute for Experimental Mathematics, Computer Networking Technology Group, University of Duisburg-Essen, Ellernstr. 29, D-45326, Essen, Germany

    Erwin P. Rathgeb

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiefer, A., Gollan, N., Schmitt, J.B. (2010). Searching for Tight Performance Bounds in Feed-Forward Networks. In: Müller-Clostermann, B., Echtle, K., Rathgeb, E.P. (eds) Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance. MMB&DFT 2010. Lecture Notes in Computer Science, vol 5987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12104-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12104-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12103-6

  • Online ISBN: 978-3-642-12104-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation