ID-replication for structured peer-to-peer systems
2012 (English)In: Euro-Par 2012 Parallel Processing: 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings / [ed] Christos Kaklamanis, Theodore Papatheodorou, Paul G. Spirakis, Springer Berlin/Heidelberg, 2012, 364-376 p.Conference paper (Refereed)
Structured overlay networks, like any distributed system, use replication to avoid losing data in the presence of failures. In this paper, we discuss the short-comings of existing replication schemes and propose a technique for replication, called ID-Replication. ID-Replication allows different replication degrees for keys in the system, thus allowing popular data to have more copies. We discuss how ID-Replication is less sensitive to churn compared to existing replication schemes, which makes ID-Replication better suited for building consistent services on top of overlays compared to other schemes. Furthermore, we show why ID-Replication is simpler to load-balance and more secure compared to successor-list replication. We evaluate our scheme in detail, and compare it with successor-list replication.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2012. 364-376 p.
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 7484 LNCS
Distributed systems, Load-balance, Short-comings, Structured overlay network, Structured peer-to-peer system
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-104951DOI: 10.1007/978-3-642-32820-6_37ISI: 000341235300037ScopusID: 2-s2.0-84867642140ISBN: 978-364232819-0OAI: oai:DiVA.org:kth-104951DiVA: diva2:570369
18th International Conference on Parallel Processing, Euro-Par 2012, 27 August 2012 through 31 August 2012, Rhodes Island
FunderSwedish e‐Science Research CenterICT - The Next Generation
QC 201211192012-11-192012-11-142015-06-11Bibliographically approved