YoVDO

Fast IP Address Matching in Elixir with Radix Trees and Persistent Term

Offered By: Code Sync via YouTube

Tags

Elixir Courses Erlang Courses Data Structures Courses Web Security Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore fast IP address matching techniques in Elixir using radix trees and persistent term in this conference talk from Code BEAM America 2022. Dive into the challenge of efficiently comparing incoming connection IP addresses against a large list of IP prefixes. Learn why default Elixir data structures fall short for this task and discover how radix trees offer a superior solution. Examine various approaches including GenServers, ETS, and constant pools optimization, understanding their limitations for this specific problem. Gain insights into the optimal solution utilizing persistent_term, enabling thousands of processes to access the same data structure rapidly. Enhance your understanding of IP address matching, radix trees, and Elixir/Erlang features to improve web server security and performance.

Syllabus

Fast IP Address Matching in Elixir (...) & Persistent Term | Michael Lubas | Code BEAM America 2022


Taught by

Code Sync

Related Courses

Intro to Computer Science
University of Virginia via Udacity
Design of Computer Programs
Stanford University via Udacity
Analytic Combinatorics, Part I
Princeton University via Coursera
Algorithms, Part I
Princeton University via Coursera
Algorithms, Part II
Princeton University via Coursera