On Reorder Density and its Application to Characterization of Packet Reordering

  • Authors:

  • Nischal M. Piratla;Anura P. Jayasumana;Tarun Banka

  • Affiliations:

  • Deutsche Telekom Laboratories;Colorado State University;Colorado State University

  • Venue:
  • LCN '05 Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

A formal approach for characterizing, evaluating and modeling packet reordering is presented. Reordering is, a phenomenon that is likely to become increasingly common on Internet, and it can have an adverse impact on end-toend performance and network resource utilization. Reorder Density (RD) is a comprehensive metric for reordering. Several properties of RD are presented that provide insight into the nature of reordering present in a sequence. Based on measurements of packet reordering, certain basic patterns of reordering that are prevalent on the Internet are identified. By focusing on these basic patterns, a model is developed for reordering in networks involving two parallel paths, using a simple loadbalancing scenario as an example. The model is verified using an emulation testbed.