arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.5236cs.NI
收藏

误导明星:互联网上无法衡量的东西?

Misleading Stars: What Cannot Be Measured in the Internet?

Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan

摘要:

Traceroute测量是我们揭示当今复杂网络(如互联网)的结构和属性的主要工具之一。本文从最坏情况的角度研究了在给定跟踪路由数据的情况下推断网络拓扑的可行性和不可行性,在没有任何概率假设的情况下,例如,节点的度分布我们注意到一个场景,其中一些路由器是匿名的,并提出了两个基本公理,对traceroute数据的两个基本假设建模:(1)每个轨迹对应于网络中的一个真实路径,(2)路由路径最多是最短路径的1/alpha因子,对于(0,1)中的某个参数alpha。在现有的文献中,集中在一组(往往只有最小的)可推断的拓扑的基数,我们认为,大量的可能的拓扑本身往往是没有问题的,只要网络具有类似的结构。因此,我们试图描述的一组拓扑推断与我们的公理。我们引入星图的概念,其着色捕捉推断拓扑之间的差异,它也允许我们明确地构造推断拓扑。我们发现,在一般情况下,推理拓扑可以显着不同的许多重要方面,如节点的距离或三角形的数量。这些负面的结果补充了一个场景的讨论,其中的轨迹集是最好的可能,即,“完整”。事实证明,虽然一些属性(如节点度)仍然难以测量,但完整的迹集可以帮助确定全局属性(如连通性)。

英文摘要:

Traceroute measurements are one of our main instruments to shed light onto the structure and properties of today's complex networks such as the Internet. This paper studies the feasibility and infeasibility of inferring the network topology given traceroute data from a worst-case perspective, i.e., without any probabilistic assumptions on, e.g., the nodes' degree distribution. We attend to a scenario where some of the routers are anonymous, and propose two fundamental axioms that model two basic assumptions on the traceroute data: (1) each trace corresponds to a real path in the network, and (2) the routing paths are at most a factor 1/alpha off the shortest paths, for some parameter alpha in (0,1]. In contrast to existing literature that focuses on the cardinality of the set of (often only minimal) inferrable topologies, we argue that a large number of possible topologies alone is often unproblematic, as long as the networks have a similar structure. We hence seek to characterize the set of topologies inferred with our axioms. We introduce the notion of star graphs whose colorings capture the differences among inferred topologies; it also allows us to construct inferred topologies explicitly. We find that in general, inferrable topologies can differ significantly in many important aspects, such as the nodes' distances or the number of triangles. These negative results are complemented by a discussion of a scenario where the trace set is best possible, i.e., "complete". It turns out that while some properties such as the node degrees are still hard to measure, a complete trace set can help to determine global properties such as the connectivity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