Fermilab Computing Division

CS Document 3220-v4

Sorting Reordered Packets with Interrupt Coalescing

Document #:
CS-doc-3220-v4
Document type:
Technical Note
Submitted by:
Wenji Wu
Updated by:
Wenji Wu
Document Created:
02 Jun 2009, 11:05
Contents Revised:
13 Aug 2009, 09:09
Metadata Revised:
13 Aug 2009, 09:09
Viewable by:
  • Public document
Modifiable by:

Quick Links:
Latest Version

Other Versions:
CS-doc-3220-v3
07 Jul 2009, 10:39
CS-doc-3220-v2
07 Jul 2009, 10:38
CS-doc-3220-v1
10 Jun 2009, 21:47
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 mechanism to sort the reordered packets belonging to the same TCP stream in a block of packets before delivering them upward; each sorted block is internally ordered. Experiments have proven the effectiveness of SRPIC against forward-path reordering.
Files in Document:
Publication Information:
Journal of Computer Networks
http://dx.doi.org/10.1016/j.comnet.2009.05.012

DocDB Home ]  [ Search ] [ Authors ] [ Events ] [ Topics ]

DocDB Version 8.8.9, contact Document Database Administrators