Congestion control Created 2026-10-06 Updated 2026-10-14
Congestion control adjusts user transmission rates in response to load signals from shared resources. A resource can compute its price from local aggregate load, while each user sums prices along its route. Primal congestion potential and dual congestion potential formulations explain equilibrium and stability for suitable monotone response functions.
Assume finitely many nonempty routes, positive weights and adjustment rates, and continuous nonnegative nondecreasing resource prices. Each route must meet a resource whose price is positive somewhere. Then the primal congestion potential has compact superlevel sets inside the positive orthant and a unique maximum. Along gradient flow with diagonal mobility, . The substitution makes the dynamics ordinary gradient flow ascent for . This is strictly concave: the logarithmic terms are strictly concave, and each integrated price is convex and nondecreasing, composed with a convex quadratic load. Thus its continuous gradient is monotone decreasing, which proves uniqueness of trajectories even without differentiability of the prices. Compact trapping and the dissipation identity force every limit point to be the unique maximizer. If every price on some route vanishes identically, its rate instead grows linearly and there is no equilibrium.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 73 4 Solution Created 2026-10-03 Updated 2026-10-14
Interpret as route 's sending rate, as its demand weight, and as its response speed. Resource sees aggregate load and returns the resource congestion price . Route sums these feedback signals to its route congestion price . Its rate increases when and decreases when . At equilibrium, each user balances weighted logarithmic utility against the summed resource prices: .
Take finite route and resource sets, nonempty routes, positive , and initially positive rates. The standard interpretation of increasing prices supplies a price positive somewhere on each route; strictly increasing nonnegative prices automatically do so. More generally, nondecreasing prices suffice provided every route contains at least one resource with a nonzero price function. Define the primal congestion potentialBecause is continuous and nondecreasing, its integral is a convex function. The positive-weight logarithmic sum is strictly concave; subtracting the convex load costs makes a strictly concave function on the positive orthant. Its gradient satisfiesThus this is gradient flow with diagonal mobility, ascending the utility-minus-cost potential.
We must also prove boundedness and existence of an optimizer. For each route choose a resource on it whose price is positive somewhere. Monotonicity supplies constants such that this resource's price is at least for loads at least . Its integrated cost is therefore at least . A resource may be chosen by several routes, but at most times. Since all costs are nonnegative,for a finite constant . Each scalar expression on the right is bounded above and tends to minus infinity as . Consequently a superlevel set is bounded. On a bounded set, if any , its logarithmic term tends to minus infinity while the remaining terms are bounded above. The superlevel set therefore stays away from every zero coordinate and is compact inside the positive orthant. The same argument gives an attained maximum ; strict concavity makes it unique, and its interior first-order equations giveAlong every trajectory,with equality exactly at . Thus the trajectory remains in its compact superlevel set, exists for all positive time, and increases to a finite limit. The nonnegative dissipation on the right has a finite time integral. It is also uniformly continuous: it is a continuous function on the trapped compact set, and the continuous vector field is bounded there, making uniformly Lipschitz in time. The result uniformly continuous integrable functions vanish at infinity gives . Every subsequential limit is therefore a critical point, hence . Compactness then proves the full convergenceContinuity, rather than differentiability, of the prices is enough. For completeness, square-root coordinates for primal congestion control also establish uniqueness of the underlying trajectories: with , the system becomes for . Each resource cost is a convex nondecreasing function composed with a convex quadratic load, while the logarithmic terms remain strictly concave. Hence is concave, and for two trajectories by monotonicity of its gradient. Identical initial data therefore give identical solutions without assuming Lipschitz price functions. If some initial rates are zero, at that boundary, so the nonnegative physical trajectory enters the positive orthant and the same proof applies from any positive time.
There is a genuine qualification if the word increasing is meant merely nondecreasing without a nontrivial-price assumption. With one route, and , the displayed model has , so and no equilibrium. Positive weights, nonempty priced routes, and positive adjustment rates are necessary model assumptions, not consequences of an arbitrary nonnegative continuous price function. Under the standard positive-data, nontrivially priced interpretation, every physical trajectory converges to the unique point proved above.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 30 4 Solution Created 2026-10-03 Updated 2026-10-14
Each user maintains a transmission rate . Resource measures its aggregate load and returns the resource congestion price . The user adds these feedback signals to form its route congestion price . Its increase term is the constant , while its decrease term is proportional to both its current rate and the congestion signal. This is a distributed congestion control algorithm: resources need only local loads, and users need only prices along their own routes.
There is a needed distinction in the word increasing. If it permits nondecreasing price functions, the all-zero prices are allowed. Then , so there is no equilibrium. The intended convergence statement holds when each nonempty route meets at least one resource whose price is positive at some load. This is automatic if every price is strictly increasing and nonnegative. We prove it under the more general nondecreasing assumption with this explicit condition, for finite sets of nonempty routes and nonnegative initial rates.
Write . Each is convex and nondecreasing, and the primal congestion potential isOn positive rates this is strictly concave: the sum of positive-weight logarithms is strictly concave, while the resource term is convex. Its derivatives areConsequently the gradient flow with diagonal mobility satisfieswith equality exactly at an equilibrium.
We must also prove trapping and existence of the equilibrium. For each route choose a resource on it and constants such that its price is at least beyond load . Finiteness gives common constants . If is large, a resource on a maximizing route has load at least , so the resource penalty is at least . With , therefore,Once all rates are bounded above, a rate tending to zero also makes through its positive-weight logarithm. Thus every nonempty superlevel set of is compact inside the positive orthant. A maximum exists by restricting to such a superlevel set, and strict concavity makes it unique, say . It is interior and satisfies , equivalentlyConversely every positive equilibrium is a stationary point of the strictly concave function and hence is this maximum.
Only continuity of the price functions is given, so it is useful to justify trajectories without silently assuming differentiability. Put and . The dynamics become ordinary gradient flow ascent, . The function is strictly concave on the positive orthant: its user terms are plus constants, and each penalty is a convex nondecreasing function composed with the convex load . Hence the supporting-tangent inequalities giveThe squared distance between two solutions is nonincreasing, proving uniqueness even though the vector field need only be continuous.
Nonnegative initial rates enter the positive orthant immediately: along a solution, variation of constants in expresses as a positive exponential times plus a strictly positive integral. Also , so rates cannot become infinite in finite time. The distance argument applies after any positive time and, by taking that time down to zero, also proves uniqueness for initial zero rates.
For a positive starting time, the increasing traps the trajectory in a compact superlevel set. Its derivative has finite integral since is bounded above there. It is uniformly continuous in time, being a continuous function of the state on a compact set with bounded velocity. By uniformly continuous integrable functions vanish at infinity, . Every limit point consequently has for every , since all rates are bounded away from zero. There is only the limit point , soThis establishes global convergence of primal congestion control with the needed nonzero-price condition, and supplies the zero-price counterexample when increasing is read in the weak sense.
For the alternative increasing-supply resource-price dynamics, consider the dual congestion potentialIts domain is with every . Each integrated supply is strictly convex, because is strictly increasing, and each negative logarithm of a positive linear function is convex. Thus is strictly convex. Its sublevel sets are bounded: for each , gives a linear lower bound on the supply primitive at large , whereas the negative logarithmic terms grow only logarithmically in . A route-price sum tending to zero makes on a bounded set. A minimum therefore exists in this domain.
The derivatives areIf a used resource had at the minimum, then but , so increasing that coordinate would strictly lower . Therefore the minimizer has strictly positive prices at every used resource. An unused resource has its unique minimizing price zero. At used resources its equations areThe multiplicative dynamics are . On strictly positive used-resource prices, equilibrium is equivalent to these equations, and strict convexity proves existence and uniqueness of the positive equilibrium. No full-row-rank assumption on is needed here: the strictly increasing individual supplies already give strict convexity.
If zero prices at used resources are allowed, the unqualified uniqueness assertion is false because of boundary equilibria of multiplicative resource prices. For one unit-weight route using two resources and , all three price vectorsare equilibria. At the user rate is one; the first resource has demand equal to supply, while the second has zero derivative because its price is zero. The last two vectors do not minimize . Thus the positive-price domain, or a boundary rule preventing a used resource from remaining at zero price, is essential.
Finally, the primal and dual equilibrium equations agree when and are inverse functions on the relevant ranges. For example, continuous strictly increasing prices with and have inverses satisfying the stated supply assumptions. Then is equivalent to , while both systems have . With inverse price and supply functions, the two equilibria describe the same rates and prices. Without this relation they need not agree: for one route and one resource with , and , the primal equilibrium is while the dual equilibrium is .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 213 4 Solution Created 2026-10-03 Updated 2026-10-06
In congestion control, resource observes only its own aggregate load and generates the nonnegative feedback price . User receives the sum of prices along its route. Its desired increase competes with the congestion charge , while sets the adjustment speed. This is local information: a resource needs the rates passing through it, and a user needs the feedback along its own route, rather than the complete network state.
There is a hypothesis to make explicit before claiming global convergence. If “increasing” means nondecreasing, the printed assumptions allow , in which case and there is no equilibrium point. The intended theorem holds when every route contains at least one resource whose price is not identically zero, with nonempty routes and nonnegative, continuous, nondecreasing prices. Strictly increasing prices satisfy this condition automatically. We prove the theorem under this necessary qualification; without it the zero-price example disproves the literal claim.
Let . Each is a nonnegative convex function. For positive rates define the primal congestion potentialThe weighted logarithmic utility is a strictly concave function, and subtracting the resource costs preserves strict concavity. Thus has at most one maximizer and at most one critical point on the positive orthant.
It also attains its maximum there. A nonzero nondecreasing price is bounded below by some positive constant at all sufficiently large loads; hence its primitive satisfies with . Choose at zero-price resources. The route coverage assumption gives , soThis bounds all superlevel sets of . Within a bounded set, approaching makes . Consequently every nonempty superlevel set is a compact set contained in the positive orthant. A maximizing sequence stays in one such set, giving a unique interior maximizer . Its critical-point equations areThe rate dynamics are the gradient flow with diagonal mobility . Along any positive trajectory,with equality only at . Thus is a strict Lyapunov function. The initial superlevel set traps the trajectory away from both infinity and the boundary, ensuring global continuation. Positive initial rates remain positive: variation of constants in makes this explicit. Starting with finite nonnegative rates also gives positive rates at every later positive time.
For completeness, mere continuity of suffices for convergence; one need not silently assume differentiable prices. On the trapping compact set, both the vector field and are continuous and bounded. The trajectory satisfies a uniform Lipschitz condition in time, so is uniformly continuous. Also , since increases to a finite limit. The decay of a nonnegative uniformly continuous integrable function applies: otherwise disjoint intervals of a fixed positive width would each contribute a fixed positive amount. Every accumulation point therefore has and is . Compactness then proves the global convergenceThis is the dissipation argument behind the LaSalle invariance principle. If uniqueness of trajectories is desired under continuous prices, put . The transformed equation is . The transformed potential is concave: it is a sum of positive multiples of , minus convex nondecreasing composed with nonnegative quadratic sums. Its gradient is monotone decreasing, so the squared distance between two solutions cannot increase. This proves uniqueness for positive initial data without a locally Lipschitz function hypothesis on .
For the alternative price dynamics, restrict first to positive prices on resources used by at least one route, and discard unused resources. Define the dual congestion potentialIts domain has and for every route. Strictly increasing make each strictly convex, and is convex. Thus is a strictly convex function. Each is eventually bounded below by a positive constant, so its integral grows at least linearly, dominating the negative logarithms as . If a route price tends to zero in a bounded set, . Therefore attains a unique minimum on its domain including the admissible boundary faces.
That minimum has every used-resource price positive. At a face , all route prices are still positive and the inward derivative isHence the minimum cannot lie on that face. At the unique interior minimum,Since the price dynamics are , their positive equilibrium points are exactly these critical points. There is one equilibrium in the positive price domain. An unused resource instead has its only nonnegative equilibrium at zero.
The positive-domain qualification matters here even with strictly increasing . If zero prices are admitted, the multiplicative factor permits boundary equilibria of multiplicative price dynamics. Take one route using two resources, , and . Both and are equilibria, with , as is the positive equilibrium , with . Thus the literal assertion of uniqueness on the whole nonnegative orthant is false. A boundary equilibrium need not satisfy load equals supplied capacity at its zero-price resources.
The relationship between the two intended equilibria is inverse resource response. The first system has ; the positive equilibrium of the second has . If on the relevant ranges, these are the same resource equations, and both systems also impose . They therefore have the same rates and prices. For strictly increasing continuous with and unbounded range, the ordinary inverses satisfy all the stated conditions on . With arbitrary independently chosen and , the equilibria need not agree. Under inverse response, and are convex conjugates on the nonnegative half-line, and supplies the Lagrangian dual problem for maximizing the weighted logarithmic utility minus resource costs, up to constants independent of .
For positive rates in congestion control, put and , where is the primal congestion potential. The equation becomes . Positive logarithmic utility weights make strictly concave on the positive orthant. Each integrated nonnegative nondecreasing resource price is a convex nondecreasing function of its load; composing it with the convex quadratic load in preserves convexity. Hence is a strictly concave function, even for prices that are merely continuous. For two solutions, . This proves uniqueness of the flow without assuming local Lipschitz continuity of the price functions.