2009
DOI: 10.1016/j.comnet.2009.05.012
|View full text |Cite
|
Sign up to set email alerts
|

Sorting Reordered Packets with Interrupt Coalescing

Abstract: TCP performs poorly in networks with serious packet reordering. Processing reordered packets in the TCP layer is costly and inefficient, involving interaction of the sender and receiver. Motivated by the interrupt coalescing mechanism that delivers packets upward for protocol processing in blocks, we propose a new strategy, Sorting Reordered Packets with Interrupt Coalescing (SRPIC), to reduce packet reordering in the receiver. SRPIC works in the network device driver; it makes use of the interrupt coalescing … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 35 publications
0
12
0
Order By: Relevance
“…Kandula et al [14] proposed Flare to divide and cache traffic at the granularity of packet bursts, with the observation that if the time between two successive packets is larger than the maximum delay difference between multiple paths, the subsequent packets can be scheduled on any path with no risk of reordering. SPRIC [37] sorts reordered packets in the same block with interrupt coalescing to eliminate or reduce packet reordering at the destination. Other solutions include dynamically adjusting the TCP reordering threshold to avoid improper retransfer or quickly recovering from spurious congestion window shrinks [3,41].…”
Section: Related Workmentioning
confidence: 99%
“…Kandula et al [14] proposed Flare to divide and cache traffic at the granularity of packet bursts, with the observation that if the time between two successive packets is larger than the maximum delay difference between multiple paths, the subsequent packets can be scheduled on any path with no risk of reordering. SPRIC [37] sorts reordered packets in the same block with interrupt coalescing to eliminate or reduce packet reordering at the destination. Other solutions include dynamically adjusting the TCP reordering threshold to avoid improper retransfer or quickly recovering from spurious congestion window shrinks [3,41].…”
Section: Related Workmentioning
confidence: 99%
“…There are several studies on network performance optimization in 10Gbps networks [22,24]. However, only a few recent studies have tested highspeed data transfers in a 100Gbps environment.…”
Section: Host Tuning Issuesmentioning
confidence: 99%
“…The performance 483 of various reordering-tolerant algorithms on TCP, which distin-484 guishes between normal multipath reordering and loss, has been 485 studied extensively in [28]. We may use lower layer solution on 486 receiving end's network stack as presented in [29]. To address reor-487 dering, on top of our solution, we are considering Linux TCP's adap-488 tive TCP reordering threshold mechanism which is based on the 489 maximum observed reordering length [30].…”
mentioning
confidence: 99%