140 likes | 297 Views
Measuring and Understanding Throughput of Network Topologies. Sigmetrics 2014 Sangeetha Abdu Jyothi , Ankit Singla , P. Brighten Godfrey, Alexandra Kolla University of Illinois at Urbana–Champaign Wu wenbin. Motivation. Analyze networks’ topology throughput
E N D
Measuring and Understanding Throughput of Network Topologies Sigmetrics 2014 Sangeetha Abdu Jyothi, AnkitSingla, P. Brighten Godfrey, Alexandra Kolla University of Illinois at Urbana–Champaign Wu wenbin
Motivation • Analyze networks’ topology throughput • A topology is good or bad • Comparing topology designs • State-of-the-art • Lacking comparisons • Using wrong metrics
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
Cut-based metrics • Bisection bandwidth • Shortcomings • NP • Only computer a special TM • May not uncover the true bottleneck
Cut-based metrics • Sparsest cut • Shortcomings • Still NP • Only computer a special TM • A loose upper bound
Specific TM + LP optimization • Longest matching TM • Use as long paths as possible • LP optimization • O(n)
Evaluation • Evaluation of computer networks • Evaluation of natural networks
Evaluation • Correlation between other metrics and throughput
Evaluation • Evaluation of models
Contributions • Analysis of existed throughput metric • Establish a throughput metric • Evaluation of computer network topologies
Future work • Longest matching TM is intuitive • Apply to wsn