Network Algorithms and Distributed Computing

When: 17th November 13:30–18:00 and 18th November 10:30–15:30

Where: Carnoy B0.59, Croix du Sud, UCL, Louvain-la-Neuve

Lecturer: Dr. Stefan Schmid, visiting Prof. at UCL

This course is structured around fundamental concepts and problems of distributed systems and networking. The course interleaves theoretical concepts (time and message complexity, locality, scalability, convergence time, self-stabilization, randomization) with practical applications (load-balancing, Internet routing). Several exercises ensure that students have time to play with and digest the concepts. The goal of the course is to give the students techniques to understand and reason about distributed systems and networks. No specific background is required for this course, and all needed mathematical concepts are introduced in the course.

To enroll in this course, please enter your name and email address in the form below. For any additional information, please contact course organizer Prof. Marco Canini at .

Course contents:

Introduction to distributed and local graph algorithms
Network topologies
Broadcast and convergecast
Spanning tree computation
Distributed synchronization and clustering
Distributed coloring
Independent sets
Distributed sorting
The power of randomization

This course appeals to Master and PhD students, and practitioners from industry interested in foundations of distributed systems and networking, as well as algorithms.

References:

Lecture notes for this course
Slides of this course
Distributed computing: a locality-sensitive approach by David Peleg, SIAM, 2000

Location:

The lectures will take place on the UCL campus, auditorium Carnoy B0 (see this map), Croix du Sud in Louvain-la-Neuve. UCL is easily reachable by train or car. Parking at Croix du Sud is free but requires a permit (zone B). If you need a permit, please send your license plate number to . More info regarding parking in Louvain-la-Neuve can be found here.

Participation:

The course is open to all scholars, researchers and practitioners from Belgium and abroad. Participation will be credited to doctoral students upon request, as part of the GRASCOMP doctoral school programme. Attendance is free but registration is required by enrolling using the form below.

About the lecturer:

Stefan Schmid obtained his PhD degree from ETH Zurich (group led by Roger Wattenhofer) for his contributions to the field of dynamic and incentive-compatible distributed systems. Subsequently, he was a postdoc at TU Munich (chair for efficient algorithms) and Paderborn (chair for theory of distributed systems). He is now a Senior Research scientist at T-Labs / TU Berlin, and also a visiting professor at CNRS Toulouse and UCL.

Registrations are now closed.