arXiv (All)
open access
Fast Engset computation
The blocking probability of a finite-source bufferless queue is a fixed point of the Engset formula, for which we prove existence and uniqueness. Numerically, the literature suggests a fixed point iteration. We show that such an iteration can fail to converge and is dominated by a simple Newton's me
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An interpretable universal bound for multiserver queues via a leave-one-out technique#665551
- An interpretable universal bound for multiserver queues via a leave-one-out technique#664051
- Visitation measures for non-linear iterations with random perturbations#1142154
- Loops, Inverse Limits and Non-Determinism#1000490
- Faster Convergence of Multidimensional Approximate Agreement via Smallest Enclosing Balls#821526
Record · ID 984768
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive