CS Talk
Nabeel Nasir
Breakfast catering from Koffee will be available!
Host: Ozan Erat
Title: Understanding the Distance Vector Routing Algorithm
Abstract:
When you’re watching a video on Instagram or playing an online multiplayer game, under the hood network packets are being sent from a server on the Internet to your smartphone through a network of routers. Determining the best path for these packets is a critical operation called routing, which can make the difference between a jittery video or laggy game and a smooth experience we expect. In this talk, I will introduce Distance Vector routing, which is one type of routing algorithm based on the Bellman-Ford equation. We will try to understand the intuition behind the algorithm, do an interactive activity to learn how the algorithm works, and discuss some of its distributed computing challenges. You will leave this talk knowing how the Distance Vector algorithm works and with a basic understanding of how computer networks handle routing of packets.
Bio:
Nabeel Nasir is a PhD candidate at the University of Virginia (UVA) advised by Prof. Bradford Campbell. His research aims to democratize Edge Computing for the Internet of Things (IoT) by distributing workloads on inexpensive edge hardware, and to empower users in shared IoT environments with better control over their data privacy. He has facilitated learning for over 750 students across 11 courses through his roles as an Instructor of Record, a GTA, and a mentor for undergraduate students and high school students. Notably, he was awarded the UVA Engineering Teaching fellowship and the UVA CS department’s Outstanding Graduate Teaching award, and was nominated for an All-University Graduate Teaching award. He has previously worked at Adobe and EnLite Research as a software engineer for over 3 years.