With the development and the application of many popular peer-to-peer （P2P） systems such as eMule and BitTorrent, worms probably employ the features of these P2P networks to put them at risk. Some features, such as ...With the development and the application of many popular peer-to-peer （P2P） systems such as eMule and BitTorrent, worms probably employ the features of these P2P networks to put them at risk. Some features, such as the local routing table and the application routing mechanism, are helpful to quickly distribute the P2P worms into the networks. This paper aims to give a comprehensive survey of P2P worms. The definition and the classification of P2P worms are discussed firstly. Then, the research and development of P2P worms, including experimental analysis, propagation modeling, and defensive approaches, are addressed and analyzed in detail.展开更多
Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Pee...Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.展开更多
基金supported by the National Natural Science Foundation of China under Grant No. 60873075
文摘With the development and the application of many popular peer-to-peer （P2P） systems such as eMule and BitTorrent, worms probably employ the features of these P2P networks to put them at risk. Some features, such as the local routing table and the application routing mechanism, are helpful to quickly distribute the P2P worms into the networks. This paper aims to give a comprehensive survey of P2P worms. The definition and the classification of P2P worms are discussed firstly. Then, the research and development of P2P worms, including experimental analysis, propagation modeling, and defensive approaches, are addressed and analyzed in detail.
基金Supported by the Natural Science Foundation ofJiangsu Province(BG2004034)
文摘Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.
