Enhanced Fixed-Point Iterative Schemes for Efficient Network Bandwidth Allocation: A Multi-Step Optimization Approach
Keywords:
Edge Bandwidth, Optimizing, Iteration, ConvergenceAbstract
Efficient allocation of network bandwidth is a critical challenge in optimizing network performance. In this study, we compare different fixed-point iterative schemes to determine a most effective approach for solving the bandwidth allocation problem. Our findings indicate that the three-step fixed-point iterative method significantly outperforms the one-step scheme in terms of convergence speed and efficiency. The results suggest that increasing the number of iteration steps beyond four may further enhance the convergence of the allocation point, leading to improved optimization. Building on this insight, we propose future research to develop and analyze a fixed-point iteration method with more than four steps. Such an approach has the potential to offer even greater efficiency in solving network bandwidth allocation problems. The findings of this study provide a foundation for further advancements in iterative optimization techniques for network resource management.
References
Asaduzzaman, M., Khatun, M. S., Ali, M. Z. (2016). On new three-step iterative scheme for approximating the fixed points of non-expansive mappings. JP J. Fixed Point Theory Appl, 11(1), 23-53.
Combettes, P. L. (2003). A block-iterative surrogate constraint splitting method for quadratic signal recovery. IEEE Transactions on Signal Processing, 51(7), 1771-1782.
Higinio, R., Ramandeep, B., Vinay, K., Puneet, S., (2023). A new three-step fixed point iteration scheme with strong convergence and applications. Journal of Computational and Applied Mathematics, 23, 377-427.
Iiduka, H. (2010). A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping. Optimization, 6, 873-885.
Iiduka, H. (2012). Fixed point optimization algorithm and its application to network bandwidth allocation. Journal of Computational and Applied Mathematics, 7, 1733-1742.
Iiduka, H. (2015). Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints. Journal of Computational and Applied Mathematics, S0377-0427(15)00017-5.
Iiduka, H., Yamada, I. (2009). A use of conjugate gradient direction for the convex optimization problem over the fixed point set of a nonexpansive mapping. SIAM Journal on Optimization, 19(4), 1881-1893.
Junzi, Z., Brendan, O'D., Stephen, B. (2020). Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations. SIAM Journal on Optimization, 4, 3170-3197.
Kelly, F. (1997). Charging and rate control for elastic traffic. European transactions on Telecommunications. 8(1), 33-37.
Kritsada, L., Withun, P. (2017). Iterative approaches to solving convex minimization problems and fixed point problems in complete CAT(0) spaces. Numer Algor, 77, 727–740.
Maingé, P. E., Moudafi, A. (2007). Strong convergence of an iterative method for hierarchical fixed-point problems. Pacific Journal of Optimization, 3(3), 529-538.
Rahul, S., Rekha, P. (2022). Some fixed point theorems for generalized enriched nonexpansive mappings in Banach spaces. Rendiconti del Circolo Matematico di Palermo, 2.
Rajendra, P., Rahul, S., Prashant, P. (2021). Nonexpansive Mappings and Their Extensions and Generalizations in Banach Spaces. 309-340.
Slavakis, K., Yamada, I. (2007). Robust wideband beamforming by the hybrid steepest descent method. IEEE Transactions on Signal Processing, 55(9), 4511-4522.
Yamada, I. (2001). The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. Inherently parallel algorithms in feasibility and optimization and their applications, 8, 473-504.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 American Observer PressBy default, articles published in this journal are available under the journal's standard copyright and access policy. Authors who choose the Open Access option by paying the applicable Open Access Charge will have their articles published under the Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) License. The applicable license will be clearly indicated on each published article.
