arXiv (All)
open access
Arrival-Intensity Control for A Single-Server Queue in Heavy Traffic
We study a single-server queue control problem (QCP) in a heavy-traffic regime, extending the framework from Lee and Weerasinghe (2011). The state process represents the offered waiting time. Service times and patience times form independent i.i.d. sequences with general distributions. We formulate
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
- Finite-state counterexamples to Ross's second queueing conjecture#1051577
- The Flow Queue CoDel Packet Scheduler and Active Queue Management Algorithm#502813
- Queuing algorithm to provide type-of-service for IP links#134863
- Congestion Control in the RFC Series#208985
- Performance Analysis of an Unreliable $M/G/1$ Retrial Queue with Two-way Communication#1082886
Record · ID 1118352
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