6,898 Hits in 6.2 sec

EASTFILE: An Energy Aware, Scalable, and TCAM based Fast IP Lookup Engine

Hamidreza Mahini
2012 International Journal of Computer Networks & Communications  
This paper presents a novel and intelligent energy aware TCAM-Based IP lookup engine (EASTFILE) which is scalable for large IP lookup tables and also IPv6 lookup.  ...  IP lookup is based on IP lookup table. Simply, IP lookup table has two columns; one for storing prefix of IP addresses and the other for saving next hop.  ...  The Scalability As noted before, a good IP lookup scheme should have a solution for scalability.  ... 
doi:10.5121/ijcnc.2012.4503 fatcat:rttn2u46cbfpjgfnkxi2trr63y

"P4L": A Four Layers P2P Model for Optimizing Resources Discovery and Localization [chapter]

Mourad Amad, Ahmed Meddahi
2006 Lecture Notes in Computer Science  
and scalability, with limited complexity while providing a rapid convergence for the lookup algorithm.  ...  reliability and availability constitute a critical issue.  ...  Algorithm 3 : Lookup acceleration in "P4L" Lookup (Key c1c2c3c4) 1: Begin 2: locate the node (in the same ring) of IP address (P1P2P3P4) where Pi is the smallest value bigger or equal than c i (by a simple  ... 
doi:10.1007/11876601_35 fatcat:irlnkthabvfi5pnfgsdqrn2xdq

Scalable Balanced Pipelined IPv6 Lookup Algorithm

Zoran Cica
2021 Elektronika ir Elektrotechnika  
Scalability represents the main problem in the existing IP lookup algorithms because the IPv6 address space is much larger than the IPv4 address space due to longer IPv6 addresses.  ...  In this paper, we propose a novel IPv6 lookup algorithm that supports very large IPv6 lookup tables and achieves high IP lookup throughput.  ...  However, the problem is a need for scheduling algorithm that schedules the starts of the requested IP lookups.  ... 
doi:10.5755/j02.eie.28903 fatcat:cqh6wnobgfekbjhzi3mn57ctey

A serial and non-collision hash algorithm

Fengjun Shang, Fengjun Shang
2004 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914)  
ln order to deal with classification of IP packets, a novel IF' classification is proposed based the serial and non-collision hash (SNH) algorithm, which is based on Non-Collision Hash Trie-Tree Algorithm  ...  destination IP prefix so that stock space will not exceed total rule number, at the same time, we introduce the serial algorithm in the source port lookup.  ...  IP lookup algorithms must be scalable with respect to the number of prefixes.  ... 
doi:10.1109/icccas.2004.1346205 fatcat:treeafr3yfekvpamkudsbl7iaq

A Novel Scalable IPv6 Lookup Scheme Using Compressed Pipelined Tries [chapter]

Michel Hanna, Sangyeun Cho, Rami Melhem
2011 Lecture Notes in Computer Science  
Commercially, many routers employ Ternary Content Addressable Memory (TCAM) to facilitate fast IP lookup. However, TCAMs are power-eager, expensive, and not scalable.  ...  An IP router has to match each incoming packet's IP destination address against all stored prefixes in its forwarding table.  ...  Acknowledgment This work was supported in part by a NSF grant (CCF-0952273).  ... 
doi:10.1007/978-3-642-20757-0_32 fatcat:viakxluuqzcabniywxwdfluvfe

Scalable IP Routing Lookup in Next Generation Network [chapter]

Chia-Tai Chan, Pi-Chung Wang, Shuo-Cheng Hu, Chung-Liang Lee, Rong-Chang Chen
2003 Lecture Notes in Computer Science  
As compared to the software-based solutions, the Ternary content-addressable memory can offer sustained throughput and simple system architecture. It is attractive for IPv6 routing lookup.  ...  It is able to accomplish the best matching prefix problem in O(1) time without considering the number of prefixes and its lengths.  ...  The bottleneck of the FE is the route lookup process, so that our study focuses on the design of a fast and scalable IP lookup scheme.  ... 
doi:10.1007/978-3-540-45235-5_5 fatcat:hd5qjxlyljfotelj6dqousjxuu

Scalable mobility management in large-scale wireless mesh networks

Shih-Hsien Yang, Lichun Bao
2011 2011 IEEE Wireless Communications and Networking Conference  
Different from prior DHT solutions that were based on consistent hashing algorithms, HDR uses a novel NCR (neighbor-aware contention resolution) algorithm to maintain the DHT lookup functions.  ...  However, WMNs suffer from scalability, performance degradation and service disruption issues due to inherent network mobility.  ...  In simple terms, mesh nodes in HDR serve as the directory server, and the destination IP address is used as the directory lookup key to find the current routing information of the destination.  ... 
doi:10.1109/wcnc.2011.5779335 dblp:conf/wcnc/YangB11 fatcat:oakb7vyuabgave6tqsaii6q26e

Scalable, memory efficient, high-speed IP lookup algorithms

R. Sangireddy, N. Futamura, S. Aluru, A.K. Somani
2005 IEEE/ACM Transactions on Networking  
IP address lookup algorithms can be evaluated on a number of metrics-lookup time, update time, memory usage, and to a less important extent, the time to construct the data structure used to support lookups  ...  In this paper, we present two IP address lookup schemes-Elevator-Stairs algorithm and logW-Elevators algorithm.  ...  Cheah, Department of Electrical and Computer Engineering, Iowa State University, for assisting in carrying out simulation work as a support to the analytical study on address lookup algorithms.  ... 
doi:10.1109/tnet.2005.852878 fatcat:yscpuyoribhhngbhcvhdzxax2y

