Barakat Altman 2000a - Revision history

Scipediacontent at 16:56, 25 January 2021

2021-01-25T16:56:59Z

Scipediacontent at 10:38, 22 January 2021

2021-01-22T10:38:08Z

Scipediacontent: Scipediacontent moved page Draft Content 994609122 to Barakat Altman 2000a

2020-10-26T09:21:06Z

Scipediacontent moved page Draft Content 994609122 to Barakat Altman 2000a

Scipediacontent: Created page with " == Abstract == Acknowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a T..."

2020-10-26T09:21:03Z

Created page with " == Abstract == Acknowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a T..."

New page

== Abstract ==

Acknowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow channel are erased when new ACKs are to be queued. In the literature the case of one-ACK per connection at a time has been studied. In this paper we show that this is too aggressive for short transfers where ACKs arrive in bursts due to the slow start phase, and where the TCP source needs to receive the maximum number of ACKs to increase fast its window. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length. These algorithms provide a good compromise between reducing the ACK queueing delay and passing a large number of ACKs that guarantee a fast window increase. Copyright Â© 2003 John Wiley & Sons, Ltd.

Document type: Report

== Full document ==
<pdf>Media:Draft_Content_994609122-beopen164-1749-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [https://hal.inria.fr/inria-00072745/file/RR-3908.pdf https://hal.inria.fr/inria-00072745/file/RR-3908.pdf]

* [http://link.springer.com/content/pdf/10.1007/3-540-39939-9_7 http://link.springer.com/content/pdf/10.1007/3-540-39939-9_7],[http://dx.doi.org/10.1007/3-540-39939-9_7 http://dx.doi.org/10.1007/3-540-39939-9_7]

* [http://onlinelibrary.wiley.com/doi/10.1002/sat.751/abstract http://onlinelibrary.wiley.com/doi/10.1002/sat.751/abstract],[https://academic.microsoft.com/#/detail/1980831285 https://academic.microsoft.com/#/detail/1980831285]

* [http://www-sop.inria.fr/members/Chadi.Barakat/Qofis2000-2.pdf http://www-sop.inria.fr/members/Chadi.Barakat/Qofis2000-2.pdf],[https://dl.acm.org/citation.cfm?id=693587 https://dl.acm.org/citation.cfm?id=693587],[https://link.springer.com/chapter/10.1007/3-540-39939-9_7 https://link.springer.com/chapter/10.1007/3-540-39939-9_7],[https://rd.springer.com/chapter/10.1007%2F3-540-39939-9_7 https://rd.springer.com/chapter/10.1007%2F3-540-39939-9_7],[https://core.ac.uk/display/23921800 https://core.ac.uk/display/23921800],[https://academic.microsoft.com/#/detail/1578827524 https://academic.microsoft.com/#/detail/1578827524]

* [https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fsat.751 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fsat.751],[https://onlinelibrary.wiley.com/doi/full/10.1002/sat.751 https://onlinelibrary.wiley.com/doi/full/10.1002/sat.751],[http://dx.doi.org/10.1002/sat.751 http://dx.doi.org/10.1002/sat.751] under the license http://doi.wiley.com/10.1002/tdm_license_1.1

* [https://hal.inria.fr/inria-00072745 https://hal.inria.fr/inria-00072745],[https://hal.inria.fr/inria-00072745/document https://hal.inria.fr/inria-00072745/document],[https://hal.inria.fr/inria-00072745/file/RR-3908.pdf https://hal.inria.fr/inria-00072745/file/RR-3908.pdf]

DOIS: 10.1002/sat.751 10.1007/3-540-39939-9_7

← Older revision		Revision as of 16:56, 25 January 2021
Line 2:		Line 2:
	== Abstract ==		== Abstract ==

−	~~Acknowledgement~~ (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow channel are erased when new ACKs are to be queued. In the literature the case of one-ACK per connection at a time has been studied. In this paper we show that this is too aggressive for short transfers where ACKs arrive in bursts due to the slow start phase, and where the TCP source needs to receive the maximum number of ACKs to increase fast its window. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length. These algorithms provide a good compromise between reducing the ACK queueing delay and passing a large number of ACKs that guarantee a fast window increase. Copyright Â© 2003 John Wiley & Sons, Ltd.	+	knowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow channel are erased when new ACKs are to be queued. In the literature the case of one-ACK per connection at a time has been studied. In this paper we show that this is too aggressive for short transfers where ACKs arrive in bursts due to the slow start phase, and where the TCP source needs to receive the maximum number of ACKs to increase fast its window. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length. These algorithms provide a good compromise between reducing the ACK queueing delay and passing a large number of ACKs that guarantee a fast window increase. Copyright © 2003 John Wiley & Sons, Ltd.

@@ Line 3: / Line 3: @@
 Acknowledgement (ACK) filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the input of the slow channel are erased when new ACKs are to be queued. In the literature the case of one-ACK per connection at a time has been studied. In this paper we show that this is too aggressive for short transfers where ACKs arrive in bursts due to the slow start phase, and where the TCP source needs to receive the maximum number of ACKs to increase fast its window. We study first static filtering where a certain ACK queue length is allowed. We show analytically how this length needs to be chosen. We present then some algorithms that adapt the filtering of ACKs as a function of the slow channel utilization rather than the ACK queue length. These algorithms provide a good compromise between reducing the ACK queueing delay and passing a large number of ACKs that guarantee a fast window increase. Copyright Â© 2003 John Wiley & Sons, Ltd.
@@ Line 16: / Line 11: @@
 * [https://hal.inria.fr/inria-00072745/file/RR-3908.pdf https://hal.inria.fr/inria-00072745/file/RR-3908.pdf]
-* [http://link.springer.com/content/pdf/10.1007/3-540-39939-9_7 http://link.springer.com/content/pdf/10.1007/3-540-39939-9_7],[http://dx.doi.org/10.1007/3-540-39939-9_7 http://dx.doi.org/10.1007/3-540-39939-9_7]
+* [http://link.springer.com/content/pdf/10.1007/3-540-39939-9_7 http://link.springer.com/content/pdf/10.1007/3-540-39939-9_7],
-* [http://onlinelibrary.wiley.com/doi/10.1002/sat.751/abstract http://onlinelibrary.wiley.com/doi/10.1002/sat.751/abstract],[https://academic.microsoft.com/#/detail/1980831285 https://academic.microsoft.com/#/detail/1980831285]
+* [http://onlinelibrary.wiley.com/doi/10.1002/sat.751/abstract http://onlinelibrary.wiley.com/doi/10.1002/sat.751/abstract],
-* [http://www-sop.inria.fr/members/Chadi.Barakat/Qofis2000-2.pdf http://www-sop.inria.fr/members/Chadi.Barakat/Qofis2000-2.pdf],[https://dl.acm.org/citation.cfm?id=693587 https://dl.acm.org/citation.cfm?id=693587],[https://link.springer.com/chapter/10.1007/3-540-39939-9_7 https://link.springer.com/chapter/10.1007/3-540-39939-9_7],[https://rd.springer.com/chapter/10.1007%2F3-540-39939-9_7 https://rd.springer.com/chapter/10.1007%2F3-540-39939-9_7],[https://core.ac.uk/display/23921800 https://core.ac.uk/display/23921800],[https://academic.microsoft.com/#/detail/1578827524 https://academic.microsoft.com/#/detail/1578827524]
+* [http://www-sop.inria.fr/members/Chadi.Barakat/Qofis2000-2.pdf http://www-sop.inria.fr/members/Chadi.Barakat/Qofis2000-2.pdf],
-* [https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fsat.751 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fsat.751],[https://onlinelibrary.wiley.com/doi/full/10.1002/sat.751 https://onlinelibrary.wiley.com/doi/full/10.1002/sat.751],[http://dx.doi.org/10.1002/sat.751 http://dx.doi.org/10.1002/sat.751] under the license http://doi.wiley.com/10.1002/tdm_license_1.1
+* [https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fsat.751 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fsat.751],
-* [https://hal.inria.fr/inria-00072745 https://hal.inria.fr/inria-00072745],[https://hal.inria.fr/inria-00072745/document https://hal.inria.fr/inria-00072745/document],[https://hal.inria.fr/inria-00072745/file/RR-3908.pdf https://hal.inria.fr/inria-00072745/file/RR-3908.pdf]
+* [https://hal.inria.fr/inria-00072745 https://hal.inria.fr/inria-00072745],
-DOIS: 10.1002/sat.751 10.1007/3-540-39939-9_7
+DOIS: 10.1007/3-540-39939-9_7 10.1002/sat.751

← Older revision	Revision as of 09:21, 26 October 2020
(No difference)