@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.}
}
@conference {12287,
	title = {Hierarchical routing with soft-state replicas in TerraDir},
	booktitle = {Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International},
	year = {2004},
	month = {2004/04//},
	pages = {48 - 48},
	abstract = {Summary form only given. Recent work on peer-to-peer systems has demonstrated the ability to deliver low latencies and good load balance when demand for data is relatively uniform. We describe an adaptive replication protocol that delivers low latencies, good load balance even when demand is heavily skewed. The protocol can withstand arbitrary and instantaneous changes in demand distribution. Our approach also addresses classical concerns related to topological constraints of asymmetrical namespaces, such as hierarchical bottlenecks in the context of hierarchical namespaces. The protocol replicates routing state in an ad-hoc manner based on profiled information, is lightweight, scalable, and requires no replica consistency guarantees.},
	keywords = {ad-hoc, adaptive, allocation;, asymmetrical, balancing;, bottlenecks;, consistency, constraints;, delivering;, demand, distribution;, guarantees;, hierarchical, latency, load, low, namespaces;, peer-to-peer, protocol;, protocols;, replica, replicas;, replication, resource, routing;, soft-state, systems;, TerraDir;, topological},
	doi = {10.1109/IPDPS.2004.1302967},
	author = {Silaghi,B. and Gopalakrishnan,Vijay and Bhattacharjee, Bobby and Kelcher,P.}
}
@conference {12288,
	title = {Slurpie: a cooperative bulk data transfer protocol},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {2},
	year = {2004},
	month = {2004/03//},
	pages = {941 - 951 vol.2 - 941 - 951 vol.2},
	abstract = {We present Slurpie: a peer-to-peer protocol for bulk data transfer. Slurpie is specifically designed to reduce client download times for large, popular files, and to reduce load on servers that serve these files. Slurpie employs a novel adaptive downloading strategy to increase client performance, and employs a randomized backoff strategy to precisely control load on the server. We describe a full implementation of the Slurpie protocol, and present results from both controlled local-area and wide-area testbeds. Our results show that Slurpie clients improve performance as the size of the network increases, and the server is completely insulated from large flash crowds entering the Slurpie network.},
	keywords = {adaptive, bulk, client-server, clients;, computing;, cooperative, data, data;, downloading, network;, peer-to-peer, protocol;, protocols;, Slurpie, strategy;, systems;, transfer, transport},
	doi = {10.1109/INFCOM.2004.1356981},
	author = {Sherwood,R. and Braud,R. and Bhattacharjee, Bobby}
}
@conference {12289,
	title = {Trust-preserving set operations},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {4},
	year = {2004},
	month = {2004/03//},
	pages = {2231 - 2241 vol.4 - 2231 - 2241 vol.4},
	abstract = {We describe a method for performing trust-preserving set operations by untrusted parties. Our motivation for this is the problem of securely reusing content-based search results in peer-to-peer networks. We model search results and indexes as data sets. Such sets have value for answering a new query only if they are trusted. In the absence of any system-wide security mechanism, a data set is trusted by a node a only if it was generated by some node which is trusted by a. Our main contributions are a formal definition of the problem as well as an efficient scheme that solves this problem by allowing untrusted peers to perform set operations on trusted data sets while also producing unforgeable proofs of correctness. This is accomplished by requiring trusted nodes to sign appropriately-defined digests of generated sets; each such digest consists of an RSA accumulator and a Bloom filter. The scheme is general, and has other applications as well. We give an analysis demonstrating the low overhead of the scheme, and we include experimental data which confirm the analysis.},
	keywords = {accumulator;, Bloom, computing;, filter;, mechanism;, network;, operation;, peer-to-peer, RSA, Security, security;, set, system-wide, Telecommunication, theory;, trust-preserving},
	doi = {10.1109/INFCOM.2004.1354646},
	author = {Morselli,R. and Bhattacharjee, Bobby and Katz, Jonathan and Keleher,P.}
}
@conference {12304,
	title = {Cooperative peer groups in NICE},
	booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies},
	volume = {2},
	year = {2003},
	month = {2003///},
	pages = {1272 - 1282 vol.2 - 1272 - 1282 vol.2},
	abstract = {A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.},
	keywords = {algorithm;, cooperative, decentralized, distributed, identification;, individual, inference, inference;, information, Internet;, malicious, manner;, mechanisms;, networks;, NICE, node;, noncooperative, peer-to-peer, platform;, reputation, retrieval;, storage;, system;, trust, users, users;},
	doi = {10.1109/INFCOM.2003.1208963},
	author = {Lee,S. and Sherwood,R. and Bhattacharjee, Bobby}
}
@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.}
}
@conference {16910,
	title = {Remote access to large spatial databases},
	booktitle = {Proceedings of the 10th ACM international symposium on Advances in geographic information systems},
	series = {GIS {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {5 - 10},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Enterprises in the public and private sectors have been making their large spatial data archives available over the Internet. However, interactive work with such large volumes of online spatial data is a challenging task. We propose two efficient approaches to remote access to large spatial data. First, we introduce a client-server architecture where the work is distributed between the server and the individual clients for spatial query evaluation, data visualization, and data management. We enable the minimization of the requirements for system resources on the client side while maximizing system responsiveness as well as the number of connections one server can handle concurrently. Second, for prolonged periods of access to large online data, we introduce APPOINT (an Approach for Peer-to-Peer Offloading the INTernet). This is a centralized peer-to-peer approach that helps Internet users transfer large volumes of online data efficiently. In APPOINT, active clients of the client-server architecture act on the server{\textquoteright}s behalf and communicate with each other to decrease network latency, improve service bandwidth, and resolve server congestions.},
	keywords = {client/server, GIS, Internet, peer-to-peer},
	isbn = {1-58113-591-2},
	doi = {10.1145/585147.585150},
	url = {http://doi.acm.org/10.1145/585147.585150},
	author = {Tanin,Egemen and Brabec,Franti{\v s}ek and Samet, Hanan}
}
