4 ms·
Wow, this looks pretty impressive. My general understanding is that congestion control algorithms seek to provide performance and efficiency in end to end TCP
by contingencies 12y ago
Wow, this looks pretty impressive.
My general understanding is that congestion control algorithms seek to provide performance and efficiency in end to end TCP (transport-layer) connections that are well-matched to the underlying network path characteristics (latency, throughput, lossiness). Unfortunately, obtaining reliable information about these characteristics can be difficult, and this is particularly the case with dynamic paths (IP mobility, mobile while moving between congested/non-congested cells, shared near-capacity networks, etc.).
Previously, the areas in which customizing these sorts of algorithms has yielded particularly high returns have been satellite communications and other extremely long distance/high latency/known characteristic deployments with outlying or extreme properties.
My main two questions would then be: (1) To what range of network layer path or individual link-layer characteristics do the claimed benefits of this algorithm apply? (2) How much difference will this make to mobile access or IPv6 IP mobility under a range of different realistic network link issue scenarios?
If the claims in this paper are true (broadly applicable increase in throughput and fairness) then I suppose we'll see a switch to this algorithm en-masse, thus providing another handy covert operating system detection mechanism to delimit the new generation of kernels.
- 3rd3 12y agoWhy is it actually the case that the sender has to care about congestion and not the link itself?
- contingencies 12y agoSome researchers have argued eloquently that network operators and implementers should modify the infrastructure to have shorter buffers or intelligent queue-management schemes, such as the recent CoDel and separate queues for different flows. But modifying every place there is too much buffering — every LTE base station, every LTE baseband chip inside a cell phone, and every cable modem — may be an uphill battle. Our work demonstrates that in some cases, comparable or higher performance is possible without modifying network infrastructure at all—just by modifying the contending endpoints.
- deleted 12y ago[deleted]
- 3rd3 12y agoI understand that changing all links is more work than updating clients, but why did developers of TCP/IP decide to do it this way?
- contingencies 12y agoUpgrade cost of network complexity: The Internet has smart edges ... and a simple core. Adding an new Internet service is just a matter of distributing an application ... Compare this to voice, where one has to upgrade the entire core. - RFC3439 (2002)
- suprjami 12y ago> (1) To what range of network layer path or individual link-layer characteristics do the claimed benefits of this algorithm apply? The paper states their RemyCC outperformed currently-available CCs even when link variables varied by an order of magnitude. To put this into simple terms, you could write a RemyCC for a 1Gbps 10ms link, and that RemyCC would still perform better (than other CC algos) through a range of 100Mbps to 10Gbps, and 1ms to 100ms. > (2) How much difference will this make to mobile access or IPv6 IP mobility under a range of different realistic network link issue scenarios? The whole premise of the paper is that a well-written RemyCC would probably handle such situations better than a traditional congestion control algorithm. > then I suppose we'll see a switch to this algorithm en-masse You are more optimistic than I. Several people have already solved bufferbloat in theory, but it still exists in real life. Updating legacy devices, even with something as "simple" as a TCP congestion control module, may not be possible. That being said, implementing a few pre-baked RemyCCs in major operating systems surely would help. Say you had a "mobile" (5Mbps 500ms) and "home broadband" (50Mbps 50ms) and "LAN" (1Gbps 5ms) RemyCC available in Lin/Mac/Win/And/IOS, TCP performance would be several times better than what we have today.
- donavanm 12y ago> To put this into simple terms, you could write a RemyCC for a 1Gbps 10ms link, and that RemyCC would still perform better (than other CC algos) through a range of 100Mbps to 10Gbps, and 1ms to 100ms. No, pg 133 of the paper. They accept design time input variables as a range, differing by an order of magnitude. If the "assumptions aren’t met, performance deteriorates." Throughput and delay look horrendous when the actual characteristics dont match the model. > That being said, implementing a few pre-baked RemyCCs in major operating systems surely would help. Say you had a mobile" (5Mbps 500ms) and "home broadband" (50Mbps 50ms) and "LAN" (1Gbps 5ms) RemyCC available in Lin/Mac/Win/And/IOS, TCP performance would be several times better than what we have today. I'm also dubious of any actual adoption. However I believe youre underestimating the number of variant algorithms required. The consumer endpoints receive the vast bulk of the traffic, and are rarely contended on transmit. Its the large scale deployments of senders (CDNs, Streaming Services, etc) that would make a significant impact to global throughput.