了解BitTorrent覆盖图的属性
Understanding the Properties of the BitTorrent Overlay
摘要:
在本文中,我们进行了广泛的模拟,以了解BitTorrent生成的覆盖的属性。我们首先分析覆盖属性如何影响BitTorrent的效率。我们专注于平均对等集大小(即,邻居的平均数目)、对等体达到其最大对等体集合大小的时间以及覆盖的直径。特别是,我们表明,对等体到达Torrent的时间越晚,达到其最大对等体集大小所需的时间就越长。然后,我们评估的影响,最大的对等体集大小,每个对等体的传出连接的最大数量,以及NAT的对等体的数量上的覆盖属性。我们表明,BitTorrent生成一个强大的覆盖,但这个覆盖不是一个随机图。特别是,一个对等体到其邻居的连接性取决于它在洪流中的到达顺序。我们还表明,大量的NAT对等显着妥协的覆盖攻击的鲁棒性。最后,我们评估了对等交换对覆盖属性的影响,并表明它会生成一个大直径的链式覆盖,这将对大型种子的效率产生不利影响。
英文摘要:
In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the efficiency of BitTorrent. We focus on the average peer set size (i.e., average number of neighbors), the time for a peer to reach its maximum peer set size, and the diameter of the overlay. In particular, we show that the later a peer arrives in a torrent, the longer it takes to reach its maximum peer set size. Then, we evaluate the impact of the maximum peer set size, the maximum number of outgoing connections per peer, and the number of NATed peers on the overlay properties. We show that BitTorrent generates a robust overlay, but that this overlay is not a random graph. In particular, the connectivity of a peer to its neighbors depends on its arriving order in the torrent. We also show that a large number of NATed peers significantly compromise the robustness of the overlay to attacks. Finally, we evaluate the impact of peer exchange on the overlay properties, and we show that it generates a chain-like overlay with a large diameter, which will adversely impact the efficiency of large torrents.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。