Sciweavers

1498 search results - page 27 / 300
» Collection tree protocol
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 4 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
HICSS
2000
IEEE
109views Biometrics» more  HICSS 2000»
14 years 2 months ago
Scalable and Secure Resource Location
In this paper we present Captain Cook, a service that continuously monitors resources in the Internet, and allows clients to locate resources using this information. Captain Cook ...
Robbert van Renesse
MM
1996
ACM
128views Multimedia» more  MM 1996»
14 years 2 months ago
The Case for Reliable Concurrent Multicasting Using Shared Ack Trees
Such interactive, distributed multimedia applications as shared whiteboards, group editors, and simulations require reliable concurrent multicast services, i.e., the reliable diss...
Brian Neil Levine, David B. Lavo, J. J. Garcia-Lun...
BMCBI
2006
150views more  BMCBI 2006»
13 years 10 months ago
TreeDyn: towards dynamic graphics and annotations for analyses of trees
Background: Analyses of biomolecules for biodiversity, phylogeny or structure/function studies often use graphical tree representations. Many powerful tree editors are now availab...
François Chevenet, Christine Brun, Anne-Lau...
MICRO
2010
IEEE
159views Hardware» more  MICRO 2010»
13 years 7 months ago
Fractal Coherence: Scalably Verifiable Cache Coherence
We propose an architectural design methodology for designing formally verifiable cache coherence protocols, called Fractal Coherence. Properly designed to be fractal in behavior, t...
Meng Zhang, Alvin R. Lebeck, Daniel J. Sorin