GToS: Examining the Role of Overlay Topology on System Performance Improvement

Gnutella’s notoriously poor scaling led some to propose distributed hash table solutions to the wide-area file search problem. Contrary to that trend, in this paper, we advocate retaining Gnutella’s simplicity while proposing GToS, a G nutella-like T opology- o riented S earch protocol for high-performance distributed file sharing, by examining the role of overlay topology on system performance improvement. Building upon prior research [10], we propose several modifications as enhancements and then refine these novel ideas, with the aim of trying to remedy the “mismatch” between the logical overlay topology and its projection on the underlying network. We test our design through extensive simulations and the results show a significant system performance improvement.

[1]  Bernardo A. Huberman,et al.  Intentional Walks on Scale Free Small Worlds , 2001, ArXiv.

[2]  Walter Willinger,et al.  Network topologies, power laws, and hierarchy , 2002, CCRV.

[3]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[4]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[5]  Farnoush Banaei Kashani,et al.  Criticality-based analysis and design of unstructured peer-to-peer networks as "Complex systems" , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[6]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[7]  Pascal Felber,et al.  Efficient search in unstructured peer-to-peer networks , 2004, Eur. Trans. Telecommun..

[8]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[9]  Tim Moors,et al.  Survey of Research towards Robust Peer-to-Peer Networks: Search Methods , 2007, RFC.

[10]  Ian T. Foster,et al.  Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.

[11]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[12]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[13]  Hector Garcia-Molina,et al.  Evaluating GUESS and non-forwarding peer-to-peer search , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[14]  Yin Li,et al.  ToA^3: Beyond the Limit of Unstructured P2P Networks , 2005, Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services - (icas-isns'05).

[15]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[16]  Christopher R. Palmer,et al.  Generating network topologies that obey power laws , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[17]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[18]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[19]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[20]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .