Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Providing public intradomain traffic matrices to the research community

Published: 10 January 2006 Publication History

Abstract

This paper presents a new publicly available dataset from GÉANT, the European Research and Educational Network. This dataset consists of traffic matrices built using full IGP routing information, sampled Netflow data and BGP routing information of the GÉANT network, one per 15 minutes interval for several months. Potential benefits of publicly available traffic matrices comprise improving our understanding of real traffic matrices, their dynamics, and to make possible the benchmarking of intradomain traffic engineering methods

References

[1]
A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, "Traffic matrix estimation: existing techniques and new directions," in Proc. of ACM SIGCOMM, 2002.
[2]
Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg, "Fast accurate computation of large-scale IP traffic matrices from link loads," in Proc. of ACM SIGMETRICS, 2003.
[3]
Y. Zhang, M. Roughan, C. Lund, and D. Donoho, "An information-theoretic approach to traffic matrix estimation," in Proc. of ACM SIGCOMM, 2003.
[4]
A. Soule, A. Nucci, R. Cruz, E. Leonardi, and N. Taft, "How to identify and estimate the largest traffic matrix elements in a dynamic environment," in Proc. of ACM SIGMETRICS, 2004.
[5]
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, "Deriving traffic demands for operational IP networks: methodology and experience," in Proc. of ACM SIGCOMM2000, September 2000.
[6]
A. Gunnar, M. Johansson, and T. Telkamp, "Traffic matrix estimation on a large IP backbone: a comparison on real data," in Proc. of ACM SIGCOMM IMC, 2004.
[7]
G. Varghese and C. Estan, "The measurement manifesto," Comput. Commun. Rev., vol. 34, no. 1, pp. 9--14, 2004.
[8]
K. Papagiannaki, N. Taft, and A. Lakhina, "A distributed approach to measure IP traffic matrices," in Proc. of ACM SIGCOMM Internet Measurement Conference, 2004.
[9]
A. Soule, A. Lakhina, N. Taft, K. Papagiannaki, K. Salamatian, A. Nucci, M. Crovella, and C. Diot, "Traffic matrices: balancing measurements, inference and modeling," in Proc. of ACM SIGMETRICS, 2005.
[10]
"Internet Traffic Archive," http://www.acm.org/sigcomm/ITA/.
[11]
University of Waikato, "The DAG project," http://dag.cs.waikato.ac.nz/.
[12]
T. McGregor, H.-W. Braun, and J. Brown, "The NLANR Network Analysis Infrastructure," IEEE Communications Magazine, May 2000.
[13]
"University of Oregon Route Views Project," http://www.routeviews.org/.
[14]
"Nanog Looking Glass Sites," http://www.nanog.org/lookingglass.html.
[15]
Intel-DANTE, "Intel-DANTE monitoring project," http://www.cambridge.intel-research.net/monitoring/dante/.
[16]
Kunihiro Ishiguro, "GNU Zebra: free routing software," Available from http://www.zebra.org, 1996.
[17]
TOTEM, "A TOolbox for Traffic Engineering Methods," http://totem.info.ucl.ac.be, February 2005.
[18]
B. Quoitin, "C-BGP, an efficient BGP simulator," http://cbgp.info.ucl.ac.be/, September 2003.
[19]
B. Quoitin and S. Uhlig, "Modeling the Routing of an Autonomous System with C-BGP," IEEE Network, vol. 19, no. 6, November 2005.
[20]
B. Halabi and D. Mc Pherson, Internet Routing Architectures (2nd Edition), Cisco Press, January 2001.
[21]
S. Balon, O. Delcourt, J. Lepropre, F. Skivée, and G. Leduc, "A traffic engineering toolbox and its application to the geant network," Submitted to IEEE eTransactions on Network and Service Management, 2005.

Cited By

View all
  • (2024)Research on Computing Resource Measurement and Routing Methods in Software Defined Computing First NetworkSensors10.3390/s2404108624:4(1086)Online publication date: 7-Feb-2024
  • (2024)Network Traffic Anomaly Detection: A Revisiting to Gaussian Process and Sparse RepresentationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2022EAP1161E107.A:1(125-133)Online publication date: 1-Jan-2024
  • (2024)Traffic matrix completion by weighted tensor nuclear norm minimization and time slicingNonlinear Theory and Its Applications, IEICE10.1587/nolta.15.31115:2(311-323)Online publication date: 2024
  • Show More Cited By

Index Terms

  1. Providing public intradomain traffic matrices to the research community

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 36, Issue 1
        January 2006
        90 pages
        ISSN:0146-4833
        DOI:10.1145/1111322
        Issue’s Table of Contents

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 10 January 2006
        Published in SIGCOMM-CCR Volume 36, Issue 1

        Check for updates

        Author Tags

        1. intra-domain traffic matrices
        2. traffic statistics

        Qualifiers

        • Article

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)148
        • Downloads (Last 6 weeks)19
        Reflects downloads up to 12 Nov 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2024)Research on Computing Resource Measurement and Routing Methods in Software Defined Computing First NetworkSensors10.3390/s2404108624:4(1086)Online publication date: 7-Feb-2024
        • (2024)Network Traffic Anomaly Detection: A Revisiting to Gaussian Process and Sparse RepresentationIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2022EAP1161E107.A:1(125-133)Online publication date: 1-Jan-2024
        • (2024)Traffic matrix completion by weighted tensor nuclear norm minimization and time slicingNonlinear Theory and Its Applications, IEICE10.1587/nolta.15.31115:2(311-323)Online publication date: 2024
        • (2024)ROND: Rethinking Overlay Network Design with Underlay Network AwarenessProceedings of the ACM on Networking10.1145/36562982:CoNEXT2(1-22)Online publication date: 13-Jun-2024
        • (2024)FIGRET: Fine-Grained Robustness-Enhanced Traffic EngineeringProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672258(117-135)Online publication date: 4-Aug-2024
        • (2024)Transferable Neural WAN TE for Changing TopologiesProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672237(86-102)Online publication date: 4-Aug-2024
        • (2024)ARES: Predictable Traffic Engineering under Controller Failures in SD-WANsProceedings of the ACM Web Conference 202410.1145/3589334.3645321(2703-2712)Online publication date: 13-May-2024
        • (2024)Proactive VNF Scaling and Placement in 5G O-RAN Using MLIEEE Transactions on Network and Service Management10.1109/TNSM.2023.329298621:1(174-186)Online publication date: 1-Feb-2024
        • (2024)Structured-Anomaly Pursuit of Network Traffic via Corruption-Robust Low-Rank Tensor DecompositionIEEE Transactions on Network Science and Engineering10.1109/TNSE.2023.327789511:3(2510-2523)Online publication date: May-2024
        • (2024)Maintaining Control Resiliency for Traffic Engineering in SD-WANsIEEE/ACM Transactions on Networking10.1109/TNET.2024.339384132:4(3485-3498)Online publication date: Aug-2024
        • Show More Cited By

        View Options

        Get Access

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media