P. Crescenzi, L. Dardini, and R. Grossi, "Ip address lookup made fast and simple," in ESA'99 Conference Proceedings, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....updates. The combined effect of our optimizations produces a 2 to 5.7 fold improvement in the trie update overheads to the pipeline when tested over several core router tables and routing update traces. Even though there has been previous work on optimizing memory usage in routing tries [1] [3], 4] 5] 12] 15] 18] 22] 24] 25] it has mostly focused on non pipelined architectures. To our knowledge, this is the . a) Routing Table 0 0 010 01 100 110 stride = 3 stride = 2 stride = 2 trie node prefix child ptr 1101 ....

....their scheme, nearly) full binary subtrees with levels are converted (recursively) into a single multi bit trie node with stride length to reduce the number of lookups. Several schemes, such as the Lulea Algorithm [4] apply path compression to optimize multi bit tries. Crescenzi et al. [3] use run length encoding to efficiently compress the routing table. The more general problem of constructing multi bit tries (with either fixed or variable strides) that are optimal in terms of total memory usage for a given number of lookups was solved by Srinivasan and Varghese in [24] this is ....

P. Crescenzi, L. Dardini, and R. Grossi. IP Address Lookup Made Fast and Simple. Lecture Notes in Computer Science, 1643:65--76, 1999.

....searching [12] are not applicable, as their performance would not scale. Fortunately, the third characteristic means that specialized data structures can be designed with the desired performance levels. There are many papers in the literature proposing schemes to solve the IP routing problem [7, 8, 9, 10, 11, 20, 24, 27, 28] with various tradeoffs based on memory consumption or memory hierarchies. We are not aware of any published work that generalizes to bounded strings such as telephone numbers, however. Work on routing Internet packets [20] exploits a simple relationship between IP prefixes and nested intervals ....

....prefix itself. In this case, either the number of data values is large or there are many runs of data values. For routing and clustering, we compared retries to LCtries [24] given the conceptual similarity, and to the compressed table data structure of Crescenzi, Dardini, and Grossi (CDG) [7], given its reported speed. The latter, in particular, is among the fastest IP lookup data structures reported in the literature; cf. Section 5. We used the authors code for both benchmarks and included in our test suite the FUNET router table and traffic trace used in the LC trie work [24] ....

[Article contains additional citation context not shown here]

P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Proc. 7th ESA, volume 1643 of LNCS, pages 65--76. Springer-Verlag, 1999.

....performed in order to forward a packet, the computation of the best matching prefix turns out to be the major and most computationally expensive task. Indeed, performing this task on low cost workstations is considered a challenging problem which requires rather sophisticated algorithmic solutions [3, 5, 8, 11, 16, 22, 24]. Partially because of these difficulties, parallel routers have been developed which are equipped with several processors to process packets faster [20, 18, 15] We first illustrate two simple algorithmic approaches to the problem and discuss why they are not feasible for IP lookup: 1. Brute ....

.... out to be inefficient for performing the IP lookup fast enough to guarantee millions of packets per second [15] More sophisticated and efficient approaches have been introduced in several works in which a suitable data structure, named forwarding table, is constructed from the routing table T [3, 5, 8, 11, 16, 22, 24]. For instance, in [24] a method ensuring O(log W ) memory accesses has been presented, where W denotes the number of different prefix lengths occurring in the routing table T . This method has been improved in [22] using a technique called controlled prefix expansion: prefixes of certain lengths ....

[Article contains additional citation context not shown here]

P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Proc. 7th Annual European Symposium on Algorithms, volume 1643 of LNCS, 1999.

....updates. The combined effect of our optimizations produces a 2 to 5.7 fold improvement in the trie update overheads to the pipeline when tested over several core router tables and routing update traces. Even though there has been previous work on optimizing memory usage in routing tries [1] [3], 4] 5] 12] 15] 18] 22] 24] 25] it has mostly focused on non pipelined architectures. To our knowledge, this is the 0101 # 100 # 110 # 1101 # . a) Routing Table 0 0 010 01 100 110 stride = 3 stride = 2 stride = 2 trie node prefix ....

....In their scheme, nearly) full binary subtrees with k levels are converted (recursively) into a single multi bit trie node with stride length k to reduce the number of lookups. Several schemes, such as the Lulea Algorithm [4] apply path compression to optimize multi bit tries. Crescenzi et al. [3] use run length encoding to efficiently compress the routing table. The more general problem of constructing multi bit tries (with either fixed or variable strides) that are optimal in terms of total memory usage for a given number of lookups was solved by Srinivasan and Varghese in [24] this is ....

P. Crescenzi, L. Dardini, and R. Grossi. IP Address Lookup Made Fast and Simple. Lecture Notes in Computer Science, 1643:65--76, 1999.

....solutions have emerged ( 5] 6] 4] 7] 8] 9] but all of these demand modifications to the current Internet Protocol and raise the complexity of routing without completely avoiding the prefix matching problem. Recent research has focused on algorithmic solutions ( 13] 12] [11], 15] 16] The advantage of these is their transparency to protocol and to advances in hardware platforms. In [14] the original level compression scheme was described. The only effort we are aware of on formulating a generalization of level compression to include memory constraints and ....

P. Crescenzi, L. Dardini, R. Grossi, "IP Address Lookup Made Fast and Simple", Dipartmento Di Informatica, Universit a Di Pisa, Technical Report TR-99-01.

No context found.

P. Crescenzi, L. Dardini, and R. Grossi, "Ip address lookup made fast and simple," in ESA'99 Conference Proceedings, 1999.

No context found.

P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Euopean Symposium on Algorithms, pages 65-76, 1999.

No context found.

P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Proc. 7th Annual European Symposium on Algorithms, volume 1643 of LNCS, pages 65--76, 1999.

No context found.

P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Euopean Symposium on Algorithms, pages 65-76, 1999.

No context found.

P. Crescenzi, L. Dardini, and R. Grossi. IP address lookup made fast and simple. In Euopean Symposium on Algorithms, pages 65--76, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC