|
Title
|
|
|
|
Network utility maximization for adaptive resource allocation in DSL systems
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| When signal coordination techniques can not eliminate all crosstalk in a digital subscriber line (DSL) system, competition for data rate among different users is strong. In such scenarios, employing a static resource allocation fails to capitalize on the time dependent nature of the traffic carried by the DSL network. An alternative approach is adaptive resource allocation, consisting of dividing time into slots of short duration and using a different resource allocation in each slot. A cross-layer scheduler then decides on the resource allocation for each time slot by solving a network utility maximization (NUM) problem. For many DSL systems however, this NUM problem is non-convex and solving it is NP-hard. This paper presents a fast algorithm for finding a local solution to the NUM problem, which is referred to as NUM-DSB. The algorithm is able to handle many DSL deployment scenarios, and is applicable regardless of the utility function's properties. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Signal Processing Conference (EUSIPCO), European
|
|
|
Source (book)
|
|
|
|
European Signal Processing Conference (EUSIPCO), AUG 03-07, 2018, Rome, ITALY
|
|
|
Publication
|
|
|
|
Los alamitos
:
Ieee computer soc
,
2018
|
|
|
ISBN
|
|
|
|
978-90-827970-1-5
|
|
|
|
|
|
|
978-90-827970-1-5
|
|
|
DOI
|
|
|
|
10.23919/EUSIPCO.2018.8553357
|
|
|
Volume/pages
|
|
|
|
(2018)
, p. 787-791
|
|
|
ISI
|
|
|
|
000455614900159
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|