Network Time Balance Management Based on TFRR Optimization Algorithm

Abstract

Network coordination work based on IEEE802.11 protocol will form a network blocking phenomenon when it was accessed into channels at a same site and the same site and with the same rate. According to the analysis of network throughput and fairness theories, this paper presents an optimization algorithm based on the accessibility of TFRR algorithm to network balance, so as to improve the network working performance and avoid the occurrence of channel blocking phenomenon through the round robin queue of adjustable time for. And the tests show that the theoretical basis of the algorithm is feasible in practice with a pure quadratic function, the minimum is reached within N iterations (excepting round-off error), but a non-quadratic function likely to makes slower progress. The subsequent search directions lose noncompliance requiring the search direction to be reset to the steepest descent direction at minimum for every N iterations, or earlier if the progress is contained. If every iteration is reset, then it turns it to the steepest. The algorithm will not work if it gets the minimum, determined when there is no progress after a direction reset (i.e. in the steepest descent direction), or if any tolerance criterion is reached. Within a linear approximation, the parameter α {\displaystyle \displaystyle \alpha} and the parameter β {\displaystyle \displaystyle \beta} are equal in the linear conjugate gradient method and they get the line searches. The conjugate gradient method will follow the narrow or ill-conditioned valleys and the steepest descent method slows down which follows a criss-cross pattern.