Abstract
We study the adaptation capabilities and
robustness of the high-speed TCP CUBIC algorithm. For this
purpose we consider a network environment with variable and
high random packet loss and a large Bandwidth-Delay product,
shared by multiple heterogeneous TCP connections. The analysis
is based on and supported by packet-level simulations. The
results show that the aggressive nature of CUBIC’s nonlinear
congestion window control principle causes a degradation of the
time-average throughput at the moderate level of random packet
loss even under increasing Round-Trip-Time of the flow.
However, this algorithmic scalability and loss-free-timedependent
window growth allows recovering transmission rate
faster in the high packet loss region due to the statistically lower
number of dropped packets, compared to the moderate loss level
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 2015 IEEE 14th International Symposium on Network Computing and Applications |
| Publisher | IEEE |
| Publication date | 2015 |
| Pages | 76-80 |
| DOIs | |
| Publication status | Published - 2015 |
| Event | 2015 IEEE 14th International Symposium on Network Computing and Applications - Cambridge, United States Duration: 28 Sept 2015 → 30 Sept 2015 https://ieeexplore.ieee.org/xpl/conhome/7371416/proceeding |
Conference
| Conference | 2015 IEEE 14th International Symposium on Network Computing and Applications |
|---|---|
| Country/Territory | United States |
| City | Cambridge |
| Period | 28/09/2015 → 30/09/2015 |
| Internet address |
Keywords
- Transmission Control Protocol
- Congestion control
- TCP CUBIC
- Reno
- NewReno
- Random packet loss
- TCP fairness
Fingerprint
Dive into the research topics of 'Robustness of Multiple High Speed TCP CUBIC Connections Under Severe Operating Conditions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver