By Topic

A leftover service curve approach to analyze demultiplexing in queueing networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hao Wang ; Univ. of Kaiserslautern, Kaiserslautern, Germany ; Ciucu, F. ; Schmitt, J.

Queueing networks are typically subject to demultiplexing operations, whereby network nodes split flows into multiple sub-flows. The demultiplexing operation captures relevant network aspects such as packet loss or multi-path routing. In this paper we propose a novel approach to analyze queueing networks with demultiplexing. The basic idea is to represent a network node implementing a demultiplexing operation on an output flow as an equivalent system for which the corresponding input flow is logically demultiplexed according to the demultiplexing operation at the output. In this way, the service given to one of the demultiplexed sub-flows at the output can be expressed in terms of a leftover service curve, and consequently performance bounds can be derived using the network calculus methodology. Using numerical illustrations, we show that the obtained bounds improve upon existing bounds, especially in the case of the rather small sub-flows.

Published in:

Performance Evaluation Methodologies and Tools (VALUETOOLS), 2012 6th International Conference on

Date of Conference:

9-12 Oct. 2012