Metrics for packet reordering—A comparative analysis

Piratla, Nischal M.; Jayasumana, Anura P.

doi:10.1002/dac.884

Cited by 39 publications

(23 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was first introduced by Piratla et al [133] and later specified in RFC 5236 [85]. To compute the reorder density M RD , the sequence number of each packet is compared to the position in which it arrived at the destination.…”

Section: Reorder Density and Entropymentioning

confidence: 99%

Multipath aggregation of heterogeneous access networks

Kaspar¹

2012

SIGMultimedia Rec.

View full text Add to dashboard Cite

The explosive deployment of wired and wireless communication infrastructure has recently enabled many novel applications and sparked new research problems. One of the unsolved issues in today's Internet - the main topic of this thesis - is the goal of increasing data transfer speeds of end hosts by aggregating and simultaneously using multiple network interfaces. This objective is most interesting when the Internet is accessible through several, relatively slow and variable (typically wireless) networks, which are unable to single-handedly provide the required data rate for resource-intensive applications, such as bulk file transfers and high-definition multimedia streaming.

show abstract

Section: Reorder Density and Entropymentioning

confidence: 99%

Multipath aggregation of heterogeneous access networks

Kaspar¹

2012

SIGMultimedia Rec.

View full text Add to dashboard Cite

show abstract

“…The effects of multipath routing on packet reordering have been addressed in various publications ranging from simulation-based analyses [9], over real-time measurements in wide-area networks [10], [11], [12], [13], to IETF standardization efforts that define metrics for measuring packet reordering [14], [15]. However, no publications have come to our attention that address how severely packets get disordered when using multiple interfaces.…”

Section: Related Workmentioning

confidence: 99%

“…One such metric, called Reorder Density, is introduced in [13] and RFC 5236 [15]. To compute the Reorder Density M RD , the sequence number of each packet is compared to the position in the sequence received at the destination.…”

Section: B Packet Reorder Metricsmentioning

confidence: 99%

An analysis of the heterogeneity and IP packet reordering over multiple wireless networks

Kaspar

Evensen

Hansen

et al. 2009

2009 IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

Abstract-With the increasing deployment of wireless technologies, such as WLAN, HSDPA, and WiMAX, it is often the case that simultaneous coverage of several access networks is available to a single user device. In addition, devices are also often equipped with multiple network interfaces. Thus, if we can exploit all available network interfaces at the same time, we can obtain advantages like the aggregation of bandwidth and increased fault tolerance. However, the heterogeneity and dynamics of the links also introduce challenges. Due to different link delays, sending packets of the same flow over multiple heterogeneous paths causes the reordering of packets.In this paper, we quantify the impact of network heterogeneity and the use of multiple links on IP packet reordering. We show with practical measurements, according to commonly used metrics, that packet reordering over multiple links exceeds the reordering caused by common connections in high-speed, widearea networks. We also demonstrate that heterogeneity and reordering exceed the assumptions presented in related work.By using sufficiently large buffers, packet reordering can be avoided. However, for devices with high resource constraints, the workload of using large buffers is expensive. Sender-side solutions of dividing and scheduling a packet sequence over multiple links can reduce the buffer requirements at the receiver. Initial experiments with a static scheduler, that has knowledge of average link delay and throughput estimates, show that packet reordering can be reduced by only 38 % due to the dynamic heterogeneity of the two links.

show abstract

“…A threshold, used to declare a packet as lost, keeps the complexity of computation within bounds. RD and RBD are able to capture reordering more comprehensively compared to existing metrics [31]. With increasing link speeds and routing table sizes, it is observed that the packet reordering will increase significantly, in the backbone routers.…”

Section: Simulation Based Predictionsmentioning

confidence: 99%

On Growth of Parallelism within Routers and Its Impact on Packet Reordering

Bare

Jayasumana

Piratla

2007

2007 15th IEEE Workshop on Local &Amp; Metropolitan Area Networks

View full text Add to dashboard Cite

Abstract-The network link speeds increase at a higher rate compared to processing speeds. This coupled with the increase in size of router tables demand higher levels of parallelism within router hardware. However, such parallelism introduces unintended consequences that potentially may negate some of the performance gains provided by the improved technology. The growth trends of computing speeds, link speeds, and routing table sizes are used to evaluate one such consequence, packet reordering within routers. Results presented show the trends related to the degree of hardware parallelism and packet reordering I. INTRODUCTIONAs the speed of physical links and networks increase beyond gigabit per second, and the end-to-end latency to packet transmission time ratio increases by orders of magnitude, certain phenomena that were insignificant and safely ignored assume substantial importance. In fact some of these second order effects, unless countered, can negate to a significant degree the gains provided by faster physical links and routing/switching hardware, and will have an adverse impact on the end-to-end performance seen by the applications. These unavoidable phenomena include, among others, delay jitter and packet reordering. Jitter has received attention only with respect to real-time applications such as VoIP, and effects of reordering were safely ignored.According to Moore's law, the CPU computing speed approximately doubles every 18 months [1, 2], while recent trends indicate that network link speed approximately doubles every nine months [3,4]. Thus, the network link speeds increase at a faster rate than the computing speed. The Internet itself is growing in size, resulting in the increase of routing tables sizes in backbone routers [5]. Consequently, the amount of processing to be performed by the routers will increase at a faster rate than the rate of increase in the computing power. Routers will rely on architectures that use an increasing number of processors working in parallel to counter the additional computation requirements. However, processing packets from the same stream in parallel processors deteriorates the problem of reordering. The two

show abstract

Metrics for packet reordering—A comparative analysis

Cited by 39 publications

References 10 publications

Multipath aggregation of heterogeneous access networks

Multipath aggregation of heterogeneous access networks

An analysis of the heterogeneity and IP packet reordering over multiple wireless networks

On Growth of Parallelism within Routers and Its Impact on Packet Reordering

Contact Info

Product

Resources

About