Scrivener: Providing Incentives in Cooperative Content Distribution Systems? Animesh Nandi1 , Tsuen-Wan “Johnny” Ngan1 , Atul Singh1 , Peter Druschel2 , and Dan S. Wallach1 1 Department 2 Max

First Page		Document Content
Date: 2005-11-01 10:40:58 Distributed data storage Computing Concurrent computing Distributed computing Distributed hash table Pastry Overlay network Peer-to-peer Chord Node Routing Tapestry		Scrivener: Providing Incentives in Cooperative Content Distribution Systems? Animesh Nandi1 , Tsuen-Wan “Johnny” Ngan1 , Atul Singh1 , Peter Druschel2 , and Dan S. Wallach1 1 Department 2 Max Add to Reading List Source URL: www.cs.rice.edu Download Document from Source Website File Size: 235,94 KB Share Document on Facebook

	Under consideration for publication in Formal Aspects of Computing Maximally Concurrent Programs 1 DocID: 1xUtw - View Document
	Automated Verification of Concurrent Stochastic Games Marta Kwiatkowska1 , Gethin Norman2 , David Parker3 , and Gabriel Santos1 1 Department of Computing Science, University of Oxford, UK DocID: 1xTlL - View Document
	Fully Concurrent Garbage Collection of Actors on Many-Core Machines Sylvan Clebsch and Sophia Drossopoulou Department of Computing, Imperial College, London {sc5511, scd}@doc.ic.ac.uk DocID: 1tNeJ - View Document
	BritishLanthorn: Ubiquitous Homogeneous Cooperative Symmetries Ike Antkare International Institute of Technology United Slates of Earth DocID: 1ru6U - View Document
	Practical Optional Types for Clojure Ambrose Bonnaire-Sergeant† , Rowan Davies, Sam Tobin-Hochstadt† Indiana University†; Omnia Team, Commonwealth Bank of Australia {abonnair,samth}@indiana.edu, Rowan.Davies@cba. DocID: 1ru0R - View Document