Reproduce “Sharing within limits: Partial resource pooling in loss systems” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Anvitha Nandigam, Suraj Jog, D. Manjunath, Jayakrishnan Nair, B. J. Prabhu
The authors analyze partial sharing between two cellular providers modeled as Erlang-B loss systems. They compare bounded-overflow and probabilistic rules for accepting overflow calls on each other’s free channels. Full pooling changes blocking from 10% and 20% to 11% for both in an example. They prove some agreements improve both providers, with at least one sharing all capacity at efficiency.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.