%0 Conference Paper %1 on2003effectiveness %A On, G. %A Schmitt, J. %A Steinmetz, R. %B Peer-to-Peer Computing, 2003. (P2P 2003). Proceedings. Third International Conference on %D 2003 %K effectiveness replication %P 57-64 %R 10.1109/PTP.2003.1231504 %T The effectiveness of realistic replication strategies on quality of availability for peer-to-peer systems %U http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1231504 %X We take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes on availability QoS for peer-to-peer (P2P) systems. We especially tackle the dynamic replica placement (RP) problem where our focus is on choosing dynamically the number and location of replicas while (1) meeting different availability QoS requirements for all individual peers and (2) taking the intermittent connectivity of peers explicitly into account. We model P2P systems as a dynamic stochastic graph in which the nodes go up and down depending on their assigned up probability. We develop some simple heuristic algorithms for solving the RP problem, which are fully distributed and adaptive. Through an event-driven simulation study we compare and evaluate the achieved availability QoS of the proposed RP algorithms. Simulation results show that (1) even simple heuristics can achieve reasonably high availability QoS, and (2) satisfying availability QoS requires more replicas than for only increasing the hit rate.

@inproceedings{on2003effectiveness, abstract = {We take an availability-centric view on quality of service (QoS) and propose a model and mechanisms for studying the effectiveness of realistic replication schemes on availability QoS for peer-to-peer (P2P) systems. We especially tackle the dynamic replica placement (RP) problem where our focus is on choosing dynamically the number and location of replicas while (1) meeting different availability QoS requirements for all individual peers and (2) taking the intermittent connectivity of peers explicitly into account. We model P2P systems as a dynamic stochastic graph in which the nodes go up and down depending on their assigned up probability. We develop some simple heuristic algorithms for solving the RP problem, which are fully distributed and adaptive. Through an event-driven simulation study we compare and evaluate the achieved availability QoS of the proposed RP algorithms. Simulation results show that (1) even simple heuristics can achieve reasonably high availability QoS, and (2) satisfying availability QoS requires more replicas than for only increasing the hit rate.}, added-at = {2014-09-11T09:15:02.000+0200}, author = {On, G. and Schmitt, J. and Steinmetz, R.}, biburl = {https://www.bibsonomy.org/bibtex/2b422c770464bdd9f16acfa1a92d13c92/avail_map_stud}, booktitle = {Peer-to-Peer Computing, 2003. (P2P 2003). Proceedings. Third International Conference on}, description = {IEEE Xplore Abstract - The effectiveness of realistic replication strategies on quality of availability for peer-to-peer sy...}, doi = {10.1109/PTP.2003.1231504}, interhash = {49a59e3547b424aec63e221e57bfcd88}, intrahash = {b422c770464bdd9f16acfa1a92d13c92}, keywords = {effectiveness replication}, month = {Sept}, pages = {57-64}, timestamp = {2014-09-11T09:15:02.000+0200}, title = {The effectiveness of realistic replication strategies on quality of availability for peer-to-peer systems}, url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1231504}, year = 2003 }