Distance-d covering problems in scale-free networks with degree correlations

TL;DR

This paper introduces a heuristic approach for resource allocation in large, complex communication networks, emphasizing the influence of network topology and degree correlations on optimal solutions.

Contribution

It presents a novel heuristic method for solving covering problems in scale-free networks with degree correlations, highlighting the impact of network topology on resource allocation strategies.

Findings

Optimal resource allocation depends on network topology.

Degree correlations influence the choice between centralized and distributed designs.

Heuristic method finds near-optimal solutions in real networks.

Abstract

A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling and distribution methods. The solution to these issues is becoming more challenging due to the increasing size and complexity of communication networks. We report here on an heuristic method that allows to find near-optimal solutions to the covering problem in real communication networks. The results show that the optimal allocation of resources strongly depends on the topology of the underlying networks. Whether a centralized or distributed design is to be used relies upon the degree correlations between connected vertices.