Sciweavers

286 search results - page 15 / 58
» Highly Concurrent Shared Storage
Sort
View
MOBIHOC
2003
ACM
15 years 2 months ago
PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
Jun Luo, Jean-Pierre Hubaux, Patrick Th. Eugster
INFOSCALE
2006
ACM
15 years 3 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provid...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas...
SENSYS
2006
ACM
15 years 3 months ago
Supporting concurrent applications in wireless sensor networks
It is vital to support concurrent applications sharing a wireless sensor network in order to reduce the deployment and administrative costs, thus increasing the usability and ef...
Yang Yu, Loren J. Rittle, Vartika Bhandari, Jason ...
ANCS
2007
ACM
15 years 1 months ago
Frame shared memory: line-rate networking on commodity hardware
Network processors provide an economical programmable platform to handle the high throughput and frame rates of modern and next-generation communication systems. However, these pl...
John Giacomoni, John K. Bennett, Antonio Carzaniga...
DSN
2006
IEEE
15 years 3 months ago
Storage Allocation in Unreliable Peer-to-Peer Systems
Peer-to-peer systems provide the opportunity to pool large amounts of distributed resources to enable internetscale applications. However, the participant nodes are highly dynamic...
John A. Chandy