Designing a novel peer-to-peer network

Authors:
Fudong Lin;Fuhong Lin;Fei Ding
Affiliations:
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China
Venue:
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Year:
2010

Citing 7
Cited 0

Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Analytical Study on Improving DHT Lookup Performance under Churn

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Characterizing unstructured overlay topologies in modern P2P file-sharing systems

IEEE/ACM Transactions on Networking (TON)
Characterizing Churn in Gnutella Network in a New Aspect

ICYCS '08 Proceedings of the 2008 The 9th International Conference for Young Computer Scientists

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-Peer (P2P) networks are widely used in today's Internet. Researchers claim that churn could bring down the peiformance in p2p networks. AS churn is an inherent character. Researchers want to find some ways to keep down. We investigate this in another point of view, from the searching aspect, churn can bring up search efficiency for repeated search. In this paper, we build a novel peer to peer network in which edges re-connecte actively. Then we introduce how a resource disseminated in it during the time runs off The last point is that we explain what dose this design gain for searching a resource.