Efficient prefix updates for IP router using lexicographic ordering and updateable address set
Dynamic IP router table schemes, which have recently been proposed in the literature, perform an IP lookup or an online prefix update in O(log2|T|) memory accesses (MAs). In terms of lookup time, they are still slower than the full expansion/compression (FEC) scheme (compressed next-hop array/code w...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
IEEE computer society
2008
|
| Online Access: | http://hdl.handle.net/20.500.11937/15759 |