loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh IEEE Symposium on Computers and Communications (ISCC'02)
O(log n ) Dynamic Packet Routing
Ramada Hotel, Taormina-Giardini Naxos, Italy
July 01-July 04
ISBN: 0-7695-1671-8
ASCII Text
x 
 
Sartaj Sahni, Kun Suk Kim, "O(log n ) Dynamic Packet Routing," Computers and Communications, IEEE Symposium on, pp. 443, Seventh IEEE Symposium on Computers and Communications (ISCC'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/ISCC.2002.1021713,
author = {Sartaj Sahni and Kun Suk Kim},
title = {O(log n ) Dynamic Packet Routing},
journal ={Computers and Communications, IEEE Symposium on},
volume = {0},
year = {2002},
issn = {1530-1346},
pages = {443},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2002.1021713},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computers and Communications, IEEE Symposium on
TI - O(log n ) Dynamic Packet Routing
SN - 1530-1346
SP
EP
A1 - Sartaj Sahni,
A1 - Kun Suk Kim,
PY - 2002
KW - Packet routing
KW - longest matching prefix
KW - red-black trees
VL - 0
JA - Computers and Communications, IEEE Symposium on
ER -
 
Sartaj Sahni, University of Florida
Kun Suk Kim, University of Florida
A data structure that permits you to find longest matching prefixes as well as to insert and delete a prefix in O(log n) time, where n is the number of prefixes in the router table is developed. Experiment results using a real IPv4 routing database are also presented.
Index Terms:
Packet routing, longest matching prefix, red-black trees
Citation:
Sartaj Sahni, Kun Suk Kim, "O(log n ) Dynamic Packet Routing," iscc, pp.443, Seventh IEEE Symposium on Computers and Communications (ISCC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.