Steganographic-Based Header Size Reduction Technique for Multimedia Streams
Bibliographic record
Abstract
High quality multimedia streaming over the Internet has proliferated in modern society due to the ever-increasing ties amongst people and businesses, thereby occupying the majority of all exchanged data traffic. The Internet is the primary multimedia exchange medium that is being used beyond its intended design. Using Hypertext Transfer Protocol/Transmission Control Protocol (HTTP/TCP), multimedia can be delivered to virtually all devices connected to the Internet. HTTP-based streaming suffers from the increasing overhead generated as the stream length, quality, and non-deterministic path conditions vary. In this paper, a novel cross-layer signalling reduction scheme is proposed to alleviate resource consumption in networks exchanging multimedia. The proposed scheme is a steganographic-based protocol translator that encodes information within multimedia payloads prior to packet flight to reduce the size of exchanged data. The encoded data is used by node pairs to replace bulky protocols, such as TCP, with lightweight protocols, such as User Datagram Protocol (UDP). In addition to the protocol translator, a routing scheme is given to be used in place of the inflated networking protocols to further reduce the header footprint. A utility function is developed to find the optimal overhead savings where simulations are conducted to verify the designs. Using virtual machines, the proposed translator is implemented where a multimedia file is exchanged and subject to encoding. The simulations and implementation show that the proposed methodologies will decrease the amount of signalling needed while increasing the overall network capacity. Furthermore, the proposed methods are capable of successfully extending existing signalling reduction methods.
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.000 | 0.001 |
| 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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".