Home // ICNS 2013, The Ninth International Conference on Networking and Services // View article

Different Scenarios of Concatenation at Aggregate Scheduling of Multiple Nodes

Authors:
Ulrich Klehmet
Kai-Steffen Hielscher

Keywords: Network Calculus; FIFO Multiplexing; Blind Multiplexing; Concatenation of nodes; Pay Multiplexing Only Once

Abstract:
Network Calculus (NC) offers powerful tools for performance evaluation in queueing systems. It has been proven as an important mathematical methodology for worst-case analysis of communication networks. One of its main application fields is the determination of QoS guarantees in packet switched communication systems. One issue of nowadays’ research is the applicability of NC concerning the performance evaluation of aggregate multiplexing flows either at one node or at multiple nodes. Then, we have to differ whether the FIFO property at merging single flows can be assumed or not as in case of socalled blind multiplexing. In this paper, we are dealing with problems of computing the service curve for the single individual flow at demultiplexing in connection with aggregate scheduling of both – a singular service system (node) or of multiple nodes, at least two. These service curves are relevant for worst-case delay computation. In particular we define important application scenarios and compare their resulting single flow service curves. These are of practical benefit in many applications and can not be found in literature.

Pages: 111 to 116

Copyright: Copyright (c) IARIA, 2013

Publication date: March 24, 2013

Published in: conference

ISSN: 2308-4006

ISBN: 978-1-61208-256-1

Location: Lisbon, Portugal

Dates: from March 24, 2013 to March 29, 2013