Sciweavers

179 search results - page 1 / 36
» Performance Analysis of Stealth DHT with Mobile Nodes
Sort
View
PERCOM
2006
ACM
14 years 4 months ago
Performance Analysis of Stealth DHT with Mobile Nodes
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
IPPS
2007
IEEE
13 years 11 months ago
Performance Modelling of Peer-to-Peer Routing
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
Idris A. Rai, Andrew Brampton, Andrew MacQuire, La...
EUROMICRO
2006
IEEE
13 years 11 months ago
Authentication in Stealth Distributed Hash Tables
Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of ...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, Ni...
ASPLOS
2006
ACM
13 years 10 months ago
Stealth prefetching
Prefetching in shared-memory multiprocessor systems is an increasingly difficult problem. As system designs grow to incorporate larger numbers of faster processors, memory latency...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
PERCOM
2009
ACM
14 years 5 months ago
Mobile Ad Hoc Networks: the DHT paradigm
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
Marcello Caleffi