Using Monte Carlo simulation for improving data availability in P2P network

Authors:
Sanaullah Nazir;Manfred Hauswirth
Affiliations:
National University of Ireland, Galway, Galway, Ireland;National University of Ireland, Galway, Galway, Ireland
Venue:
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Year:
2010

Citing 8
Cited 0

The dangers of replication and a solution

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A longitudinal survey of Internet host reliability

SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities

CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Data durability in peer to peer storage systems

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
Minimizing churn in distributed systems

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
High availability, scalable storage, dynamic peer networks: pick two

HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Redundancy Management for P2P Storage

CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Modeling machine availability in enterprise and wide-area distributed computing environments

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a replication strategy to improve data availability in P2P Networks. The focus of the paper is to replicate data to nodes which are highly available and complement one another in terms of uptimes. This would decrease the replication management overhead until the number of replicas falls to a certain threshold. Replication to reliable node would improve the cost of replication by avoiding irregular nodes of the network. We run Monte Carlo simulation based on past traces of Kad, OverNet, Bittorrent and PlanetLab, to present how our replication keeps data sustainable in the network. In our evaluation we show that a life pattern along with the availability of nodes improves overall data availability. We perform our evaluation on a Kademlia network, and show that our approach reduces over head compared to existing approaches to data availability.