1 / 14

Finding Good Peers in Peer-to-Peer Networks

Finding Good Peers in Peer-to-Peer Networks. Ramaswamy N.Vadivelu Scalab, ASU. Introduction. Ramanathan , Kalogeraki,Pruyne P2P models: Decentralization by distribution. No central authority Broadcasting Network topology: Arbitrary and Dynamic

bettybsmith
Download Presentation

Finding Good Peers in Peer-to-Peer Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Finding Good Peers in Peer-to-Peer Networks Ramaswamy N.Vadivelu Scalab, ASU Scalab Seminar Series

  2. Introduction • Ramanathan , • Kalogeraki,Pruyne • P2P models: Decentralization by distribution. • No central authority • Broadcasting • Network topology: Arbitrary and Dynamic • Bandwidth vs. No.of messages and peers Scalab Seminar Series

  3. “Good “ peers and their “Interests”. • Nodes with high degree of interests are good !. • Proposed mechanism…. • Advantages: • Reduces the number of messages in the network • Allocates resources • Scales well. • Assumptions: • Connectivity • Non unique files Scalab Seminar Series

  4. System Model • Logical network of nodes. • Immediate • Indirect • Note: • Non connected nodes! Each Peer maintains: • Meta-data, p-c, p-m and p-d. • p-b Scalab Seminar Series

  5. Constraint: Sum [p-b(q)] < p-b • Limit the number of connections ( p-c ) per peer. • The horizon : h-p • Metrics: • imp(q) • Queryhits(q) • Avhops(q) • Connectime(q) Scalab Seminar Series

  6. Finding Good Peers • Minimize h(q). • Maximize prob of connecting similar peers. • Each peer maintains a dynamic peer-list. • Fallback: Central server! • Communication through specified messages. • TTL, group_id • Connection accepted based on metrics . Scalab Seminar Series

  7. Searching in the Network • Through query messages with constraints. • Query – Query-Hit message • Path retraced, TTL decremented. • Results are buffered and displayed. • Reputation metrics • Results are used to determine the ‘good’ peers. Scalab Seminar Series

  8. Horizon • Indirect peers through Immediate peers. • View of indirect peers. • Inverser relation to importance • Large av.number of hops, =>nodes farther off. • No replies,does that mean its not a good peer? Scalab Seminar Series

  9. No,because • May give results for other queries. • May lose connections to other indirect nodes. • So we calculate “ Importance”. • Sequence of weighted measurements,not the average. Scalab Seminar Series

  10. Good peers are those with high importance. • Good peers provide: • High percentage of queryhits • Are connected over a long period of time. • Long time connectivity is a strong indication that they have the same interests. Scalab Seminar Series

  11. Periodic evaluation of peers. When perc QueryHits (s) > min perc QueryHits of immediate neighbors. Max_Connections. Stability is related to rate of Peer selection. Scalab Seminar Series

  12. Peer Selection Algorithm Scalab Seminar Series

  13. Experimental Results • Two scenarios: • Finding peers with similar interests • Adapting a peer’s connections, as interests are changed. Scalab Seminar Series

  14. Discussion: Scalab Seminar Series

More Related