Abstract
Peer-to-peer (P2P) computing has received a lot of attention in recent years. Gnutella is one popular P2P system that allows users to share and exchange MP3 music. It relies on flooding to search for desired data, which causes very serious traffic problem. The large traffic results in network and resource overhead. In this thesis, we propose to use an efficient underlay for Gnutella to reduce the network traffic in the search process. This underlying infrastructure is based on the Tornado P2P system which provides sufficient routing information. A spanning tree structure can be constructed over Tornado, through which the search messages can be distributed to the nodes in the Gnutella network without duplicated messages. We discuss different ways of using the spanning tree. The performance of the proposed scheme is evaluated with simulation. Through the simulation, the advantages of our proposed scheme are confirmed.