Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Multi-Layer Decomposition of Network Utility Maximization Problems

Published: 14 October 2020 Publication History

Abstract

We describe a distributed framework for resource sharing problems that arise in communications, micro-economics, and various networking applications. In particular, we consider a hierarchical multi-layer decomposition for network utility maximization (ML-NUM), where functionalities are assigned to different layers. The proposed methodology creates solutions with central management and distributed computations to the resource allocation problems. In non-stationary environments, the technique aims to respond quickly to the dynamics of the network by decreasing delay by partially shifting the communication and computational burden to the network edges. Our main contribution is a detailed analysis under the assumption that the network changes are on the same time-scale as the convergence time of the algorithms used for local computations. Moreover, assuming strong concavity and smoothness of the users' objective functions, and under some stability conditions for each layer, we present convergence rates and optimality bounds for the ML-NUM framework. In addition, the main benefits of the proposed method are demonstrated with numerical examples.

References

[1]
N. Karakoc, A. Scaglione, and A. Nedic, “Multi-layer decomposition of optimal resource sharing problems,” in Proc. IEEE Conf. Decis. Control (CDC), Miami Beach, FL, USA, Dec. 2018, pp. 1–6.
[2]
L. Ferrari, N. Karakoc, A. Scaglione, M. Reisslein, and A. Thyagaturu, “Layered cooperative resource sharing at a wireless SDN backhaul,” in Proc. IEEE Int. Conf. Commun. Workshops (ICC Workshops), Kansas City, MO, USA, May 2018, pp. 1–6.
[3]
P. Shantharama, A. S. Thyagaturu, N. Karakoc, L. Ferrari, M. Reisslein, and A. Scaglione, “LayBack: SDN management of multi-access edge computing (MEC) for network access services and radio resource sharing,” IEEE Access, vol. 6, pp. 57545–57561, 2018.
[4]
M. Wanget al., “A multi-layer multi-timescale network utility maximization framework for the SDN-based LayBack architecture enabling wireless backhaul resource sharing,” Electronics, vol. 8, no. 9, pp. 937.1–937.28, Aug. 2019.
[5]
J.-B. Sheu, “A novel dynamic resource allocation model for demand-responsive city logistics distribution operations,” Transp. Res. E: Logistics Transp. Rev., vol. 42, no. 6, pp. 445–472, Nov. 2006.
[6]
Z. Zhou, M. Dong, K. Ota, and Z. Chang, “Energy-efficient context-aware matching for resource allocation in ultra-dense small cells,” IEEE Access, vol. 3, pp. 1849–1860, 2015.
[7]
Z. Liu, Q. Wu, S. Huang, and H. Zhao, “Transactive energy: A review of state of the art and implementation,” in Proc. IEEE Manchester PowerTech, Jun. 2017, pp. 1–6.
[8]
F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control for communication networks: Shadow prices, proportional fairness and stability,” J. Oper. Res. Soc., vol. 49, no. 3, pp. 237–252, Apr. 1998.
[9]
S. H. Low and D. E. Lapsely, “Optimization flow control. I. basic algorithm and convergence,” IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 861–874, Dec. 1999.
[10]
M. Chiang, S. H. Low, R. Calderbank, and J. C. Doyle, “Layering as optimization decomposition,” Proc. IEEE, vol. 95, no. 1, pp. 255–312, Jan. 2007.
[11]
B. Johansson, P. Soldati, and M. Johansson, “Mathematical decomposition techniques for distributed cross-layer optimization of data networks,” IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 1535–1547, Aug. 2006.
[12]
D. P. Palomar and M. Chiang, “Alternative distributed algorithms for network utility maximization: Framework and applications,” IEEE Trans. Autom. Control, vol. 52, no. 12, pp. 2254–2269, Dec. 2007.
[13]
X. Lin, N. B. Shroff, and R. Srikant, “On the connection-level stability of congestion-controlled communication networks,” IEEE Trans. Inf. Theory, vol. 54, no. 5, pp. 2317–2338, May 2008.
[14]
D. P. Bertsekas and J. N. Tsitsiklis, “Gradient convergence in gradient methods with errors,” SIAM J. Optim., vol. 10, no. 3, pp. 627–642, Jan. 2000.
[15]
A. Nedić and D. P. Bertsekas, “The effect of deterministic noise in subgradient methods,” Math. Program., vol. 125, no. 1, pp. 75–99, Sep. 2010.
[16]
M. Mehyar, D. Spanos, and S. H. Low, “Optimization flow control with estimation error,” in Proc. IEEE INFOCOM, Mar. 2004, pp. 984–992.
[17]
J. Zhang, D. Zheng, and M. Chiang, “The impact of stochastic noisy feedback on distributed network utility maximization,” IEEE Trans. Inf. Theory, vol. 54, no. 2, pp. 645–665, Feb. 2008.
[18]
Y. Cui and V. K. N. Lau, “Convergence-optimal quantizer design of distributed contraction-based iterative algorithms with quantized message passing,” IEEE Trans. Signal Process., vol. 58, no. 10, pp. 5196–5205, Oct. 2010.
[19]
N. Gatsis and G. B. Giannakis, “Power control with imperfect exchanges and applications to spectrum sharing,” IEEE Trans. Signal Process., vol. 59, no. 7, pp. 3410–3423, Jul. 2011.
[20]
A. Y. Popkov, “Gradient methods for nonstationary unconstrained optimization problems,” Autom. Remote Control, vol. 66, no. 6, pp. 883–891, Jun. 2005.
[21]
C. Xi and U. A. Khan, “Distributed dynamic optimization over directed graphs,” in Proc. IEEE 55th Conf. Decis. Control (CDC), Dec. 2016, pp. 245–250.
[22]
J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556–567, Oct. 2000.
[23]
A. Beck and M. Teboulle, “A fast iterative shrinkage-thresholding algorithm for linear inverse problems,” SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183–202, Jan. 2009.
[24]
I. Necoara and A. Patrascu, “Iteration complexity analysis of dual first-order methods for conic convex programming,” Optim. Methods Softw., vol. 31, no. 3, pp. 645–678, May 2016.
[25]
H. Yu and M. J. Neely, “On the convergence time of dual subgradient methods for strongly convex programs,” IEEE Trans. Autom. Control, vol. 63, no. 4, pp. 1105–1112, Apr. 2018.
[26]
C. Wilson, V. V. Veeravalli, and A. Nedic, “Adaptive sequential stochastic optimization,” IEEE Trans. Autom. Control, vol. 64, no. 2, pp. 496–509, Feb. 2019.
[27]
P. He, L. Zhao, S. Zhou, and Z. Niu, “Water-filling: A geometric approach and its application to solve generalized radio resource allocation problems,” IEEE Trans. Wireless Commun., vol. 12, no. 7, pp. 3637–3647, Jul. 2013.
[28]
D. P. Palomar and J. R. Fonollosa, “Practical algorithms for a family of waterfilling solutions,” IEEE Trans. Signal Process., vol. 53, no. 2, pp. 686–695, Feb. 2005.
[29]
A. Scaglione, G. B. Giannakis, and S. Barbarossa, “Redundant filterbank precoders and equalizers. I. Unification and optimal designs,” IEEE Trans. Signal Process., vol. 47, no. 7, pp. 1988–2006, Jul. 1999. 10.1109/78.771047.
[30]
E. Telatar, “Capacity of multi-antenna Gaussian channels,” Eur. Trans. Telecommun., vol. 10, no. 6, pp. 585–595, Nov. 1999.
[31]
A. Scaglione, S. Barbarossa, and G. B. Giannakis, “Filterbank transceivers optimizing information rate in block transmissions over dispersive channels,” IEEE Trans. Inf. Theory, vol. 45, no. 3, pp. 1019–1032, Apr. 1999.
[32]
A. Scaglione, S. Barbarossa, and G. B. Giannakis, “Optimal adaptive precoding for frequency-selective Nagakami-m fading channels,” in Proc. Veh. Technol. Conf. Fall IEEE VTS Fall VTC. 52nd Veh. Technol. Conf., vol. 3, Sep. 2000, pp. 1291–1295.
[33]
A. Beck, A. Nedić, A. Ozdaglar, and M. Teboulle, “An O(1/k) gradient method for network resource allocation problems,” IEEE Trans. Control Netw. Syst., vol. 1, no. 1, pp. 64–73, Mar. 2014.
[34]
M. Zargham, A. Ribeiro, A. Ozdaglar, and A. Jadbabaie, “Accelerated dual descent for network flow optimization,” IEEE Trans. Autom. Control, vol. 59, no. 4, pp. 905–920, Apr. 2014.
[35]
Y. Ho, L. Servi, and R. Suri, “A class of center-free resource allocation algorithms,” Large Scale Syst., vol. 1, no. 1, pp. 51–62, 1980.
[36]
L. Xiao and S. Boyd, “Optimal scaling of a gradient method for distributed resource allocation,” J. Optim. Theory Appl., vol. 129, no. 3, pp. 469–488, Dec. 2006.
[37]
D. Bertsekas, Nonlinear Programming. Belmont, MA, USA: Athena Scientific, 1999.

Cited By

View all
  • (2023)Uncertainty-aware Energy Harvest Prediction and Management for IoT DevicesACM Transactions on Design Automation of Electronic Systems10.1145/360637228:5(1-33)Online publication date: 29-Jun-2023
  • (2020)Lifting-Based Fractional Wavelet FilterAdvances in Multimedia10.1155/2020/88236892020Online publication date: 16-Dec-2020

Index Terms

  1. Multi-Layer Decomposition of Network Utility Maximization Problems
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image IEEE/ACM Transactions on Networking
    IEEE/ACM Transactions on Networking  Volume 28, Issue 5
    Oct. 2020
    479 pages

    Publisher

    IEEE Press

    Publication History

    Published: 14 October 2020
    Published in TON Volume 28, Issue 5

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Uncertainty-aware Energy Harvest Prediction and Management for IoT DevicesACM Transactions on Design Automation of Electronic Systems10.1145/360637228:5(1-33)Online publication date: 29-Jun-2023
    • (2020)Lifting-Based Fractional Wavelet FilterAdvances in Multimedia10.1155/2020/88236892020Online publication date: 16-Dec-2020

    View Options

    Get Access

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media