On performance analysis of self-similar traffic
Weidong Jin · Jisuanji gongcheng yu sheji · 2007
The results of extensive studies in the last decade indicate that network traffic has the ubiquitous characteristic of self-similarity.Self-similarity has great impact on the design and performance analysis of networks.The problem of performance analysis of self-similar traffic is an unsolved problem.An envelope process called fractional bounded arrival process(FBAP) is proposed for self-similar traffic representation.The optimal method of parameters of token bucket is studied based on FBAP traffic.The formal of the rate and depth of the token bucket based on delay constrained are derived.A model for the performance analysis of guarantee service based on network calculus is proposed.The maximum end-to-end delay bound,the maximum backlog bound and the effective bandwidth of guaranteed service are derived.The validity and effectiveness of the analytic results are verified with an application example.