skip to main content
article

The problem of synthetically generating IP traffic matrices: initial recommendations

Published: 01 July 2005 Publication History

Abstract

There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at its disposal any information about how to construct realistic traffic matrices. We introduce here the two basic problems that need to be addressed to construct such matrices. The first is that of synthetically generating traffic volume levels that obey spatial and temporal patterns as observed in realistic traffic matrices. The second is that of assigning a set of numbers (representing traffic levels) to particular node pairs in a given topology. This paper provides an in-depth discussion of the many issues that arise when addressing these problems. Our approach to the first problem is to extract statistical characteristics for such traffic from real data collected inside two large IP backbones. We dispel the myth that uniform distributions can be used to randomly generate numbers for populating a traffic matrix. Instead, we show that the lognormal distribution is better for this purpose as it describes well the mean rates of origin-destination flows. We provide estimates for the mean and variance properties of the traffic matrix flows from our datasets. We explain the second problem and discuss the notion of a traffic matrix being well-matched to a topology. We provide two initial solutions to this problem, one using an ILP formulation that incorporates simple and well formed constraints. Our second solution is a heuristic one that incorporates more challenging constraints coming from carrier practices used to design and evolve topologies.

References

[1]
J.Cao, D.Davis, S.Vander Weil, and B.Yu, "Time-Varying Network Tomography: Router Link Data", Journal of the the American Statistical Association, 95(452), 2000.
[2]
A.Medina, N.Taft, K.Salamatian, S.Bhattacharyya and C.Diot, "Traffic Matrix Estimation: Existing Techniques Compared and New Directions", ACM Sigcomm, Pitsburgh, PA, August 2002.
[3]
Y. Zhang, M. Roughan, N. Duffield and A. Greenberg, "Fast Accurate Computation of Large-Scale IP Traffic Matrices from Link Loads", Proceedings of ACM Sigmetrics San Diego, CA, June 2003.
[4]
The Abilene Network of Internet2 Community, "Abilene Observatory", http://abilene.internet2.edu/.
[5]
Y. Zhang, M. Roughan, C. Lund and D. Donoho, "An Information Theoretic Approach to Traffic Matrix Estimation", Proceedings of ACM Sigcomm, Karlsruhe, Germany, August 2003.
[6]
S. Bhattacharyya, C. Diot, J. Jetcheva and N. Taft, "Geographical and Temporal Characteristics of Inter-POP Flows: View from a Single POP", In European Transactions on Telecommunications, February, 2002.
[7]
Gang Liang, Bin Yu, "Pseudo Likelihood Estimation in Nework Tomography", IEEE Infocom, San Francisco, CA, March 2003.
[8]
A. Nucci, R. Cruz, N. Taft and C. Diot, "Design of IGP Link Weight Changes for Estimation of Traffic Matrices", IEEE Infocom, Hong Kong, China, March 2004.
[9]
A. Nucci, B. Schroeder, S. Bhattacharyya, N. Taft and C. Diot, "IGP Link Weight Assignment for Transient Link Failures", The 18th International Teletraffic Congress (ITC), Germany, September 2003.
[10]
A. Soule, A. Nucci, E. Leonardi, R. Cruz, and N. Taft, "How to Identify and Estimate the Top Largest Traffic Matrix Elements in a Changing Environment", Proceedings of ACM Sigmetrics, New York, June 2004.
[11]
K. Papagiannaki, N. Taft, and A. Lakhina, "A Distributed Approach to Measure IP Traffic Matrices". Proceedings of ACM IMC. October 2004.
[12]
B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS Weights in a Changing World". IEEE Journal on Selected Areas in Communications, vol. 20, no 4., 2002.
[13]
A. Feldmann, A. Greenberg, C. Lunc, N. Reingold, J. Rexford and F. True, "Deriving Traffic Demands for Operational IP Networks: Methodology and Experience", IEEE/ACM Transactions on Networking June 2001.
[14]
A. Lakhina, K. Papagiannaki, M. Crovella, C. Diot, E. Kolacyzk, and N. Taft, "Structural Analysis of Network Traffic Flows", Proceedings of ACM Sigmetrics, New York. June 2004.
[15]
E. W. Zegura, "GT-ITM: Georgia Tech Internetwork Topology Models (Software)", Georgia Tech, http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm/tar.gz, 1996.
[16]
A. Gunnar, M. Johansson, and T. Telkamp, "Traffic Matrix Estimation on a Large IP Backbone - A Comparison on Real Data", Proceedings of ACM IMC, October, 2004.
[17]
A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: Boston University Representative Internet Topology Generator", Boston University, http://cs-www.bu.edu/brite, April, 2001.
[18]
A. Soule, A. Lakhina, N. Taft, K. Papagiannaki, K. Salamatian, A. Nucci, M. Crovella, and C. Diot, "Traffic Matrices: Balancing Measurement, Inference and Modeling", Proceedings of ACM Sigmetrics, Banf, Canada, June, 2005.
[19]
N. Spring, R. Mahajan and D. Wetherall, "Measuring ISP topologies with RocketFuel", Proceedings of ACM SIGCOMM 2002, Pittsburgh PA, August, 2002.
[20]
John A. Rice, "Mathematical Statistics and Data Analysis", Wadsworth & Brooks/Cole. Chapter 9. 1988.
[21]
A. Nucci, A. Sridharan and N. Taft, "The Problem of Synthetically Generating IP Traffic Matrices: Initial Recommendations",Sprint Technical Report RR05-ATL-1498, May 2005. Available at http://ipmon.sprintlabs.com.
[22]
A. Nucci, N. Taft, C. Barakat and P. Thiran, "Controlled Use of Excess Backbone Bandwidth for Providing New Services in IP-over-WDM Networks", IEEE Journal of Selected Areas in Communications. Nov. 2004.
[23]
D. Applegate and E. Cohen, "Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs", Proceedings of ACM SIGCOMM, August, 2003.
[24]
M. Roughan, M. Thorup and Y. Zhang, "Traffic Engineering with Estimated Traffic Matrices", Proceedings of ACM IMC. Miami FL, May 2003.

