同儕網路 (Peer-to-Peer；P2P) 近幾年來被大量的應用在網路服務上，而一個同儕系統如果具有位置知覺能力的話將會大幅增加系統效能。所以本篇論文提出利用層級架構 (hierarchical structure)來達成位置知覺並且將使用者依興趣分群的混合式P2P系統。在本系統中，使用者會依照位置區域和興趣分群並且利用超立方體結構 (hypercube structure) 來替使用者定址。整個系統從位置區域的觀點來看，系統將依實體位置相近的使用者分配在同一個區域之內，從興趣的觀點來看，系統將把使用者依興趣性質邏輯上的分成若干個興趣叢集 (Interest Cluster)，然後經由選舉出的超級節點 (super node) 來替其底下普通節點 (peer node)來進行跨區域與跨興趣的詢問，也就是說在本系統之下大部分的詢問訊息 (Query Message) 將只在鄰近的區域與同樣的興趣叢集之下發生，進而提升同儕網路的詢問與搜尋效能。我們還為系統運作設計了三種通訊協定，分別是節點加入、離開與搜尋通訊協定。最後我們利用 NS2 來模擬系統，並分別以點對點延遲與詢問所經過的 hop 數模擬距離以評估本系統的效能，模擬的結果顯示出在依時間順序加入系統的節點，假設其位置是均勻分散且網路節點相當多的情況之下本篇論文所提出的方法會大大的提升系統效能。

Peer-to-peer system (P2P system) is becoming a key technology and has been widely a platform for users to search and share file over the Internet. However P2P system tends to waste the network bandwidth because of its decentralized resource management. Consequently, efficient querying or searching becomes one of the important design issues in peer-to-peer system (P2P system). In this paper, we proposed a locality-awared hybrid P2P system with interest grouping. In this system, users are physically divided into several locality regions and logically grouped into several interest clusters. And we employ a hypercube structure to address users. Moreover, super nodes are elected to route the inter-region and inter-cluster query messages. That is the bulk of query messages will be routed in the same locality region and interest cluster. We also devised corresponding node Join, Leave and Search protocol. Finally, we evaluate the system performance of our approach by NS2 simulator. The experimental results show that if the number of participant nodes in the network are enough and even the nodes which the location are uniform distributed will join the system in time sequence, our approach will be outstanding. The results show that the query delay will be reduced to 1/6.63 with comparing to PeerCluster approach.

[1] Busnel, Y., Kermarrec, A.-M., “PROXSEM: Interest-Based Proximity Measure to Improve Search Efficiency in P2P Systems,” 4th European Conference on Universal Multiservice Networks, pp. 62-74, Feb. 2007.
[2] Kobayashi, H., Takizawa, H., Inaba, T., Takizawa, Y., “A Self-Organizing Overlay Network to Exploit the Locality of Interests for Effective Resource Discovery in P2P Systems,” IEEE Symposium on applications and the Internet, pp. 246-255, Feb. 2005.
[3] Wen-Tsuen Chen, Chi-Hong Chao, Jeng-Long Chiang,” An Interested-based Architecture for Peer-to-Peer Network Systems,” 20th IEEE international Conference on Advanced Information Networking and Applications, Volume 1, pp. 707 – 712, April 2006.
[4] Xi Tong, Dalu Zhang, Zhe Yang, ”Efficient Content Location Based On Interest-Cluster in Peer-to-Peer System,” IEEE international Conference on e-Business Engineering, pp. 324 – 331, Oct. 2005.
[5] Sripanidkulchai, K., Maggs, B., Zhang, H., “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” IEEE Infocom on Computer and Communications Societies, Volume 3, pp. 2166 – 2176, April 2003.
[6] Xin-Mao Huang, Cheng-Yue Chang, Ming-Syan Chen, “PeerCluster: A Cluster-Based Peer-to-Peer System,” IEEE Trans. on Parallel and Distributed Systems, Volume 17, Issue 10, pp. 1110 – 1123, Oct. 2006.
[7] Schlosser, M., Sintek, M., Decker, S., Nejdl, W., “A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services,” in IEEE Proc. of Second International Conference on Peer-to-peer computing, pp. 104 – 111, Sept. 2002.
[8] Yunhao Liu, Li Xiao, Xiaomei Liu, Ni, L.M., Xiaodong Zhang, “Location Awareness in Unstructured Peer-to-Peer Systems,” IEEE Trans. on Parallel and Distributed Systems, Volume 16, Issue 2, pp. 163 – 174, Feb 2005.
[9] Xiao, L., Yunhao Liu, Ni, L.M., “Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment,” IEEE Trans. on Computers, Volume 54, Issue 9, pp. 1091 – 1103, Sept. 2005.
[10] Zhenyu Li, Gaogang Xie, Zhongcheng Li, “Locality-Aware Consistency Maintenance for Heterogeneous P2P Systems,” in Proc. of IEEE International Parallel and Distrubuted Symosium, pp. 1-10, March 2007.
[11] Locher, T., Schmid, S., Wattenhofer, R., “eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System,” 6th IEEE International Conference on Peer-to-peer Computing, pp. 3-11, Sept. 2006.
[12] Zhang, Guoqiang; Zhang, Guoqing, “Agent Selection And P2P Overlay Construction Using Global Locality Knowledge,” IEEE International Conference on Networking, Sensing and Control, pp. 519-524, April 2007.
[13] Napster Inc., http://free.napster.com, 2007.
[14] Kumar, A.; Xu, J.; Zegura, E.W.,”Efficient and Scalable Query Routing for
Unstructured Peer-to-Peer Networks,” in Proc. of IEEE Infocom, Volume 2, pp. 13-17, March 2005.
[15] Qianbing Zheng, Xicheng Lu, Peidong Zhu, Wei Peng, “An efficient random walks based approach to reducing file locating delay in unstructured P2P network, “ IEEE Global Telecommunication Conf., Volume 2,pp. 5, Dec. 2005.
[16] Xiaomei Liu, Yunhao Liu, Li Xiao, “Improving Query Response Delivery Quality in Peer-to-Peer Systems,” IEEE Trans. on Parallel and Distributed Systems, Volume 17, Issue 11, pp. 1335 – 1347, Nov. 2006.
[17] I. Stoica, R. Morris, D. Karger, E Kaashoek and H. Balakrishnan.“Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,”
in Proc. of ACM SIGCOMM ‘OI, 2001.
[18] A. Rowstron , P. Druschel , “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” in IFIP/ACM International Conference on Distributed System Platform ( Middle-ware), 2001.