摘要

現今在P2P系統上，如何有效的存取資料是一個重要的課題，為了能夠快速的在P2P上找到想要的資料，我們需要在中央系統上保存一些額外的global資訊來幫助搜尋，可是維持這些global資訊的完整性和及時性是非常困難的，在我們的研究中，提出了一套系統將這些global資訊散佈到底下的peer上以減少要維持這些資訊的額外費用以及缺點，透過這些global資訊，我們可以減少整個系統所產生的traffic並增加查詢的正確率，從實驗可以看到，我們的系統是可以比以往的研究更有效的減少traffic並提升正確率。

Abstract

The research of retrieving data in peer-to-peer (P2P) systems has become more and more important in many research communities nowadays. In order to search the resources in P2P systems, it is required to keep the global information that is usually maintained in few central servers; however, the maintenance overhead is relatively severe. In this work, we propose a framework that can distribute the global information in P2P systems with minimum maintenance overhead. By distributed the information in P2P systems, the framework can expedite the query processes and reduce the traffic load. The experimental results show our framework outperforms other methods in traffic and accuracy.

[1] Fasttrack. http://www.fasttrack.nu/.
[2] Freenet website. http://freenet.sourceforge.net.
[3] Gnutella. http://gnutella.wego.com/.
[4] Kazaa home page. http://www.kazaa.com.
[5] Napster, http://www.napster.com/.
[6] V. Cross. Fuzzy semantic distance measures between ontological
concepts. pages 635– 640 Vol.2, 2004.
[7] F. Heine, M. Hovestadt, and O. Kao. Towards ontologydriven
p2p grid resource discovery. In GRID ’04: Proceedings
of the Fifth IEEE/ACM International Workshop
on Grid Computing, pages 76–83, Washington, DC, USA,
2004. IEEE Computer Society.
[8] S. Joseph. P2p metadata search layers.
[9] B. Kantor and P. Lapsley. Wnetwork news transfer protocol.
RFC 977, February 1986.
[10] A. Kibe, H. Nakamura, and H. Sunaga. Search mechanism
using distributed metadata caching in p2p networks. In
SAINT-W ’05: Proceedings of the 2005 Symposium on Applications
and the Internet Workshops (SAINT 2005 Workshops),
pages 212–215, Washington, DC, USA, 2005. IEEE
Computer Society.
[11] B. J. Kim, C. N. Yoon, S. K. Han, and H. Jeong. Path finding
strategies in scale-free networks. Physical Review E,
65:027103, 2002.
[12] K. D. Laboratory. Dataset: Can-o-sleep.
[13] O. Mangisengi and W. Essmayr. P2p knowledge management:
an investigation of the technical architecture and main
processes. In DEXA ’03: Proceedings of the 14th International
Workshop on Database and Expert Systems Applications,
page 787, Washington, DC, USA, 2003. IEEE Computer
Society.
[14] K. Nakauchi, Y. Ishikawa, H. Morikawa, and T. Aoyama.
Peer-to-peer keyword search using keyword relationship. In
CCGRID ’03: Proceedings of the 3st International Symposium
on Cluster Computing and the Grid, page 359, Washington,
DC, USA, 2003. IEEE Computer Society.
[15] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and
S. Shenker. A scalable content addressable network. Technical
Report TR-00-010, Berkeley, CA, 2000.
[16] A. Rowstron and P. Druschel. Pastry: Scalable, decentralized
object location, and routing for large-scale peer-to-peer
systems. Lecture Notes in Computer Science, 2218:329–??,
2001.
[17] S. Saroiu, P. Gummadi, and S. Gribble. A measurement
study of peer-to-peer file sharing systems, 2002.
[18] A. F. Smeaton and I. Quigley. Experiments on using semantic
distances between words in image caption retrieval. In
Research and Development in Information Retrieval, pages
174–180, 1996.
[19] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan.
Chord: A scalable Peer-To-Peer lookup service
for internet applications. In Proceedings of the 2001 ACM
SIGCOMM Conference, pages 149–160, 2001.
[20] H. Xiao and I. Cruz. Rdf-based metadata management in
peer-to-peer systems, 2004.
[21] B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and
J. Kubiatowicz. Tapestry: A resilient global-scale overlay
for service deployment, 2003.