The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
A framework for uplink power control in cellular radio systems
Yates, R. D. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.414651 · Cited by 2,436
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
Distributed multiuser power control for digital subscriber lines
Yu, W., Ginis, G., & Cioffi, J. M. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.1007390 · Cited by 855
Crosstalk identification in xDSL systems
Zeng, C., Aldana, C., Salvekar, A. A., et al. (2001) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.942511 · Cited by 59
Cited by
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Power Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886
An introduction to convex optimization for communications and signal processing
Luo, Z.-Q., & Yu, W. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879347 · Cited by 562
SCALE: A Low-Complexity Distributed Protocol for Spectrum Balancing in Multiuser DSL Networks
Papandriopoulos, J., & Evans, J. S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2023751 · Cited by 395
Self-citationEnergy Efficiency in Wireless Networks via Fractional Programming Theory
Zappone, A., & Jorswieck, E. (2015) · now publishers, Inc. eBooks · doi:10.1561/9781680830439 · Cited by 326
Metadata
- Authors
- Papandriopoulos, J., & Evans, J.
- Venue
- 2006 IEEE International Conference on Communications
- Publisher
- IEEE
- Published
- 2006
- Pages
- 3270-3275
- ISSN
- 1550-3607 (ISSN-L)
- OpenAlex
- W2165849651
- Cited by
- 283
- References
- 5
- FWCI
- 34.50
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Low-Complexity Distributed Algorithms for Spectrum Balancing in Multi-User DSL Networks. https://app.cochat.ai/papers/10.1109/icc.2006.255311
- The paper
- Papandriopoulos, J., & Evans, J. (2006). Low-Complexity Distributed Algorithms for Spectrum Balancing in Multi-User DSL Networks. 2006 IEEE International Conference on Communications. https://doi.org/10.1109/icc.2006.255311
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.