Let a flow be a sequence of packets that are sent from a source computer to a destination computer. In this paper, we consider the fair allocation of bandwidth to each flow in a computer network. We focus on max-min fairness, which assigns to each flow the largest possible bandwidth that avoids affecting other flows. What distinguishes our approach is that routers only maintain a constant amount of state, i.e., no per-flow state is maintained. This is consistent with trends in the Internet (such as the proposed Differentiated Services Internet architecture). In addition, to provide a high degree of fault-tolerance, we ensure our approach is self-stabilizing, that is, it returns to a normal operating state after a finite sequence of faults. © 2010 Elsevier B.V. All rights reserved.
Cobb, J. A., & Gouda, M. G. (2011). Stabilization of max-min fair networks without per-flow state. In Theoretical Computer Science (Vol. 412, pp. 5562–5579). Elsevier B.V. https://doi.org/10.1016/j.tcs.2010.11.042