Cited By

View all
  • (2024)SM-FPLF: Link-State Prediction for Software-Defined DCN Power OptimizationIEEE Access10.1109/ACCESS.2024.340867212(79496-79518)Online publication date: 2024
  • (2021)DRL-FTO: Dynamic Flow Rule Timeout Optimization in SDN using Deep Reinforcement LearningProceedings of the 16th Asian Internet Engineering Conference10.1145/3497777.3498549(41-48)Online publication date: 14-Dec-2021
  • (2021)Learning Based Methods for Traffic Matrix Estimation From Link MeasurementsIEEE Open Journal of the Communications Society10.1109/OJCOMS.2021.30626362(488-499)Online publication date: 2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review  Volume 35, Issue 3
July 2005
90 pages
ISSN:0146-4833
DOI:10.1145/1070873
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2005
Published in SIGCOMM-CCR Volume 35, Issue 3

Check for updates

Author Tags

  1. distribution fitting
  2. hypothesis
  3. internet traffic matrices
  4. testing
  5. topology
  6. traffic characterization

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)25
  • Downloads (Last 6 weeks)5
Reflects downloads up to 18 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)SM-FPLF: Link-State Prediction for Software-Defined DCN Power OptimizationIEEE Access10.1109/ACCESS.2024.340867212(79496-79518)Online publication date: 2024
  • (2021)DRL-FTO: Dynamic Flow Rule Timeout Optimization in SDN using Deep Reinforcement LearningProceedings of the 16th Asian Internet Engineering Conference10.1145/3497777.3498549(41-48)Online publication date: 14-Dec-2021
  • (2021)Learning Based Methods for Traffic Matrix Estimation From Link MeasurementsIEEE Open Journal of the Communications Society10.1109/OJCOMS.2021.30626362(488-499)Online publication date: 2021
  • (2021)Bayesian Adaptive Path Allocation Techniques for Intra-Datacenter Workloads2021 International Conference on Computer Communications and Networks (ICCCN)10.1109/ICCCN52240.2021.9522253(1-8)Online publication date: Jul-2021
  • (2020)Mapping Network Traffic Dynamics in the Complexity-Entropy Plane2020 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC50000.2020.9219559(1-6)Online publication date: Jul-2020
  • (2020)Service Chain Rerouting for NFV Load BalancingGLOBECOM 2020 - 2020 IEEE Global Communications Conference10.1109/GLOBECOM42002.2020.9322265(1-6)Online publication date: Dec-2020
  • (2020)Introduction to Yuragi LearningFluctuation-Induced Network Control and Learning10.1007/978-981-33-4976-6_5(113-133)Online publication date: 25-Nov-2020
  • (2020)WPSP: A Multi-correlated Weighted Policy for VM Selection and Migration for Cloud ComputingEuro-Par 2020: Parallel Processing10.1007/978-3-030-57675-2_20(312-326)Online publication date: 18-Aug-2020
  • (2019)A Bit Torrent Traffic Optimization Method for Enhancing the Stability of Network TrafficInformation10.3390/info1012036110:12(361)Online publication date: 20-Nov-2019
  • (2019)ESSO: An Energy Smart Service Function Chain OrchestratorIEEE Transactions on Network and Service Management10.1109/TNSM.2019.294417016:4(1345-1359)Online publication date: Dec-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

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media