Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Internet Protocol (IP) used to route packets between nodes in a network. It introduces the concept of finding the shortest path in a graph and explains the Breadth First Search (BFS) algorithm for this purpose. The lecture also discusses how BFS algorithm works to find the shortest path from node A to node B, and how routing tables are maintained in a network to facilitate packet transmission. Additionally, it explains the structure of IPv4 addresses on a 32-bit system and the need for IPv6 due to the limited number of available IPv4 addresses.