Sciweavers

527 search results - page 70 / 106
» Compact Multicast Routing
Sort
View
74
Voted
SOSP
2003
ACM
15 years 6 months ago
SplitStream: high-bandwidth multicast in cooperative environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
SECON
2008
IEEE
15 years 4 months ago
On the Pitfalls of High-Throughput Multicast Metrics in Adversarial Wireless Mesh Networks
—Recent work in multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to compute ...
Jing Dong, Reza Curtmola, Cristina Nita-Rotaru
INFOCOM
2007
IEEE
15 years 3 months ago
Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks
— Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to imp...
Xiaojing Xiang, Zehua Zhou, Xin Wang
P2P
2003
IEEE
108views Communications» more  P2P 2003»
15 years 3 months ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 3 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia