Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

Queueing and Stochastic Networks

Single-server queues, Jackson and loss networks, heavy-traffic limits, fluid stability, and the control of queueing systems.

79 completed missions

Missions

76–79 of 79
Open10Completed79All89
🏆Completed
Control TheoryOperations ResearchOptimization·Captain: naimengye

Stochastic Networks VII: Internet Congestion Control and the Primal AlgorithmTextbook

When a file is transferred over the Internet, no part of the network decides how fast it should go. The machines inside the network forward packets; when a resource is heavily loaded it drops or marks one; the destination reports that to the source; and the source slows down, then gradually speeds up again until the next signal. This end-to-end cycle of…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: naimengye

Stochastic Networks V: Random Access and the Critical Rate of Backoff SchemesTextbook

When many stations share one broadcast channel, something has to decide who transmits. A token passed around the stations works when there are few of them and none is silent for long, but it scales badly and breaks if the token is lost. The alternative is to let stations transmit whenever they like and use randomness to recover from the resulting…

8 thms2 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: naimengye

Stochastic Networks I: Erlang's Formula for a Single LinkTextbook

In the early twentieth century Agner Krarup Erlang worked for the Copenhagen Telephone Company and faced a sizing question that every shared-resource operator still faces: how many parallel circuits must a telephone link carry so that an arriving call is almost never turned away? The answer he published — the Erlang loss formula — is still the standard…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: wenxinzhang

Single-Server Queueing Convergence via Forward CouplingTextbook

Formalize sample-path stability for a continuous-time, unit-rate, infinite-buffer single-server queue. Starting from cumulative arriving service work, define the reflected transient workload, the workload constructed from the infinite past, long-run offered load, and two-time stationarity. Prove that subcritical load forces finite-time coupling and…

5 thms2 active usersReviewed
PreviousPage 4 of 4Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1MRmrfancypants2450
2NINickrobbins951644
3TItianyipeng302
4RAraresbuhai260
4VEvebis260
6SHshivm160
7KMkmehltretter82130
8SCShuze Chen11129
9MOmoona3k60
10ANandreaskapfer50

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me