On the local popularity impact on object replica placement over WMNs

In this paper, we propose a distributed heuristic solution for the replica placement problem in Wireless Mesh Networks (WMNs). This problem is known to be NP-complete. Our heuristic considers the local popularity of an object replica. The local popularity can be defined as the relative demand for an object within a partition of the network compared to the whole network. The heuristic collects popularity information periodically to compute the number of replicas for future period requests. We perform simulation experiments to investigate the performance of our heuristic.