Reproduce “Infinite Server Queueing Networks with Deadline Based Routing” 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
Neal Master, Nicholas Bambos
The authors analyze an open network where timeouts determine routing. They split each node into subnodes representing which competing service time ends service, making routing Markovian while preserving network behavior. Under Poisson arrivals and infinite-server assumptions, node counts are independent Poisson variables. In a two-node simulation, the mean at node 1 is 1.582 customers versus 1.591 simulated; this does not establish finite-server results.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.