EN
For a family of maps
$f_{d}(p) = 1 - (1-p/d)^{d}$, d ∈ [2,∞], p ∈ [0,1].
we analyze the speed of convergence (including constants) to the globally attracting neutral fixed point p = 0. The study is motivated by a problem in the optimization of routing. The aim of this paper is twofold: (1) to extend the usage of dynamical systems to unexplored areas of algorithms and (2) to provide a toolbox for a precise analysis of the iterates near a non-degenerate neutral fixed point.