Engineering a multiservice IP backbone to support tight SLAs
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
High data rate transmission in high resolution radio astronomy: vlbiGRID
Future Generation Computer Systems - iGrid 2002
A scalable load balancer for forwarding internet traffic: exploiting flow-level burstiness
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Sequence-preserving adaptive load balancers
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic load balancing without packet reordering
ACM SIGCOMM Computer Communication Review
Novel approaches to end-to-end packet reordering measurement
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Robust TCP stream reassembly in the presence of adversaries
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
IEEE Transactions on Parallel and Distributed Systems
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Multipath traffic engineering in WDM optical burst switching networks
IEEE Transactions on Communications
Efficient flow-aware dynamic link load balancing
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A hardware packet re-sequencer unit for network processors
ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems
Load balancing for flow-based parallel processing systems in CMP architecture
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer
Journal of Network and Computer Applications
Keeping the packet sequence in optical packet-switched networks
Optical Switching and Networking
Proceedings of the 10th ACM international symposium on Mobility management and wireless access
Fast and flexible: parallel packet processing with GPUs and click
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Packet reordering in the Internet is a well-known phenomenon. As the delay and speed of backbone links continue to increase, what used to be a negligible amount of packet reordering may now, combined with some level of dropped packets, cause multiple invocations of fast recovery within a TCP window. This may result in a significant drop in link utilization and hence in application throughput. What adds to the difficulty is that packet reordering is a silent problem. It may result in significant application throughput degradation while leaving little to no trace. In this article we try to measure and quantify the effect of reordering packets in a backbone link that multiplexes multiple TCP flows on application throughput. Different operating systems and delay values as well as various types of flow mixes were tested in a laboratory setup. The results show that only a small percentage of reordered packets, by at least three packet locations, in a backbone link can cause significant degradation of application throughput. Long flows are affected most. Due to the potential impact of this phenomenon, minimization of packet reordering as well as mitigating the effect algorithmically should be considered.