1 / 10

Efficient implementation of IPv6 routing and QoS technologies on an Intel platform.

Efficient implementation of IPv6 routing and QoS technologies on an Intel platform. . Presented by: Ciara Loftus Supervisors: Liam Kilmartin Cristian Dumitrescu. Project Overview. Intel DPDK (Data Plane Development Kit) :

mikasi
Download Presentation

Efficient implementation of IPv6 routing and QoS technologies on an Intel platform.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Efficient implementation of IPv6 routing and QoS technologies on an Intel platform. Presented by: Ciara Loftus Supervisors: Liam Kilmartin CristianDumitrescu

  2. Project Overview • Intel DPDK (Data Plane Development Kit) : • set of libraries that help applications transmit and receive data as efficiently as possible on IA • features a routing algorithm (LPM) implementation for IPv4 packets • LPM for IPv6 • Implementation, Test Application & Benchmarking • Quality of Service

  3. IPv6 Packet Header Note: 128-bit source & destination address

  4. Longest Prefix Matching “the process of determining which prefix (if any) in a set of prefixes covers a target address. A target address is covered by a prefix if all of the bits in the prefix match the left-most bits of the target address. When multiple prefixes cover an address, the longest prefix is the one that matches.” RFC 2461

  5. Algorithm • API: • Lookup • Add • Delete • Decision Criteria: • Performance • Resources • Time

  6. Hash-based vsTrie-based Scheme

  7. Level Compressed Trie • Binary Tree • Radix Trie: Nodes which have a single child are merged with their child. • LC-Trie: replace the i highest complete levels of the binary trie with a single node with 2­­i descendants.

  8. Current Work • Programs completed: • Bitwise comparison between IP addresses. • Simple binary tree with lookup, add & delete operations performed with binary numbers. • Currently working on: • Radix tree implementation. • Using pcap library to capture packets & retrieve packet headers.

  9. Future Work • Algorithm Implementation • Test Application Development • Performance Measurements • QoS

  10. Questions?

More Related