Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
22
Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes
"... It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the scenario where sinks are not present in large-scale sensor networks, and unreliable sensors have to collectively resort to storing s ..."
Abstract
-
Cited by 41 (2 self)
- Add to MetaCart
sensed data over time on themselves. At a time of convenience, such cached data from a small subset of live sensors may be collected by a centralized (possibly mobile) collector. In this paper, we propose a decentralized algorithm using fountain codes to guarantee the persistence and reliability
Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes
"... Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the scenario where sinks are not present in large-scale sensor networks, and unreliable sensors have to collectively resort to s ..."
Abstract
- Add to MetaCart
to storing sensed data over time on themselves. At a time of convenience, such cached data from a small subset of live sensors may be collected by a centralized (possibly mobile) collector. In this paper, we propose a decentralized algorithm using fountain codes to guarantee the persistence and reliability
Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes
"... Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the scenario where sinks are not present in large-scale sensor networks, and unreliable sensors have to collectively resort to s ..."
Abstract
- Add to MetaCart
to storing sensed data over time on themselves. At a time of convenience, such cached data from a small subset of live sensors may be collected by a centralized (possibly mobile) collector. In this paper, we propose a decentralized algorithm using fountain codes to guarantee the persistence and reliability
Fundamental Limits of Caching in Wireless D2D Networks
, 2014
"... We consider a wireless Device-to-Device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already be ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
of the problem. We propose a caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands. We also consider a random caching strategy, which is more
Novasky: Cinematic-Quality VoD in a P2P Storage Cloud
"... Abstract—In this paper, we present Novasky, a real-world Video-on-Demand (VoD) system capable of delivering cinematicquality video streams to end users. The foundation of the Novasky design is a peer-to-peer (P2P) storage cloud, storing and refreshing media streams in a decentralized fashion using l ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
local storage spaces of end users. We present our design objectives in Novasky, and how these objectives are achieved using a collection of unique mechanisms, with respect to caching strategies, coding mechanisms, and the maintenance of the supplydemand relationship when it comes to media availability
CDF software distribution on the Grid using Parrot
"... Abstract. Large international collaborations that use decentralized computing models are becoming a custom rather than an exception in High Energy Physics. A good computing model for such big collaborations has to deal with the distribution of the experiment-specific software around the world. When ..."
Abstract
- Add to MetaCart
software to all European Grid sites using Parrot, a user-level application capable of attaching existing programs to remote I/O systems through the filesystem interface. This choice allows CDF to use just one centralized source of code and a scalable set of caches all around Europe to efficiently
Evil Twins: Two Models for TCB Reduction in HPC Clusters ABSTRACT
"... Traditional high performance computing systems require extensive management and suffer from security and configuration problems. This paper presents two generations of a cluster-management system that aims at making clusters as secure and self-managing as possible. The goal of the system is minimali ..."
Abstract
- Add to MetaCart
implementation consisting of only a few hundred lines of C code. In the second, a centralized pull model (“Evil Twin”), nodes may be running behind NATs or firewalls, and are controlled by a centralized web service. A specially developed cache invalidation protocol is used for telling nodes when to reload
Performance of Multicore Systems on Parallel Data Clustering with Deterministic Annealing
, 2008
"... Abstract—Multicore systems are of growing importance and 64-128 cores can be expected in a few years. We expect datamining to be an important application class of general importance and are developing such scalable parallel algorithms for managed code (C#) on Windows. We present a performance analys ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract—Multicore systems are of growing importance and 64-128 cores can be expected in a few years. We expect datamining to be an important application class of general importance and are developing such scalable parallel algorithms for managed code (C#) on Windows. We present a performance
Collection Tree Protocol
"... This paper presents and evaluates two principles for designing robust, reliable, and efficient collection protocols. These principles allow a protocol to benefit from accurate and agile link estimators by handling the dynamism such estimators introduce to routing tables. The first is datapath valida ..."
Abstract
- Add to MetaCart
validation: a protocol can use data traffic as active topology probes, quickly discovering and fixing routing loops. The second is adaptive beaconing: by extending the Trickle code propagation algorithm to routing control traffic, a protocol sends fewer beacons while simultaneously reducing its route repair
Results 1 - 10
of
22
