<--- Back to Details
First PageDocument Content
Distributed data storage / Computing / Concurrent computing / Distributed computing / Distributed hash table / Pastry / Overlay network / Peer-to-peer / Chord / Node / Routing / Tapestry
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

Similar Documents

Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger  Roger Wattenhofer

Efficient Traffic Routing with Progress Guarantees Stefan Blumer Manuel Eichelberger Roger Wattenhofer

DocID: 1xVZy - View Document

Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain

Sweet Little Lies: Fake Topologies for Flexible Routing Stefano Vissicchio University of Louvain

DocID: 1xVPP - View Document

Decoy Routing: Toward Unblockable Internet Communication Josh Karlin  Daniel Ellard

Decoy Routing: Toward Unblockable Internet Communication Josh Karlin Daniel Ellard

DocID: 1xVLC - View Document

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki  Aviv Zohar

Hijacking Bitcoin: Routing Attacks on Cryptocurrencies https://btc-hijack.ethz.ch Maria Apostolaki Aviv Zohar

DocID: 1xVI1 - View Document

Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista

Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista

DocID: 1xVsm - View Document