loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l
On Reorder Density and its Application to Characterization of Packet Reordering
Sydney, Australia
November 15-November 17
ISBN: 0-7695-2421-4
ASCII Text
x 
 
Nischal M. Piratla, Anura P. Jayasumana, Tarun Banka, "On Reorder Density and its Application to Characterization of Packet Reordering," Local Computer Networks, Annual IEEE Conference on, pp. 156-165, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005.
 
 
BibTex
x
 
@article{ 10.1109/LCN.2005.96,
author = {Nischal M. Piratla and Anura P. Jayasumana and Tarun Banka},
title = {On Reorder Density and its Application to Characterization of Packet Reordering},
journal ={Local Computer Networks, Annual IEEE Conference on},
volume = {0},
year = {2005},
issn = {0742-1303},
pages = {156-165},
doi = {http://doi.ieeecomputersociety.org/10.1109/LCN.2005.96},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Local Computer Networks, Annual IEEE Conference on
TI - On Reorder Density and its Application to Characterization of Packet Reordering
SN - 0742-1303
SP156
EP165
A1 - Nischal M. Piratla,
A1 - Anura P. Jayasumana,
A1 - Tarun Banka,
PY - 2005
KW - null
VL - 0
JA - Local Computer Networks, Annual IEEE Conference on
ER -
 
Nischal M. Piratla, Deutsche Telekom Laboratories
Anura P. Jayasumana, Colorado State University
Tarun Banka, Colorado State University

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.

Citation:
Nischal M. Piratla, Anura P. Jayasumana, Tarun Banka, "On Reorder Density and its Application to Characterization of Packet Reordering," lcn, pp.156-165, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005
Usage of this product signifies your acceptance of the Terms of Use.