Answers are grounded in this paper and cite their sources.
Facing burst traffic, TCP congestion control algorithms severely decrease window size neglecting the fact that such burst traffics are temporal. In the increase phase sending window experiences a linear rise which may lead to waste in hefty proportion of available bandwidth. If congestion control mechanisms be able to estimate future state of network traffic they can cope with different circumstances and efficiently use bandwidth. Since data traffic which is running on networks is mostly self-similar, algorithms can take advantage of self-similarity property and repetitive traffic patterns to have accurate estimations and predictions in large time scales.
No takes yet. Share an insight, caveat, or question.
Mehdi Mohtashamzadeh (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: