Research on modeling of network traffic based on (MK)-FBM
Chen Bai-xiu · Railway Computer Application · 2009
Traffic modeling was an important basis of network programming and performance evaluation. FBM was only efficient for approximating the performance of a class of exactly self-similar traffic,whose correlation property could be described by a single Hurst index. However,most traffic in real networks did not display exactly self-similarity,but had more general long-range dependent properties,which could not be described by a single Hurst index. By paying attention to the time scales dominating the performance,in this paper,it was proposed an (MK)-FBM method to solve the problem. Based on the buffer overflow rate given by Norros,it was derived the formulas of average queuing length,queuing length variance,average delay,delay jitter and effective bandwidth.