<--- 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

1 A Distributed Algorithm to Construct Multicast Trees in WSNs: An Approximate Steiner Tree Approach Hongyu Gong

DocID: 1vlc1 - View Document

Proceedings of the Internet Society Network and Distributed System Security Symposium (NDSS 2001), February 2001, ppEfficient and Secure Source Authentication for Multicast Adrian Perrig 

DocID: 1vl5q - View Document

1 The Multicast Capacity of Large Multihop Wireless Networks† Srinivas Shakkottai,

DocID: 1v6Nd - View Document

Optimization Based Rate Control for Multicast with Network Coding Lijun Chen† , Tracey Ho† , Steven H. Low† , Mung Chiang‡ and John C. Doyle† † Engineering & Applied Science Division, California Institute of

DocID: 1v4HM - View Document

ConMap: A Novel Framework for Optimizing Multicast Energy in Delay-constrained Mobile Wireless Networks Xinzhe Fu1 , Zhiying Xu2 , Qianyang Peng1 , Jie You2 , Luoyi Fu1 , Xinbing Wang1,2 , Songwu Lu3 Department of {Compu

DocID: 1uTvY - View Document