Efficient Search in Peer to Peer Networks对等网络中的高效搜索.pptVIP

Efficient Search in Peer to Peer Networks By: Beverly Yang Hector Garcia-Molina Presented By: Anshumaan Rajshiva Date: May 20,2002 P2P Networks Distributed systems in which nodes of equal roles and capabilities exchange information and services directly with each other. Key Challenges Efficient techniques for search and retrieval of data. Best search techniques for a system depends on the needs of the application. Current search techniques in “loose” P2P systems tend to be very inefficient, either generating too much load on the system, or providing for a very bad user experience. Current Reason for Inefficiency Queries are processed by more nodes than desired. Suggested Improvement Processing queries through fewer nodes. Techniques Iterative Deepening Directed BFS Local Indices Problem Framework P2P: Undirected graph Vertices: nodes in the n/w Edges: Open connections between neighbors. Message will travel from A to B in hops. Length of the path: Number of hops Source of query: Node submitting the query Problem Framework When a node receives a query it should process the query locally and respond to the query/forward/drop the query Address of the source node will be unknown to the responding node (scheme used by Gnutella) Metrics Cost: Average Aggregate Bandwidth Average Aggregate Processing Cost Quality of Results: Number of Results Satisfaction of the query Cost Message propagates across nodes,each node spend some processing resources on behalf of the query Main cost described in terms of bandwidth and processing cost Cost Average Aggregate Bandwidth: The average over a set of representative queries of the aggregate BW consumed(in bytes) over each edge on behalf of the query Average Aggregate Processing Cost: The average over a set of representative queries of the aggregate processing power consumed at each node on behalf of the query Quality of Results Results from the perspective of user Number of results: the