Representation of a Stochastic Traffic Bound
Authors:
- 1 December 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 21 (9) , 1368-1372
Abstract
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.Keywords
This publication has 25 references indexed in Scilit:
- Per-domain packet scale rate guarantee for expedited forwardingIEEE/ACM Transactions on Networking, 2006
- Change trend of averaged Hurst parameter of traffic under DDOS flood attacksComputers & Security, 2006
- Design and implementation of QoS-provisioning system for voice over IPIEEE Transactions on Parallel and Distributed Systems, 2006
- Guaranteeing end-to-end deadlines in ATM networks2002
- A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networksIEEE/ACM Transactions on Networking, 1998
- Wide area traffic: the failure of Poisson modelingIEEE/ACM Transactions on Networking, 1995
- Performance and stability of communication networks via robust exponential boundsIEEE/ACM Transactions on Networking, 1993
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- On the performance of box-counting estimators of fractal dimensionBiometrika, 1993
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991