2018 IEEE Conference on Decision and Control (CDC) 2018
DOI: 10.1109/cdc.2018.8619777
|View full text |Cite
|
Sign up to set email alerts
|

Multi-layer Decomposition of Optimal Resource Sharing Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…To this end, WNOS first determines a decomposition approach based on the mathematical structure of the network control problem, including whether the problem involves one or multiple sessions, what protocol layers are to be optimized, if the problem is convex or not, among others. Different decomposition approaches can lead to different structures of the resulting distributed control program with various convergence properties, communication overhead, and achievable network performance [8], [9], [10], [11].…”
Section: Wnos Architecturementioning
confidence: 99%
See 1 more Smart Citation
“…To this end, WNOS first determines a decomposition approach based on the mathematical structure of the network control problem, including whether the problem involves one or multiple sessions, what protocol layers are to be optimized, if the problem is convex or not, among others. Different decomposition approaches can lead to different structures of the resulting distributed control program with various convergence properties, communication overhead, and achievable network performance [8], [9], [10], [11].…”
Section: Wnos Architecturementioning
confidence: 99%
“…Physical Layer : maximize λ1C1(Π) + λ2C2(Π) + λ3C3(Π), (11) where, at the transport layer, each flow s ∈ {1, 2, 3} maximizes its own utility by adjusting its transmission rate R s with given dual coefficients; while the physical-layer subproblem maximizes a weighted-sum-capacity by adapting the transmission strategies Π, i.e., the transmission power of individual nodes. Now we show how the the decomposition results can be applied at network run time by taking the transport-layer subproblem for s = 1 as an example while the same principles can also be applied to other subproblems.…”
Section: Rsmentioning
confidence: 99%
“…We note that this case study does not seek to examine theoretical convergence guarantees for multi-layer multi-timescale optimization. Initial steps towards such a theoretical analysis have recently been reported in [79]. As a complement to and a motivation for detailed theoretical analyses, this present case study seeks to demonstrate the feasibility of the multi-layer optimization with multiple timescales and to showcase performance gains for wireless backhaul.…”
Section: Wireless Backhaul Network Optimizationmentioning
confidence: 99%
“…Such a two-layer benchmark would still perform the intra-operator optimization, but with only two layers compared to the three layers in the considered benchmark. These two benchmarks would generally perform similarly, with differences being influenced by convergence characteristics [79]. For the present study, we focus on the impact of the sharing of the backhaul resource across operators as quantified by comparing the considered no-SDN "intra-operator" optimization with the full SDN-based optimization involving the central SDN orchestrator.…”
Section: Comparison Benchmarkmentioning
confidence: 99%
“…2. Because the cost and constraints of an aggregator are decomposable in terms of the prosumer profiles p b , the problem could be decomposed further to allow individual prosumers to keep C b (p b ) and P b private, interacting with the aggregator in a similar manner as shown in [51].…”
mentioning
confidence: 99%