Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, February 27, 2024, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Goran Zuzic (Google Research)

Deterministic Polylog-Competitive Routing

This talk will address point-to-point packet routing in undirected distributed networks, which is the most important communication primitive in most networks. Our main contribution is the first polylog-competitive solution to this problem. Specifically, we show that in any undirected network it is possible to give each node simple stateless deterministic local forwarding rules, such that, any adversarially chosen set of packets are delivered as fast as possible, up to polylog factors.

To showcase our techniques, I will demonstrate the main ideas on the simpler case of the hypercube. While a deterministic, but quite complicated, solution was known in the hypercube, our ideas can be generalized to worst-case networks using seminal polylog-competitive oblivious routings of Raecke and hop-constrained oblivious routings of Ghaffari, Haeupler, Zuzic [STOC'20].

Joint work with Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, and Cliff Stein.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login