An Experimental Study on Multipath TCP Congestion Control With Heterogeneous Radio Access Technologies
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In the near future, a large volume of the data traversing wireless networks will not only be requested and/or reported by humans but also by machines (e.g., the Internet-of-things and machine-to-machine applications). This mandates the availability of enormous radio spectrum resources and an end-to-end reliable information transfer. Currently, many wireless devices are equipped with two wireless interfaces with heterogeneous radio access technologies. Thus, the usage of a transport layer designed for multi-homed devices such as multipath transmission control protocol (MPTCP) is inevitable. This paper presents an experimental performance study of three congestion control algorithms, which can be used by MPTCP, namely, Cubic, linked-increases algorithm (LIA), and opportunistic LIA (OLIA). The testbed comprises real (not simulated) LTE and WiFi networks that are used to connect dual-homed wireless nodes to one another. We comparatively study the throughput performance of the three algorithms under varying factors, including the receiver buffer size, number of parallel connections, data volume, and flow lifetime. Our key findings reveal that, although Cubic is not designed with multipath in mind, it outperforms the multipath-based LIA and OLIA, whenever the LTE per-node capacity is higher than its WiFi counterpart. Also, in a reversed situation (WiFi per-node capacity is higher) Cubic outperforms OLIA and LIA for short-lived flows.
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.
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.001 | 0.002 |
| Open science | 0.003 | 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 it