A QoS-aware AIMD protocol for time-sensitive applications in wired/wireless networks
Bibliographic record
Abstract
A TCP-friendly additive increase and multiplicative decrease (AIMD) protocol is proposed to support time-sensitive applications in hybrid wired/wireless networks. By analyzing the performance of AIMD-controlled flows in hybrid networks, we propose a cross-layer procedure to select the AIMD protocol parameters with consideration of wireless link characteristics and application QoS requirements, in terms of delay, loss, and throughput. Since the cross-layer interaction only exchanges parameters among the application, the transport layer protocol, and the link layer protocol, our approach preserves the end-to-end semantics of the transport protocol and the layered structure of the Internet, and it is applicable to supporting various multimedia applications over heterogeneous wireless links. With appropriate parameters, AIMD-controlled flows can fairly share network resources with TCP flows, efficiently utilize wireless resources, and statistically guarantee end-to-end delay for time-sensitive applications. Extensive simulations are performed to validate the analytical results, evaluate the protocol performance, and demonstrate that the AIMD protocol can outperform the unresponsive UDP protocol when transporting multimedia traffic in hybrid networks. With satisfactory QoS, end systems have more incentives to voluntarily regulate multimedia traffic with an AIMD-based congestion controller, which is vital for network stability, integrity, and future proliferation.
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.000 | 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".