 This paper proposes a distributed algorithm for allocating resources over a multi-agent network with heterogeneous time-varying delays. It addresses the problem of finding a fixed sum allocation that preserves the sum of the resource values across agents. The algorithm is designed to handle both known and unknown delays, and it is applicable to networks with non-linearities such as clipping and quantization. Additionally, the algorithm is able to handle changing topologies and switching between them. This article was authored by Muhammad Reza-Dusmohamedian, Ali Reza-Agassi, Apostola Sirikos, and others.