Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
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.
International Journal of Electronics and Telecommunications – de Gruyter
Published: Dec 1, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.