<--- Back to Details
First PageDocument Content
Distributed data storage / Pastry / Distributed hash table / Tree / Binary tree / Node / Tapestry / IP multicast / Multicast / R-tree / Anycast / Routing
Date: 2003-08-13 11:44:30
Distributed data storage
Pastry
Distributed hash table
Tree
Binary tree
Node
Tapestry
IP multicast
Multicast
R-tree
Anycast
Routing

bottleneck_bandwidth_downstream_upstream_cdf1.xls

Add to Reading List

Source URL: www.cs.rice.edu

Download Document from Source Website

File Size: 770,55 KB

Share Document on Facebook

Similar Documents

ChunkCast: An Anycast Service for Large Content Distribution Byung-Gon Chun, Peter Wu, Hakim Weatherspoon, and John Kubiatowicz Computer Science Division University of California, Berkeley {bgchun,peterwu,hweather,kubitr

DocID: 1vrqG - View Document

Anycast vs. DDoS: Evaluating Nov. 30 Giovane C. M. Moura1, Ricardo de O. Schmidt2, John Heidemann3, Wouter B. de Vries2, Moritz Müller1, Lan Wei3, CrisAan Hesselman1

DocID: 1tW3q - View Document

Scalable application-level anycast for highly dynamic groups Miguel Castro1 , Peter Druschel2 , Anne-Marie Kermarrec1, and Antony Rowstron1 1 2

DocID: 1sglz - View Document

Distributed data storage / Computing / Concurrent computing / Distributed computing / Distributed hash table / Tapestry / Pastry / Routing / Chord / Kademlia / Decentralized object location and routing / Anycast

Towards a Common API for Structured Peer-to-Peer Overlays     

DocID: 1qSHh - View Document

Computing / Network architecture / Computer architecture / Cyberwarfare / Computer network security / Data security / IP multicast / Overlay network / Denial-of-service attack / Anycast / Database trigger / Firewall

Towards a More Functional and Secure Network Infrastructure Daniel Adkins Karthik Lakshminarayanan Adrian Perrig Ion Stoica UC Berkeley UC Berkeley CMU

DocID: 1qSvj - View Document