Friendships that Last: Peer Lifespan and its Role in P2P Protocols

Bustamante, Fabián E.; Qiao, Yi

doi:10.1007/1-4020-2258-1_16

Cited by 108 publications

(182 citation statements)

References 16 publications

Supporting

Mentioning

175

Contrasting

Unclassified

Order By: Relevance

“…This study is consistent with our observations about the connection durations between the query collection crawler and Gnutella peers in Section 3.1. Study [2] further shows the lifespan of peers follows the Pareto distribution. Different from the simulations of existing studies such as [14], we considered the population dynamics in our evaluation, since the performance of SPIRP can be affected by the lifespan of responders.…”

Section: Simulation Methodologymentioning

confidence: 90%

Exploiting Content Localities for Efficient Search in P2P Systems

Guo

Jiang

Xiao

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Existing P2P search algorithms generally target either the performance objective of improving search quality from a client's perspective, or the objective of reducing search cost from an Internet management perspective. We believe that the essential issue to be considered for designing and optimizing search algorithms in unstructured P2P networks is the trade-off between the two performance objectives. Motivated by our observations, the locality of content serving in the peer community and the localities of search interests of individual peers, we propose CAC-SPIRP, a fast and low cost P2P searching algorithm. Our algorithm consists of two components. The first component aims to reduce the search cost by constructing a CAC (Content Abundant Cluster), where content-abundant peers self-identify, and self-organize themselves into an inter-connected cluster providing a pool of popular objects to be frequently accessed by the peer community. A query will be first routed to the CAC, and most likely to be satisfied there, significantly reducing the amount of network traffic and the search scope. The second component in our algorithm is client oriented and aims to improve the quality of P2P search, called SPIRP (Selectively Prefetching Indices from Responding Peers). A client individually identifies a small group of peers who have the same interests as itself to prefetch their entire file indices of the related interests, minimizing unnecessary outgoing queries and significantly reducing query response time. Building SPIRP on the CAC Internet infrastructure, our algorithm combines both merits of the two components and balances the trade-off between the two performance objectives. Our trace-driven simulations show that CAC-SPIRP significantly improves the overall performance from both client's perspective and Internet management perspective.

show abstract

Section: Simulation Methodologymentioning

confidence: 90%

Exploiting Content Localities for Efficient Search in P2P Systems

Guo

Jiang

Xiao

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…To mimic the behavior of P2P users, we use the trace from paper [2] which includes over 90K peer lifespan measured in the Gnutella network between March 1st and 8th, 2003. Each node joins/leaves the P2P system at the specific time given by the trace.…”

Section: Discussionmentioning

confidence: 99%

“…But these approaches miss the relativity between replicas which we mainly considered. Some researches [2], [14] explore the usage of nodes' lifetime to enhance the performance of P2P system, but their target domains (reducing the connection breakdown, proofing the resilience of P2P system) are different to ours. Some efforts solve the data availability problem by using erasure coding [10]- [12] or exploiting proactive replication [13], but they still do not consider the relativity between replicas.…”

Section: Related Workmentioning

confidence: 98%

Relative MTTF-Based Incentive Scheme for Availability-Based Replication in P2P Systems

Kim¹

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWhen P2P systems are used for data sensitive systems, the data availability has become an important issue. The availability-based replication using individual node availability is the most popular method keeping high data availability efficiently. However, since the individual node availability is derived by the individual lifetime information of each node, the availability-based replication may select useless replicas. In this paper, we explore the relative MTTF (Mean Time To Failure)-based incentive scheme for the more efficient availability-based replication. The relative MT T F is used to classify the guaranteed replicas which can get the incentive node availability, and these replicas help reduce the data traffic and the number of replicas without losing the target data availability. Results from trace-driven simulations show that the replication using our relative MT T F-based incentive scheme achieves the same target data availability with 41% less data traffic and 24% less replicas.

show abstract

“…Past work has investigated selecting neighbours that are likely to be the most reliable to improve the performance of P2P networks [12]. By selecting the oldest available nodes as neighbours, Bustamante and Qiao [12] show that these connections tend to last longer and therefore need to be replaced less often producing more robust networks.…”

Section: Related Workmentioning

confidence: 99%

Still Alive: Extending Keep-Alive Intervals in P2P Overlay Networks

2011

View full text Add to dashboard Cite

Abstract-Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a number of algorithms which allow each individual connections to extend the interval between successive keep-alive messages based upon the likelihood that a corresponding node will remain in the system.Several studies have shown that older peers are more likely to remain in the network longer than their short-lived counterparts. Therefore using the distribution of peer session times and the current age of peers as key attributes, we propose three algorithms that increase the interval between successive keepalive messages as nodes become more reliable.By prioritising keep-alive messages to nodes that are more likely to fail, our algorithms reduce the expected delay between failures occurring and their subsequent detection. Failed connections can incur expensive lookup timeouts and increases the network's vulnerability to partitioning. We extensively analyse the properties of these algorithms and compare them to the standard periodic keep-alive mechanism using simulations based upon measured network data.

show abstract

Friendships that Last: Peer Lifespan and its Role in P2P Protocols

Cited by 108 publications

References 16 publications

Exploiting Content Localities for Efficient Search in P2P Systems

Exploiting Content Localities for Efficient Search in P2P Systems

Relative MTTF-Based Incentive Scheme for Availability-Based Replication in P2P Systems

Still Alive: Extending Keep-Alive Intervals in P2P Overlay Networks

Contact Info

Product

Resources

About