@conference {12286,
	title = {Multi-dimensional quorum sets for read-few write-many replica control protocols},
	booktitle = {Cluster Computing and the Grid, 2004. CCGrid 2004. IEEE International Symposium on},
	year = {2004},
	month = {2004/04//},
	pages = {355 - 362},
	abstract = {We describe d-spaces, a replica control protocol defined in terms of quorum sets on multi-dimensional logical structures. Our work is motivated by asymmetrical access patterns, where the number of read accesses to data are dominant relative to update accesses, i.e. where the protocols should be read-few write-many. D-spaces are optimal with respect to quorum group sizes. The quality of the tradeoff between read efficiency and update availability is not matched by existing quorum protocols. We also propose a novel scheme for implementing d-spaces that combines caching and local information to provide a best-effort form of global views. This allows quorum reconfiguration to be lightweight without impacting access latencies, even when the rate of membership changes is very high.},
	keywords = {accesses;, availability;, cache, caching;, Communication, complexity;, CONTROL, d-spaces;, distributed, efficiency;, lightweight, logical, multi-dimensional, processing;, protocols;, quorum, read, read-few, reconfiguration;, replica, sets;, storage;, structures;, update, write-many},
	doi = {10.1109/CCGrid.2004.1336588},
	author = {Silaghi,B. and Keleher,P. and Bhattacharjee, Bobby}
}
@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}
}
@conference {15199,
	title = {Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs},
	booktitle = {Foundations of Computer Science, 1989., 30th Annual Symposium on},
	year = {1989},
	month = {1989/11/01/oct},
	pages = {288 - 293},
	abstract = {An efficient parallel algorithm for testing whether a graph <e1>G </e1> is <e1>K</e1>-vertex connected, for any fixed <e1>k</e1>, is presented. The algorithm runs in <e1>O</e1>(log <e1>n</e1>) time and uses <e1>nC</e1>(<e1>n</e1>,<e1>m</e1>) processors on a concurrent-read, concurrent-write parallel random-access machine (CRCW PRAM), where <e1>n </e1> and <e1>m</e1> are the number of vertices and edges of <e1>G</e1> and <e1>C</e1>(<e1>n</e1>,<e1>m</e1>) is the number of processors required to compute the connected components of <e1>G</e1> in logarithmic time. An optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing <e1>k </e1>-vertex connectivity, for any <e1>k</e1> gt;4. To develop the algorithm, an efficient parallel algorithm is designed for the following disjoint <e1>s</e1>-<e1>t</e1> paths problem: Given a graph <e1>G</e1> and two specified vertices <e1>s</e1> and <e1>t</e1>, find <e1>k</e1>-vertex disjoint paths between <e1>s</e1> and <e1>t</e1>, if they exist. If no such paths exist, find a set of at most <e1>k</e1>-1 vertices whose removal disconnects <e1>s</e1> and <e1>t</e1>. The parallel algorithm for this problem runs in <e1>O</e1>(log <e1>n</e1>) time using <e1>C</e1>(<e1>n</e1>,<e1>m</e1>) processors. It is shown how to modify the algorithm to find <e1>k</e1>-edge disjoint paths, if they exist. This yields an efficient parallel algorithm for testing whether a graph <e1>G</e1> is <e1>k</e1>-edge connected, for any fixed <e1>k</e1>. The algorithm runs in <e1>O</e1>(log <e1>n</e1>) time and uses <e1>nC </e1> (<e1>n</e1>,<e1>n</e1>) processors on a CRCW PRAM. Again, an optimal speedup algorithm for computing connected components would induce an optimal speedup algorithm for testing <e1>k</e1>-edge connectivity},
	keywords = {algorithm;parallel, algorithms;random-access, algorithms;testing, complexity;graph, connectivity;computational, connectivity;optimal, CRCW, disjoint, paths;graphs;k-edge, paths;k-vertex, PRAM;disjoint, s-t, speedup, storage;, theory;parallel},
	doi = {10.1109/SFCS.1989.63492},
	author = {Khuller, Samir and Schieber,B.}
}
