most-queue 2.7__tar.gz → 2.9__tar.gz

{most_queue-2.7 → most_queue-2.9}/.gitignore

@@ -162,11 +162,32 @@ cython_debug/
 
 .vscode
 
-works/negative_queues/results/*
+# works/negative_queues (article sources, figures, scripts)
+# keep sources in git, ignore generated artifacts and bulky results
+works/negative_queues/*.zip
+works/negative_queues_takahasi_takami_sources.zip
+works/negative_queues/build/
+works/negative_queues/results/
+works/negative_queues/__pycache__/
+works/negative_queues/*.aux
+works/negative_queues/*.bbl
+works/negative_queues/*.bcf
+works/negative_queues/*.blg
+works/negative_queues/*.fdb_latexmk
+works/negative_queues/*.fls
+works/negative_queues/*.log
+works/negative_queues/*.out
+works/negative_queues/*.run.xml
+works/negative_queues/*.synctex.gz
+works/negative_queues/*.toc
+works/negative_queues/**/*.bkp
 
 # ignore all png files in tests/units folder
 tests/units/*.png
 
+# Generated by examples/srpt_table.py (matplotlib)
+examples/srpt_table.png
+
 # ignore all files in works/vacations/results
 works/vacations/results/*
 
@@ -174,3 +195,9 @@ works/vacations/results/*
 docs/negative_queues_takahasi_takami.md
 docs/negative_queues_figures/
 docs/books/
+docs/статьи/
+works/queueing_systems_review/SRPT/pdf/
+works/experiments/rabbitmq_prefetch/
+works/reviews/
+# RDR paper PDF (external, not redistributed) — keep only COVERAGE.md audit
+works/articles/multichannel-pr/*.pdf

most_queue-2.9/PKG-INFO

@@ -0,0 +1,200 @@
+Metadata-Version: 2.4
+Name: most_queue
+Version: 2.9
+Summary: Software package for calculation and simulation of queuing systems
+Project-URL: Homepage, https://github.com/xabarov/most-queue
+Author-email: Xabarov Roman <xabarov1985@gmail.com>
+License: Copyright (c) 2018 The Python Packaging Authority
+        
+        Permission is hereby granted, free of charge, to any person obtaining a copy
+        of this software and associated documentation files (the "Software"), to deal
+        in the Software without restriction, including without limitation the rights
+        to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+        copies of the Software, and to permit persons to whom the Software is
+        furnished to do so, subject to the following conditions:
+        
+        The above copyright notice and this permission notice shall be included in all
+        copies or substantial portions of the Software.
+        
+        THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+        IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+        FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+        AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+        LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+        OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+        SOFTWARE.
+License-File: LICENSE
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Requires-Python: >=3.9
+Requires-Dist: colorama
+Requires-Dist: graphviz
+Requires-Dist: matplotlib
+Requires-Dist: networkx
+Requires-Dist: numpy
+Requires-Dist: pandas
+Requires-Dist: pyyaml
+Requires-Dist: scipy<2.0,>=1.13.0
+Requires-Dist: tqdm
+Description-Content-Type: text/markdown
+
+<div align="center">
+
+# Most-Queue
+
+**Queueing theory in Python: exact analytical solvers paired with discrete-event simulation — for 50+ models from M/M/1 to multiserver-jobs, RDR priorities, SRPT scheduling, age of information, vacations and queueing networks.**
+
+[🇷🇺 Русская версия](README.ru.md)
+
+[![Tests](https://github.com/xabarov/most-queue/actions/workflows/tests.yml/badge.svg)](https://github.com/xabarov/most-queue/actions/workflows/tests.yml)
+[![PyPI version](https://img.shields.io/pypi/v/most-queue)](https://pypi.org/project/most-queue/)
+[![Python versions](https://img.shields.io/pypi/pyversions/most-queue)](https://pypi.org/project/most-queue/)
+[![License](https://img.shields.io/pypi/l/most-queue)](https://github.com/xabarov/most-queue/blob/main/LICENSE)
+[![Downloads](https://static.pepy.tech/badge/most-queue)](https://pepy.tech/project/most-queue)
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.21268402.svg)](https://doi.org/10.5281/zenodo.21268402)
+[![GitHub commit activity](https://img.shields.io/github/commit-activity/m/xabarov/most-queue)](https://github.com/xabarov/most-queue/commits/main)
+
+<img src="https://raw.githubusercontent.com/xabarov/most-queue/main/assets/most-queue-nano1.jpeg" alt="Most-Queue banner" width="720"/>
+
+</div>
+
+## Why Most-Queue?
+
+- **Analytics and simulation together.** Nearly every analytical calculator ships with a paired
+  discrete-event simulator, and the test suite cross-validates them against each other. You get
+  fast exact numbers *and* a way to check them.
+- **Models you won't find elsewhere in open source**: size-based scheduling analytics
+  (SRPT, SJF, PSJF, SPJF with ML-style size predictions, FB/LAS), M/G/1 vacation models,
+  negative customers (RCS / disasters), unreliable servers, multi-server phase-type systems
+  solved by the Takahashi–Takami method (including CV < 1 via complex-fit H₂).
+- **Moments, not just means**: waiting/sojourn time raw moments, state probabilities,
+  utilization — with a uniform `set_sources() / set_servers() / run()` API across all models.
+- **Pure Python + NumPy/SciPy**, pip-installable, MIT license.
+
+## Installation
+
+```bash
+pip install most-queue
+```
+
+Requires Python ≥ 3.9. For network visualization you may also need the system `graphviz` package.
+
+## Quick start: theory vs simulation in 20 lines
+
+```python
+from most_queue.theory.fifo.mmnr import MMnrCalc
+from most_queue.sim.base import QsSim
+
+# Analytical M/M/3 with a finite queue
+calc = MMnrCalc(n=3, r=100)
+calc.set_sources(l=2.0)
+calc.set_servers(mu=1.0)
+theory = calc.run()
+
+# The same system, simulated
+sim = QsSim(3)
+sim.set_sources(2.0, "M")
+sim.set_servers(1.0, "M")
+experiment = sim.run(100_000)
+
+print(f"Mean waiting time: theory {theory.w[0]:.3f} vs simulation {experiment.w[0]:.3f}")
+# Mean waiting time: theory 0.444 vs simulation 0.448
+```
+
+## Showcase: who pays for the scheduling discipline?
+
+Computed by the library's own calculators — conditional slowdown `E[T(x)]/x` by job size
+for FCFS, PS, FB (blind) and SRPT (size-aware):
+
+<img src="https://raw.githubusercontent.com/xabarov/most-queue/main/docs/figures/slowdown.png" alt="Slowdown by job size for FCFS/PS/FB/SRPT" width="720"/>
+
+See the executable comparison of **9 disciplines** in
+[`tutorials/disciplines_comparison.ipynb`](tutorials/disciplines_comparison.ipynb).
+
+## What's inside
+
+| Family | Models | Method |
+|---|---|---|
+| Classic FIFO | M/M/c, M/M/c/r, Erlang B/C, M/G/1, GI/M/c, M/D/c, Eₖ/D/c, M/G/∞ | exact |
+| Multi-server phase-type | M/H₂/c, H₂/M/c, H₂/H₂/c (CV < 1 via complex fit) | Takahashi–Takami |
+| Size-based scheduling | M/G/1 SRPT, SJF, PSJF, SPJF (with size predictors + graceful-degradation curves), FB/LAS, PS, LCFS-PR | exact (Schrage–Miller, Mitzenmacher) |
+| Priorities | M/G/1 PR/NP multi-class, M/G/c PR/NP, M/Ph/c PR; **RDR** M/M/k & M/PH/k multi-class (exact + RDR-A), per-class response variance | exact / RDR / invariant approximation |
+| Multiserver-job (MSJ) | jobs holding several servers at once — FCFS response time, saturated-system stability/throughput | exact CTMC / saturated product-form |
+| Age of Information | M/M/1, M/G/1, preemptive-LCFS — average & peak AoI | closed-form + simulation |
+| Vacations & warm-up | M/G/1 multiple vacations, N-policy, warm-up/cooling/delay (M/Ph/c) | Fuhrmann–Cooper, Takahashi–Takami |
+| Negative customers | M/G/1 and M/G/c with RCS or disasters | exact / Takahashi–Takami |
+| Reliability | M/G/1 with breakdowns & repairs | Avi-Itzhak–Naor |
+| Matrix-analytic (MAP/PH) | MAP/PH/1, M/PH/1, PH/PH/1, MAP/M/c, MAP/PH/c — correlated (bursty) arrivals, single- & multi-server; MMPP fitting | QBD, logarithmic reduction |
+| Batch Markovian arrivals | BMAP/M/1, BMAP/PH/1 — correlated batch traffic | level truncation |
+| Retrial & abandonment | M/M/1 and M/G/1 retrial (orbit), Erlang-A (M/M/n+M) with staffing | exact / Falin–Templeton |
+| GI/G approximations | GI/G/1, GI/G/m mean waiting time | Kingman, Krämer–Langenbach-Belz, Allen–Cunneen |
+| Batch arrivals & bulk service | Mˣ/M/1 batch arrivals; M/M^[a,b]/1 bulk (batch) service — LLM inference batching | exact |
+| Impatience & closed | M/M/1+M, Engset | exact |
+| Parallel service | Fork-Join, Split-Join | Markovian / order statistics |
+| Networks | open networks, priority networks, networks with negative customers, routing optimization | decomposition |
+
+Every model comes with a plain-language explanation and a diagram in the
+[illustrated model catalog](docs/models.md).
+
+## Documentation & tutorials
+
+- 📖 [Documentation](docs/README.md) — concepts, calculation and simulation guides (English; Russian versions available via in-page switchers)
+- 🎓 [Jupyter tutorials](tutorials/) — from a first M/M/1 to Takahashi–Takami and SRPT
+- 🗺 [Development roadmaps](docs/epics/README.md) — what's next (closed networks / MVA, multi-server retrial, polling)
+- 🧪 [Tests](tests/) — every model validated against simulation; run with `pytest -m "not slow"`
+
+## Applications
+
+Capacity planning for cloud services and data centers · call-center staffing ·
+manufacturing lines · telecom traffic · healthcare resource planning ·
+scheduling research (SRPT/LAS with ML size predictions).
+
+## Recent highlights
+
+- **2026 (v2.9)** — **Datacenter & multi-priority wave**: **RDR** for multi-server multi-class
+  preemptive priorities (M/M/k and M/PH/k, exact + RDR-A, per-class response-time variance);
+  the **multiserver-job** model (jobs holding several servers at once — FCFS response time and
+  saturated-system stability, the first open-source implementation); **Age of Information**
+  (average & peak AoI); **bulk-service** queues for LLM inference batching; and
+  **graceful-degradation curves** for prediction-based scheduling. See the
+  [trends survey](docs/research/queueing-trends-2026.md).
+- **2026** — **Matrix-analytic MAP/PH stack**: PH distributions and MAPs
+  (`most_queue.random.map_ph`), a QBD solver with logarithmic reduction, and exact calculators
+  for MAP/PH/1, M/PH/1, PH/PH/1, **MAP/M/c**, **MAP/PH/c**, plus **BMAP/M/1** and **BMAP/PH/1**
+  for batch arrivals and **MMPP fitting** from data; MAP and PH sources in the simulator. Plus
+  retrial queues (orbit) and Erlang-A abandonment with a staffing helper.
+  See [`tutorials/map_ph_correlation.ipynb`](tutorials/map_ph_correlation.ipynb).
+- **2026** — Wave of exact classics: Erlang B/C, M/G/∞, GI/G approximations, M/G/1 vacation
+  models (multiple vacations, N-policy), PS, LCFS-PR, FB/LAS, unreliable server — each with a
+  paired simulator and tests. Illustrated model catalog with generated diagrams.
+- **2026** — Size-based scheduling analytics: SRPT / SJF / PSJF / SPJF with prediction models
+  (reproduces the Mitzenmacher–Shahout 2025 table in tests) + `SizeBasedQsSim`.
+- **2026 (preprint)** — Multi-server queues with negative customers via Takahashi–Takami:
+  [preprint & reproduction code](works/negative_queues/).
+- **2025 (paper)** — Multi-channel system with warm-up, cooling and cooling delay:
+  Lokhvitsky, Khabarov, Yakovlev, DOI [10.25791/aviakosmos.1.2025.1456](https://doi.org/10.25791/aviakosmos.1.2025.1456).
+
+## Contributing
+
+Issues and pull requests are welcome! Open an [issue](https://github.com/xabarov/most-queue/issues)
+for bugs or model requests. Development conventions: [docs/PROJECT.md](docs/PROJECT.md),
+definition of done: [docs/DOD.md](docs/DOD.md).
+
+## Citation
+
+If you use Most-Queue in research, please cite it (see [`CITATION.cff`](CITATION.cff)):
+
+```bibtex
+@software{most_queue,
+  author  = {Khabarov, Roman},
+  title   = {Most-Queue: queueing theory calculations and simulation in Python},
+  url     = {https://github.com/xabarov/most-queue},
+  doi     = {10.5281/zenodo.21268402},
+  license = {MIT}
+}
+```
+
+## License
+
+[MIT](LICENSE) © Roman Khabarov

most_queue-2.9/README.md

@@ -0,0 +1,159 @@
+<div align="center">
+
+# Most-Queue
+
+**Queueing theory in Python: exact analytical solvers paired with discrete-event simulation — for 50+ models from M/M/1 to multiserver-jobs, RDR priorities, SRPT scheduling, age of information, vacations and queueing networks.**
+
+[🇷🇺 Русская версия](README.ru.md)
+
+[![Tests](https://github.com/xabarov/most-queue/actions/workflows/tests.yml/badge.svg)](https://github.com/xabarov/most-queue/actions/workflows/tests.yml)
+[![PyPI version](https://img.shields.io/pypi/v/most-queue)](https://pypi.org/project/most-queue/)
+[![Python versions](https://img.shields.io/pypi/pyversions/most-queue)](https://pypi.org/project/most-queue/)
+[![License](https://img.shields.io/pypi/l/most-queue)](https://github.com/xabarov/most-queue/blob/main/LICENSE)
+[![Downloads](https://static.pepy.tech/badge/most-queue)](https://pepy.tech/project/most-queue)
+[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.21268402.svg)](https://doi.org/10.5281/zenodo.21268402)
+[![GitHub commit activity](https://img.shields.io/github/commit-activity/m/xabarov/most-queue)](https://github.com/xabarov/most-queue/commits/main)
+
+<img src="https://raw.githubusercontent.com/xabarov/most-queue/main/assets/most-queue-nano1.jpeg" alt="Most-Queue banner" width="720"/>
+
+</div>
+
+## Why Most-Queue?
+
+- **Analytics and simulation together.** Nearly every analytical calculator ships with a paired
+  discrete-event simulator, and the test suite cross-validates them against each other. You get
+  fast exact numbers *and* a way to check them.
+- **Models you won't find elsewhere in open source**: size-based scheduling analytics
+  (SRPT, SJF, PSJF, SPJF with ML-style size predictions, FB/LAS), M/G/1 vacation models,
+  negative customers (RCS / disasters), unreliable servers, multi-server phase-type systems
+  solved by the Takahashi–Takami method (including CV < 1 via complex-fit H₂).
+- **Moments, not just means**: waiting/sojourn time raw moments, state probabilities,
+  utilization — with a uniform `set_sources() / set_servers() / run()` API across all models.
+- **Pure Python + NumPy/SciPy**, pip-installable, MIT license.
+
+## Installation
+
+```bash
+pip install most-queue
+```
+
+Requires Python ≥ 3.9. For network visualization you may also need the system `graphviz` package.
+
+## Quick start: theory vs simulation in 20 lines
+
+```python
+from most_queue.theory.fifo.mmnr import MMnrCalc
+from most_queue.sim.base import QsSim
+
+# Analytical M/M/3 with a finite queue
+calc = MMnrCalc(n=3, r=100)
+calc.set_sources(l=2.0)
+calc.set_servers(mu=1.0)
+theory = calc.run()
+
+# The same system, simulated
+sim = QsSim(3)
+sim.set_sources(2.0, "M")
+sim.set_servers(1.0, "M")
+experiment = sim.run(100_000)
+
+print(f"Mean waiting time: theory {theory.w[0]:.3f} vs simulation {experiment.w[0]:.3f}")
+# Mean waiting time: theory 0.444 vs simulation 0.448
+```
+
+## Showcase: who pays for the scheduling discipline?
+
+Computed by the library's own calculators — conditional slowdown `E[T(x)]/x` by job size
+for FCFS, PS, FB (blind) and SRPT (size-aware):
+
+<img src="https://raw.githubusercontent.com/xabarov/most-queue/main/docs/figures/slowdown.png" alt="Slowdown by job size for FCFS/PS/FB/SRPT" width="720"/>
+
+See the executable comparison of **9 disciplines** in
+[`tutorials/disciplines_comparison.ipynb`](tutorials/disciplines_comparison.ipynb).
+
+## What's inside
+
+| Family | Models | Method |
+|---|---|---|
+| Classic FIFO | M/M/c, M/M/c/r, Erlang B/C, M/G/1, GI/M/c, M/D/c, Eₖ/D/c, M/G/∞ | exact |
+| Multi-server phase-type | M/H₂/c, H₂/M/c, H₂/H₂/c (CV < 1 via complex fit) | Takahashi–Takami |
+| Size-based scheduling | M/G/1 SRPT, SJF, PSJF, SPJF (with size predictors + graceful-degradation curves), FB/LAS, PS, LCFS-PR | exact (Schrage–Miller, Mitzenmacher) |
+| Priorities | M/G/1 PR/NP multi-class, M/G/c PR/NP, M/Ph/c PR; **RDR** M/M/k & M/PH/k multi-class (exact + RDR-A), per-class response variance | exact / RDR / invariant approximation |
+| Multiserver-job (MSJ) | jobs holding several servers at once — FCFS response time, saturated-system stability/throughput | exact CTMC / saturated product-form |
+| Age of Information | M/M/1, M/G/1, preemptive-LCFS — average & peak AoI | closed-form + simulation |
+| Vacations & warm-up | M/G/1 multiple vacations, N-policy, warm-up/cooling/delay (M/Ph/c) | Fuhrmann–Cooper, Takahashi–Takami |
+| Negative customers | M/G/1 and M/G/c with RCS or disasters | exact / Takahashi–Takami |
+| Reliability | M/G/1 with breakdowns & repairs | Avi-Itzhak–Naor |
+| Matrix-analytic (MAP/PH) | MAP/PH/1, M/PH/1, PH/PH/1, MAP/M/c, MAP/PH/c — correlated (bursty) arrivals, single- & multi-server; MMPP fitting | QBD, logarithmic reduction |
+| Batch Markovian arrivals | BMAP/M/1, BMAP/PH/1 — correlated batch traffic | level truncation |
+| Retrial & abandonment | M/M/1 and M/G/1 retrial (orbit), Erlang-A (M/M/n+M) with staffing | exact / Falin–Templeton |
+| GI/G approximations | GI/G/1, GI/G/m mean waiting time | Kingman, Krämer–Langenbach-Belz, Allen–Cunneen |
+| Batch arrivals & bulk service | Mˣ/M/1 batch arrivals; M/M^[a,b]/1 bulk (batch) service — LLM inference batching | exact |
+| Impatience & closed | M/M/1+M, Engset | exact |
+| Parallel service | Fork-Join, Split-Join | Markovian / order statistics |
+| Networks | open networks, priority networks, networks with negative customers, routing optimization | decomposition |
+
+Every model comes with a plain-language explanation and a diagram in the
+[illustrated model catalog](docs/models.md).
+
+## Documentation & tutorials
+
+- 📖 [Documentation](docs/README.md) — concepts, calculation and simulation guides (English; Russian versions available via in-page switchers)
+- 🎓 [Jupyter tutorials](tutorials/) — from a first M/M/1 to Takahashi–Takami and SRPT
+- 🗺 [Development roadmaps](docs/epics/README.md) — what's next (closed networks / MVA, multi-server retrial, polling)
+- 🧪 [Tests](tests/) — every model validated against simulation; run with `pytest -m "not slow"`
+
+## Applications
+
+Capacity planning for cloud services and data centers · call-center staffing ·
+manufacturing lines · telecom traffic · healthcare resource planning ·
+scheduling research (SRPT/LAS with ML size predictions).
+
+## Recent highlights
+
+- **2026 (v2.9)** — **Datacenter & multi-priority wave**: **RDR** for multi-server multi-class
+  preemptive priorities (M/M/k and M/PH/k, exact + RDR-A, per-class response-time variance);
+  the **multiserver-job** model (jobs holding several servers at once — FCFS response time and
+  saturated-system stability, the first open-source implementation); **Age of Information**
+  (average & peak AoI); **bulk-service** queues for LLM inference batching; and
+  **graceful-degradation curves** for prediction-based scheduling. See the
+  [trends survey](docs/research/queueing-trends-2026.md).
+- **2026** — **Matrix-analytic MAP/PH stack**: PH distributions and MAPs
+  (`most_queue.random.map_ph`), a QBD solver with logarithmic reduction, and exact calculators
+  for MAP/PH/1, M/PH/1, PH/PH/1, **MAP/M/c**, **MAP/PH/c**, plus **BMAP/M/1** and **BMAP/PH/1**
+  for batch arrivals and **MMPP fitting** from data; MAP and PH sources in the simulator. Plus
+  retrial queues (orbit) and Erlang-A abandonment with a staffing helper.
+  See [`tutorials/map_ph_correlation.ipynb`](tutorials/map_ph_correlation.ipynb).
+- **2026** — Wave of exact classics: Erlang B/C, M/G/∞, GI/G approximations, M/G/1 vacation
+  models (multiple vacations, N-policy), PS, LCFS-PR, FB/LAS, unreliable server — each with a
+  paired simulator and tests. Illustrated model catalog with generated diagrams.
+- **2026** — Size-based scheduling analytics: SRPT / SJF / PSJF / SPJF with prediction models
+  (reproduces the Mitzenmacher–Shahout 2025 table in tests) + `SizeBasedQsSim`.
+- **2026 (preprint)** — Multi-server queues with negative customers via Takahashi–Takami:
+  [preprint & reproduction code](works/negative_queues/).
+- **2025 (paper)** — Multi-channel system with warm-up, cooling and cooling delay:
+  Lokhvitsky, Khabarov, Yakovlev, DOI [10.25791/aviakosmos.1.2025.1456](https://doi.org/10.25791/aviakosmos.1.2025.1456).
+
+## Contributing
+
+Issues and pull requests are welcome! Open an [issue](https://github.com/xabarov/most-queue/issues)
+for bugs or model requests. Development conventions: [docs/PROJECT.md](docs/PROJECT.md),
+definition of done: [docs/DOD.md](docs/DOD.md).
+
+## Citation
+
+If you use Most-Queue in research, please cite it (see [`CITATION.cff`](CITATION.cff)):
+
+```bibtex
+@software{most_queue,
+  author  = {Khabarov, Roman},
+  title   = {Most-Queue: queueing theory calculations and simulation in Python},
+  url     = {https://github.com/xabarov/most-queue},
+  doi     = {10.5281/zenodo.21268402},
+  license = {MIT}
+}
+```
+
+## License
+
+[MIT](LICENSE) © Roman Khabarov

most_queue-2.9/docs/README.md

@@ -0,0 +1,120 @@
+# Most-Queue Library Documentation
+
+[🇷🇺 Русская версия](README.ru.md)
+
+![Queue](../assets/most-queue-nano1.jpeg)
+
+**Most-Queue** is a Python library for simulation and numerical analysis of queueing systems and queueing networks.
+
+## 📚 Documentation Guide
+
+### Getting Started
+- **[Quick Start](getting_started.md)** — installation and first usage examples
+- **[Core Concepts](concepts.md)** — queueing theory and terminology
+- **[Thesaurus](tesaurus.md)** — glossary of queueing theory terms
+
+### Main Sections
+- **[Queueing System Simulation](simulation.md)** — guide to modeling queueing systems (including the *SizeBasedQsSim* section — SRPT, SJF, SPJF, etc.)
+- **[Numerical Methods](calculation.md)** — computing queueing system characteristics with analytical methods (including the *Size-based M/G/1 calculators* section)
+- **[Distributions](distributions.md)** — reference for supported distributions
+- **[Queueing Models](models.md)** — catalog of supported queueing system types
+
+### For Developers
+- **[Project Overview](PROJECT.md)** (in Russian) — repository layout, conventions, where to find the theory
+- **[Infrastructure](INFRASTRUCTURE.md)** (in Russian) — building, testing, code quality, publishing
+- **[Definition of Done](DOD.md)** (in Russian) — task completion criteria
+- **[Epics](epics/README.md)** (in Russian) — planning of major development directions
+- **[Model Gap Analysis](models_gap_analysis.md)** (in Russian) — what is implemented, what is missing, priorities (EPIC-001)
+
+### Specialized Topics
+- **[SRPT / SPJF: Calculation Methods and Verification](srpt_spjf_methods.md)** — formulas, numerical scheme (grids, Simpson, quad), comparison with `SizeBasedQsSim` and tests (per the [roadmap](roadmaps/srpt_spjf_roadmap.md) (in Russian))
+- **[Queueing Networks](networks.md)** — simulation and calculation of queueing networks
+- **[Priority Systems](priorities.md)** — systems with priority service
+- **[Disasters (negative customers): Time Characteristics](negative_disasters_time_characteristics.md)** — computing \(W, V, V_{served}, V_{broken}\) via LST
+- **[RCS (negative customers): Time Characteristics](negative_rcs_time_characteristics.md)** — computing \(W, V, V_{served}, V_{broken}\) in the RCS model
+- **[Advanced Examples](examples.md)** — practical cases and complex scenarios
+
+## 🎯 Key Features
+
+### Simulation
+- Modeling of various queueing system types (M/M/c, M/G/1, GI/M/c, and others)
+- Support for a variety of arrival and service time distributions
+- Systems with priorities, vacations, negative customers
+- Fork-Join and Split-Join systems
+- Queueing networks
+
+### Numerical Methods
+- Analytical calculation of steady-state characteristics
+- Methods for various queueing system types
+- High calculation accuracy
+- Fast results
+
+### Result Analysis
+- Moments of waiting and sojourn times
+- System state probabilities
+- Utilization factor
+- Visualization and result tables
+
+## 📦 Installation
+
+```bash
+pip install most-queue
+```
+
+Or install from the repository:
+
+```bash
+pip install -e .
+```
+
+## 🔍 Quick Example
+
+```python
+from most_queue.sim.base import QsSim
+
+# Create an M/M/1 system simulator
+qs = QsSim(num_of_channels=1)
+
+# Configure the arrival process (Poisson with rate 0.5)
+qs.set_sources(0.5, "M")
+
+# Configure the service (exponential with rate 1.0)
+qs.set_servers(1.0, "M")
+
+# Run the simulation for 10000 jobs
+results = qs.run(10000)
+
+# Get the results
+print(f"Mean waiting time: {results.w[0]:.4f}")
+print(f"Mean sojourn time: {results.v[0]:.4f}")
+print(f"Utilization factor: {results.utilization:.4f}")
+```
+
+## 📖 Library Structure
+
+The library consists of two main modules:
+
+- **`most_queue.sim`** — queueing system simulation module
+- **`most_queue.theory`** — numerical calculation methods module
+
+## 🧪 Examples and Tests
+
+- Usage examples can be found in the [`tests/`](../tests/) folder
+- Jupyter tutorials are available in the [`tutorials/`](../tutorials/) folder
+
+## 📝 Version
+
+Current version: **2.8**
+
+## 🔗 Useful Links
+
+- [GitHub Repository](https://github.com/xabarov/most-queue)
+- [Issues and Suggestions](https://github.com/xabarov/most-queue/issues)
+
+## 👥 Contact
+
+For questions and suggestions: xabarov1985@gmail.com
+
+---
+
+**Note**: This documentation is in English. Russian versions of the pages are available via the language-switcher links at the top of each page.

most_queue-2.9/docs/epics/README.md

@@ -0,0 +1,59 @@
+# Эпики Most-Queue
+
+Папка с эпиками — крупными направлениями разработки. Каждый эпик — отдельный файл
+`EPIC-NNN-<slug>.md` с последовательной нумерацией.
+
+## Процесс
+
+1. Новое направление → новый файл эпика по шаблону ниже, статус `proposed`.
+2. Эпик декомпозируется на задачи (чек-лист внутри файла). Детальный технический план
+   при необходимости выносится в `docs/roadmaps/` (взаимные ссылки обязательны).
+3. В работе — статус `in progress`; по завершении — `done` + раздел «Результаты».
+   Критерии готовности — [../DOD.md](../DOD.md).
+4. Статусы задач отмечаются прямо в чек-листе эпика; история — через git.
+
+## Шаблон эпика
+
+```markdown
+# EPIC-NNN: <Название>
+
+- **Статус:** proposed | in progress | done | dropped
+- **Создан:** YYYY-MM-DD
+- **Roadmap:** ссылка на docs/roadmaps/... (если есть)
+
+## Цель
+Зачем это нужно и что изменится в библиотеке.
+
+## Контекст
+Текущее состояние, источники, ограничения.
+
+## Задачи
+- [ ] ...
+
+## Критерии готовности (DoD эпика)
+Специфичные для эпика критерии + общий DoD.
+
+## Результаты
+Заполняется по завершении.
+```
+
+## Реестр эпиков
+
+| № | Эпик | Статус |
+|---|------|--------|
+| [EPIC-001](EPIC-001-queueing-models-gap-analysis.md) | Исследование: модели теории очередей vs реализованные | done |
+| [EPIC-002](EPIC-002-wave1-exact-models.md) | Волна 1: точные базовые модели (Erlang B/C, M/G/∞, GI/G, vacations, PS/FB, breakdowns) | done |
+| [EPIC-003](EPIC-003-qbd-map-ph.md) | QBD/MAP/PH-стек (матрично-аналитические методы) | done |
+| [EPIC-004](EPIC-004-retrial-erlang-a.md) | Retrial-очереди и Erlang-A | done |
+| [EPIC-005](EPIC-005-illustrated-catalog.md) | Иллюстрированный каталог моделей (простые описания + схемы) | done |
+| [EPIC-006](EPIC-006-english-docs.md) | EN-центричная документация (перевод + двуязычные схемы) | done |
+| [EPIC-007](EPIC-007-map-phase2.md) | MAP-стек, фаза 2 (MAP/M/c, MAP/PH/c, фиттинг, BMAP/M/1) | done |
+| [EPIC-008](EPIC-008-map-phase3.md) | MAP-стек, фаза 3 (BMAP/PH/1 общего вида) | done |
+| [EPIC-009](EPIC-009-rdr-priority.md) | RDR: многоканальные многоприоритетные СМО (оптимизация G-матрицы + RDR-A + точная CTMC + фикс сходимости + аудит статьи) | done |
+| [EPIC-010](EPIC-010-age-of-information.md) | Age of Information (AoI/PAoI) — свежесть информации | done |
+| [EPIC-011](EPIC-011-multiserver-job.md) | Multiserver-job (MSJ): заявка занимает k серверов одновременно | done |
+| [EPIC-012](EPIC-012-bulk-service.md) | Bulk-service очереди (batching, LLM inference) | done |
+| [EPIC-013](EPIC-013-predictions-scheduling.md) | Планирование с предсказаниями (learning-augmented) | done |
+
+Направления EPIC-010…013 выбраны по обзору трендов сообщества:
+[../research/queueing-trends-2026.md](../research/queueing-trends-2026.md).

{most_queue-2.7 → most_queue-2.9}/most_queue/__init__.py

@@ -5,12 +5,18 @@ This package provides both simulation and numerical calculation methods
 for various types of queueing systems and networks.
 """
 
-__version__ = "2.05"
+from importlib.metadata import PackageNotFoundError, version
 
 # Import main simulation and theory classes for easy access
 from most_queue.sim.base import QsSim
 from most_queue.theory.base_queue import BaseQueue
 
+try:
+    # single source of truth for the version: the installed package metadata
+    __version__ = version("most-queue")
+except PackageNotFoundError:  # running from a source checkout that is not installed
+    __version__ = "0.0.0.dev0"
+
 __all__ = [
     "QsSim",
     "BaseQueue",