Most research on Distributed Hash Tables (DHTs) assumes ephemeral, lightly loaded deployments. Each node has a lifetime of a few hours and initiates a lookup once every few second...
Abstract--This paper focuses on data structures for multicore reachability, which is a key component in model checking algorithms and other verification methods. A cornerstone of a...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
We analyze the problem of storing contextual information across a set of distributed heterogeneous mobile devices. These devices form a Mobile Ad Hoc Network (MANET) interconnected...
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...
In cluster-based storage systems, the metadata server cluster must be able to adaptively distribute responsibility for metadata to maintain high system performance and long-term l...