arXiv (All)
open access
Finite-state counterexamples to Ross's second queueing conjecture
We construct finite-state Markov arrival-rate processes for which faster modulation increases the mean stationary workload of a stable single-server queue, disproving the universal ordering in Leskelä's formulation of Ross's second conjecture. A 64-state example has positive transition rates between
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
- Proof of Equivalence of Complexity Classes and Other Relations#76398
- Stationary activated random walk: regularity, heavy tails, and remixing#1115799
- The phase transition for domination in two interacting urns with power reinforcement#926133
- Percolation on Finite Graphs#1076208
- Convexity Properties and Comparative Statics for M/M/S Queues with Balking and Reneging#941635
Record · ID 1051577
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