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

skip to main content
article

Traffic matrix estimation: existing techniques and new directions

Published: 19 August 2002 Publication History

Abstract

Very few techniques have been proposed for estimating traffic matrices in the context of Internet traffic. Our work on POP-to-POP traffic matrices (TM) makes two contributions. The primary contribution is the outcome of a detailed comparative evaluation of the three existing techniques. We evaluate these methods with respect to the estimation errors yielded, sensitivity to prior information required and sensitivity to the statistical assumptions they make. We study the impact of characteristics such as path length and the amount of link sharing on the estimation errors. Using actual data from a Tier-1 backbone, we assess the validity of the typical assumptions needed by the TM estimation techniques. The secondary contribution of our work is the proposal of a new direction for TM estimation based on using choice models to model POP fanouts. These models allow us to overcome some of the problems of existing methods because they can incorporate additional data and information about POPs and they enable us to make a fundamentally different kind of modeling assumption. We validate this approach by illustrating that our modeling assumption matches actual Internet data well. Using two initial simple models we provide a proof of concept showing that the incorporation of knowledge of POP features (such as total incoming bytes, number of customers, etc.) can reduce estimation errors. Our proposed approach can be used in conjunction with existing or future methods in that it can be used to generate good priors that serve as inputs to statistical inference techniques.

References

[1]
M. Ben-Akiva and S. Lerman. Discrete Choice Analysis: Theory and Application to Travel Demand. MIT Press, 1985.
[2]
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, January/February 2002.
[3]
J. Cao, D. Davis, S. Vander Weil, and B. Yu. Time-Varying Network Tomography. J. of the American Statistical Association., 2000.
[4]
W.E. Deming and F.F. Stephan. On a least squares adjustment of a sampled frequency table when the expected marginal totals are known. Annals of Mathematical Statistics, pages 427--444, 1940.
[5]
S. Erlander and N.F. Stewart. The Gravity Model in Transportation Analysis -- Theory and Applications. 1990.
[6]
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving Traffic Demands for Operational IP Networks: Methodology and Experience. IEEE/ACM Transactions on Networking, June 2001.
[7]
O. Goldschmidt. ISP Backbone Traffic Inference Methods to Support Traffic Engineering. In Internet Statistics and Metrics Analysis (ISMA) Workshop, San Diego, CA, December 2000.
[8]
L. Rüschendorf. Convergence of the iterative proportional fitting procedure. Annals of Statistics, pages 1160--1174, 1995.
[9]
G. Strang. Introduction to Linear Algebra. Wellesley-Cambridge Press, 1993.
[10]
J. Swait. Probabilistic Choice Set Information in Transportation Demand Models. Technical Report Ph.D. Thesis, MIT, Department of Civil and Environmental Engineering, 1959.
[11]
C. Tebaldi and M. West. Bayesian Inference of Network Traffic Using Link Count Data. J. of the American Statistical Association., pages 557--573, June 1998.
[12]
Y. Vardi. Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data. J. of the American Statistical Association., pages 365--377, 1996.

Cited By

View all
  • (2024)In-Network Address Caching for Virtual NetworksProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672213(735-749)Online publication date: 4-Aug-2024
  • (2024)An LDP Compatible Sketch for Securely Approximating Set Intersection CardinalitiesProceedings of the ACM on Management of Data10.1145/36392812:1(1-27)Online publication date: 26-Mar-2024
  • (2024)Routing-Oblivious Network Tomography with Flow-Based Generative ModelIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621139(2139-2148)Online publication date: 20-May-2024
  • Show More Cited By

Index Terms

  1. Traffic matrix estimation: existing techniques and new directions

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM SIGCOMM Computer Communication Review
    ACM SIGCOMM Computer Communication Review  Volume 32, Issue 4
    Proceedings of the 2002 SIGCOMM conference
    October 2002
    332 pages
    ISSN:0146-4833
    DOI:10.1145/964725
    Issue’s Table of Contents
    • cover image ACM Conferences
      SIGCOMM '02: Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
      August 2002
      368 pages
      ISBN:158113570X
      DOI:10.1145/633025
    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: 19 August 2002
    Published in SIGCOMM-CCR Volume 32, Issue 4

    Check for updates

    Author Tags

    1. statistical inference
    2. traffic matrix estimation

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)196
    • Downloads (Last 6 weeks)38
    Reflects downloads up to 12 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)In-Network Address Caching for Virtual NetworksProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672213(735-749)Online publication date: 4-Aug-2024
    • (2024)An LDP Compatible Sketch for Securely Approximating Set Intersection CardinalitiesProceedings of the ACM on Management of Data10.1145/36392812:1(1-27)Online publication date: 26-Mar-2024
    • (2024)Routing-Oblivious Network Tomography with Flow-Based Generative ModelIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621139(2139-2148)Online publication date: 20-May-2024
    • (2024)Achieving Predictable and Scalable Load Balancing Performance in LEO Mega-ConstellationsICC 2024 - IEEE International Conference on Communications10.1109/ICC51166.2024.10623014(3146-3151)Online publication date: 9-Jun-2024
    • (2024)DRL-Tomo: a deep reinforcement learning-based approach to augmented data generation for network tomographyThe Computer Journal10.1093/comjnl/bxae06467:10(2995-3008)Online publication date: 21-Jul-2024
    • (2024)Open-ti: open traffic intelligence with augmented language modelInternational Journal of Machine Learning and Cybernetics10.1007/s13042-024-02190-815:10(4761-4786)Online publication date: 9-May-2024
    • (2024)The all-pairs vitality-maximization (VIMAX) problemAnnals of Operations Research10.1007/s10479-024-06022-4338:2-3(1019-1048)Online publication date: 10-May-2024
    • (2023)Completing and Predicting Internet Traffic Matrices Using Adversarial Autoencoders and Hidden Markov ModelsIEEE Transactions on Network and Service Management10.1109/TNSM.2023.327016620:3(2244-2258)Online publication date: 1-Sep-2023
    • (2023)Deep Adversarial Tensor Completion for Accurate Network Traffic MeasurementIEEE/ACM Transactions on Networking10.1109/TNET.2022.323390831:5(2101-2116)Online publication date: Oct-2023
    • (2023)Traffic Matrix Estimation based on Denoising Diffusion Probabilistic Model2023 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC58397.2023.10218016(316-322)Online publication date: 9-Jul-2023
    • 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