5 search results - page 1 / 1 » Multiway range trees: scalable IP lookup with fast updates |
CN
2004
13 years 4 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
AINA
2009
IEEE
13 years 11 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...
TC
2010
13 years 2 months ago
2010
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
SIGCOMM
2000
ACM
13 years 8 months ago
2000
ACM
Routers must do a best matching pre x lookup for every packet solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed ...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
Abstract— Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services...