@conference {12296,
	title = {Adaptive replication in peer-to-peer systems},
	booktitle = {Distributed Computing Systems, 2004. Proceedings. 24th International Conference on},
	year = {2004},
	month = {2004///},
	pages = {360 - 369},
	abstract = {Peer-to-peer systems can be used to form a low-latency decentralized data delivery system. Structured peer-to-peer systems provide both low latency and excellent load balance with uniform query and data distributions. Under the more common skewed access distributions, however, individual nodes are easily overloaded, resulting in poor global performance and lost messages. This paper describes a lightweight, adaptive, and system-neutral replication protocol, called LAR, that maintains low access latencies and good load balance even under highly skewed demand. We apply LAR to Chord and show that it has lower overhead and better performance than existing replication strategies.},
	keywords = {adaptive, allocation;, data, databases;, decentralized, delivery, distributed, LAR, low-latency, peer-to-peer, processing;, protocol;, replicated, replication, resource, strategies;, structured, system-neutral, system;, systems;},
	doi = {10.1109/ICDCS.2004.1281601},
	author = {Gopalakrishnan,V. and Silaghi,B. and Bhattacharjee, Bobby and Keleher,P.}
}
@article {12301,
	title = {Deno: a decentralized, peer-to-peer object-replication system for weakly connected environments},
	journal = {Computers, IEEE Transactions on},
	volume = {52},
	year = {2003},
	month = {2003/07//},
	pages = {943 - 959},
	abstract = {This paper presents the design, implementation, and evaluation of the replication framework of Deno, a decentralized, peer-to-peer object-replication system targeted for weakly connected environments. Deno uses weighted voting for availability and pair-wise, epidemic information flow for flexibility. This combination allows the protocols to operate with less than full connectivity, to easily adapt to changes in group membership, and to make few assumptions about the underlying network topology. We present two versions of Deno{\textquoteright}s protocol that differ in the consistency levels they support. We also propose security extensions to handle a class of malicious actions that involve misrepresentation of protocol information. Deno has been implemented and runs on top of Linux and Win32 platforms. We use the Deno prototype to characterize the performance of the Deno protocols and extensions. Our study reveals several interesting results that provide fundamental insight into the benefits of decentralization and the mechanics of epidemic protocols.},
	keywords = {actions;, connected, consistency, data, data;, databases;, decentralized, Deno;, distributed, environments;, epidemic, group, levels;, Linux;, malicious, management;, membership;, network, object, object-replication, of, operating, peer-to-peer, protocols;, replicated, replication;, Security, security;, synchronisation;, system;, systems;, topology;, Unix;, voting;, weakly, weighted, Win32;},
	isbn = {0018-9340},
	doi = {10.1109/TC.2003.1214342},
	author = {Cetintemel,U. and Keleher,P. J and Bhattacharjee, Bobby and Franklin,M.J.}
}
