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

Hideaki Iiduka, Masato Uchida

Research output: Contribution to journalArticle

10 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
Externally publishedYes

Fingerprint

Fixed-point Algorithm
Bandwidth Allocation
Frequency allocation
Optimization Algorithm
Utility Maximization
Nonconvex Optimization
Fixed Point Set
Nonexpansive Mapping
Maximise
Norm
Numerical Examples

Keywords

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

ASJC Scopus subject areas

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

Cite this

Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints. / Iiduka, Hideaki; Uchida, Masato.

In: IEEE Communications Letters, Vol. 15, No. 6, 5752800, 06.2011, p. 596-598.

Research output: Contribution to journalArticle

@article{b61161191699409aa73f2310f6d8811d,
title = "Fixed point optimization algorithms for network bandwidth allocation problems with compoundable constraints",
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.",
keywords = "fixed point optimization algorithm, network bandwidth allocation problem, non-concave utility maximization problem, Nonexpansive mapping",
author = "Hideaki Iiduka and Masato Uchida",
year = "2011",
month = "6",
doi = "10.1109/LCOMM.2011.040711.101369",
language = "English",
volume = "15",
pages = "596--598",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

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

AU - Iiduka, Hideaki

AU - Uchida, Masato

PY - 2011/6

Y1 - 2011/6

N2 - 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.

AB - 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.

KW - fixed point optimization algorithm

KW - network bandwidth allocation problem

KW - non-concave utility maximization problem

KW - Nonexpansive mapping

UR - http://www.scopus.com/inward/record.url?scp=79959564616&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959564616&partnerID=8YFLogxK

U2 - 10.1109/LCOMM.2011.040711.101369

DO - 10.1109/LCOMM.2011.040711.101369

M3 - Article

VL - 15

SP - 596

EP - 598

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 6

M1 - 5752800

ER -