A Segment Strategy Based on Flooding Search in Unstructured P2P Network

2008 ◽  
Author(s):  
Yuhua Liu ◽  
Longquan Zhu ◽  
Jingju Gao ◽  
Yuling Li
Keyword(s):  
P2p Network ◽  
Unstructured P2p Network ◽  
Unstructured P2p

DrTrust: A trust model in unstructured P2P network

2009 ◽  
Vol 29 (2) ◽  
pp. 503-506
Author(s):  
Yun-chang ZHANG ◽  
Jian-xin CHEN ◽  
Shan-shan CHEN
Keyword(s):  
Trust Model ◽  
P2p Network ◽  
Unstructured P2p Network ◽  
Unstructured P2p

ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS

2011 ◽  
Vol 14 (04) ◽  
pp. 611-633 ◽  
Author(s):  
JOYDEEP CHANDRA ◽  
NILOY GANGULY
Keyword(s):  
Peer Networks ◽  
P2p Network ◽  
Network Coverage ◽  
P2p Networks ◽  
Extensive Simulation ◽  
Back Cross ◽  
Peer To Peer Networks ◽  
Unstructured P2p Network ◽  
Unstructured P2p ◽  
Query Packet

In this paper, we develop methods to estimate the network coverage of a TTL-bound query packet undergoing flooding on an unstructured p2p network. The estimation based on the degree distribution of the networks, reveals that the presence of certain cycle-forming edges, that we name as cross and back edges, reduces the coverage of the peers in p2p networks and also generate a large number of redundant messages, thus wasting precious bandwidth. We therefore develop models to estimate the back/cross edge probabilities and the network coverage of the peers in the presence of these back and cross edges. Extensive simulation is done on random, power-law and Gnutella networks to verify the correctness of the model. The results highlight the fact that for real p2p networks, which are large but finite, the percentage of back/cross edges can increase enormously with increasing distance from a source node, thus leading to huge traffic redundancy.

Sign in / Sign up

Export Citation Format

Share Document