论文标题
基于接近性的网络：通过粒子群优化优化的小世界覆盖
Proximity-based Networking: Small world overlays optimized with particle swarm optimization
论文作者
论文摘要
信息传播是大型，动态的分布式系统中的基本且经常出现的问题。为了解决这个问题，人们对建立有效的覆盖网络的兴趣越来越大，从而可以维持分散的对等网络。在这些覆盖网络中，节点采用小世界网络的模式，其连接基于接近度。这些小世界系统在Internet网络中的信息传播和查找中可能非常有用。可以通过远期错误正确（FEC）和用户数据报协议（UDP）有效地传输数据，并通过最小的信息损失进行路由。我们提出了一个网络方案，该方案将在和弦中的地理位置纳入了每个节点分区的钥匙空间中的同行组织。当我们将其与基于接近度的社区集合{基于小世界结构}时，我们可以模仿旨在解决传统小世界问题的解决方案的有效效率，并带有弹性和耐受性的额外好处。此外，可以根据社区要求更新路由和通讯录。我们提出的方案的灵活性可实现各种群模型和代理。这使我们的网络可以作为基础网络模型，可以应用于网络的文件共享，流和同步。
Information dissemination is a fundamental and frequently occurring problem in large, dynamic, distributed systems. In order to solve this, there has been an increased interest in creating efficient overlay networks that can maintain decentralized peer-to-peer networks. Within these overlay networks nodes take the patterns of small world networks, whose connections are based on proximity. These small-world systems can be incredibly useful in the dissemination and lookup of information within an internet network. The data can be efficiently transferred and routing with minimal information loss through forward error correct (FEC) and the User Datagram Protocol (UDP). We propose a networking scheme that incorporates geographic location in chord for the organization of peers within each node's partitioned key space. When we combine this with a proximity-based neighborhood set {based on the small world structure} we can mimic the efficient of solutions designed to solve traditional small-world problems, with the additional benefit of resilience and fault-tolerance. Furthermore, the routing and address book can be updated based on the neighborhood requirements. The flexibility of our proposed schemes enables a variety of swarm models, and agents. This enables our network to as an underlying networking model that can be applied to file-sharing, streaming, and synchronization of networks.
