The 8th International Conference on Communication Systems, 2002. ICCS 2002.
DOI: 10.1109/iccs.2002.1183313
|View full text |Cite
|
Sign up to set email alerts
|

Worst-case performance limitation of TCP SACK and a feasible solution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
10
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(10 citation statements)
references
References 5 publications
0
10
0
Order By: Relevance
“…The key difference between [13] and [5] is that [13] uses byte as the offset unit, but [5] uses the unchanged segment size as the unit. Hence, the scheme presented in [5] can represent the more SACK blocks using the same TCP option space (40 bytes can be available for 19 SACK blocks at least), and thus it is more effective in some scenarios, compared to that of [13].…”
Section: Related Workmentioning
confidence: 99%
See 4 more Smart Citations
“…The key difference between [13] and [5] is that [13] uses byte as the offset unit, but [5] uses the unchanged segment size as the unit. Hence, the scheme presented in [5] can represent the more SACK blocks using the same TCP option space (40 bytes can be available for 19 SACK blocks at least), and thus it is more effective in some scenarios, compared to that of [13].…”
Section: Related Workmentioning
confidence: 99%
“…In [13], a concept of offset is presented to send the more SACK blocks' information. In the scheme, the sender only sends one 32-bit absolute sequence number for the highest sequence number of the out-of-order segments (denote it by A), instead of sending all absolute ones.…”
Section: Related Workmentioning
confidence: 99%
See 3 more Smart Citations