Understanding digital subscriber line technology
Understanding digital subscriber line technology
Convex Optimization
Dynamic spectrum management for next-generation DSL systems
IEEE Communications Magazine
Crosstalk identification in xDSL systems
IEEE Journal on Selected Areas in Communications
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
A framework for uplink power control in cellular radio systems
IEEE Journal on Selected Areas in Communications
Near optimum power control under fairness constraints in CoMP systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A class of convergent algorithms for resource allocation in wireless fading networks
IEEE Transactions on Wireless Communications
Maximizing the sum rate in symmetric networks of interfering links
IEEE Transactions on Information Theory
Improved dual decomposition based optimization for DSL dynamic spectrum management
IEEE Transactions on Signal Processing
International Journal of Applied Metaheuristic Computing
Resource Allocation Schemes for the Heterogeneous OFDMA System with Multiple Ad Hoc Relays
Wireless Personal Communications: An International Journal
Convergence of Price-Based Resource Allocation Algorithms in Multicellular Multicarrier Systems
Wireless Personal Communications: An International Journal
| Hi-index | 754.90 |
Dynamic spectrum management of digital subscriber lines (DSLs) 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 multiuser 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 studies indicate that SCALE converges extremely fast when applied to VDSL, with performance exceeding that of IWF in just a few iterations, and to over 90% of the final rate in under five iterations. We provide a proof to show that SCALE converges to a Karush-Kuhn-Tucker (KKT) point, suggesting that it indeed has the potential to reach true global optimality. Finally, we return to the IWF problem and derive a new algorithm named SCAWF that is shown to be a very simple way to water-fill, particularly suited to the multiuser context.