Distributed Resource Allocation on Dynamic Networks in Quadratic Time

TL;DR

This paper introduces a deterministic, distributed protocol for resource allocation in dynamic networks, achieving quadratic convergence time relative to the number of nodes under certain connectivity conditions.

Contribution

It presents a novel distributed algorithm with proven quadratic convergence time for resource allocation in time-varying networks.

Findings

Convergence time scales quadratically with network size.

Protocol works on time-varying undirected graphs.

Achieves efficient distributed resource allocation.

Abstract

We consider the problem of allocating a fixed amount of resource among nodes in a network when each node suffers a cost which is a convex function of the amount of resource allocated to it. We propose a new deterministic and distributed protocol for this problem. Our main result is that the associated convergence time for the global objective scales quadratically in the number of nodes on any sequence of time-varying undirected graphs satisfying a long-term connectivity condition.