Filters








1,750 Hits in 5.7 sec

IP LOOKUP BY BINARY SEARCH ON PREFIX LENGTH

KUN SUK KIM, SARTAJ SAHNI
2002 Journal of Interconnection Networks (JOIN)  
õ 3 $ P1=1* P2=01* P3=001* P4=010* P5=0101* P6=00001* P7=00010* P8=00110* P9=01000* P10=01001* Prefixes § | ¥ b w N31 N32 N41 N42 N43 N51 N52 N53 N54 Length 5 4 3 2 1 N2 N1 P1 P2 P3 P4 P5 P6 P7 P8 P9 P10  ...  ø ÷ ò g ü õ ó g ø ¡ ö ú ¡ h a f $ P2=01* P1=1* 2(length 2) 3(length 3) 4(length 5) 1(length 1) Array of hash table pointers P10=01001* P9=01000* P8=00110* P7=00010* P6=00001* P5=01010* P5=01011* P3=001  ... 
doi:10.1142/s0219265902000586 fatcat:djyzx3bfxja4fcyv4sscno7h4a

IP lookup by binary search on prefix length

Kun Suk Kim, S. Sahni
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003  
õ 3 $ P1=1* P2=01* P3=001* P4=010* P5=0101* P6=00001* P7=00010* P8=00110* P9=01000* P10=01001* Prefixes § | ¥ b w N31 N32 N41 N42 N43 N51 N52 N53 N54 Length 5 4 3 2 1 N2 N1 P1 P2 P3 P4 P5 P6 P7 P8 P9 P10  ...  ø ÷ ò g ü õ ó g ø ¡ ö ú ¡ h a f $ P2=01* P1=1* 2(length 2) 3(length 3) 4(length 5) 1(length 1) Array of hash table pointers P10=01001* P9=01000* P8=00110* P7=00010* P6=00001* P5=01010* P5=01011* P3=001  ... 
doi:10.1109/iscc.2003.1214104 dblp:conf/iscc/KimS03 fatcat:yf5mfwllive7fmyx3labptvna4

Binary search on prefix lengths for ip address lookup

Ju Hyoung Mun, Hyesook Lim, Changhoon Yim
2006 IEEE Communications Letters  
Index Terms-IP address lookup, binary trie, binary search, binary search on prefix length, leaf pushing.  ...  In this letter, a new IP address lookup scheme based on binary search on prefix lengths is proposed.  ...  We have performed thorough research on the various address lookup algorithms related to binary search and proposed a new algorithm based on binary search on prefix lengths in Manuscript this letter.  ... 
doi:10.1109/lcomm.2006.1638626 fatcat:kmevl4rhkrawpeuhonjqemv6pm

NXG06-1: An Efficient IP Address Lookup Algorithm Using a Priority Trie

Hyesook Lim, Ju Hyoung Mun
2006 IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM)  
By thoroughly studying the current proposals for the IP address lookup problem, we find out that binary search could be a lowcost solution while providing high performance.  ...  The longest prefix matching for the IP address lookup is more complex than exact matching because of its dual dimensions, length and value.  ...  Waldvogel et al. proposed to use binary search on hash tables organized by prefix lengths [5] . Lim et al.  ... 
doi:10.1109/glocom.2006.347 dblp:conf/globecom/LimM06 fatcat:ai6uk6sorfbznicxvodj5h62oy

An Efficient IP Address Lookup Scheme Using Balanced Binary Search with Minimal Entry and Optimal Prefix Vector

Hyuntae PARK, Hyejeong HONG, Sungho KANG
2011 IEICE transactions on communications  
This paper proposes an efficient IP address lookup scheme using balanced binary search with minimal entries and optimal prefix vectors.  ...  The performance evaluation results show that the proposed scheme offers faster lookup speeds along with reduced memory requirements. key words: IP address lookup, balanced binary search, minimal entry,  ...  Therefore, the lookup speed of a balanced binary search depends only on the number of entries.  ... 
doi:10.1587/transcom.e94.b.3128 fatcat:e5l6t3nddfhedl2wj6r7lkzlvu

An Efficient Parallel IP Lookup Technique for IPv6 Routers Using Multiple Hashing with Ternary marker storage

KIRAN SREE POKKULURI
2011 African Journal of Information & Communication Technology  
Our paper describes a novel approach which employs multiple hashing on reduced number of hash tables on which ternary search on levels is applied in parallel.  ...  This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average  ...  Using 53 hash tables each corresponding to one prefix length, with appropriate markers the number of lookups for prefixes of different lengths in binary and ternary search on levels is given by the figure  ... 
doi:10.5130/ajict.v6i1.627 fatcat:mviq2zv5qbhfvjo435lpmt7nte

Parallel processing priority trie-based IP lookup approach

