Reflecting P2P User Behaviour Models in a Simulation Environment

Aggarwal, Vinay K.; Akonjang, Obi; Feldmann, Anja; Tashev, R.; Mohr, Stephan

doi:10.1109/pdp.2008.62

Cited by 9 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The best improvement seen is that in Experiment 3. By considering that the shifted recovery time is 1 Even though it is rejected, this distribution is still much closer to the empirical data than the exponential distribution. hypo-exponentially distributed with s + 1 phases and parameters sα, (s − 1)α, .…”

Section: Methodsmentioning

confidence: 68%

See 1 more Smart Citation

A realistic simulation model for peer-to-peer storage systems

Dandoush

Alouf

Nain

2009

Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

The peer-to-peer (P2P) paradigm have emerged as a cheap, scalable, self-repairing and fault-tolerant storage solution. This solution relies on erasure codes to generate additional redundant fragments of each "block of data" in order to increase the reliability and availability and overcome the churn. When the amount of unreachable fragments attains a predefined threshold, due to permanent departures or long disconnections of peers, a recovery process is initiated to compensate the missing fragments, requiring multiple fragments of data of a given "block" to be downloaded in parallel for an enhanced service. Recent modeling efforts that address the availability and the durability of data have assumed the recovery process to follow an exponential distribution, an assumption made mainly in the absence of studies characterizing the "real" distribution of the recovery process. This work aims at filling this gap and better understanding the behavior of these systems through simulation while taking into consideration the heterogeneity of peers, the underlying network topologies, the propagation delays and the transport protocol. To that end, the distributed storage protocol is implemented in the NS-2 network simulator. This paper describes a realistic simulation model that captures the behavior of P2P storage systems. We provide some experiments results that show how modeling the availability and durability can be impacted by the recovery times distribution which is impacted in turn by the characteristics of the the network and the context.

show abstract

Section: Methodsmentioning

confidence: 68%

“…Aggarwal et al [1] implemented Gnutella file sharing protocol in SSFNet simulator and compared also the packet-level and the flowlevel simulation results. They reflected the user behavior models in their simulation framework.…”

Section: Introduction and Related Workmentioning

confidence: 99%

A realistic simulation model for peer-to-peer storage systems

Dandoush

Alouf

Nain

2009

Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

show abstract

“…Furthermore, we adopt a Poisson distribution for both the session lengths and the user arrivals. We set the average session length to 40 hours, according to what reported in [13]. Furthermore, we set the average arrival rate to 1 user per second, which coupled with the above session length results in an average overlay population of 144,000 nodes in the steady state.…”

Section: B Distributed Caching Systemmentioning

confidence: 99%

“…Furthermore, we set the average arrival rate to 1 user per second, which coupled with the above session length results in an average overlay population of 144,000 nodes in the steady state. The number of resources shared by users is generated by adopting a Weibull distribution with scale = 42 and shape = 0.5, as depicted in [13]. The selection of the resources to share or request is modeled with a Zipf-Mandelbrot distribution, as proposed by in [14].…”

Section: B Distributed Caching Systemmentioning

confidence: 99%

Design and Implementation of a Locality-Aware P2P System

Ciminiera¹,

Marchetto²,

Manzillo³

et al. 2012

RPTELC

View full text Add to dashboard Cite

One of the most relevant problem for an Internet Service Provider is the large bandwidth usage on international links, mainly due to peer-to-peer applications adopted for file-sharing. The Collaborative Locality-aware Overlay SERvice (CLOSER) technology has been recently proposed to solve this issue by properly modifying the behavior of peer-to-peer application. The technology is also covered in two recent patent applications. This paper presents possible design guidelines to actually implement CLOSER in a DHT-based peer-to-peer system and describe a real implementation based on the popular aMule application.

show abstract

“…In a simulation environment, multiple parameters, which can effect on system performance, can be tuned. Thus, simulation can let us perform experiments with reasonably complex system models and fairly large topologies [3]. We conduct simulation experiments to investigate the performance of our traceable P2P record exchange framework.…”

Section: Experimental Settings and Simulation Environmentsmentioning

confidence: 99%

Simulation Based Analysis for a Traceable P2P Record Exchange Framework

Ishikawa

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. P2P technologies are getting more and more attention lately. However, unlike the traditional client-server architecture, a P2P network allows all computers to communicate and share resources as equals without central server control. This causes inconsistency in exchanged information and results in lack of trustworthiness. To provide trustful and flexible information exchange facility in P2P networks, we proposed a traceable P2P record exchange framework . In this framework, a peer can exchange structured records with a predefined schema among other peers. The framework supports a tracing facility to query the lineage of the obtained records based on database technologies. A tracing query is described in Datalog and executed as a recursive query among cooperating peers in a P2P network. In this paper, we focus on analyzing and verifying the traceable P2P record exchange framework based on simulation experiments in three different example P2P networks.

show abstract

Reflecting P2P User Behaviour Models in a Simulation Environment

Cited by 9 publications

References 13 publications

A realistic simulation model for peer-to-peer storage systems

A realistic simulation model for peer-to-peer storage systems

Design and Implementation of a Locality-Aware P2P System

Simulation Based Analysis for a Traceable P2P Record Exchange Framework

Contact Info

Product

Resources

About