Network utility problem and easy reliability polynomials

Author(s):  
Eduardo Canale ◽  
Pablo Romero ◽  
Gerardo Rubino ◽  
Xavier Warnes
2016 ◽  
Vol 39 (6) ◽  
pp. 620-622 ◽  
Author(s):  
HTIN AUNG ◽  
RAUL E. ESPINOSA ◽  
BRIAN D. POWELL ◽  
CHRISTOPHER J. MCLEOD

Author(s):  
Barry Smyth ◽  
Pádraig Cunningham
Keyword(s):  

Entropy ◽  
2019 ◽  
Vol 21 (7) ◽  
pp. 708
Author(s):  
Shengbin Liao ◽  
Jianyong Sun

Classical network utility maximization (NUM) models fail to capture network dynamics, which are of increasing importance for modeling network behaviors. In this paper, we consider the NUM with delivery contracts, which are constraints to the classical model to describe network dynamics. This paper investigates a method to distributively solve the given problem. We first transform the problem into an equivalent model of linear equations by dual decomposition theory, and then use Gaussian belief propagation algorithm to solve the equivalent issue distributively. The proposed algorithm has faster convergence speed than the existing first-order methods and distributed Newton method. Experimental results have demonstrated the effectiveness of our proposed approach.


Sign in / Sign up

Export Citation Format

Share Document