Nothing Special   »   [go: up one dir, main page]

skip to main content
article

Robust traffic matrix estimation with imperfect information: making use of multiple data sources

Published: 26 June 2006 Publication History

Abstract

Estimation of traffic matrices, which provide critical input for network capacity planning and traffic engineering, has recently been recognized as an important research problem. Most of the previous approaches infer traffic matrix from either SNMP link loads or sampled NetFlow records. In this work, we design novel inference techniques that, by statistically correlating SNMP link loads and sampled NetFlow records, allow for much more accurate estimation of traffic matrices than obtainable from either information source alone, even when sampled NetFlow records are available at only a subset of ingress. Our techniques are practically important and useful since both SNMP and NetFlow are now widely supported by vendors and deployed in most of the operational IP networks. More importantly, this research leads us to a new insight that SNMP link loads and sampled NetFlow records can serve as "error correction codes" to each other. This insight helps us to solve a challenging open problem in traffic matrix estimation, "How to deal with dirty data (SNMP and NetFlow measurement errors due to hardware/software/transmission problems)?" We design techniques that, by comparing notes between the above two information sources, identify and remove dirty data, and therefore allow for accurate estimation of the traffic matrices with the cleaned dat.We conducted experiments on real measurement data obtained from a large tier-1 ISP backbone network. We show that, when full deployment of NetFlow is not available, our algorithm can improve estimation accuracy significantly even with a small fraction of NetFlow data. More importantly, we show that dirty data can contaminate a traffic matrix, and identifying and removing them can reduce errors in traffic matrix estimation by up to an order of magnitude. Routing changes is another a key factor that affects estimation accuracy. We show that using them as the a priori, the traffic matrices can be estimated much more accurately than those omitting the routing change. To the best of our knowledge, this work is the first to offer a comprehensive solution which fully takes advantage of using multiple readily available data sources. Our results provide valuable insights on the effectiveness of combining flow measurement and link load measurement.

References

[1]
S. Bhattacharyya, C. Diot, J. Jetcheva, and N. Taft. Geographical and temporal characteristics of inter-pop flows: View from a single pop. European Transactions on Telecommunications, 2000.
[2]
J. Cao, D. Davis, S. Vander Wiel, and B. Yu. Time-varying network tomography:router link data. Journal of American Statistics Association, pages 1063--1075, 2000.
[3]
D.L. Donoho. For most large underdetermined systems of equations, the minimal l1-norm near solution approximates the sparsest near-solution. In http://www-stat.stanford.edu/~donoho/Reports/, 2004.
[4]
N. Duffield and C. Lund. Predicting resource usage and estimation accuracy in an ip flow measurement collection infrastructure. In Proc. ACM SIGCOMM IMC, October 2003.
[5]
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational IP networks: Methodology and experience. IEEE transaction on Networking, June 2001.
[6]
A. Gunnar, M. Johansson, and T. Telkamp. Traffic matrix estimation on a large ip backbone-- a comparison on real data. In Proc. USENIX/ACM SIGCOMM IMC, October 2004.
[7]
S.M. Kay. Fundamentals of Statistical Signal Processing: Estimation Theory. Prentice Hall, 1993.
[8]
A. Lakhina, K. Papagiannaki, and M. Crovella. Diagnosing network-wide anomalies. In Proc. ACM SIGCOMM, August 2004.
[9]
A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot. Traffic matrix estimation:existing techniques and new directions. In Proc. ACM SIGCOMM, August 2002.
[10]
White paper-netflow services and applications. http://www.cisco.com/warp/public/cc/pd/iosw/ioft/ neflct/tech/napps_wp.htm.
[11]
A. Nucci, R. Cruz, N. Taft, and C. Diot. Design of igp link weight changes for estimation of traffic matrices. In Proc. IEEE INFOCOM, March 2004.
[12]
K. Papagiannaki, N. Taft, and A. Lakhina. A distributed approach to measure traffic matrices. In Proc. ACM/SIGCOMM IMC, October 2004.
[13]
A. Shaikh and A. Greenberg. Ospf monitoring: Architecture, design and deployment experience. In Proc. USENIX NSDI, 2004.
[14]
A. Soule, A. Lakhina, N. Taft, and K. Papagiannaki. Traffic matrices: Balancing measurements, inference and modeling. In Proc. ACM SIGMETRICS, August 2005.
[15]
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. ACM SIGMETRICS, June 2004.
[16]
Y. Vardi. Internet tomography: estimating source-destination traffic intensities from link data. Journal of American Statistics Association, pages 365--377, 1996.
[17]
J. Wu, Z. Mao, J. Rexford, and J. Wang. Finding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network. In Proc. USENIX NSDI, 2005.
[18]
Y. Zhang, Z. Ge, A. Greeenberg, and M. Roughan. Network anomography. In Proc. USENIX/ACM SIGCOMM IMC, Oct 2005.
[19]
Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale ip traffic matrices from link loads. In Proc. ACM SIGMETRICS, June 2003.
[20]
Y. Zhang, M. Roughan, C. Lund, and D. Donoho. An information-theoretic approach to traffic matrix estimation. In Proc. ACM SIGCOMM, August 2003.
[21]
Q. Zhao, Z. Ge, J. Wang, and J. Xu. Robust traffic matrix estimation with imperfect information: Making use of multiple data sources. In Technical Report, April 2006.
[22]
Q. Zhao, A. Kumar, J. Wang, and J. Xu. Data streaming algorithms for accurate and efficient measurement of traffic and flow matrices. In Proc. ACM SIGMETRICS, June 2005.

