Assessing the Structural Complexity of Computer and Communication Networks

ACM Comput. Surv.(2015)

引用 7|浏览53
暂无评分
摘要
In this tutorial, 17 structural complexity indices are presented and compared, each representing one of the following categories: adjacency- and distance-based metrics, Shannon entropy-based metrics, product measures, subgraph-based metrics, and path- and walk-based metrics. The applicability of these indices to computer and communication networks is evaluated with the aid of different elementary, specifically designed, random, and real network topologies. On the grounds of the evaluation study, advantages and disadvantages of particular metrics are identified. In addition, their general properties and runtimes are assessed, and a general view on the structural network complexity is presented.
更多
查看译文
关键词
design,graph theory,internet,management,measurement,network topology,reliability,structural complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要