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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fujita, Y., Saruwatari, Y., Yoshida, J., Tsuda, K.: Query message delivery over community-based overlay network. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part II. LNCS (LNAI), vol. 4693, pp. 1354–1361. Springer, Heidelberg (2007)
Albert, R., Barabasi, A.L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74, 47–97 (2002)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-law Relationships of the Internet Topology. In: ACM SIGCOMM, pp. 251–262 (1999)
Stauffer, D., Aharony, A.: Introduction to Percolation Theory. Taylor and Froncis, London (1994)
Abrams, M., Standridge, C.R., Abdulla, G., Williams, S., Fox, E.A.: Caching Proxies: Limitations and Potentials. In: Proceedings of 4th International World Wide Web Conference, pp. 119–133 (1995)
Li, Y., Liu, M.T.: Optimization of Performance Gain in Content Distribution Networks with Server Replicas. In: SAINT2003 Proceedings, pp. 182–189 (2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content-addressable Network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 161–172. ACM Press, New York (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of ACM SIGCOMM, pp. 149–160. ACM Press, New York (2001)
Sunaga, H., Hoshiai, T., Kamei, S., Kimura, S.: Technical Trends in P2P-Based Communications. IEICE Trans. Commun. E87-B(10), 2831–2846 (2004)
Fujita, Y., Yoshida, J., Tsuda, K.: Reverse-query mechanism for contents delivery management in distributed agent network. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3684, pp. 758–764. Springer, Heidelberg (2005)
Macdonald, P.J., Almaas, E., Barabási, A.-L.: Minimum spanning trees on weighted scale-free networks. Europhys. Letters 72(2), 308–314 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujita, Y., Saruwatari, Y., Takahashi, M., Tsuda, K. (2009). Cover All Query Diffusion Strategy over Unstructured Overlay Network. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2009. Lecture Notes in Computer Science(), vol 5712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04592-9_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-04592-9_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04591-2
Online ISBN: 978-3-642-04592-9
eBook Packages: Computer ScienceComputer Science (R0)