Sciweavers

115 search results - page 16 / 23
» Using Random Subsets to Build Scalable Network Services
Sort
View
DCOSS
2006
Springer
15 years 3 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
LISA
2001
15 years 1 months ago
Macroscopic Internet Topology and Performance Measurements from the DNS Root Name Servers
We describe active measurements of topology and end-to-end latency characteristics between several of the DNS root servers and a subset of their clients using the skitter tool dev...
Marina Fomenkov, Kimberly C. Claffy, Bradley Huffa...
ICPPW
2009
IEEE
15 years 6 months ago
SenSORCER: A Framework for Managing Sensor-Federated Networks
—Despite many technology advances, the limited computing power of sensors encumber them from taking part in service-oriented architectures. In recent years, the sensornetworking ...
Sujit Bhosale, Michael W. Sobolewski
IPPS
2005
IEEE
15 years 5 months ago
A Performance Comparison of Tree and Ring Topologies in Distributed Systems
A distributed system is a collection of computers that are connected via a communication network. Distributed systems have become commonplace due to the wide availability of low-c...
Min Huang, Brett Bode
SRDS
2010
IEEE
14 years 9 months ago
P-Store: Genuine Partial Replication in Wide Area Networks
Partial replication is a way to increase the scalability of replicated systems since updates only need to be applied to a subset of the system's sites, thus allowing replicas...
Nicolas Schiper, Pierre Sutra, Fernando Pedone