Distributed Network Algorithms

About the course:

This course is about distributed network algorithms. It covers various fundamental distributed network algorithms including Maximal Independent Set, Leader Election, Byzantine Agreement, Minimum Spanning Tree, Shortest paths routing, Compact Routing, Dominating Set, and Distributed Approximation Algorithms.

Textbook: G. Pandurangan. Distributed Network Algorithms. pdf

Lecture Notes:

Course Information

Distributed Model, Maximal Independent Set

Broadcast, BFS, DFS

Leader Election

Minimum Spanning Tree

Routing

Faster MST algorithms

Distributed Approximation Algorithms

Wireless Networks

Compact Routing

Dominating Set

Distributed Agreement