Fixed Point Optimization Algorithms for Network Bandwidth Allocation Problems with Compoundable Constraints

Author

Iiduka, Hideaki ; Uchida, Masato

Author_Institution

Network Design Res. Center, Kyushu Inst. of Technol., Tokyo, Japan

Volume

15

Issue

6

fYear

2011

fDate

6/1/2011 12:00:00 AM

Firstpage

596

Lastpage

598

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

bandwidth allocation; iterative methods; optimisation; telecommunication networks; compoundable constraint; fixed point optimization algorithm; iterative technique; network bandwidth allocation; nonconvex optimization; nonexpansive mapping; transmission rate; Algorithm design and analysis; Bandwidth; Channel allocation; Convergence; Measurement; Optimization; Resource management; Nonexpansive mapping; fixed point optimization algorithm; network bandwidth allocation problem; non-concave utility maximization problem;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2011.040711.101369

Filename

5752800