The DISCO network calculator: a toolbox for worst case analysis

ABSTRACT

In this paper we describe the design, implementation, and analytical background of the DISCO Network Calculator. The DISCO Network Calculator is an open-source toolbox written in Java™ which we developed for worst-case analyses based on network calculus. To our knowledge it is the first of its kind. It allows to do network analyses regarding performance characteristics such as delay and backlog bounds for piecewise linear arrival and service curves. We illustrate the tool's usefulness by two comprehensive example applications.

REFERENCES

• 1: Rajeev Agrawal , Rene L. Cruz , Clayton Okino , Rajendran Rajan, Performance bonds for flow control protocols, IEEE/ACM Transactions on Networking (TON), v.7 n.3, p.310-323, June 1999 [doi>10.1109/90.779197]
• 2: F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity: An Algebra for Discrete Event Systems. Probability and Mathematical Statistics. John Wiley & Sons Ltd., West Sussex, Great Britain, 1992.
• 3: Samarjit Chakraborty , Simon Künzli , Lothar Thiele , Andreas Herkersdorf , Patricia Sagmeister, Performance evaluation of network processor architectures: combining simulation with analytical estimation, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.41 n.5, p.641-665, 5 April 2003 [doi>10.1016/S1389-1286(02)00454-1]
• 4: C.-S. Chang. On deterministic traffic regulation and service guarantees: A systematic approach by filtering. IEEE Transactions on Information Theory, 44(3):1097--1110, May 1998.
• 5: Anna Charny , Jean-Yves Le Boudec, Delay Bounds in a Network with Aggregate Scheduling, Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services, p.1-13, September 25-26, 2000
• 6: R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE Journal on Selected Areas in Communications, 13(6):1048--1056, August 1995.
• 7: R. L. Cruz. SCED+: Efficient management of quality of service guarantees. In Proc. IEEE INFOCOM, volume 2, pages 625--634, March 1998.
• 8: Markus Fidler , Volker Sander, A parameter based admission control for differentiated services networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.44 n.4, p.463-479, 15 March 2004 [doi>10.1016/j.comnet.2003.12.004]
• 9: H. Kim and J. C. Hou. Network calculus based simulation: theorems, implementation, and evaluation. In Proc. IEEE INFOCOM, March 2004.
• 10: J.-Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory, 44(3):1087--1096, May 1998.
• 11: Jean-Yves Le Boudec , Patrick Thiran, Network calculus: a theory of deterministic queuing systems for the internet, Springer-Verlag New York, Inc., New York, NY, 2001
• 12: Luciano Lenzini , Linda Martorini , Enzo Mingozzi , Giovanni Stea, Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks, Performance Evaluation, v.63 n.9, p.956-987, October 2006 [doi>10.1016/j.peva.2005.10.003]
• 13: Scheduling for quality of service guarantees via service curves, Proceedings of the 4th International Conference on Computer Communications and Networks, p.512, September 20-23, 1995
• 14: J. Schmitt. On the allocation of network service curves for bandwidth/delay-decoupled scheduling disciplines. In Proc. of IEEE GLOBECOM, pages 1544--1548. IEEE, November 2002.
• 15: J. Schmitt and U. Roedig. Sensor network calculus - a framework for worst case analysis. In Proc. IEEE/ACM DCOSS, pages 141--154, June 2005.
• 16: J. Schmitt, F. Zdarsky, and I. Martinovic. Performance bounds in feed-forward networks under blind multiplexing. Technical Report 349/06, University of Kaiserslautern, Germany, April 2006.
• 17: T. Skeie, S. Johannessen, and O. Holmeide. Timeliness of real-time ip communication in switched industrial ethernet networks. IEEE Transactions on Industrial Informatics, 2(1):25--39, February 2006.
• 18: David Starobinski , Mark Karpovsky , Lev A. Zakrevski, Application of network calculus to general topologies using turn-prohibition, IEEE/ACM Transactions on Networking (TON), v.11 n.3, p.411-421, June 2003 [doi>10.1109/TNET.2003.813040]
• 19: Ion Stoica , Hui Zhang , T. S. Eugene Ng, A hierarchical fair service curve algorithm for link-sharing, real-time and priority services, Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication, p.249-262, September 14-18, 1997, Cannes, France

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Modeling techniques

Keywords:
deterministic guarantees, network calculus, tool support