Abstract
For lots of traffic engineering tasks, telecommunications operators need good knowledge about the traffic which transit through their networks. This information is fully represented by the matrix of the volumes of data which go from any entry node to any exit node during a period of time. This matrix is called the origin-destination (OD) traffic matrix. However such a matrix is not directly available. Only measures of the volumes of data which transit through a link between routers can be obtained easily with the help of Simple Network Management Protocol (SNMP). These measures are called link counts.
Lots of techniques have been proposed to estimate the traffic matrix from the link counts. Among those, statistical methods propose to model the demand for each OD pair in order to chose a possible traffic matrix which fits the reality of networks. Nevertheless, the model is often arbitrary and don’t take into account the temporal dimension of traffic. In this paper, we claim that a temporal model of the traffic for each OD pair could be trained from the link counts only. We prove the validity of our approach on a one router network on which direct measurements of the OD counts were made available. Then, we compare our results to other methods and show that their accuracy is the best.
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
Cao, J., Davis, D., Vander Wiel, S., and Yu, B. (2000a). Time-Varying Network Tomography: Router Link Data. Journal of the American Statistical Association, 95(452).
Cao, J., Vander Wied, S., Yu, B., and Zhu, Z. (2000b). J. Cao, S. Vander Wiel, B. Yu, and Z. Zhu, A Scalable Method for Estimating Network Traffic Matrices from Link Counts. Technical report, Bell Labs.
Dempster, A.P., Laird, N.M., and Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data. Journal of the Royal Statistical Society B, 39:1–38.
Doucet, A., De Freitas, N., and Gordon, N. (2001). Sequential Monte Carlo Methods in Practice. Springer.
Duffiels, N., Zhang, Y., Roughan, M., and Greenberg, A. (2003). Fast accurate computation of large-scale IP traffic matrices from link loads. In: ACM SIGMETRIC’s, San Diego.
Golub, G.H. and Van Loan, C.F. (1996). Matrix Computations, Third Edition. Johns Hopkins Series in Mathematical Sciences.
McLachlan, G.J. and Krishnan, T. (1997). The EM Algorithm and Extensions. Wiley Series in Probability and Statistics.
Medina, A., Taft, N., Battacharya, S., Diot, C., and Salamatian, K. (2002). Traffic matrix estimation: Existing techniques compared and new directions. In: SIGCOMM, Pittsburgh.
Paxson, V. and Floyd, S. (1995). Wide-Area Traffic: the Failure of Poisson Modelling. IEEE/ACM Transactions on Networking.
Rabiner, L.R. (1989). A tutorial on hidden markov models and selected applications in speech recognition. In: Proceedings of IEEE Conference.
Roughan, M., Greenberg, A., Kalmanek, C., Rumsewicz, M., Yates, J., and Zhang, Y. (2002). Experience in measuring backbone traffic variability: Models, metrics, measurements and meaning. Internet Measurement Workshop, Marseille.
Soule, A., Nucci, A., Cruz, R., Leonardi, E., and Taft, N. (2004). How to identify and estimate the largest traffic matrix elements in a dynamic environment? In: ACM Sigmetrics.
Tebaldi, C., and West, M. (1998). Bayesian Inference on Network Traffic Using Link Count Data. Journal of the American Statistical Association, 93(442).
Titterington, D.M., Smith, A.F.M., and Makov, U.E. (1985). Statistical Analysis of Finite Mixture Distributions. John Wiley and Sons.
Van Zwet, E. Method of Moments Estimation for Origin-Destination Traffic on a Network. Department of Statistics, University of California in Berkeley.
Vardi, Y. (1996). Network Tomography: Estimating Source-Destination Traffic Intensities From Link Data. Journal of the American Statistical Association, 91(433).
Vaton, S. and Gravey, A. (2002). Iterative Bayesian analysis of network traffic matrices in the case of bursty flows. Internet Measurement Workshop, Marseille.
Vaton, S. and Gravey, A. (2003). Network tomography: An iterative Bayesian analysis. In: ITC 18th, Berlin.
Zhang, Y., Roughan, M., Lund, C., and Donoho, D. (2003). An Information Theoretic Approach to Traffic Matrix Estimation. In: ACM SIGCOMM.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Vaton, S., Bedo, JS., Gravey, A. (2005). Advanced Methods for the Estimation of the Origin Destination Traffic Matrix. In: Girard, A., Sansò, B., Vázquez-Abad, F. (eds) Performance Evaluation and Planning Methods for the Next Generation Internet. Springer, Boston, MA. https://doi.org/10.1007/0-387-25551-6_8
Download citation
DOI: https://doi.org/10.1007/0-387-25551-6_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25550-7
Online ISBN: 978-0-387-25551-4
eBook Packages: Business and EconomicsBusiness and Management (R0)