Research Papers

Prediction of Congestion and Bursting Phenomena in Network Traffic Based on Multifractal Spectrums

[+] Author and Article Information
Yan Liu

School of Mechanical Engineering,
Northwestern Polytechnical University,
Xi'an 710072, PRC;
Xi'an Shaangu Power Co. Ltd.,
Xi'an 710075, PRC
e-mail: liuyan@nwpu.edu.cn

Hang Wang

Xi'an Shaangu Power Co. Ltd.,
Xi'an 710075, PRC

Contributed by the Dynamic Systems Division of ASME for publication in the Journal of Dynamic Systems, Measurement, and Control. Manuscript received March 30, 2011; final manuscript received July 8, 2012; published online March 28, 2013. Assoc. Editor: Bor-Chin Chang.

J. Dyn. Sys., Meas., Control 135(3), 031012 (Mar 28, 2013) (7 pages) Paper No: DS-11-1093; doi: 10.1115/1.4023665 History: Received March 30, 2011; Revised July 08, 2012

From the viewpoint of nonlinear dynamics, a numerical method for predicting the traffic of the local area network (LAN) is presented based on the multifractal spectrums; in particular, for predicting the typical congestion and bursting phenomena, by analyzing real time sequences. First, the multifractal spectrums available to the LAN traffic are derived in some detail and their physical meanings are consequently explained. Then an exponent factor is introduced to the measurement or description of the singularity of the time sequence and the correlations between multifractal spectrums and traffic flow rate are studied in depth. Finally, as an example, the multifractal spectrums presented are used to predict the network traffic of an Ethernet by analyzing its real time sequence. The results show that there exists a distinct relationship between the multifractal spectrums and the traffic flow rate of networks and the multifractal spectrum could be used to efficiently and feasibly predict the traffic flow rate, especially for predicting the singularities of the real time sequences, which are closely related to the congestion and bursting phenomena. Thus, this method can be applied to the prediction and management of the congestion and bursting in the network traffic at an early time. Furthermore, the prediction will become much more accurate and powerful over a long period, since the fluctuations of the traffic flow rate are remarkable.

Copyright © 2013 by ASME
Your Session has timed out. Please sign back in to continue.


Liu, Y., Zhang, J. Z., and Mu, D. J., 2008, “Nonlinear Dynamics of the Small-World Networks—Hopf Bifurcation, Sequence of Period-Doubling Bifurcations and Chaos,” J. Phys.: Conf. Ser., 96, p. 012061. [CrossRef]
Park, D. C., 2010, “Long-Term Prediction of Ethernet Traffic Using Multiscale-Bilinear Recurrent Neural Network With Adaptive Learning,” J. Circuits Syst. Comput., 19(1), pp. 71–155. [CrossRef]
Chen, B. S., Yang, Y. S., Lee, B. K., and Lee, T. H., 2003, “Fuzzy Adaptive Predictive Flow Control of ATM Network Traffic,” IEEE Trans. Fuzzy Syst., 11(4), pp. 568–581. [CrossRef]
Alheraish, A., 2005, “Comparison of AR Full Motion Video Traffic Models in B-ISDN,” Comput. Electr. Eng., 31(1), pp. 1–22. [CrossRef]
Zhang, J., Lam, K. C., Yan, W. J., Gao, H., and Li, Y., 2004, “Time Series Prediction Using Lyapunov Exponents in Embedding Phase Space,” Comput. Electr. Eng., 30(1), pp. 1–15. [CrossRef]
Park, J. C., 2000, “Chaos and Predictability of Internet Transmission Times,” Complex Syst., 12(3), pp. 297–316.
Yue, J. H., Dong, K. Q., and Shang, P. J., 2009, “Phase Space Prediction of Traffic Time Series,” J. Comput. Inf. Syst., 5(4), pp. 1257–1266.
Xie, H., 2008, “Short-Term Traffic Flow Prediction Based on Embedding Phase-Space and Blind Signal Separation,” 2008 IEEE International Conference on Cybernetics and Intelligent Systems, Paper No. 4670797. [CrossRef]
Rao, Y. H., Xu, Z. Y., and Liu, Z. L., 2004, “Length Requirement of Self-Similar Network Traffic,” Chin. J. Electron., 13(1), pp. 175–178.
Rao, R., Lee, S., and Narasimha, R., 2001, “Further Results on Self-Similar Network Traffic Modeling With Scale-Invariant Systems,” Proc. SPIE, 4395, pp. 188–199. [CrossRef]
Feldmann, A., Gilbert, A. C., Willinger, W., and Kurtz, T. G., 1998, “The Changing Nature of Network Traffic: Scaling Phenomena,” Comput. Commun. Rev., 28(2), pp. 5–29. [CrossRef]
Wan, J., Dou, W. H., Luo, J. S., and Zhang, H. Y., 2005, “Discrete Wavelet Spectrum Analysis for Multifractal Network Traffic,” 2005 5th International Conference on Information, Communications and Signal Processing, IEEE, pp. 393–398. [CrossRef]
Doi, H., Matsuda, T., and Yamamoto, M., 2007, “Influence of TCP Congestion Control on Multifractal Nature of Network Traffic,” Electron. Commun. Jpn, 90(1), pp. 68–76. [CrossRef]
Dang, T. D., Molnar, S., and Maricza, I., 2004, “Performance Analysis of Multifractal Network Traffic,” Eur. Trans. Telecommun. Relat. Technol., 15(2), pp. 63–78. [CrossRef]
Véhel, J. L., and Sikdar, B., 2001, “A Multiplicative Multifractal Model for TCP Traffic,” IEEE Symposium on Computers and Communications Proceedings, pp. 714–719. [CrossRef]
Cong, S., Han, L. X., Liu, Y., and Gao, C. S., 2003, “The Multifractal Model Based on the Discrete Wavelet Transform,” J. China Inst. Commun., 24(5), pp. 43–48.
Halsey, T. C., Jensen, M. H., and Kadanoff, L. P., 1986, “Fractal Measures and Their Singularities: The Characterization of Strange Sets,” Phys. Rev. A, 33, pp. 1141–1150. [CrossRef] [PubMed]
Feldmann, A., Gilbert, A. C., and Willinger, W., 1998, “Data Network as Cascades: Investigating the Multifractal Nature of Internet WAN Traffic,” Comput. Commun. Rev., 28(4), pp. 42–55. [CrossRef]
Kim, T. S., and Kim, S., 2004, “Singularity Spectra of Fractional Brownian Motions as a Multi-Fractal,” Chaos, Solitons Fractals, 19(3), pp. 613–619. [CrossRef]
Zhang, J. Z., 1995, Fractal, Tsinghua University Press, Tsinghua, pp. 363–373.


Grahic Jump Location
Fig. 1

Multifractal spectrum for real network traffic

Grahic Jump Location
Fig. 2

Structure function for real network traffic

Grahic Jump Location
Fig. 3

Weighting factors and multifractal spectrum parameters (Monday)

Grahic Jump Location
Fig. 4

Distribution of Zi versus Δαi and Δfi

Grahic Jump Location
Fig. 5

Changing of G with Δfi

Grahic Jump Location
Fig. 6

Changing of G with Δfi−1

Grahic Jump Location
Fig. 7

Changing of G with Δf i−2

Grahic Jump Location
Fig. 8

Changing of G with Δf i−3

Grahic Jump Location
Fig. 9

Changing of G with Δf i−1 + Δf i−2

Grahic Jump Location
Fig. 10

Changing of G with Δf i−1 + Δf i−2 + Δf i−3



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In