超立方體(Hypercube)結構近年來已被廣泛的應用在許多網路系統當中，其中應用在具有位置知覺(Locality-Aware)及興趣分群(Interest-Based)系統的同儕網路(Peer-to-Peer ; P2P)架構下，超級結點(super node)為底層結點與外界間之通訊、傳輸等橋梁。因此如何有效率的與底層結點作溝通聯繫，將攸關著此網路系統之效率。本篇將提出利用改良式最小成本生成樹演算法，來達成超級結點與其底層結點間之搜尋時間更為快速之目的。

Hypercube structures have been used in many networks in the past few years. One of these systems is locality-aware hybrid system with interest grouping. In this system, super nodes have more resources and bandwidth. Intra-peers and inter-peers are separated by super node. When intra-peers need to communicate with inter-peers, they will send messages by way of the super node. It is important to minimize the transmission time between intra-peers and the super node. In this paper, we proposed an algorithm based on the minimum cost spanning tree. Our purpose is to shorten the transmission time from the super node to intra-peers.

[1] http://free.napster.com/
[2] S. H. Kwok and K. Y. Chan,” An Enhanced Gnutella P2P Protocol: A Search Perspective”, Proceedings of the 18th International Conference on Advanced Information Networking and Application, 2004 IEEE
[3] http://freenetproject.org/
[4] Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, and Hari Balakrishnan,” Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications”, IEEE/ACM Transactions on Networking, VOL. 11, NO. 1, February 2003.
[5] Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker2, ” A Scalable Content-Addressable Network”, ACM SIGCOMM, 161-172, San Diego, California, USA, August 2001.
[6] Antony Rowstron, Peter Druschel, “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems”, Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001). Heidelberg, Germany, November 2001.
[7] KaZaA Homepage, http://www.kazaa.com
[8] Li-Ming Tseng, Chun-Cheng Hu, ”A Locality Awared Hybrid P2P System with Interest Grouping”, Taiwan Academic Network Conference, Taipei, Taiwan, October 2007.
[9] Jörg Eberspächer, Rüdiger Schollmeier, Stefan Zöls, Gerald Kunzmann, Lehrstuhl für Kommunikationsnetze, Technische Universität Münche, “Structured P2P Networks in
Mobile and Fixed Environments”.
[10] Gang Chen, Chor Ping Low, Zhonghua Yang, “Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest”, IEEE Transactions on Parallel and Distributed Systems, VOL. 19, NO. 6, June 2008.
[11] Wen-Tsuen Chen, Chi-Hong Chao, and Jeng-Long Chiang, “An Interested-based Architecture for Peer-to-Peer Network Systems”, Proceedings of the 20th International
Conference on Advanced Information Networking and Applications, April 2006.
[12] Xiaole Bai, Shuping Liu, Peng Zhang, Raimo Kantola, “ICN: Interest-based Clustering Network”, Proceedings of the Fourth International Conference on Peer-to-Peer
Computing, 2004 IEEE.
[13] Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, “Enhancing Locality in Structured Peer-to-Peer Networks”, Proceedings of the Tenth International Conference on Parallel and Distributed Systems, pp.25-34, July 2004
[14] Hiroaki Kobayashi, Hiroyuki Takizawa, Tsutomu Inaba, Yasuaki Takizawa, “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
[15] S.LENNART JOHNSSON, CHING-TIEN HO, “Optimum Broadcasting and Personalized Communication in Hypercubes”, IEEE Transactions on Computers, VOL. 38, NO. 9, SEPTEMBER 1989.
[16] Xin-Mao Huang, Cheng-Yue Chang, and Ming-Syan Chen, “PeerCluster: A Cluster-Based Peer-to-Peer System”, IEEE Transactions on Parallel and Distributed Systems, VOL. 17, NO. 10, October 2006.
[17 ] Ellis Horowitz , Sartaj Sahni, Susan Anderson-Freed,
Fundamentals of Data Structures in C, Computer Science Press, New York, 2002.