Optimal resource allocation with node and link capacity constraints in complex networks

Rui Li, Yongxiang Xia, Chi Kong Tse

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

With the tremendous increase of the Internet traffic, achieving the best performance with limited resources is becoming an extremely urgent problem. In order to address this concern, in this paper, we build an optimization problem which aims to maximize the total utility of traffic flows with the capacity constraint of nodes and links in the network. Based on Duality Theory, we propose an iterative algorithm which adjusts the rates of traffic flows and capacity of nodes and links simultaneously to maximize the total utility. Simulation results show that our algorithm performs better than the NUP algorithm on BA and ER network models, which has shown to get the best performance so far. Since our research combines the topology information with capacity constraint, it may give some insights for resource allocation in real communication networks.
Original languageEnglish
Title of host publicationIEEE International Symposium on Circuits and Systems
Subtitle of host publicationFrom Dreams to Innovation, ISCAS 2017 - Conference Proceedings
PublisherIEEE
ISBN (Electronic)9781467368520
DOIs
Publication statusPublished - 25 Sep 2017
Event50th IEEE International Symposium on Circuits and Systems, ISCAS 2017 - Baltimore, United States
Duration: 28 May 201731 May 2017

Conference

Conference50th IEEE International Symposium on Circuits and Systems, ISCAS 2017
CountryUnited States
CityBaltimore
Period28/05/1731/05/17

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this