Cover all query diffusion strategy over unstructured overlay network

Abstract

We have studied query diffusion strategy to cover all the nodes over unstructured overlay network. Although our previous work [1] covers 80% of nodes over the power-law network, we step further to minimize the number of left-behind nodes. In order to propagate messages to overall network, we assume the best case to choose the shortest path between every node pair. This is aimed for studying the optimal message path as a whole, reducing the query diffusion cost which is equal to the sum of minimum shortest path length. We have studied the characteristics of message propagation behavior, and that our proposed strategy can be applied for contents delivery over unstructured overlay network. © 2009 Springer Berlin Heidelberg.