2012
DOI: 10.1186/1687-6180-2012-150
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic partial crosstalk cancellation resource allocation algorithms for DSL access networks

Abstract: Earlier work on crosstalk mitigation techniques for DSL access networks has focused on physical layer transmit rate maximization or transmit power minimization through static resource allocation, i.e., static allocation of transmit power and/or computational complexity to the individual user in the network. However, such static resource allocation does not allow to consider upper-layer metrics such as network throughput, stability and delay performance. In this article, we develop a set of dynamic resource all… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 26 publications
(48 reference statements)
0
2
0
Order By: Relevance
“…Finally, we wish to highlight that these dynamic schemes are all much more computationally efficient than previously proposed fixed cancellation tap budget approaches [3][4] [5], which use a total system budget of 30%. From Figure 4, we can derive that the average number of allocated cancellation taps is only 9.5% for our new scheme, which corresponds to an improvement of 68%.…”
Section: Simulationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we wish to highlight that these dynamic schemes are all much more computationally efficient than previously proposed fixed cancellation tap budget approaches [3][4] [5], which use a total system budget of 30%. From Figure 4, we can derive that the average number of allocated cancellation taps is only 9.5% for our new scheme, which corresponds to an improvement of 68%.…”
Section: Simulationsmentioning
confidence: 99%
“…These works however consider a static resource allocation approach. Research work on transitioning from a static to a dynamic allocation of vectoring resources has been presented in [5][6] [7]. These works however only consider the past user behaviour in terms of accumulated queue loads, whereas in this paper future user demands and flexible fixed data rates are considered.…”
Section: Introductionmentioning
confidence: 99%