Abstract
We consider storage devices located in the plane according to a general point process and specialize the results for the homogeneous Poisson process. A large data file is stored at the storage devices, which have limited storage capabilities. Hence, they can only store parts of the data. Clients can contact the storage devices to retrieve the data.We compare the expected cost of obtaining the complete data under uncoded as well as coded data allocation strategies. It is shown that for the general class of cost measures where the cost of retrieving data is increasing with the distance between client and storage devices, coded allocation outperforms uncoded allocation. The improvement offered by coding is quantified for two more specific classes of performance measures. Finally, our results are validated by computing the costs of the allocation strategies for the case that storage devices coincide with currently deployed mobile base stations.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of Networking Conference IFIP 2014 |
| Place of Publication | Piscataway, NJ |
| Publisher | IEEE Computer Society |
| Pages | 1-9 |
| Number of pages | 9 |
| ISBN (Print) | 978-3-901882-58-6 |
| DOIs | |
| Publication status | Published - 2014 |
| Event | 13th IFIP Networking Conference 2014 - Trondheim, Norway Duration: 2 Jun 2014 → 4 Jun 2014 http://networking2014.item.ntnu.no/ |
Conference
| Conference | 13th IFIP Networking Conference 2014 |
|---|---|
| Country | Norway |
| City | Trondheim |
| Period | 2/06/14 → 4/06/14 |
| Internet address |
Keywords
- Resource Management
- Stochastic processes
- Storage management
- Performance Evaluation
- Base stations
- Coded data allocation strategies
- Mobile base stations
- Mobile computing
- Data retrieval
- Delays
- Network topology
- Distributed storage devices
- Homogeneous Poisson process
- Encoding
- Wireless networks