The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Dynamic batching policies for an on-demand video server
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fundamentals of Queueing Theory.
Moore, R. H., Gross, D., & Harris, C. M. (1977) · Journal of the American Statistical Association · doi:10.2307/2286953 · Cited by 2,930
Metascheduling for continuous media
Anderson, D. P. (1993) · ACM Transactions on Computer Systems · doi:10.1145/152864.152866 · Cited by 129
Cited by
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Maddah-Ali, M. A., & Niesen, U. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2317316 · Cited by 626
Seeling, P., Reisslein, M., & Kulapala, B. (2004) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2004.5342293 · Cited by 309
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching
Yu, Q., Maddah-Ali, M. A., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2785237 · Cited by 278
Metadata
- Authors
- Dan, A., Sitaram, D., & Shahabuddin, P.
- Venue
- Multimedia Systems
- Published
- 1996-06
- Volume
- 4
- Issue
- 3
- Pages
- 112-121
- ISSN
- 0942-4962 (ISSN-L)
- 1432-1882
- OpenAlex
- W2047066090
- Cited by
- 400
- References
- 2
- FWCI
- 25.42
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic batching policies for an on-demand video server. https://app.cochat.ai/papers/10.1007/s005300050016
- The paper
- Dan, A., Sitaram, D., & Shahabuddin, P. (1996). Dynamic batching policies for an on-demand video server. Multimedia Systems. https://doi.org/10.1007/s005300050016
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.