Hootan Zhian, Muhammad Bayat, Maryam Amiri, Masoud Sabaei
2014 7'th International Symposium on Telecommunications (IST'2014)  
Our method consists of a trie and several subtries based on prefix length. These subtries processed by a specific thread to speed up IP lookup functionality.  ...  Routers must be able to forward millions of packets per second on each of their interfaces. Finding a method that can speed up the IP lookup is one of the challenges in network research.  ...  RELATED WORKS Trie-based algorithms have been proposed to speedup IP lookup in routers. Binary trie [1] is a tree-based data structure. It uses linear search on length.  ... 
doi:10.1109/istel.2014.7000782 fatcat:ckdwe7zjhnblxi6qsbwxmi4jfe

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Hyuntae Park, Hyejeong Hong, Sungho Kang
2012 Computer Networks  
Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution.  ...  Based on this small balanced tree, a native binary search can be effectively used in address lookup issue.  ...  The IP address lookup issue for the prefixes is transformed into a binary search for range.  ... 
doi:10.1016/j.comnet.2011.09.004 fatcat:ge3gmww6uvb35mgwl2cyoaiora

Review On Tries for IPv6 Lookups

Rohit G Bal
2016 International journal of advanced smart convergence  
Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching.  ...  The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router.  ...  Searching in binary tries is done by comparing one bit at a time. IP lookup is basically comparison of bits here best prefix matching..  ... 
doi:10.7236/ijasc.2016.5.3.47 fatcat:3jrsdvzzkfbsfoqtjxpl5ziwra

Scalable high speed IP routing lookups

Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
1997 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM '97  
Our paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths.  ...  IP routing lookup requires computing the best matching prefix, for which standard solutions like hashing were believed to be inapplicable.  ...  The work of George Varghese was supported in part by an ONR Young Investigator Award and NSF grants NCR-940997 and NCR-9628218.  ... 
doi:10.1145/263105.263136 dblp:conf/sigcomm/WaldvogelVTP97 fatcat:de7vvtxebvcbzhdgwowo7vwmri

Scalable high speed IP routing lookups

Marcel Waldvogel, George Varghese, Jon Turner, Bernhard Plattner
1997 Computer communication review  
Our paper describes a new algorithm for best matching prefix using binary search on hash tables organized by prefix lengths.  ...  IP routing lookup requires computing the best matching prefix, for which standard solutions like hashing were believed to be inapplicable.  ...  The work of George Varghese was supported in part by an ONR Young Investigator Award and NSF grants NCR-940997 and NCR-9628218.  ... 
doi:10.1145/263109.263136 fatcat:k3l2g57ygnddbmzofv3a6fwlzm

High speed IP address lookup architecture using hashing

Hyesook Lim, Ji-Hyun Seo, Yeo-Jin Jung
2003 IEEE Communications Letters  
One of the most important design issues for IP routers responsible for datagram forwarding in computer networks is route-lookup mechanism.  ...  In this letter, we explored a practical IP address lookup scheme which converts longest prefix matching problem into the exact matching problem.  ...  [6] proposed an address lookup scheme based on binary search of hash tables.  ... 
doi:10.1109/lcomm.2003.818885 fatcat:2u4imlj5ajednmmwwtjb73akle

Simple and fast IP lookups using binomial spanning trees

Yeim-Kuan Chang
2005 Computer Communications  
Binary trie based lookup algorithms are simple not only for searching for the longest prefix match but also for updating the routing table.  ...  In this paper, we propose a new IP lookup algorithm based on binomial spanning trees.  ...  Since finding a minimal perfect hashing table for the whole set of prefixes is difficult, a binary search on prefix lengths was proposed [18] .  ... 
doi:10.1016/j.comcom.2004.10.014 fatcat:s6htd5ykr5cxpkpyac6fkzqfee

Binary searches on multiple small trees for IP address lookup

Hyesook Lim, Bomi Lee, Wonjung Kim
2005 IEEE Communications Letters  
Index Terms-IP address lookup, binary search, multiple balanced trees, enclosure prefix, disjoint prefix.  ...  number of routing entries not on the length of routing prefixes.  ...  For IP address lookup with longest matching, hashing is applied to hash tables in each prefix length [4] - [5] . The most recent approach is based on a new concept of tree.  ... 
doi:10.1109/lcomm.2005.1375247 fatcat:wroyjrlqdfeshodp33rzkqtwt4

High-speed IP address lookup using balanced multi-way trees

Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim
2006 Computer Communications  
In this paper, we propose a multi-way search architecture for IP address lookup which shows very good performance in search speed.  ...  As one of the major packet processing performed in routers, address lookup determines an output port using the destination IP address of incoming packets.  ...  [8] proposed to organize a routing table by prefix length and apply a binary search on the prefix length in the routing table. In accessing prefixes in each length, hashing is used.  ... 
doi:10.1016/j.comcom.2005.12.002 fatcat:m7jztpbyxvb6dkisfacaf7o4cu
« Previous Showing results 1 — 15 out of 1,750 results