Reorder Density (RD): A formal, comprehensive metric for packet reordering1

33Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The increase in link speeds, increased parallelism within routers and switches, QoS support and load balancing among links, all point to future networks with increased packet reordering. Unchecked, packet reordering will have a significant detrimental effect on the end-to-end performance, while resources required for dealing with packet reordering at routers and end-nodes will grow considerably. A formal analysis of packet reordering is carried out and Reorder Density (RD) metric is defined for measurement and characterization of packet reordering. RD captures the amount and degree of reordering, and can be used to define the reorder response of networks under stationary conditions. Properties of RD are derived, and it is shown that the reorder response of the network formed by cascading two subnets is equal to the convolution of the reorder responses of individual subnets. Packet reordering over the Internet is measured and used to validate the derivations. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Piratla, N. M., Jayasumana, A. P., & Bare, A. A. (2005). Reorder Density (RD): A formal, comprehensive metric for packet reordering1. In Lecture Notes in Computer Science (Vol. 3462, pp. 78–89). Springer Verlag. https://doi.org/10.1007/11422778_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free