针对节点度幂律分布对等覆盖网络的分散式目标免疫

P2P网络的节点度近似服从幂律分布的无标度特性导致了这类网络对随机故障的鲁棒性和对蓄意攻击的脆弱性.为提高其抵抗蓄意攻击的能力,提出了一种经济、高效的分散式目标免疫策略,针对(1)具有最高连接度的节点、(2)具有最高可用性的节点和(3)与具有最高负载的链路直接相连的节点这三类目标实施免疫,设计了基于NoN-indexing机制的熟人免疫方法,能够仅利用网络拓扑局部知识和仅免疫少量关键节点,即可大幅度提高P2P网络的抗蓄意攻击能力.仿真实验结果验证了该分散式免疫策略的经济性和高效性.     

DEAON： dynamically-evolving active overlay networks for scalable information retrieval

In this paper,we propose the dynamically-evolving active overlay network(DEAON),which is an efficient,scalable yet simple protocol to facilitate applications of decentralized information retrieval in P2P networks.DEAON consists of three novel components:a Desirable Topology Construction and Adantation algorithm to guide the evolution of the overlay topology towards a small-world-like graph;a Semantic-based Neighbor Selection scheme to conduct an online neighbor ranking;a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors.We deploy and compare DEAON with other several existing distributed search techniques over static and dynamic environments.The results indicate that DEAON outperforms its competitors by achieving higher recall rate while using much less network resources,in both of the above environments.