u nderstanding d ata c enter t raffic c haracteristics theophilus benson 1, ashok anand 1, aditya...
TRANSCRIPT
![Page 1: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/1.jpg)
UNDERSTANDING DATA CENTER TRAFFIC CHARACTERISTICS
Theophilus Benson1, Ashok Anand1, Aditya Akella1, Ming Zhang2
University Of Wisconsin – Madison1, Microsoft Research2
1
![Page 2: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/2.jpg)
DATA CENTERS BACKGROUND
Built to optimize cost and performance
Tiered Architecture 3 layers; edge, aggregation, core Cheap devices at edges and
expensive devices at core Over-subscription of links closer to
the core Fewer links towards core reduce cost Trade negligible loss/delay for fewer
devices and links2
![Page 3: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/3.jpg)
DATA CENTERS TODAY
Cheap andabundant
Expensiveand scarce
Many little links
Few largelinks
3Cisco CanonicalDC Architecture
![Page 4: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/4.jpg)
CHALLENGES IN DESIGNING FOR DATA CENTERS
Very little is known about data centers No models for evaluation
Lack of knowledge effects evaluation Use properties of wide area network traffic. Make up traffic matrixes/random traffic patterns.
Insufficient for the following reasons Can’t accurately compare techniques Oblivious to actual characteristics of data
centers
4
![Page 5: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/5.jpg)
DATA CENTER TRAFFIC CHARACTERIZATION
Goals of our project Understand low level
characteristics of traffic in data centers What is the arrival process? Is it similar or distinct from wide area
networks? How does low level traffic impact
the data center?
5
![Page 6: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/6.jpg)
DATA CENTER TRAFFIC CHARACTERIZATION
In studying data center traffic we found that: Few links experience loss Many links are unutilized Traffic adheres to ON-OFF Arrival process is log normal
6
![Page 7: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/7.jpg)
OUTLINE
Background Goals Data set Observations and insights Overview of traffic generator (see paper for
details) Conclusion
7
![Page 8: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/8.jpg)
DATA SETS
Data from 19 data centers Differences in size and architecture
Data for intranet and extranet server farms Applications: messaging, search,
video streaming, email Data consists of
Packet traces from edge switches in one data center
SNMP MIB of devices in all data centers
Data collected over a span of 10 days
8
Type # ofDC
MeanSize(# of Dev)
2-Tier 10 13
3-Tier 9 363
![Page 9: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/9.jpg)
ANALYZING SNMP DATA
Core Aggregation Edge
% of links used 59 73 57
% of links with at least one loss
4 3 2
Analyze link utilization and drops Analysis from one 5 minute interval
Lot of un-utilized links Back-up/redundant links
Aggregation layer has the most used links Funneling of traffic from aggregation
Very few links with losses9
![Page 10: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/10.jpg)
ANALYZING SNMP DATA: LINK UTILIZATION
95th percentile used Core > Edge > Aggregation Core has fewest links Edge has smaller, (1Gbps) links higher util.
than aggregation. 10
![Page 11: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/11.jpg)
ANALYZING SNMP DATA: LINK LOSS RATES
Aggregation > Edges > Core Utilization: Core > Edges > Aggregation
Core has relatively little loss but high utilization All links loose less than 2% of packets Aggregation of flow leads to stability
Edge & Aggr have significantly higher losses Few links (20%) experience high losses (over 40%) Most likely due to bursty traffic 11
![Page 12: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/12.jpg)
INSIGHTS FROM SNMP
Loss is localized to a few links (4%) Loss may be avoided by utilizing all links
40% of links are unused in some areas Reroute traffic Move applications/migrate virtual machine
Inverse correlation between loss and utilization Should examine low level packet traces Traces from same 10 days as SNMP
12
![Page 13: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/13.jpg)
ANALYZING PACKET TRACES
Time series of traffic on an edge link
ON-OFF traffic at edges Time series shows ON-OFF patterns Binned in 15 and 100 m. secs ON-OFF persists 13
![Page 14: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/14.jpg)
ANALYZING PACKET TRACES
What is the arrival process? Matlab curve-fitting (least mean square) Weibull, log normal, pareto, exponential
Curve fits log-normal for the 3 distributions Inter-arrival, on-times, off-times All switches exhibit identical patterns Different from pareto (WAN) traffic
14
![Page 15: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/15.jpg)
DATA CENTER TRAFFIC GENERATOR
Based on our insights we created a traffic generator
Goal: produce a stream of packets that exhibits an ON-OFF arrival pattern
Input: distribution of traffic volumes and loss rates from SNMP pulls for a link
Output: the parameters for a fine grained arrival process that will produce the input distribution
15
![Page 16: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/16.jpg)
DATA CENTER TRAFFIC GENERATOR
Approach Search the space of available parameters
Simulate each set of parameters Accept parameters that pass a similarity test with high
confidence Wilcoxon used for the similarity test
16
![Page 17: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/17.jpg)
SHARING INSIGHTS
Implications for research and operations Evaluate designs with traffic generator
Implications for Fat-tree Fat-tree: congestion eliminated through no over-
provision and traffic balancing Parameterization: traffic engineering, flow
classification, assumes stableness on the order of ‘T’ seconds
Our work can inform the setting of ‘T’
17
![Page 18: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/18.jpg)
CONCLUSION
Analyzed traffic from 19 data centers Bottle neck aggregation layer Characterized arrival process at edge links
Described a traffic generator for data centers Utilized for evaluation of data center designs
Future work Analyze packet trace
stableness of traffic matrix ratio of inter/intra-dc communication
18
![Page 19: U NDERSTANDING D ATA C ENTER T RAFFIC C HARACTERISTICS Theophilus Benson 1, Ashok Anand 1, Aditya Akella 1, Ming Zhang 2 University Of Wisconsin – Madison](https://reader035.vdocuments.us/reader035/viewer/2022062618/5515068a550346a80c8b5669/html5/thumbnails/19.jpg)
QUESTIONS?
19