Measuring and Understanding Throughput of Network Topologies
description
Transcript of Measuring and Understanding Throughput of Network Topologies
![Page 1: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/1.jpg)
Measuring and Understanding Throughput of Network Topologies
Sigmetrics 2014 Sangeetha Abdu Jyothi, Ankit Singla, P. Brighten Godfrey,
Alexandra KollaUniversity of Illinois at Urbana–Champaign
Wu wenbin
![Page 2: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/2.jpg)
Motivation
• Analyze networks’ topology throughput– A topology is good or bad– Comparing topology designs
• State-of-the-art– Lacking comparisons– Using wrong metrics
![Page 3: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/3.jpg)
Formulation
• Capacities of each edge (u, v): c(u, v)– Stress-test topology itself: c(u, v) = 1
• Traffic matrix: TM– T(v, w): request flow v->w
• Throughput with TM is max t for feasible TM·t
![Page 4: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/4.jpg)
Cut-based metrics
• Bisection bandwidth
• Shortcomings– NP– Only computer a
special TM– May not uncover the
true bottleneck
![Page 5: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/5.jpg)
Cut-based metrics
• Sparsest cut
• Shortcomings– Still NP– Only computer a
special TM– A loose
upper bound
![Page 6: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/6.jpg)
Specific TM + LP optimization
• Longest matching TM– Use as long paths as possible
• LP optimization– O(n)
![Page 7: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/7.jpg)
Evaluation
• Evaluation of computer networks• Evaluation of natural networks
![Page 8: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/8.jpg)
Evaluation
• Correlation between other metrics and throughput
![Page 9: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/9.jpg)
Evaluation
• Evaluation of models
![Page 10: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/10.jpg)
Contributions
• Analysis of existed throughput metric• Establish a throughput metric• Evaluation of computer network topologies
![Page 11: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/11.jpg)
Future work
• Longest matching TM is intuitive• Apply to wsn
![Page 12: Measuring and Understanding Throughput of Network Topologies](https://reader035.fdocuments.in/reader035/viewer/2022062410/568161e9550346895dd21911/html5/thumbnails/12.jpg)
Q&A