文章基本信息

标题：Deciding on the Type of the Degree Distribution of a Graph from Traceroute-like Measurements
本地全文：下载
作者：Xiaomin Wang ; Matthieu Latapy ; Mich`ele Soria 等
期刊名称：International Journal of Computer Networks & Communications
印刷版ISSN：0975-2293
电子版ISSN：0974-9322
出版年度：2012
卷号：4
期号：3
DOI：10.5121/ijcnc.2012.4311
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：The degree distribution of the Internet topology is considered as one of its main properties. However, it is only known through a measurement procedure which gives a biased estimate. This measurement may in first approximation be modeled by a BFS (Breadth-First Search) tree. We explore here our ability to infer the type (Poisson or power-law) of the degree distribution from such a limited knowledge. We design procedures which estimate the degree distribution of a graph from a BFS of it, and show experimentally (on models and real-world data) that this approach succeeds in making the difference between Poisson and power-law degree distributions
关键词：Internet; graph; topology; measurement; degree distribution; tracer- oute;simulations.