Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints

Hideaki Iiduka, Masato Uchida

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

In this letter, we develop a novel computational approach for network bandwidth allocation problems in which the compoundable constraints about the preferable transmission rate fall in the infeasible region. The approach is based on an iterative technique for non-convex optimization over the fixed point set of a certain nonexpansive mapping. The realized allocation maximizes a predefined utility and is closest to the preferable transmission rate with respect to the norm. Numerical examples show that our approach is an efficient way to solve the non-concave utility maximization problem.

Original languageEnglish
Article number5752800
Pages (from-to)596-598
Number of pages3
JournalIEEE Communications Letters
Volume15
Issue number6
DOIs
Publication statusPublished - 2011 Jun 1
Externally publishedYes

Keywords

  • Nonexpansive mapping
  • fixed point optimization algorithm
  • network bandwidth allocation problem
  • non-concave utility maximization problem

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints'. Together they form a unique fingerprint.

  • Cite this