ACM Home Page
Please provide us with feedback. Feedback
The problem of synthetically generating IP traffic matrices: initial recommendations
Full text PdfPdf (294 KB)
Source ACM SIGCOMM Computer Communication Review archive
Volume 35 ,  Issue 3  (July 2005) table of contents
SESSION: Reviewed articles table of contents
Pages: 19 - 32  
Year of Publication: 2005
ISSN:0146-4833
Authors
Antonio Nucci  Narus Inc., Mountain View, CA
Ashwin Sridharan  Sprint ATL, Burlingame, CA
Nina Taft  Intel Research, Berkeley, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 54,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1070873.1070876
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
3
 
4
The Abilene Network of Internet2 Community, "Abilene Observatory", http://abilene.internet2.edu/.
5
 
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
11
 
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
14
 
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
 
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
19
 
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
24

CITED BY  8

Collaborative Colleagues:
Antonio Nucci: colleagues
Ashwin Sridharan: colleagues
Nina Taft: colleagues