2020
DOI: 10.1109/tnet.2020.3003925
|View full text |Cite
|
Sign up to set email alerts
|

Multi-Layer Decomposition of Network Utility Maximization Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 37 publications
0
5
0
Order By: Relevance
“…The studies found at the judicious sharing of the computation resources along the backhaul path can reduce the peak demands for computational resources in so-called multi-access edge computing (MEC, aka. mobile edge computing) nodes [83][84][85][86].…”
Section: Future Research and Development Directionsmentioning
confidence: 99%
“…The studies found at the judicious sharing of the computation resources along the backhaul path can reduce the peak demands for computational resources in so-called multi-access edge computing (MEC, aka. mobile edge computing) nodes [83][84][85][86].…”
Section: Future Research and Development Directionsmentioning
confidence: 99%
“…It is worth pointing out that, the main contribution of this paper is not to propose a specific new decomposition theory. Instead, our objective is to accomplish network control problem decomposition based on existing theories in an automated fashion [8], [19], [20], [21]. Next, we describe how this can be accomplished by taking cross-layer decomposition as an example in Section IV-B.…”
Section: A Decomposition Approachesmentioning
confidence: 99%
“…Finding the optimal solution offline: Due to the challenges mentioned above, the optimal energy allocation can only be obtained using iterative algorithms and expected values of the energy that will be harvested in future intervals. To obtain the optimal solution as point of reference, we adapt an iterative gradient projection algorithm used recently in network utility maximization problems [30]. It starts with random allocations and Lagrange multipliers λ, as depicted in Algorithm 1 lines 2-4.…”
Section: B Optimal Solution Using Iterative Gradient Projectionmentioning
confidence: 99%
“…The iteration in lines 5-8 continues until λ converges within desired tolerance bounds. The proof of convergence can be found in [30].…”
Section: B Optimal Solution Using Iterative Gradient Projectionmentioning
confidence: 99%