20 search results - page 3 / 4 » Dynamic Tree Bitmap for IP Lookup and Update |
WEA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ï¬...
INFOCOM
2009
IEEE
14 years 12 days ago
2009
IEEE
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...
ANCS
2006
ACM
13 years 11 months ago
2006
ACM
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
ICCSA
2007
Springer
13 years 12 months ago
2007
Springer
Mobile IP (MIP) is designed for supporting mobile nodes. The technology does not sufficiently handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) [1] ensures session conti...