  We model the cooperation policy with only two parameters -- search radius $r$
and number of copies in the network $N_{copy}$. These two parameters represent
the range of cooperation and tolerance of duplicates. We show how cooperation
policy impacts content distribution, and further illustrate the relation
between content popularity and topological properties. Our work leads many
implications on how to take advantage of topological properties in in-network
caching strategy design.
