ID-REPLICATION FOR PEER-TO-PEER SYSTEMS
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Replication provides fault-tolerance in distributed systems. This thesis presents ID-replication, which is a new replication scheme for structured overlays. We first discuss the shortcomings of existing replication schemes and show how ID-replication does not suffer from many of these issues. We present a detailed design, algorithmic specification and evaluation of ID-replication.
ID-replication is less sensitive to churn which makes it better suited for building consistent services on top of it and for working in asynchronous networks where inaccurate failure detections are a norm. ID‐replication does not require requests to go through a particular replica before forwarding them to another node for processing and thus does not suffer from the bottleneck. ID-‐replication provides variable replication degree, which makes it suitable for systems which need to provide extra backup for more critical data. It also makes the system easily handle hotspots/popular and is easier to load balance.
We evaluate ID‐replication and provide a comprehensive comparison of ID-replication with SL-replication, which is among the most popular replication scheme in use today.
Place, publisher, year, edition, pages
2013. , 43 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-177877OAI: oai:DiVA.org:kth-177877DiVA: diva2:874708