Abstract
The virtual region-based P2P architecture was provided in this paper, which extended the proximity concept in overlay network. By virtual region it meant various related factors should be integrated into the design of P2P topology, such as peer interest, peer locality, and heterogeneity in peer capacity etc. But, the shared contents in P2P are vast and miscellaneous, it is very difficult to recognize the interest similarity among peers, dynamically form the interest region and direct peer to appropriate interest region. In this paper, the Jensen-Shannon Divergence (JSD) was used to characterize interest/semantic similarity among peers, and the interest region formation and location mechanism based on Dynamic Interest Landmark (DIL) was offered to facilitate to dynamically guide peers to join the appropriate interest region corresponding to peers’ content semantic. Considering that interest region is composed of geographically sporadic peers, each interest region was organized according to peer proximity in underlying infrastructure. The theoretical and simulated results illustrated that our architecture can significantly reduce the query overhead, and improve the search performance.
Research supported by the NSFC Grants 60472067, JiangSu education bureau (5KJB510091) and State Key Laboratory of Networking and Switching Technology, Bei**g University of Posts and Telecommunications (BUPT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. IEEE Communications Survey and Tutorial (2004)
Crespo, A., Garcia-Molina, H.: Semantic Overlay Networks for P2P Systems, available at http://www-db.stanford.edu/~crespo/publications/op2p.ps
Bai, X., Liu, S., Zhang, P., Kantola, R.: ICN: Interest-based Clustering Network. In: Proc. of the Fourth International Conference on Peer-to-Peer Computing (P2P 2004) (2004)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems. In: Proc. of IEEE INFOCOM 2003 (2003)
Condie, T., Sepandar, D.K., Garcia-Molina, H.: Adaptive Peer-to-Peer Topologies. In: Proc. of the Fourth International Conference on Peer-to-Peer Computing (P2P 2004) (2004)
Zhang, X.Y., Zhang, Q., Zhang, Z., Song, G., Zhu, W.: A Construction of Locality-Aware Overlay Network: mOverlay and Its Performance. IEEE Journal on Selected Areas in Communications (2004)
Jain, S., Mahajan, R., Wetherall, D., Borriello, G.: Scalable Self-Organizing Overlays, available at http://www.cs.washington.edu/homes/sushjain/overlays.html
Majtey, A.P., Lamberti, P.W., Prato, D.P.: Jensen-Shannon Divergence as a Measure of Distinguishability between Mixed Quantum States. ar**v:quant-ph/0508138 (2005)
Atip, A., Ramayya, K., Smith, M.D., Rahul, T.: Interest-Based Self-Organizing Peer-to-Peer Networks: A Club Economics Approach, available at http://ssrn.com/abstract=585345
Dimakopoulos, V.V., Pitoura, E.: A Peer-to-Peer Approach to Resource Discovery in Multi-Agent Systems. In: Klusch, M., Omicini, A., Ossowski, S., Laamanen, H. (eds.) CIA 2003. LNCS (LNAI), vol. 2782, Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Wang, W., Sakurai, K., Hori, Y. (2006). On Studying P2P Topology Construction Based on Virtual Regions and Its Effect on Search Performance. In: Ma, J., **, H., Yang, L.T., Tsai, J.JP. (eds) Ubiquitous Intelligence and Computing. UIC 2006. Lecture Notes in Computer Science, vol 4159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11833529_102
Download citation
DOI: https://doi.org/10.1007/11833529_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38091-7
Online ISBN: 978-3-540-38092-4
eBook Packages: Computer ScienceComputer Science (R0)