Low-Complexity Distributed Algorithms for Spectrum Balancing in Multi-User DSL Networks

Abstract

Dynamic Spectrum Management of Digital Subscriber Lines (DSL) has the potential to dramatically increase the capacity of the aging last-mile copper access network. This paper takes an important step toward fulfilling this potential through power spectrum balancing. We derive a novel algorithm called SCALE, that provides a significant performance improvement over the existing iterative water-filling (IWF) algorithm in multi-user DSL networks, doing so with comparable low complexity. The algorithm is easily distributed through measurement and limited message-passing with the use of a Spectrum Management Center. We outline how overhead can be managed, and show that in the limit of zero message-passing, performance reduces to IWF. Numerical convergence of SCALE was found to be extremely fast when applied to VDSL, with performance exceeding that of iterative water-filling in just a few iterations, and to over 90% of the final rate in under 5 iterations. Lastly, we return to the problem of iterative water-filling and derive a new algorithm named SCAWF that is shown to be a very simple way to waterfill, particularly suited to the multi-user context.