An O(log n) Dynamic Router-Table Design (2004)
by
Sartaj Sahni
,
Kun Suk Kim
| Venue: | IEEE Transactions on Computers |
| Citations: | 8 - 1 self |
BibTeX
@ARTICLE{Sahni04ano(log,
author = {Sartaj Sahni and Kun Suk Kim},
title = {An O(log n) Dynamic Router-Table Design},
journal = {IEEE Transactions on Computers},
year = {2004},
volume = {53},
pages = {351--363}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Internet (IP) packet forwarding is typically done by finding the longest prefix in a router table that matches the packer's destination address. For W-bit destination addresses, the use of binary tries enables us to determine the longest matching prefix in O(W) time, independent of the number n of prefixes in the router table. New prefixes may be inserted and old ones deleted in O(W) time also.
