Network utility maximisation through particle swarm optimisation
by Tua A. Tamba; Endra Joelianto
International Journal of Systems, Control and Communications (IJSCC), Vol. 10, No. 1, 2019

Abstract: Given a network system with several nodes that are linked together in a certain topology, the network utility maximisation (NUM) problem is concerned with searching for the maximum aggregate utility function of all nodes under the constraint of limited link capacities. This paper proposes the use of a gradient-free, stochastic optimisation approach based on particle swarm optimisation (PSO) method for solving the NUM problem. In contrast to much of the prior solution methods which often assume the concavity of the network's utility function, the proposed PSO approach is capable of solving NUM problems with either concave or nonconcave utility functions. We show through simulation results of solving NUM problems in medium size networks that the optimal solutions obtained by the proposed PSO method indeed correspond to the exact global optima.

Online publication date: Mon, 21-Jan-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com