Packet reordering is a well-known phenomenon that the order of packets is inverted in the Internet. Previous studies indicates reordering can affect the performance of both the network and the packets receiver. Nevertheless, they get different results about the prevalence of reordering in the Internet. In this paper, we firstly present a methodology for single-point reordering measurement at a ...

Studies have shown that packet reordering is common, especially in satellite networks where there are link level retransmissions and multipath routing. Moreover, traditional satellite networks exhibit high corruption rates causing packet losses. Reordering and corruption of packets decrease the TCP performance of a network, mainly because it leads to overestimation of the congestion in the netw...

Studies have shown that packet reordering is common, especially in satellite networks where there are link level retransmissions and multipath routing. Moreover, satellite networks exhibit high corruption rates causing packet losses. Reordering and corruption of packets decrease the TCP performance of a network, mainly because it leads to overestimation of the congestion in the network. We cons...

Queueing models are widely used to establish stochastic models for QoS analysis of different communication environments. In [1] the authors created a queueing model to evaluate a sensor network environment with two quality classes of sources. The “Emergency” class represents the sources of very important communication (e.g. fire alarm), and the “Normal” class represents the standard communicati...

Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maint...

Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCPPR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are mainta...

We have analyzed the measurements of the end-to-end packet reordering by tracing UDP packets between 12 testboxes of RIPE NCC. We showed that reordering quite often happens in Internet. For bursts of 50 100-byte UDP packets, there were about 56% of all the streams arrived at the destinations out-of-order. We studied the extent of the reordering in these streams, and observed that most reordered...

This memo defines metrics to evaluate whether a network has maintained packet order on a packet-by-packet basis. It provides motivations for the new metrics and discusses the measurement issues, including the context information required for all metrics. The memo first defines a reordered singleton, and then uses it as the basis for sample metrics to quantify the extent of reordering in several...

1 This research was supported in part by the DARPA Next Generation Internet (NGI) program and the NSF Information Technology Research (ITR) grant no. 0121546. Abstract Out of order arrival of packets is an inevitable phenomenon on the Internet. Application performance can degrade to a great extent due to out-of-order arrival of packets. Metrics to characterize the degree of re-ordering will pro...