Klehmet U, Hielscher KS (2012)
Publication Type: Conference contribution
Publication year: 2012
Edited Volumes: DCNET 2012, ICE-B 2012, OPTICS 2012 - Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems, ICETE
Pages Range: 75-78
Conference Proceedings Title: Proc. of International Conference on Data Communication Networking
Event location: Rom
URI: http://www7.informatik.uni-erlangen.de/~klehmet/publications/Papers/NCstrict.pdf
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.
APA:
Klehmet, U., & Hielscher, K.-S. (2012). Strictness of Rate-Latency Service Curves. In Proc. of International Conference on Data Communication Networking (pp. 75-78). Rom.
MLA:
Klehmet, Ulrich, and Kai-Steffen Hielscher. "Strictness of Rate-Latency Service Curves." Proceedings of the International Conference on Data Communication Networking, Rom 2012. 75-78.
BibTeX: Download