loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ulrich Klehmet and Kai-Steffen Hielscher

Affiliation: University Erlangen, Germany

ISBN: 978-989-8565-23-5

Keyword(s): Network Calculus, Blind Multiplexing, Strict Service Curve, Non-strict Service Curve.

Related Ontology Subjects/Areas/Topics: Data Communication Networking ; Performance Evaluation ; Quality-Of-Service ; Software Engineering ; Software Project Management ; Telecommunications ; Traffic Measurement, Analysis, Modeling and Visualization

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. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.173.48.224

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Klehmet, U.; 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

@conference{dcnet12,
author={Ulrich Klehmet. and 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},
}

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 - Klehmet, U.
AU - Hielscher, K.
PY - 2012
SP - 75
EP - 78
DO - 10.5220/0004123800750078

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.