 |
Distributed Network Algorithms |
 |
(June 27, 2016 - July 02, 2016) |
||
Course Instructors:
 |
 |
|
| Dr Stefan Schmid | Dr Partha Sarathi Mandal |
Download Lecture Slides and Lecture Notes
Course Details (1 credit course, total 10 lectures)
June 27, 2016 Monday
Lecture 1: 11:30AM to 12:30PM
Network Topologies and Interconnects
Theory: Diameter-Degree Tradeoffs, Network Design, Expansion
Application: Datacenter Fabrics
Lecture 2: 12:30PM to 01:30PM
The Power of Locality
Theory: Coloring and Distributed Symmetry Breaking
Application: Parallel Computing, Wireless Medium Access
June 28, 2016 Tuesday
Lecture 3: 10:00 to 11:00 AM
The Power of Randomization
Theory: Maximal Independent Sets
Application: Biology
Lecture 4: 11:15AM to 12:15PM
Spanning Tree Constructions
Theory: Fast Distributed Spanning Tree Algorithms
Application: Ad-hoc and Sensor Networks, Ethernet Spanning Tree Protocol (STP)
June 29, 2016 Wednesday
Lecture 5: 10:00 to 11:00 AM
Distributed Synchronization
Theory and Application: Clock Synchronization (with a short excursion to graph clustering)
Lecture 6: 11:15AM to 12:15PM
Self-Stabilization
Theory: Self-Stabilization and Self-Adjusting Networks
Application: P2P Networks
June 30, 2016 Thursday
Lecture 7: 10:00 to 11:00 AM
Distributed Objects
Mutual Exclusion and the Arrow Protocol
Lecture 8: 11:15AM to 12:15PM
Distributed Wireless Networks
Theory and Application: Medium Access
July 01, 2016 Friday
Lecture 9: 10:00 to 11:00 AM
Graph Embedding
Theory: Algorithms for Graph Embeddings
Practice: Big Data Analytics, Network Virtualization
Lecture 10: 11:15AM to 12:15PM
Software-Defined Networking
Theory: Distributed Control of Software-Defined Networks
Application: Consistent Network Updates
July 02, 2016 Saturday
Examination for students