DocumentCode
2017805
Title
O(log n) dynamic packet routing
Author
Sahni, Sartaj ; Kim, Kun Suk
Author_Institution
Dept. of Comput. & Inf. Sci. & Eng., Florida Univ., Gainesville, FL, USA
fYear
2002
fDate
2002
Firstpage
443
Lastpage
448
Abstract
A data structure is developed that permits one 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. Experimental results using a real IPv4 routing database are also presented.
Keywords
Internet; table lookup; telecommunication network routing; trees (mathematics); IPv4 routing database; Internet; data structure; dynamic packet routing; longest matching prefixes; red-black search trees; router table; table lookup; Data engineering; Data structures; Databases; Encoding; Information science; Internet; Routing; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications, 2002. Proceedings. ISCC 2002. Seventh International Symposium on
ISSN
1530-1346
Print_ISBN
0-7695-1671-8
Type
conf
DOI
10.1109/ISCC.2002.1021713
Filename
1021713
Link To Document