Cover All Query Diffusion Strategy over Unstructured Overlay Network

Authors:
Yoshikatsu Fujita;Yasufumi Saruwatari;Masakazu Takahashi;Kazuhiko Tsuda
Affiliations:
Graduate School of Business Scineces, University of Tsukuba, Tokyo, Tokyo, Japan 112-0012;Graduate School of Business Scineces, University of Tsukuba, Tokyo, Tokyo, Japan 112-0012;Graduate School of Business Scineces, University of Tsukuba, Tokyo, Tokyo, Japan 112-0012;Graduate School of Business Scineces, University of Tsukuba, Tokyo, Tokyo, Japan 112-0012
Venue:
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Year:
2009

Citing 6
Cited 0

On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Optimization of Performance Gain in Content Distribution Networks with Serve Replicas

SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
Query Message Delivery over Community-Based Overlay Network

KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Reverse-Query mechanism for contents delivery management in distributed agent network

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

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.