A novel scheduling scheme for serving VBR-encoded multimedia streams
Bibliographic record
Abstract
We propose a novel scheduling scheme, in which a new user is admitted for service by a multimedia server only if the service requirements of all the existing users and the new user can be satisfied. Each user is assumed to be requesting a variable bit rate (VBR) MPEG2 encoded media stream. The scheduling scheme maximizes the number of streams that can be served concurrently. The quality of service is guaranteed in terms of the fraction of the frames that may be dropped for a user. When a new request arrives, the admission control algorithm estimates the fraction of frames that may have to be dropped for the users assuming that the new request is accepted. If the fraction of frames is more than the drop rate committed to the users, the request is rejected, otherwise it is accepted. Our scheme is much more simpler than the schemes suggested in the literature and results in better utilization of the resources, and at the same time provides guaranteed QoS to the users requesting predictive service. Extensive simulations have been conducted to demonstrate the effectiveness of this scheduling scheme.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".