2009/06/10 by Wenji Wu, Phil DeMar, M. Crawford +1
Computer Science · Engineering · #Advanced Optical Network Technologies #Algorithm #Block (permutation group theory) #Computer network #Computer science #Interrupt #Network Traffic and Congestion Control #Network packet #Real-time computing #Software-Defined Networks and 5G #Sorting #Sorting algorithm #Sorting network #Telecommunications #Transmission (telecommunications) #cs.NI
paper · pdf · doi:10.1016/j.comnet.2009.05.012
published as Comput.Net.53:2646-2662,2009
openalex publication_date 2009/06/10 · arxiv created 2010/08/29 · arxiv updated 2014/11/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.