Queueing analysis for multifractal traffic through network calculus and global scaling parameter

In this article, we derive a global scaling parameter for network multifractal traffic. Through this parameter and by relating the effective bandwidth concept to the statistical network calculus, we propose performance bounds for highspeed networks. Our performance bound estimation approach is evaluated by simulations with Internet and Ethernet traffic traces, verifying its efficiency in capturing byte loss probability and mean buffer occupation. The proposed byte loss probability bound was shown to be tighter than that given by the large deviations theory.