Multimedia Messaging Service: System Description and Performance Analysis
Bibliographic record
Abstract
Following the success of short messaging service (SMS), multimedia messaging service (MMS) is emerging as a natural but revolutionary successor to short messaging. MMS allows personalized multimedia messages containing content such as images, audio, text and video to be created and transferred between MMS-capable phones and other devices. By using IP and its associated protocols, MMS is able to interwork with other messaging systems such as Internet messaging services. An important feature of MMS is the guaranteed delivery of messages via a store-and-forward mechanism which temporarily stores messages in the network until successfully delivered. Unlike SMS, multimedia messaging service does not mandate any maximum size for a multimedia message. This enhanced flexibility of MMS requires a careful design of the network in order to avoid excessive message delays and losses. This paper develops a mathematical model for evaluating the performance of an MMS system. Using the model, closed-form expressions for major performance parameters such as message loss, message delay and expiry probability have been derived. Furthermore, a simple algorithm is presented to find the optimal temporary storage size for a given set of system parameters. The accuracy of the presented analysis is evaluated through simulations which shows a close agreement between analytic and simulation results.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.015 | 0.005 |
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 source (direct Gemma or distilled Codex), 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".