Abstract
A method is proposed to estimate traffic matrices in the presence of long-range dependent traffic, while the methods proposed so far for that task have been designed for short-range dependent traffic. The method employs the traffic measurements on links and provides the maximum likelihood estimate of both the traffic matrix and the Hurst parameter. It is “blind”, i.e. it does not exploit any model neither for the traffic intensity values (e.g. the gravity model) nor for the mean-variance relationship (e.g. the power-law model). In the application to a sample network the error on traffic intensities decays rapidly with the traffic intensity down to below 30%. The estimation error of the Hurst parameter can be reduced to a few percentage points with a proper choice of the measurement interval.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bear, D.: Principles of telecommunication traffic engineering. IEE/Peter Peregrinus, London (1988)
Kim, N.: A point-to-point traffic estimation from trunk-group and office measurements for large networks. In: 13th International Teletraffic Congress, Copenhagen, Denmark (June 1991)
Tu, M.: Estimation of point-to-point traffic demand in the public switched telephone network. IEEE Transactions on Communications 42(2/3/4), 840–845 (1994)
Buttó, M., Conversi, P.G., Naldi, M.: Estimation of point-to-point traffic in circuit-switched networks. European Transactions on Telecommunications 10(5), 497–504 (1999)
Vardi, Y.: Network tomography: Estimating source-destination traffic intensities from link data. Journal of the American Statistical Association 91, 365–377 (1996)
Cao, J., Davis, D., Vander Wiel, S., Yu, B.: Time-varying network tomography: Router link data. Journal of the American Statistical Association 95, 1063–1075 (2000)
Castro, R., Coates, M., Liang, G., Nowak, R., Yu, B.: Network tomography: Recent developments. Statistical Science 19, 499–517 (2004)
Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrix estimation: Existing techniques and new directions. In: SIGCOMM 2002, Pittsburgh, Pennsylvania, USA (August 2002)
Juva, I.: Traffic matrix estimation in the Internet: measurement analysis, estimation methods and applications. PhD in Technology, Helsinki University of Technology (2007)
Karagiannis, T., Molle, M., Faloutsos, M.: Long-range dependence: Ten years of internet traffic modeling. IEEE Internet Computing 8(5), 57–64 (2004)
Gong, W.B., Liu, Y., Misra, V., Towsley, D.: Self-similarity and long range dependence on the internet: a second look at the evidence, origins and implications. Computer Networks 48(3), 377–399 (2005)
Park, C., Hernandez-Campos, F., Marron, J.S., Donelson Smith, F.: Long-range dependence in a changing internet traffic mix. Computer Networks 48(3), 401–422 (2005)
Susitaival, R., Juva, I., Peuhkuri, M., Aalto, S.: Characteristics of origin-destination pair traffic in funet. Telecommunication Systems 33, 67–88 (2006)
Norros, I., Kilpi, J.: Testing the gaussian approximation of aggregate traffic. In: Internet Measurement Workshop IMW 2002, Marseille (2002)
Juva, I., Susitaival, R., Peuhkuri, M., Aalto, S.: Traffic characterization for traffic engineering purposes: analysis of funet data. In: Proceedings of the 1st EuroNGI Conference on Next Generation Internet Networks (NGI 2005), Rome, pp. 404–422 (2005)
Juva, I., Susitaival, R., Peuhkuri, M., Aalto, S.: Effects of spatial aggregation on the characteristics of origin-destination pair traffic in funet. In: Koucheryavy, Y., Harju, J., Sayenko, A. (eds.) NEW2AN 2007. LNCS, vol. 4712, pp. 1–12. Springer, Heidelberg (2007)
Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B (Methodological) 39(1), 1–38 (1977)
Moon, T.K.: The expectation-maximization algorithm. IEEE Signal Processing Magazine 13(6), 47–60 (1996)
Kuk, A., Chan, J.: Three ways of implementing the EM algorithm when parameters are not identifiable. Biometrical Journal 43, 207–218 (2001)
Juva, I., Vaton, S., Virtamo, J.: Quick traffic matrix estimation based on link count covariances. In: 2nd EuroNGI Workshop on Traffic Engineering, Protection and Restoration for NGI, Rome, Italy, April 21-22 (2005)
Press, W., Teukolsky, S., Vetterling, W., Flannery, B.: Numerical Recipes in C, 2nd edn. Cambridge University Press, Cambridge (1992)
Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, New York (1949)
Naldi, M., Salaris, C.: Rank-size distribution of teletraffic and customers over a wide area network. European Transactions on Telecommunications 17(4), 415–421 (2006)
Susitaival, R., Juva, I., Peuhkuri, M., Aalto, S.: Characteristics of origin-destination pair traffic in funet. Telecommunication Systems 33(1-3), 67–88 (2006)
Gunnar, A., Johansson, M., Telkamp, T.: Traffic matrix estimation on a large ip backbone: a comparison on real data. In: IMC 2004: Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, pp. 149–160. ACM, New York (2004)
Hall, P., Jing, B., Lahiri, S.N.: On the sampling window method for long-range dependent data. Statistica Sinica 8(4), 1189–1204 (1998)
De Giovanni, L., Naldi, M.: Tests of correlation among wavelet-based estimates for long memory processes. Communications in Statistics - Simulation and Computation 37(2), 301–313 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Conti, P.L., De Giovanni, L., Naldi, M. (2009). Blind Maximum-Likelihood Estimation of Traffic Matrices in Long Range Dependent Traffic. In: Valadas, R., Salvador, P. (eds) Traffic Management and Traffic Engineering for the Future Internet. FITraMEn 2008. Lecture Notes in Computer Science, vol 5464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04576-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-04576-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04575-2
Online ISBN: 978-3-642-04576-9
eBook Packages: Computer ScienceComputer Science (R0)