Traffic matrix estimation on a large IP backbone: a comparison on real data
2004 (English)In: IMC '04 Proceedings of the 4th ACM SIGCOMM conference on Internet measurement, 2004, 149-160 p.Conference paper (Refereed)
This paper considers the problem of estimating the point-to-point traffic matrix in an operational IP backbone. Contrary to previous studies, that have used a partial traffic matrix or demands estimated from aggregated Netflow traces, we use a unique data set of complete traffic matrices from a global IP network measured over five-minute intervals. This allows us to do an accurate data analysis on the time-scale of typical link-load measurements and enables us to make a balanced evaluation of different traffic matrix estimation techniques. We describe the data collection infrastructure, present spatial and temporal demand distributions, investigate the stability of fan-out factors, and analyze the mean-variance relationships between demands. We perform a critical evaluation of existing and novel methods for traffic matrix estimation, including recursive fanout estimation, worst-case bounds, regularized estimation techniques, and methods that rely on mean variance relationships. We discuss the weaknesses and strengths of the various methods, and highlight differences in the results for the European and American subnetworks.
Place, publisher, year, edition, pages
2004. 149-160 p.
Traffic matrix estimation, Optimization, SNMP, MPLS
IdentifiersURN: urn:nbn:se:kth:diva-7729DOI: 10.1145/1028788.1028807ScopusID: 2-s2.0-14944378851OAI: oai:DiVA.org:kth-7729DiVA: diva2:12841
IMC’04 October 25–27, 2004, Taormina, Sicily, Italy
QC 201011052007-11-252007-11-252012-03-02Bibliographically approved