Boundedness of Heterogeneous TCP Flows with Multiple Bottlenecks
Bibliographic record
Abstract
TCP has been the dominant congestion control protocol in the Internet. Although it is well known that TCP combined with intermediate systems with active queue management (AQM) schemes can not guarantee asymptotical stability when the feedback delay or the link capacity is large, the asymptotical stability may not be necessary for network achieving good performance in terms of resource utilization, flow throughput and queueing delay. Practical bounds are important performance index for congestion control protocols and AQM schemes. How to derive practical bounds for realistic systems with heterogeneous flows, various delays and multiple bottlenecks is an important and challenging open issue. In this paper, we study the boundedness of generalized TCP and AQM systems considering the heterogeneity of flows and the impact of multiple bottlenecks. We derive the uniform bounds and uniform ultimate bounds of flow window size, which reveal how the system and flow parameters affect the system performance. Extensive simulation results have been given to verify the correctness of the bounds.
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.001 | 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".