33 search results - page 4 / 7 » Adaptive Data Structures for IP Lookups |
PIMRC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Future generations of mobile operator networks, based on an all-IP-based flat architecture and a multitude of different access technologies, require a proper IP-based mobility ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...
184
Voted
STOC
2003
ACM
15 years 10 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...
87
Voted
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
— The scalability of Internet addressing and routing has been a serious issue and becomes a more urgent problem today because of driving factors like IPv6. A radical impacting el...
73
Voted
MICRO
2002
IEEE
14 years 10 months ago
2002
IEEE
abstracting the operation of lower-level packet processing functions. The library synthesizes into field-programmable gate array (FPGA) logic and is utilized in a network platform ...