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.