National Repository of Grey Literature 4 records found  Search took 0.00 seconds. 
Bloom Filters and Their Use in Internet Routing
Vraštiak, Pavel ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
This thesis is considering Bloom lter data structure to be used in Internet routing. We will describe properties of this data structure and explain why Bloom lters could bring great results in longest pre x matching operation. Algorithm is implemented in C language.
Longest Prefix Match in High-Speed Networks
Skačan, Martin ; Tobola, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with the Longest Prefix Matching (LPM), which is a time-critical operation in packet forwarding. To achieve 100Gbps throughput, this operation has to be implemented in hardware and a forwarding table has to fit into the on-chip memory, which is limited by its small size. Current LPM algorithms need large memory to store IPv6 forwarding tables or cannot be simply implemented in HW. Therefore we performed an analysis of available IPv6 forwarding tables and several LPM algorithms. Based on this analysis, we propose a new algorithm which is able to provide very low memory demands for IPv4/IPv6 lookups. To the best of our knowledge, the proposed algorithm has the lowest memory requirements in comparison to existing LPM algorithms. Moreover, the proposed algorithm is suitable for IP lookup in 100Gbps networks, which is shown on new pipelined hardware architecture with 140Gbps throughput.
Bloom Filters and Their Use in Internet Routing
Vraštiak, Pavel ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
This thesis is considering Bloom lter data structure to be used in Internet routing. We will describe properties of this data structure and explain why Bloom lters could bring great results in longest pre x matching operation. Algorithm is implemented in C language.
Longest Prefix Match in High-Speed Networks
Skačan, Martin ; Tobola, Jiří (referee) ; Kořenek, Jan (advisor)
This thesis deals with the Longest Prefix Matching (LPM), which is a time-critical operation in packet forwarding. To achieve 100Gbps throughput, this operation has to be implemented in hardware and a forwarding table has to fit into the on-chip memory, which is limited by its small size. Current LPM algorithms need large memory to store IPv6 forwarding tables or cannot be simply implemented in HW. Therefore we performed an analysis of available IPv6 forwarding tables and several LPM algorithms. Based on this analysis, we propose a new algorithm which is able to provide very low memory demands for IPv4/IPv6 lookups. To the best of our knowledge, the proposed algorithm has the lowest memory requirements in comparison to existing LPM algorithms. Moreover, the proposed algorithm is suitable for IP lookup in 100Gbps networks, which is shown on new pipelined hardware architecture with 140Gbps throughput.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.