M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of ip address lookup algorithms," IEEE Network Magazine, vol. 15, no. 2, pp. 8--23, March-April 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An IP Packet Forwarding Technique Based on Partitioned.. - Akhbarizadeh, Nourani (2002) (Correct)
....protocol changes to avoid the LUT search problem all together [15] Moreover, some researchers suggest partitioning LUT to reduce lookup time complexity. For example, 9] implies that LUT be partitioned into separate tables based on prefix length. A good survey of these methods can be found in [16] [17] The main contribution of this paper is twofold. First, we present Ip packet forwarding based on partitioned lookup table (IFPLUT) method which to a large extent reduces the complexity of the route lookup operation and parallelizes the search process. Second, we offer an efficient ....
M. Ruiz-Sanchez, E. Biersack and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms," IEEE Network Magazine, March 2001.
Efficient Hardware Architecture for Fast IP Address Lookup - Pao, Liu, Wu, Yeung, Chan (2002) (2 citations) (Correct)
....have been published in the literature [1 3,7,9 11] These methods employ sophisticated data structures and rely heavily on the on chip cache memory of the CPU. The average time to perform one address lookup ranges from 0. 5 to 6 micro second when executed on a 200 MHz PentiumPro based computer [8]. Although the processing time can be shortened by using a more powerful CPU, the software approaches may not scale with the explosive growth of the internet in terms of the data rate and the size of the forwarding table. Gupta et al. proposed a simple hardware table lookup approach in [4] Their ....
M. A. Ruiz-Sanchez, E. W. Biersack and W. Dabbous, "Survey and Taxonomy of IP Address Lookup Algorithms", IEEE Network, pp. 8-23, March/April 2001.
A B-Tree Dynamic Router-Table Design - Lu, Sahni (Correct)
....priority may be done in an arbitrary fashion type as longest matching prefix tables (LMPT) Although every LMPT is also an NHPRT, an NHPRT may not be an LMPT. We use W to denote the maximum possible length of a prefix. In IPv4, W = 32 and in IPv6, W = 128. Ruiz Sanchez, Biersack, and Dabbous [11] review data structures for static LMPTs and Sahni, Kim, and Lu [17] review data structures for both static and dynamic LMPTs. Several trie based data structures for LMPTs have been proposed [18, 1, 2, 10, 19, 12, 13] Structures such as that of [18] perform each of the dynamic router table ....
M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, Survey and taxonomy of IP address lookup algo- rithms, IEEE Network, 2001, 8-23.
IP Lookup By Binary Search On Prefix Length - Kim, Sahni (2002) (Correct)
....packet is sent to ouput link a. The speed at which the router can route packets is limited by the time it takes to perform this table lookup for each packet. Several solutions for the IP lookup problem (i.e. finding the longest matching prefix) have been proposed. These solutions are surveyed in [3, 6]. In this paper, we focus on the collection of hash tables (CHT) scheme of Waldvogel et al. 9] This work was supported, in part, by the National Science Foundation under grant CCR 9912395. Let P be the set of prefixes in a router table, and let Pi be the subset of P comprised of prefixes ....
....count for the marker and the prefix together should be i and not 2. For example, in Figure 2(b) the marker corresponding to the non null pointer to node N42 is identical to the prefix P3 and that for the non null pointer to N43 is identical to P4. So, we can safely reduce the value of Entries[3] from 5 to 3. Note also that if the target lengths for the example of Figure 2(a) are 1, 3, and 5, then the number of prefixes and markers in Ha is 4. However, ExpansionCost[2, 3] Entries[3] 2 5 = 7. Exclusive of the time needed to compute ExpansionCost and Entries, the complexity of ....
[Article contains additional citation context not shown here]
M. Ruiz-Sanchez, E. Biersack, and W. Dabbous, Survey and taxonomy of IP address lookup algo- rithms, IEEE Network, 2001, 8-23.
High Router Flexibility and Performance by.. - Duret, Rischette, .. (2002) (Correct)
....where to send the packet, or a default treatment) Figure 1 below is an example of such behavior for basic IP forwarding. The implemented lookup process is basically a multibit Trie allowing for either exact range or longest match. An extensive survey of lookup algorithms can be found in [5]. The complexities reported for this lookup scheme are: Worst case lookup time O(W) Worst case update time O(W K 2K) Worst case memory size O(2kNW K) Where N is the number of entries, W the length of the address and K the size of the bit slice (or stride according to [5] Fig. 1. ....
.... be found in [5] The complexities reported for this lookup scheme are: Worst case lookup time O(W) Worst case update time O(W K 2K) Worst case memory size O(2kNW K) Where N is the number of entries, W the length of the address and K the size of the bit slice (or stride according to [5]) Fig. 1. Successive header fields to be processed for basic IPv4 forwarding. The shaded areas within the incoming frame are the header fields that are analyzed through the IFT. The sequence of the analyzed fields and related counters update is fully defined by the pattern store memory that ....
[Article contains additional citation context not shown here]
Miguel A. Ruiz-Sanchez, Ernst W. Biersack, Walid Dabbous "Survey and Taxonomy of IP Address Lookup Algorithms" in IEEE Network March/April 2001
Efficient Caching for IP Lookups - Ioannidis, Grama (2004) (Correct)
No context found.
M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of ip address lookup algorithms," IEEE Network Magazine, vol. 15, no. 2, pp. 8--23, March-April 2001.
Performance Prediction Methods for Address Lookup.. - Kawabe, Ata, Murata (2001) (Correct)
No context found.
M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network, vol. 15, pp. 8--23, Mar./Apr. 2001.
Performance Prediction Method for Address Lookup Algorithms Based .. - Kawabe (2002) (Correct)
No context found.
M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network, vol. 15, pp. 8--23, Mar./Apr. 2001.
On Performance Prediction of Address Lookup.. - Kawabe, Ata.. (2001) (Correct)
No context found.
M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network, vol. 15, no. 2, pp. 8--23, Mar./Apr. 2001.
On Performance Prediction of Address Lookup.. - Kawabe, Ata.. (2002) (Correct)
No context found.
M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Network, vol. 15, no. 2, pp. 8--23, Mar./Apr. 2001.
Shared Memory Multiprocessor Architectures for Software IP.. - Luo, Bhuyan, Chen (2003) (Correct)
No context found.
M. A. Ruiz-Sanchez, E. W. Biersack, and W. Dabbous, Survey and Taxonomy of IP Address Lookup Algorithms, IEEE Network, March/April 2001, pp 8-23.
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