140 likes | 154 Views
Explore the dynamics of peer-to-peer networks to find good peers matching interests, optimize connections, evaluate stability, and discuss experimental results. Learn about proposing mechanisms for decentralization, reducing message traffic, allocating resources, and scaling networks effectively. Discover how to enhance communication through specified messages and reputation metrics, enabling better information retrieval and peer connectivity in a decentralized setting. Join the Scalab Seminar Series for deep insights into effective peer selection algorithms and their impact on network performance.
E N D
Finding Good Peers in Peer-to-Peer Networks Ramaswamy N.Vadivelu Scalab, ASU Scalab Seminar Series
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
“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
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
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
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
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
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
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
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
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
Peer Selection Algorithm Scalab Seminar Series
Experimental Results • Two scenarios: • Finding peers with similar interests • Adapting a peer’s connections, as interests are changed. Scalab Seminar Series
Discussion: Scalab Seminar Series