Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy Perspective
Bibliographic record
Abstract
Multipath TCP (MPTCP) is a promising TCP extension that exploits different Internet paths between a pair of hosts to obtain high aggregate throughput, while it also brings the concern of energy consumption. There has been a lively interest in the design of energy-efficient MPTCP. The research community, however, lacks a comprehensive understanding of which components in an MPTCP congestion control algorithm play the fundamental role in energy efficiency, how various algorithms compare against each other from energy-consuming perspective, or whether there exist potentially better solutions for energy saving. This paper takes the first step towards answering these questions. Through realworld MPTCP Linux kernel experiments, we show that the energy consumption is related to three major aspects: average throughput, path delay and different network scenarios. In order to bridge congestion control to the three aspects, we analyze the existing algorithms and capture the essential parameters of multipath congestion control model related to energy efficiency. Then we propose a window increase factor to shift traffic to low-delay energy-efficient paths. To further extend this design, we apply an energy-aware compensative parameter to fit the general hierarchical Internet topology. Our evaluation indicates that the enhanced congestion control module can successfully improve MPTCP energy efficiency without affecting its transmission performance.
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.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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 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".