Strictness of Rate-latency Service Curves

Ulrich Klehmet, Kai-Steffen Hielscher

Abstract

Network Calculus (NC) offers powerful methods for performance evaluation of queueing systems, especially for the worst-case analysis of communication networks. It is often used to obtain QoS guarantees in packet switched communication systems. One issue of nowadays’ research is the applicability of NC for multiplexed flows, in particular, if the FIFO property cannot be assumed when merging the individual flows. If a node serves the different flows using another schedule than FIFO, the terms ’strict’ or ’non-strict’ service curves play an important role. In this paper, we are dealing with the problems of strict and non-strict service curves in connection with aggregate scheduling. In the literature, the strictness of the service curve of the aggregated flow is reported as a fundamental precondition to get a service curve for the single individual flows at demultiplexing, if the service node process the input flows in Non-FIFO manner. The important strictness-property is assumed to be a unique feature of the service curve alone. But we will show here that this assumption is not true in general. Only the connection with the concrete input allows to classify a service as curve strict or non-strict.

References

  1. Bouillard, A., Gaujal, B., and Lagrange, S. (2007). Optimal routing for end-to-end guarantees: the price of multiplexing. In Valuetools 7807, Nantes.
  2. Charny, A. and Le Boudec, J.-Y. (2000). Delay Bounds in a Network with Aggregate Scheduling. Springer Verlag LNCS 1922.
  3. Cruz, R. (1991). A calculus for network delay, part i: Network elements in isolation. IEEE Trans. Inform. Theory, 37-1:114-131.
  4. Fidler, M. and Sander, V. (2004). A parameter based admission control for differentiated services networks. Computer Networks, 44:463-479.
  5. Le Boudec, J.-Y. and Thiran, P. (2001). Network Calculus. Springer Verlag LNCS 2050.
  6. Rizzo, G. (2008). Stability and Bounds in Aggregate Scheduling Networks. Ecole Polytechnique Federale De Lausanne, PhD Thesis.
  7. Schmitt, J., Zdarsky, F., and Fidler, M. (2007). Delay Bounds under Arbitrary Multiplexing. Technical Report, 360/07.
  8. Schmitt, J., Zdarsky, F., and Martinovic, I. (2008). Improving Performance Bounds in Feed-Forward Networks by Paying Multiplexing Only Once. In Measurements, Modelling and Evaluation of Computer and Communication Systems(14th GI/ITG Conference), Dortmund.
  9. Ying, Y., Guillemin, F., Mazumdar, R., and Rosenberg, C. (2008). Buffer overflow asymptotics for multiplexed regulated traffic. Performance Evaluation, 65-8.
Download


Paper Citation


in Harvard Style

Klehmet U. and Hielscher K. (2012). Strictness of Rate-latency Service Curves . In Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: DCNET, (ICETE 2012) ISBN 978-989-8565-23-5, pages 75-78. DOI: 10.5220/0004123800750078


in Bibtex Style

@conference{dcnet12,
author={Ulrich Klehmet and Kai-Steffen Hielscher},
title={Strictness of Rate-latency Service Curves},
booktitle={Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: DCNET, (ICETE 2012)},
year={2012},
pages={75-78},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004123800750078},
isbn={978-989-8565-23-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: DCNET, (ICETE 2012)
TI - Strictness of Rate-latency Service Curves
SN - 978-989-8565-23-5
AU - Klehmet U.
AU - Hielscher K.
PY - 2012
SP - 75
EP - 78
DO - 10.5220/0004123800750078