33 search results - page 2 / 7 » Adaptive Data Structures for IP Lookups |
137
Voted
AINA
2009
IEEE
15 years 5 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
ICN
2007
Springer
15 years 4 months ago
2007
Springer
We propose a data structure–dynamic tree bitmap–for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tr...
92
Voted
INFOCOM
2002
IEEE
15 years 3 months ago
2002
IEEE
A multigigabit IP router may receive several millions packets per second from each input link. For each packet, the router needs to find the longest matching prefix in the forw...
100
Voted
CCR
2004
14 years 10 months ago
2004
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
83
Voted
ICNP
1999
IEEE
15 years 2 months ago
1999
IEEE
The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost im...