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 .