Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing
نویسندگان
چکیده
منابع مشابه
A Small and Fast IP Forwarding Table Using Hashing
Building next generation routers with the capability of forwarding multiple millions of packets per second is required for the increasing demand for high bandwidth on the Internet. Reducing the required memory size of the forwarding table is a possible solution since small forwarding table can be integrated into the application specific integrated circuit (ASIC). In this paper a hash technique ...
متن کاملscour modeling piles of kambuzia industrial city bridge using hec-ras and artificial neural network
today, scouring is one of the important topics in the river and coastal engineering so that the most destruction in the bridges is occurred due to this phenomenon. whereas the bridges are assumed as the most important connecting structures in the communications roads in the country and their importance is doubled while floodwater, thus exact design and maintenance thereof is very crucial. f...
Memory Efficient IPV4/V6 Lookup using Path Compression
With the rapid growth of the Internet, IP-lookup becomes the bottle-neck in network traffic management. Therefore, the design of high speed IP routers has been a major area of research. The focus of this paper is on achieving significant reduction in memory requirements for the longest prefix-match operation needed in IPv4/v6 lookups. The Longest Prefix Matching (LPM) is one of the problems in ...
متن کاملEnergy Efficient Fast Forwarding in Event Driven Wireless Sensor Network (EWSN) using Route Discovery
In wireless Sensor Network Efficient event detecting protocol (EEDP) is used for event monitoring. In the event occuring area each node broadcasts its primary detection result to make a final decision. The final decision-made by a node will choose the next hop using the underlying routing protocol to forward a single alarm packet and the shortest path is also considered. For selecting a shortes...
متن کاملAn Efficient Parallel IP Lookup Technique for IPv6 Routers Using Multiple Hashing with Ternary marker storage
Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when increases traffic in the router or when employed for IPV6 address lookup. Our paper describes a novel approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2018
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2018.2820067