456 search results - page 90 / 92 » On Routing in Distributed Hash Tables |
ISPD
2005
ACM
14 years 3 months ago
2005
ACM
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
IEEEPACT
2006
IEEE
14 years 3 months ago
2006
IEEE
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the ...
CCGRID
2001
IEEE
14 years 1 months ago
2001
IEEE
The Differentiated Services (DiffServ) approach will also bring benefits for multicast applications which need quality of service support. For instance, a highly reliable multicas...
BMCBI
2007
13 years 10 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
COORDINATION
2008
Springer
13 years 11 months ago
2008
Springer
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...