A TCAM-based distributed parallel IP lookup scheme and performance analysis

Kai Zhen, Chengchen Hu, Hongbin Lu, Bin Liu
2006 IEEE/ACM Transactions on Networking  
Using four 133 MHz TCAM chips and given 25% more TCAM entries than the original route table, the proposed scheme achieves a lookup throughput of up to 533 MPPS while remains simple for ASIC implementation  ...  Using ternary content addressable memory (TCAM) for high-speed IP address lookup has been gaining popularity due to its deterministic high performance.  ...  ACKNOWLEDGMENT The authors would like to thank Mr. G. Zhang and the reviewers of IEEE INFOCOM 2004 for their valuable comments on this paper. They also thank Dr. X. Wang and Mr. D.  ... 
doi:10.1109/tnet.2006.880171 fatcat:z75t5nvsgzaehkhutkmf5pvq2y

Neural Network Based Algorithms for IP Lookup and Packet Classification [chapter]

Mehran Mahramian, Nasser Yazdani, Karim Faez, Hassan Taheri
2002 Lecture Notes in Computer Science  
The algorithm can be implemented in hardware on a single chip. Our method can perform an IP lookup in 4.5 nanoseconds, which implies the support for a 60 Gbps link rate.  ...  Increasing the rate of communication links is in contrast to the practical processing power of routers and switches. We propose some neural network algorithms to solve the IP lookup problem.  ...  Using a simple back propagation algorithm, the network should learn ) 32 ( 2 k − IP addresses, where k is the length of IP prefix (e.g. 65536 IP addresses for a 16 bit long IP prefix).  ... 
doi:10.1007/3-540-36087-5_24 fatcat:rhsitke2wrd33g5fys4jt4jl6y

Towards On-the-Fly Incremental Updates for Virtualized Routers on FPGA

Thilan Ganegedara, Hoang Le, Viktor K. Prasanna
2011 2011 21st International Conference on Field Programmable Logic and Applications  
The scalability of the architecture is demonstrated for upto 17 real routing tables.  ...  The reconfigurability and abundant parallelism of FPGAs make them a desirable hardware platform for high-performance and cost-effective routers.  ...  Problem Definition Given K virtual routing tables R i , i = 0, 1, ..., K − 1, ſnd (1) an algorithm to efſciently merge the routing tables with support for on-the-ƀy incremental updates (2) a scalable virtualized  ... 
doi:10.1109/fpl.2011.46 dblp:conf/fpl/GanegedaraLP11 fatcat:d5ncvl2lkng3bi5bifr24yc3di

Dynamic Routing Tables Using Simple Balanced Search Trees [chapter]

Yeim-Kuan Chang, Yung-Chieh Lin
2006 Lecture Notes in Computer Science  
Pre-computations are usually used by the special designed IP address lookup algorithms for better performance in terms of lookup speed and memory requirement.  ...  Various schemes for high-performance IP address lookups have been proposed recently.  ...  Despite the intense research that has been conducted in recent years, there should be a balance between lookup speed, memory requirement, update, and scalability for a good IP address lookup scheme.  ... 
doi:10.1007/11919568_39 fatcat:vuf4nzpqfnfn5kcfz74epyp2bi

Scalable Packet Classification for IPv6 by Using Limited TCAMs [chapter]

Chia-Tai Chan, Pi-Chung Wang, Shuo-Cheng Hu, Chung-Liang Lee, Rong-Chang Chen
2003 Lecture Notes in Computer Science  
Accordingly, we propose an efficient algorithm to reduce the required TCAM by encoding the address portion of the searchable entries.  ...  As compared to the software-based solutions, the TCAM can offer sustained throughput and simple system architecture.  ...  That leads to a simple IP lookup scheme, which requires O(W ) hash lookups, independent of the number of prefixes.  ... 
doi:10.1007/978-3-540-45235-5_8 fatcat:6kklnt6kxfdrjn7zsevy2fcehe

A complex systems approach to service discovery

R. Robinson, J. Indulska
2004 Proceedings. 15th International Workshop on Database and Expert Systems Applications, 2004.  
to improve their scalability and robustness.  ...  We describe the influences of complex systems theory on the design of an existing service discovery protocol for pervasive computing environments, and show that the application of complex systems ideas  ...  The finger table then stores as many identifiers and IP addresses for each interval as it is capable of doing.  ... 
doi:10.1109/dexa.2004.1333549 dblp:conf/dexaw/RobinsonI04 fatcat:ojqic3sjefhwfkrifyxtlebf34

Towards Dynamic and Scalable High-Speed IP Address Lookup Based on B+ Tree

Gang WANG, Yaping LIN, Rui LI, Jinguo LI, Xin YAO, Peng LIU
2012 IEICE transactions on information and systems  
Our contributions are to design a practical structure for high-speed IP address lookup suitable for both IPv4 and IPv6 addresses, and to develop efficient algorithms for dynamic prefix insertion and deletion  ...  In this paper, we propose a novel structure named Compressed Multi-way Prefix Tree (CMPT) based on B+ tree to perform dynamic and scalable high-speed IP address lookup.  ...  There are several driving factors motivating the research on dynamic and scalable high-speed IP address lookup problem.  ... 
doi:10.1587/transinf.e95.d.2277 fatcat:d62zdjroxrgc5mdksroeznreia
« Previous Showing results 1 — 15 out of 6,898 results