90 likes | 103 Views
This paper delves into scalability issues faced by Gnutella, explores distributed algorithms for scaling P2P applications, evaluates network topologies, and presents discovery mechanisms like Flooding, Chord, Pastry, and CAN. The experimental evaluation compares Hash-based routing and flooding in terms of average number of hops for lookups, with a focus on fault tolerance, accuracy, and availability.
E N D
Scalability Issues in Large Peer-to-Peer Networks A Case Study of Gnutella Ramaswamy N.Vadivelu Scalab, ASU Scalab Seminar Series
Introduction • Jovanovic, Annexstein, Berman • Need for distributed algorithm that would allow • p2p applns to scale to a large community of users • ~ Network Topology? • Paper evaluates Gnutella topology. • A distributed computing application that allows • topology discovery to be performed in constant • time . Scalab Seminar Series
Gnutella Scalab Seminar Series
Discovery requirements for applications. Scalab Seminar Series
Discovery Mechanisms: • Flooding • Chord • Pastry • CAN Scalab Seminar Series
Experimental Evaluation • A general purpose P2P framework. • Nodes join dynamically • Defining a ‘query • Success termed as discovering 1000 queries • Flooding: • Chord: • Pastry: • CAN: Scalab Seminar Series
Results Scalab Seminar Series
Each point: Av. number of hops for a lookup. Error bars: Standard Deviation Result: Hash based routing outperforms flooding Extensions: Evaluating fault tolerance,accuracy and availbaility. Scalab Seminar Series