arXiv (All)
open access
New Bounds on the Competitive Ratio of Longest Queue Drop: 1.46929591 <= CR(LQD) <= 1.683652
We study the competitive ratio of Longest Queue Drop (LQD), the canonical buffer management policy for shared memory switches, for which the previously published bounds were CR(LQD) in [1.44546086, 1.6918]. We improve both ends. For the lower bound, we provide an exact-integer certificate on a new i
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
- The Attention Cost of Stable Matching#996522
- Generalized Hypercube Queueing Models with Overlapping Service Regions#612701
- Generalized Hypercube Queueing Models with Overlapping Service Regions#611224
- Probability threshold for the stability of $α(G(n,r,s))$#1154767
- Maximum Achievable Burst Size in All-Optical Satellite Networks#310775
Record · ID 1013758
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