臺灣博碩士論文加值系統

隨著網際網路的蓬勃發展，對等式(Peer-to-Peer，簡稱P2P)通訊架構可以提供多功能資源分享與溝通的應用平台，提供各式軟體應用需求，例如多媒體檔案搜尋、分享、即時傳訊、撥放、聊天室等。本論文提出一個在對等式網路中高效率的資源搜尋方法，在讓網路使用者能夠更有效率地利用網路資源。
在此論文中，我們提出樹狀拓撲搜尋方法，並且定義資源資訊分佈法，接著提出三種可能的搜尋方法。第一種方法，每個網路節點只需要紀錄少數個節點的訊息即可達到簡單且有效率的搜尋，在使用者經常加入或離開的網路環境中，這樣的做法會使得網路形成好幾個小型的團體，因為一個節點的離開可能造成一個團體分裂成三個小團體；第二種方法是延續第一種做法再加以改良，加入搜尋區域大小的概念，讓每個網路節點都知道自己可以處理搜尋訊息的能力極限，加快搜尋速度；第三種方法是在每個節點紀錄路由表，進一步加快處理速度，此種做法還有一個很大的好處，根據路由表的紀錄，在網路連結發生斷線時可以及時重組。經由模擬分析，我們證明第三種方法可以達到高效率的資源搜尋。

Nowadays, emerging Peer-to-Peer (P2P) network system has become a popular medium for people to share their resources such as files, services, computing, and etc. Resource search scheme is the core design of P2P network system. How to design an efficient and scalable search scheme is still an important issue on P2P network systems. The previous search schemes can be classified into two categories: flooding-based and routing-based.
This thesis proposed an efficient routing-based search scheme that utilizes distributed hash table (DHT) mechanism to handle the storage of resource information. The overlay network is built on the binary tree topology, and we propose three kinds of routing-base search schemes including simple routing, regional routing, and fast routing on this tree topology. Fast routing can efficiently forward the query message to find physical resource location. Moreover, the message overhead is taken into account to save the network bandwidth.

第一章　簡介。
第二章 對等式網路的相關搜尋方訪介紹。
第三章　回顧以路由為基礎的搜尋法。
第四章　所提出的搜尋方法。
第五章　結論。

[1]R. Schollemeier, “A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications,” in Proceedings of the First International Conference on Peer-to-Peer Computing, August 2001, pp 101-102.
[2]A. Rowstron, P. Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems,” in Proceedings of IPIP/ACM International Conference on Distributed Systems Platforms, November 2001.
[3]I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” in Proceedings of ACM SIGCOMM, 2001
[4]S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable Content-addressable Network,” in Proceedings of ACM SIGCOMM, 2001.
[5]B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, “Tapestry: An Infrastructure for Fault-resilient Wide-area Location and Routing,” Technical Report UCB//CSD-01-1141, U. C. Berkeley, April 2001.
[6]B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS’02).
[7]R. Schollmeier and G. Scholleier, “Why Peer-to-Peer (P2P) does scale: an analysis of P2P traffic patterns,” in Proceedings of 2nd International Conference on Peer-to-Peer Computing, 2002, pp 112-119.
[8]C. Plaxton, R. Rajarman, and A. Richa, “Accessing nearby copies of replicated objects in a distributed environment,” in Proceedings of the ACM SPAA (Nweport, Rhode Island, June 1997), pp.311-320.
[9]M. Kelaskar, V. Matossian, P. Mehra, D. Paul, and M. Parashar, “A study of Discovery Mechanisms for Peer-to-Peer Applications,” in Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computer and the Grid (CCGRID’02).
[10]D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, “Consistent hashing and random trees: Distributed caching protocols for relieving hop spots on the World Wide Web,” in Proceedings of the 29th Annual ACM symposium on Theory of Computing (El Paso, TX, May 1997), pp. 654-663.
[11]D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, “Resilient Overlay Networks” in Proceedings of the 18th ACM symposium on Operating Systems Principles (SOSP), October 2001, Banff, Canada.
[12]C. G. Plaxton and R. Rajaraman, “Fast Fault-Tolerant Concurrent Access to Shared Objects,” in Proceedings of 37th Annual Symposium on Foundations of Computer Science, October 1996), pp. 570-579.
[13]E. P. Markatos, “Tracing a large-scale peer to peer system: an hour in the life of Gnutella,” in Proceedings of 2nd International Symposium on Cluster Computing and the Grid (CCGRID2002), pp 56-65, 2002.
[14]I. Clarke, O. Sandberg, B. Wiley, and T. Hong, “Freenet: A distributed anonymous information storage and retrieval system,” in H. Federrath, editor, Designing Privacy Enhancing Technologies, volume 2009 of Lecture Notes in Computer Science, pp. 44-46, Springer-Verlag, 2001.
[15]J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gumamdi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao, “Oceanstore: An architecture for global-scale persistent storage,” in Proceedings of the 9th International Conference on Architecture Support for Programming Languages an Operating Systems (ASPLOS), 2000.
[16]K. Aberer, M. Punceva, M. Hauswirth, R. Schmidt, “Improving data access in P2P systems,” in IEEE Internet Computing, Volume: 6 Issue: 1, pp 58 -67, Jan.-Feb. 2002.
[17]M. Junginger, Y. Lee, “The multi-ring topology-high-performance group communication in peer-to-peer networks,” in Proceedings of 2nd International Conference on Peer-to-Peer Computing, pp 49 -56, 2002
[18]S. Ratnasamy, S. Shenker, and I. Stoica, “Routing algorithms for DHTs: Some open questions,” in Proceedings of International Peer-to-Peer Workshop, 2002
[19]M. Ripeanu, I. Foster, and A. Iamnitchi, “Mapping the Gnutella network: Properities of large-scale peer-to-peer systems and implications for system design,” IEEE Internet Computing Journal, vol. 6, no. 1, 2002.
[20]P. Ganesan, Q. Sun, H. Garcia-Molina, “YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology,” in Proceedings of Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003)
[21]J. Xu, “On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks,” in Proceedings of Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003)
[22]“FreeNet,” http://freenet.sourceforge.net.
[23]“Gnutella,” http://gnutella.wego.com.
[24]“Kazaa,” http://www.kazaa.com.