Sciweavers

115 search results - page 10 / 23
» Using Random Subsets to Build Scalable Network Services
Sort
View
EUROPAR
2009
Springer
15 years 3 months ago
Enabling High Data Throughput in Desktop Grids through Decentralized Data and Metadata Management: The BlobSeer Approach
Whereas traditional Desktop Grids rely on centralized servers for data management, some recent progress has been made to enable distributed, large input data, using to peer-to-peer...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
SASN
2004
ACM
15 years 5 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
WWW
2003
ACM
16 years 14 days ago
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval
We consider the problem of building a P2P-based search engine for massive document collections. We describe a prototype system called ODISSEA (Open DIStributed Search Engine Archi...
Torsten Suel, Chandan Mathur, Jo-wen Wu, Jiangong ...
SOSP
1997
ACM
15 years 1 months ago
Distributed Schedule Management in the Tiger Video Fileserver
Tiger is a scalable, fault-tolerant video file server constructed from a collection of computers connected by a switched network. All content files are striped across all of the c...
William J. Bolosky, Robert P. Fitzgerald, John R. ...
OSDI
2004
ACM
16 years 2 days ago
FUSE: Lightweight Guaranteed Distributed Failure Notification
FUSE is a lightweight failure notification service for building distributed systems. Distributed systems built with FUSE are guaranteed that failure notifications never fail. When...
John Dunagan, Nicholas J. A. Harvey, Michael B. Jo...