Hypernets --Gnutella的好消息
Hypernets -- Good (G)news for Gnutella
摘要：
对Gnutella网络可扩展性的批评主要基于原始互连拓扑的带宽属性：凯莱树。通常，已知树具有比高维拓扑更低的聚合带宽，超立方体、网格和环面。Gnutella旨在支持数千到数百万个对等点。然而，在文献中的互连拓扑结构的研究，集中在硬件实现，这是有限的成本，以几千个节点。由于Gnutella网络是虚拟的，因此超拓扑相对不受此类限制的约束。我们提出了几个合理的超拓扑的性能模型，并比较他们的查询吞吐量高达数百万的同行。虚拟超立方体和虚拟超环面被示出为提供近线性的可扩展性受对等TCP/IP连接，可以同时保持开放的数量。
英文摘要：
Criticism of Gnutella network scalability has rested on the bandwidth attributes of the original interconnection topology: a Cayley tree. Trees, in general, are known to have lower aggregate bandwidth than higher dimensional topologies e.g., hypercubes, meshes and tori. Gnutella was intended to support thousands to millions of peers. Studies of interconnection topologies in the literature, however, have focused on hardware implementations which are limited by cost to a few thousand nodes. Since the Gnutella network is virtual, hyper-topologies are relatively unfettered by such constraints. We present performance models for several plausible hyper-topologies and compare their query throughput up to millions of peers. The virtual hypercube and the virtual hypertorus are shown to offer near linear scalability subject to the number of peer TCP/IP connections that can be simultaneously kept open.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
