Referenced Items are not available for this document.
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.
Published in:
Communications Letters, IEEE
(Volume:15
,
Issue:
6
)
Date of Publication: June 2011
- Page(s):
- 596 - 598
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 12063339
- Digital Object Identifier :
- 10.1109/LCOMM.2011.040711.101369
- Product Type:
- Journals & Magazines
- Date of Publication :
- 21 April 2011
- Date of Current Version :
- 20 June 2011
- Issue Date :
- June 2011
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
