Traffic matrix estimation: existing techniques and new directions

By Alberto Medina, Nina Taft, Kave Salamatian, Supratik Bhattacharyya, Christophe Diot. Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, 2002

581 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/828ead67f334517d7db11dd9f3a496485a29675c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Christophe Diot
  2. Mark Crovella
  3. Anukool Lakhina
  4. Nina Taft
  5. Yin Zhang
  6. Konstantina (Dina) Papagiannaki
  7. Matthew Roughan
  8. Carsten Lund

In Statistical and Nonlinear Physics

  1. Christophe Diot
  2. Anukool Lakhina
  3. Mark Crovella
  4. Matthew Roughan
  5. Yin Zhang
  6. David L. Donoho
  7. Konstantina (Dina) Papagiannaki
  8. Walter Willinger

Citations in the corpus