Storing and locating mutable data in structured peer-to-peer overlay networks

Chazapis, A; Koziris, N

dc.contributor.author	Chazapis, A	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T02:43:33Z
dc.date.available	2014-03-01T02:43:33Z
dc.date.issued	2005	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31472
dc.subject	Distributed Hash Table	en
dc.subject	Distributed System	en
dc.subject	Fault Tolerant	en
dc.subject	Peer-to-peer Overlay Networks	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Distributed Hash Tables (DHT)	en
dc.subject.other	Kademlia networks	en
dc.subject.other	Mutable data	en
dc.subject.other	Peer-to-peer overlay networks	en
dc.subject.other	Algorithms	en
dc.subject.other	Computer networks	en
dc.subject.other	Data storage equipment	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Network protocols	en
dc.subject.other	Nonbibliographic retrieval systems	en
dc.subject.other	Data structures	en
dc.title	Storing and locating mutable data in structured peer-to-peer overlay networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11573036_22	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11573036_22	en
heal.language	English	en
heal.publicationDate	2005	en
heal.abstract	Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate on a method that allows them to manage mutable data. We argue that by altering the retrieval algorithm of DHTs, we can enable them to cope with data updates, without sacrificing their fundamental properties of scalability and fault-tolerance. We describe in detail and analyze an implementation of a Kademlia network capable of handling mutable data. Nevertheless, the corresponding protocol additions can easily be applied to any DHT design. Experimental results show that although the process of managing and propagating data updates throughout the network adds up to the total cost of the lookup operation, the extra network utilization can be exploited in favor of overlay resilience to random node joins and failures. © Springer-Verlag Berlin Heidelberg 2005.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11573036_22	en
dc.identifier.isi	ISI:000233675500022	en
dc.identifier.volume	3746 LNCS	en
dc.identifier.spage	234	en
dc.identifier.epage	244	en