Optimal deployment of caches in the plane

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

100 Downloads (Pure)

Abstract

We consider wireless caches placed in the plane according to a homogeneous Poisson process. A data file is stored at the caches, which have limited storage capabilities. Clients can contact the caches to retrieve the data. The caches store the data according to one of the two data allocation strategies: partitioning & coding. We consider the Pareto front of the expected deployment cost of the caches and the expected cost of a client retrieving the data from the caches. We show that there is a strong trade-off between the expected retrieval and the expected deployment cost under the partitioning and the coding strategies. We also show that under coding, it is optimal to deploy a high number of caches, each with low storage capacity.
Original languageUndefined
Title of host publicationProceedings of the 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013
Place of PublicationUSA
PublisherIEEE
Pages863-866
Number of pages4
ISBN (Print)978-1-4799-0248-4
DOIs
Publication statusPublished - 2014
Event1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Austin, TX, USA
Duration: 3 Dec 20135 Dec 2013

Publication series

Name
PublisherIEEE

Conference

Conference1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013
Period3/12/135/12/13
Other3-5 December 2013

Keywords

  • EWI-25111
  • Wireless communication
  • IR-92204
  • METIS-306042
  • Networks of caches
  • Cost optimization
  • Coding

Cite this