arXiv (All)
open access
Fundamental Limits of Covert queueing under Busy-Period Observations
Consider a queueing system operated by Bob, which is intended to serve only jobs generated by a legitimate user, Willie. Willie's jobs arrive according to a Poisson process, and the service times are exponentially distributed. Bob seeks to covertly serve additional jobs arriving according to an inde
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
- Servers and Waiters: What Matters in the Law of A.I.#485887
- Queues: Theory and Applications#66873
- Position Paper: Denial-of-Service Against Multi-Round Transaction Simulation#128223
- Fundamentals of queueing theory#1331382
- Management policies to handle multi queuing systems in a service oriented organization : a study of the Henri Bourassa driver licensing office in the City of Montreal#1020522
Record · ID 1298407
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