Constructing a Churned Peer-to-Peer Network for Efficient Search
AS churn is an inherent character of a network. Researchers find it could bring down the performance of networks. We investigate this in another point of view, and find that searching one resource repeatedly can bring up search efficiency, though churn does bring down the performance for one time search. In this paper, we build a churned peer to peer network in which the connections are reconnected actively. The good aspect of churn is illustrated by using this churned network we construct. And then we make a mathematical analysis to model these network parameters and simulate to verify what we find.
Peer-to-Peer network active churn searches
Fuhong Lin Changjia Chen Hengkui Wu Hongke Zhang Lili Kou
Electronics and Information Engineering Beijing Jiaotong University Beijing, China Business College Business College of Shanxi University Shanxi, China
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
271-274
2009-07-10(万方平台首次上网日期,不代表论文的发表时间)