For a fixed occupancy , let be the per-flow rate on every active route, so feasibility means . A proportionally fair allocation is a feasible allocation satisfying, for every other feasible ,
The sum counts the proportional changes over individual flows. By the first-order condition for a concave function, it is exactly the allocation solving
This is weighted logarithmic utility optimization, and its negative objective is a strictly convex function, which gives unique rates on active routes. Routes with have no per-flow rate to determine.
Index the four routes by , , , , and let be each route's total service. Write
The four capacity constraints say , , , and . Equivalently,
For fixed maxima , every active route in the first group optimally takes total service , and every active route in the second takes , because its logarithmic objective is increasing. Up to the constant , the objective therefore becomes with . Its maximizer is , when , with the evident endpoint choices when one group is empty. Hence the proportionally fair allocation on a four-cycle is
Set on inactive routes. If , all service totals are zero. In particular, for , , as required. Two disjoint active routes in the same group can each receive the same total service; service totals need not sum to one over the entire network.
With independent document arrivals given by Poisson processes of rates and independent unit-mean exponential distributions for document sizes, each of the active documents has completion rate . The flow-level network model is consequently a continuous-time Markov chain with
At all downward rates are zero. The total departure rate is at most four, so the bounded total jump rate ensures no explosion.
The original PDF's displayed factor is a binomial coefficient, not the plain quotient produced by the TeX extraction. The candidate stationary distribution for this reversible four-cycle flow model is
Use . For and ,
so . For the corresponding ratio is . Thus detailed balance for a continuous-time Markov chain holds for every adjacent pair, proving the displayed stationary distribution whenever .
For completeness, its existence condition can be made explicit. Put and . At fixed ,
Therefore the sum over states with is at most , using the binomial theorem. This is summable if . Conversely, restricting to the single maximizing route in each group leaves the series , which diverges if . Hence
These are exactly the four strict resource-load inequalities. With positive arrival rates the Markov chain is irreducible, so the normalized stationary distribution is unique.
Use the slotted ALOHA model with one outstanding packet per active station and a collision channel: a slot with exactly one attempt succeeds, whereas an idle slot or a slot with two or more attempts delivers nothing. Let be independent Poisson random variables of mean , independent also of the transmission choices. Arrivals join after the current slot's attempts. Given , the attempt count has a binomial distribution with parameters and . Consequently, for ,
For , set and . The equation adds arrivals and removes precisely one packet following a successful slot. The estimate controls the common transmission probability and updates using the idle, success, or collision feedback. The conditional distribution of the next state depends only on , so this pair is a Markov chain.
Away from the reflecting floor in , its one-step conditional expectations are
When and are large with , the Poisson limit theorem gives and . Treating these approximate drifts as derivatives motivates the fluid approximation of slotted ALOHA:
The floor at is negligible in this interior scaling. This calculation motivates the ordinary differential equations; it is not a proof of a stochastic fluid limit.
For , put
Then and . On the domain , introduce time by . Differentiating gives
where .
The function is strictly increasing from zero to infinity, and . To check the monotonicity explicitly,
Indeed, with ,
because its discriminant is ; and . Thus the scalar ordinary differential equation for points toward the unique value satisfying . Every trajectory with , has bounded and . Positivity of follows from .
If , then and . Thus decays exponentially for large , and
This is finite-time draining of a fluid model. The unmodified equations have undefined at the origin, so the statement that trajectories converge to the origin needs this endpoint interpretation; continuing with an absorbing zero trajectory is an additional fluid-model convention, not a solution of the displayed equations at the origin.
If , then and . Now grows exponentially, physical time tends to infinity, and
In particular the trajectory escapes to infinity. Even without the ratio analysis, , since .
For the actual Markov chain, it is essential not to replace the finite- success probability by : a single backlogged packet can succeed with probability one. Instead, for , maximizing over gives the ALOHA throughput bound
If , choose and so that for all , uniformly in . For sufficiently small ,
because its derivative at zero is . Independence of arrivals and attempts gives
whenever . For any integer , stop at the stopping time . The stopped process is a nonnegative supermartingale. The optional stopping theorem, first at bounded times and then by a limit, yields the exponential-supermartingale escape bound
From every state with , a Poisson distribution arrival burst has a uniformly positive probability of sending the next backlog to at least , for any fixed . From there the probability of never revisiting is at least . By the Markov property at successive visits, the probability of infinitely many visits to this strip is zero: each visit has a uniform positive chance of being the last. This holds for every integer , so
Therefore the Markov chain is transient for every finite choice of . The proof is uniform in and does not infer stochastic transience merely from the approximate ordinary differential equations.
Let be the finite, nonempty set of available routes for source-sink pair , and write for a route flow. The link-route incidence matrix has when route uses link , and zero otherwise. The source-sink route incidence matrix has when . Thus gives link throughputs and gives aggregate source-sink flows. A route's delay is
A Wardrop equilibrium uses only routes of minimum delay for their source-sink pair:
An infinitesimal user cannot improve its delay by changing route.
For fixed , the feasible route flows form a nonempty compact convex set: for each , and . Define the Beckmann potential
It is continuous, so the extreme value theorem gives a minimizer. Since every is strictly increasing, is a strictly convex function of . Its route-flow gradient is .
If an occupied route has greater delay than another route , moving a small amount of flow from to gives a negative directional derivative, contradicting minimality. Conversely, at a Wardrop equilibrium, for any feasible ,
The first-order condition for convex optimization therefore proves optimality. Consequently
If two minimizers had different , their midpoint would give a strictly smaller Beckmann potential. Thus the equilibrium link throughputs are unique. The route flows need not be unique, since need not be a strictly convex function of .
For a concrete example, take two successive stages of parallel links: in the first stage and in the second, with one source-sink pair and four routes . Put on every link and total flow . All allocations
have the same link throughputs and every route has delay two. These distinct allocations are all Wardrop equilibria.
For elastic demand, use the standard physical convention that and is finite, continuous, and strictly decreasing. Set and , and define the inverse demand function on . It is continuous and strictly decreasing, with and as . Choose any reference value and set
Each summand of is a strictly convex function. The reference values only add a constant to the objective. In the usual case , one may use a lower limit zero whenever the improper integral is finite; that integrability is not guaranteed merely by continuity of .
Minimize over the compact feasible set , , interpreting the objective at by its one-sided limit, which can be . This extension is sequentially lower semicontinuous, and an interior-demand feasible point has finite value, so a minimizer exists. It cannot have : adding a small amount on any route for has bounded marginal link cost, whereas its marginal demand benefit tends to infinity. Thus .
For , the route-flow partial derivative is . The first-order conditions for convex optimization give
If , reducing any occupied route cannot improve the objective only if that route has zero delay; nonnegative link delays then give . Therefore the conditions in every case are
Conversely these conditions give the nonnegative directional derivative for every feasible competitor and hence minimize the convex function . Allowing explicitly yields the stated form with and , with inverse-demand endpoint conventions understood. In particular, is defined on its demand range, rather than evaluating outside that range.
Strict convexity in the pair proves that the equilibrium aggregate source-sink flows and link throughputs are unique. Individual route flows may still be nonunique. Nonnegative, finite demand, nonnegative delays, finite route sets, and a usable route for each source-sink pair are the implicit modeling assumptions needed for the existence assertions.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact