  It is a widely accepted heuristic in content caching to place the most
popular content at the nodes that are the best connected. The other common
heuristic is somewhat contradictory, as it places the most popular content at
the edge, at the caching nodes nearest the users. We contend that neither
policy is best suited for caching content in a network and propose a simple
alternative that places the most popular content at the least connected node.
Namely, we populate content first at the nodes that have the lowest graph
centrality over the network topology. Here, we provide an analytical study of
this policy over some simple topologies that are tractable, namely regular
grids and trees. Our mathematical results demonstrate that placing popular
content at the least connected nodes outperforms the aforementioned
alternatives in typical conditions.
