By Topic

Representation of a Stochastic Traffic Bound

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
$33 $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)
Ming Li ; East China Normal University, Shanghai ; Wei Zhao

This paper presents a theoretical representation of a stochastic traffic bound (σ',ρ') that consists of two items, the burstiness bound σ' and the bound of long-term average rate ρ'. The novelty of the suggested representation is that the burstiness bound and the bound of long-term average rate are separately connected to the fractal dimension D that is the measure of the local self-similarity together with the small-scale factor r and the Hurst parameter H that is the measure of the long-range dependence (LRD) together with the large-scale factor a of traffic. More precisely, we obtain σ' = r2D-5σ and ρ' = a-H ρ, where σ is the conventional bound of burstiness and ρ the conventional bound of long-term average rate, respectively. Thus, the present bound (σ',ρ') takes the conventional bound, say (σ,ρ), as a special case when r = 1 and a = 1. Hence, the proposed representation provides us with a flexible way to tighten a traffic bound. Since we study the stochastically bounded modeling of traffic by taking into account the parameters in stochastic modeling, namely, D, H, r, and a, as well as the parameters in the deterministic modeling of traffic, i.e., σ and ρ, a new outlook regarding the stochastically bounded modeling of traffic is revealed. In addition, we open a problem to estimate r and a with respect to the possible applications of the proposed bound to the practice.

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:21 ,  Issue: 9 )