The design philosophy of the DARPA internet protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems (TOCS)
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
The Eifel algorithm: making TCP robust against spurious retransmissions
ACM SIGCOMM Computer Communication Review
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
The Design and Implementation of the FreeBSD Operating System
The Design and Implementation of the FreeBSD Operating System
Solaris Internals (2nd Edition)
Solaris Internals (2nd Edition)
Understanding The Linux Kernel
Understanding The Linux Kernel
Microsoft Windows Internals, Fourth Edition: Microsoft Windows Server(TM) 2003, Windows XP, and Windows 2000 (Pro-Developer)
A new TCP for persistent packet reordering
IEEE/ACM Transactions on Networking (TON)
The performance analysis of linux networking - Packet receiving
Computer Communications
Dynamic load balancing without packet reordering
ACM SIGCOMM Computer Communication Review
Measurement and classification of out-of-sequence packets in a tier-1 IP backbone
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
Keeping Order: Determining the Effect of TCP Packet Reordering
ICNS '07 Proceedings of the Third International Conference on Networking and Services
Interactivity vs. fairness in networked Linux systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Potential performance bottleneck in Linux TCP
International Journal of Communication Systems
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
XIA: efficient support for evolvable internetworking
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Experiences with 100Gbps network applications
Proceedings of the fifth international workshop on Data-Intensive Distributed Computing Date
Distributed adaptive routing for big-data applications running on data center networks
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
| Hi-index | 0.00 |
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.