Hybrid Data Structure for IP Lookup in Virtual Routers Using FPGAs

Date

2011-09-14

Author

Erdem, Oguzhan
Le, Hoang
Prasanna, Viktor K.
Bazlamaçcı, Cüneyt Fehmi

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

176
views

0
downloads

Network router virtualization has recently gained much interest in the research community, as it allows multiple virtual router instances to run on a common physical router platform. The key metrics in designing network virtual routers are (1) number of supported virtual router instances, (2) total number of prefixes, and (3) ability to quickly update the virtual table. Existing merging algorithms use leaf pushing and a shared next hop data structure to eliminate the large memory bandwidth requirement. However, the size of the shared next hop table grows linearly with the number of virtual routers. Due to the limited amount of on-chip memory and the number of I/O pins of Field Programmable Gate Arrays (FPGAs), existing designs cannot support large number of tables and/or large number of prefixes.

Subject Keywords

IP networks, Data structures, Routing, Pipeline processing, Memory management, Field programmable gate arrays, Redundancy

URI

https://hdl.handle.net/11511/52860

Conference Name

22nd IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Genetic algorithms for distributed database design and distributed database query optimization Sevinç, Ender; Coşar, Ahmet; Department of Computer Engineering (2009) The increasing performance of computers, reduced prices and ability to connect systems with low cost gigabit ethernet LAN and ATM WAN networks make distributed database systems an attractive research area. However, the complexity of distributed database query optimization is still a limiting factor. Optimal techniques, such as dynamic programming, used in centralized database query optimization are not feasible because of the increased problem size. The recently developed genetic algorithm (GA) based optimi...
Evaluation of priority dependent and time scheduled MAC layer protocols for ad-hoc networks Erdeğer, İsmail; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2015) Ad-hoc networks have very unique features, such as dynamic topologies, relatively limited bandwidth and wireless signal propagation schemes, which present various challenges for wireless communication. In this thesis, control mechanisms for channel access scheduling and topology in ad-hoc networks are evaluated, which utilize the information from two-hop neighborhood to cope with the communication difficulties in ad-hoc networks. Channel assignment is one of the most important topics for ad-hoc networks. Ch...
Implementation and evaluation of the dependability plane for the dynamic distributed dependable real time industrial protocol ((D₃RIP)) Sezer, Ömer Berat; Schmidt, Şenan Ece; Schmidt, Kalus Werner; Department of Electrical and Electronics Engineering (2013) Dynamic Distributed Dependable Real Time Ethernet Industrial Protocol (D3RIP) is a real time industrial communication protocol that runs over shared-medium Ethernet with COTS hardware. The protocol consists of an interface layer that enables time slotted communication and a coordination layer that guarantees collision avoidance and timely delivery of real time messages generated by the control application. At the current development stage, these two layers of the protocol are fully implemented and tested. T...
Memory organization in pipelined hierarchical search structures for packet classification Rumelili, Çağla Irmak; Bazlamaçcı, Cüneyt Fehmi; Erdem, Oğuzhan; Department of Electrical and Electronics Engineering (2013) Packet classification is a main requirement in routers to manage network security and traffi c. In high speed networks packet classification in line rates has become a major challenge. Our design mainly benefits from a parallel pipelined architecture implemented on field programmable gate arrays (FPGA) to achieve high speed packet processing. The presented solution is based on Hierarchical Hybrid Search Structure (HHSS) [5]. Our work solves the deep pipeline problem of HHSS in a memory e fficient way. This ...
Placement of 5G RAN Slices in Multi-tier O-RAN 5G Networks with Flexible Functional Splits Sarikaya, Egemen; Onur, Ertan (2021-01-01) The network slicing concept has gained much attention with the development of software-defined network and network function virtualization technologies, enabling logically isolated networks for different purposes in the same network infrastructure. The virtualization of network functions enables the functional split of radio access network functions to fulfill different 5G radio access network requirements. Functional split can be expressed as deciding the distribution of radio access network functionalitie...

Citation Formats

O. Erdem, H. Le, V. K. Prasanna, and C. F. Bazlamaçcı, “Hybrid Data Structure for IP Lookup in Virtual Routers Using FPGAs,” presented at the 22nd IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), Santa Monica, CA, 2011, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52860.