By Topic

On Computing Bounds on Average Backlogs and Delays with Network Calculus

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

2 Author(s)
Ciucu, F. ; T-Labs., Tech. Univ. Berlin, Berlin, Germany ; Hohlfeld, O.

The stochastic network calculus is an analytical tool which was mainly developed to compute tail bounds on backlogs and delays. From these, bounds on average backlogs and delays are derived in the literature by integration. This paper improves such bounds on average backlogs by using Jensen's inequality; improved bounds on average delays follow immediately from Little's Law. The gain factor can be substantial especially at high utilizations, e.g., of order Ω (1/1-ρ ) when ρ → 1. This gain is further numerically illustrated for Markov-modulated On-Off arrival processes. Moreover, the paper shows how to improve standard stochastic network calculus performance bounds by suitably using FIFO service curves.

Published in:

Communications (ICC), 2010 IEEE International Conference on

Date of Conference:

23-27 May 2010