The package consists of a number of MATLAB® M-files that can be executed under the platform's R2008a version (or later). Given the network topology, represented by an adjacency matrix, the code computes the optimal/near-optimal placement of a piece of content within the network; to that end, it solves iteratively small-scale optimization problems (i.e. a subset of alpha times the number of the network nodes) moving the content to increasingly preferable locations, under the hypothesis of a uniform demand pattern. The nodes that participate in each one of the small scale problems are carefully selected according to their 'social significance', which is captured by the innovative CBC metric (see the paper above).

This software package implements the functionality initially described in Section 4 of SOCIALNETS Deliverable D3.2. and subsequently used to produced the new and finalising results shown in Deliverable D3.3