Sciweavers

6919 search results - page 1031 / 1384
» Designing Service Communities
Sort
View
IPTPS
2004
Springer
16 years 3 days ago
DHT Routing Using Social Links
— The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existin...
Sergio Marti, Prasanna Ganesan, Hector Garcia-Moli...
QOFIS
2004
Springer
16 years 3 days ago
MULTI+: Building Topology-Aware Overlay Multicast Trees
TOPLUS is a lookup service for structured peer-to-peer networks that is based on the hierarchical grouping of peers according to network IP prefixes. In this paper we present MULT...
Luis Garcés-Erice, Ernst W. Biersack, Pasca...
WWW
2010
ACM
16 years 1 days ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett
CLUSTER
2003
IEEE
16 years 1 days ago
A Performance Comparison of Linux and a Lightweight Kernel
In this paper, we compare running the Linux operating system on the compute nodes of ASCI Red hardware to running a specialized, highly-optimized lightweight kernel (LWK) operatin...
Ron Brightwell, Rolf Riesen, Keith D. Underwood, T...
EDOC
2003
IEEE
16 years 1 days ago
An Efficient, Scalable Content-Based Messaging System
Large-scale information processing environments must rapidly search through massive streams of raw data to locate useful information. These data streams contain textual and numeri...
Ian Gorton, Justin Almquist, Nick Cramer, Jereme H...
« Prev « First page 1031 / 1384 Last » Next »