Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On Bounds on Cumulative Teletraffic Using Min-Plus Convolution

On Bounds on Cumulative Teletraffic Using Min-Plus Convolution Abstract Ideas and results published in two papers by R. L. Cruz in IEEE Transactions on Information Theory in 1991 gave rise to what is called now network calculus. A key role in it plays a certain inequality characterizing the behaviour of cumulative traffic curves. It defines the so-called burstiness constraint by which many kinds of traffics can be described, as for example those occurring in computer networks. Interpretation of this constraint, which can be expressed in two equivalent forms: with and without the use of min-plus convolution, can be found in papers of R. L. Cruz. Nothing however was said about how to obtain it practically, for example, for each of representatives of a family of measured cumulative traffic curves being upperbounded. This problem is tackled in this paper, and as a result, a relation between the Cruz’s constraining function and an upper-bounding function of measured traffic curves is found. The relation obtained is quite general and valid also for the case of non-fulfilment of the so-called sub-additivity property by traffic curves. For the purpose of its derivation, a notion of sub-additivity property with some tolerance Δ was introduced, and the corresponding theorem exploiting it formulated and proved. Further, to complement discussion of the above relation, a minimal burstiness constraint was added to the original Cruz’s inequality and related with a lower bound of a family of measured cumulative traffic curves. The derivations presented in this paper are illustrated by examples. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Electronics and Telecommunications de Gruyter

On Bounds on Cumulative Teletraffic Using Min-Plus Convolution

Loading next page...
 
/lp/de-gruyter/on-bounds-on-cumulative-teletraffic-using-min-plus-convolution-XDNGhaVOrY

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
de Gruyter
Copyright
Copyright © 2012 by the
ISSN
0867-6747
DOI
10.2478/v10177-012-0043-1
Publisher site
See Article on Publisher Site

Abstract

Abstract Ideas and results published in two papers by R. L. Cruz in IEEE Transactions on Information Theory in 1991 gave rise to what is called now network calculus. A key role in it plays a certain inequality characterizing the behaviour of cumulative traffic curves. It defines the so-called burstiness constraint by which many kinds of traffics can be described, as for example those occurring in computer networks. Interpretation of this constraint, which can be expressed in two equivalent forms: with and without the use of min-plus convolution, can be found in papers of R. L. Cruz. Nothing however was said about how to obtain it practically, for example, for each of representatives of a family of measured cumulative traffic curves being upperbounded. This problem is tackled in this paper, and as a result, a relation between the Cruz’s constraining function and an upper-bounding function of measured traffic curves is found. The relation obtained is quite general and valid also for the case of non-fulfilment of the so-called sub-additivity property by traffic curves. For the purpose of its derivation, a notion of sub-additivity property with some tolerance Δ was introduced, and the corresponding theorem exploiting it formulated and proved. Further, to complement discussion of the above relation, a minimal burstiness constraint was added to the original Cruz’s inequality and related with a lower bound of a family of measured cumulative traffic curves. The derivations presented in this paper are illustrated by examples.

Journal

International Journal of Electronics and Telecommunicationsde Gruyter

Published: Dec 1, 2012

There are no references for this article.