Cited By

View all
  • (2022)Fast xFlow Proxy: Exploring and Visualizing Deep Inside of Carrier TrafficIEICE Transactions on Communications10.1587/transcom.2021EBP3086E105.B:5(512-521)Online publication date: 1-May-2022
  • (2022)Dynamic Traffic Engineering Considering Service Grade in Integrated Service NetworkIEEE Access10.1109/ACCESS.2022.319411510(79021-79028)Online publication date: 2022
  • (2021)A tensor train approach for internet traffic data completionAnnals of Operations Research10.1007/s10479-021-04147-4339:3(1461-1479)Online publication date: 14-Jun-2021
  • Show More Cited By

Index Terms

  1. Robust traffic matrix estimation with imperfect information: making use of multiple data sources

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 34, Issue 1
    Performance evaluation review
    June 2006
    388 pages
    ISSN:0163-5999
    DOI:10.1145/1140103
    Issue’s Table of Contents
    • cover image ACM Conferences
      SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systems
      June 2006
      404 pages
      ISBN:1595933190
      DOI:10.1145/1140277
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 26 June 2006
    Published in SIGMETRICS Volume 34, Issue 1

    Check for updates

    Author Tags

    1. network measurement
    2. statistical inference
    3. traffic matrix

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 27 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Fast xFlow Proxy: Exploring and Visualizing Deep Inside of Carrier TrafficIEICE Transactions on Communications10.1587/transcom.2021EBP3086E105.B:5(512-521)Online publication date: 1-May-2022
    • (2022)Dynamic Traffic Engineering Considering Service Grade in Integrated Service NetworkIEEE Access10.1109/ACCESS.2022.319411510(79021-79028)Online publication date: 2022
    • (2021)A tensor train approach for internet traffic data completionAnnals of Operations Research10.1007/s10479-021-04147-4339:3(1461-1479)Online publication date: 14-Jun-2021
    • (2020)SDN-Based Control of IoT Network by Brain-Inspired Bayesian Attractor Model and Network SlicingApplied Sciences10.3390/app1017577310:17(5773)Online publication date: 20-Aug-2020
    • (2020)Traffic Engineering With Three-Segments RoutingIEEE Transactions on Network and Service Management10.1109/TNSM.2020.299320717:3(1896-1909)Online publication date: Sep-2020
    • (2020)A Multi-View Subspace Learning Approach to Internet Traffic Matrix EstimationIEEE Transactions on Network and Service Management10.1109/TNSM.2020.298332917:2(1282-1293)Online publication date: 10-Jun-2020
    • (2020)A MapReduce Approach for Traffic Matrix Estimation in SDNIEEE Access10.1109/ACCESS.2020.30162498(149065-149076)Online publication date: 2020
    • (2020)Sparse representation for network traffic recoveryComputer Communications10.1016/j.comcom.2020.07.003Online publication date: Jul-2020
    • (2020)Fast/Slow-Pathway Bayesian Attractor Model for IoT Networks Based on Software-Defined Networking with Virtual Network SlicingFluctuation-Induced Network Control and Learning10.1007/978-981-33-4976-6_6(135-154)Online publication date: 25-Nov-2020
    • (2019)Decentralized Collaborative Flow Monitoring in Distributed SDN Control-Planes2019 International Conference on Networked Systems (NetSys)10.1109/NetSys.2019.8854496(1-8)Online publication date: Mar-2019
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media