Premium
Metrics for packet reordering—A comparative analysis
Author(s) -
Piratla Nischal M.,
Jayasumana Anura P.
Publication year - 2008
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.884
Subject(s) - computer science , network packet , metric (unit) , the internet , set (abstract data type) , sensitivity (control systems) , data mining , computer network , operations management , electronic engineering , world wide web , engineering , economics , programming language
Packet reordering is an inevitable phenomenon on the Internet. An ideal metric for packet reordering should capture reordering accurately, provide insight into the nature of reordering, and help in the evaluation and analysis of reordering leading to mitigation of its adverse effects. Proposed metrics for packet reordering, namely, reorder density, reorder buffer‐occupancy density, reordering extent, and n ‐reordering, overcome to various degrees the deficiencies of percentage reordering in capturing the nature and extent of reordering. These metrics vary widely in areas such as evaluation complexity, measurement technique, usage, and in the definition used for packet reordering itself. Metrics for reordering are evaluated using a framework consisting of a set of both essential and desirable attributes of reorder metrics. The attributes include the ability to capture reordering, sensitivity to lost and duplicate packets in reorder measurements, usefulness, simplicity, and evaluation complexity. Finally, the characterization of packet reordering using these metrics is discussed, using sets of measurements carried over the Internet. Copyright © 2007 John Wiley & Sons, Ltd.