AN ADAPTIVE DISTRIBUTED HYBRID SEARCH SCHEME FOR UNSTRUCTURED PEER-TO-PEER NETWORKS
We consider a distributed hybrid search scheme for peer-to-peer network in this paper and introduce one link statement function, which is decreasing with the round trip time (RTT) of link. Link statement function is reasonable because they can reflect how well the link worked, for example, overloaded or not. The transition probability function between two nodes is redefined, which depend on not only the association of these two nodes but also the link statement between them. So one node can choose its best neighbor based on the transition probability between them to forward the query message. This algorithm is more robust and adaptive to the dynamic networks.
peer-to-peer networks hybrid search scheme load balance link statement function
Li Shiyong Lin Fuhong Wu Hengkui Qin Yajuan Zhang Hongke
School of Electronics and Information Engineering, Beijing Jiaotong University,Beijing 100044, P.R. China
国际会议
北京
英文
664-668
2009-10-18(万方平台首次上网日期,不代表论文的发表时间)