Distributed storage in the plane

Eitan Altman, Konstantin Avrachenkov, Jasper Goseling

Research output: Book/ReportReportProfessional

29 Downloads (Pure)


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 languageEnglish
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages8
Publication statusPublished - Dec 2013

Publication series

PublisherUniversity of Twente, Department of Applied Mathematics
ISSN (Print)1874-4850


Dive into the research topics of 'Distributed storage in the plane'. Together they form a unique fingerprint.
  • Distributed storage in the plane

    Altman, E., Avrachenkov, K. & Goseling, J., 2014, Proceedings of Networking Conference IFIP 2014. Piscataway, NJ: IEEE Computer Society, p. 1-9 9 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    19 Citations (Scopus)
    11 Downloads (Pure)

Cite this