Sciweavers

1101 search results - page 141 / 221
» Reliability for Networked Storage Nodes
Sort
View
91
Voted
NETWORK
2008
106views more  NETWORK 2008»
15 years 22 days ago
Toward internet-wide multipath routing
The Internet would be more efficient and robust if routers could flexibly divide traffic over multiple paths. Often, having one or two extra paths is sufficient for customizing pa...
Jiayue He, Jennifer Rexford
SIGMETRICS
2006
ACM
15 years 6 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
90
Voted
IPSN
2004
Springer
15 years 6 months ago
Loss inference in wireless sensor networks based on data aggregation
In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of in...
Gregory Hartl, Baochun Li
127
Voted
IPSN
2005
Springer
15 years 6 months ago
Tracking on a graph
Abstract— This paper considers the problem of tracking objects with sparsely located binary sensors. Tracking with a sensor network is a challenging task due to the inaccuracy of...
Songhwai Oh, Shankar Sastry
105
Voted
SPAA
2005
ACM
15 years 6 months ago
The expansion and mixing time of skip graphs with applications
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
James Aspnes, Udi Wieder