A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks
DOI10.1016/J.AUTOMATICA.2019.108506zbMATH Open1429.93144OpenAlexW2964597536MaRDI QIDQ2280910FDOQ2280910
Authors: Jingyao Wang, Mahmoud Ashour, Constantino M. Lagoa, N. S. Aybat, Hao Che
Publication date: 19 December 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2019.108506
Recommendations
traffic engineeringconnectionless communication networksfully distributed traffic allocation algorithmnetwork utility maximization problemnonconcave utility function
Utility theory (91B16) Network design and communication in computer systems (68M10) Control/observation systems involving computers (process control, etc.) (93C83) Networked control (93B70)
Cites Work
- Global optimization with polynomials and the problem of moments
- Moments, positive polynomials and their applications
- Title not available (Why is that?)
- Rate control for communication networks: shadow prices, proportional fairness and stability
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Approximate volume and integration for basic semialgebraic sets
- Semidefinite programming for chance constrained optimization over semialgebraic sets
Cited In (3)
This page was built for publication: A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280910)