Survey of consistent software-defined network updates KT Foerster, S Schmid, S Vissicchio IEEE Communications Surveys & Tutorials 21 (2), 1435-1461, 2018 | 105 | 2018 |
On Consistent Migration of Flows in SDNs S Brandt, KT Foerster, R Wattenhofer 36th IEEE International Conference on Computer Communications (INFOCOM 2016), 2016 | 99 | 2016 |
Consistent Updates in Software Defined Networks: On Dependencies, Loop Freedom, and Blackholes KT Foerster, R Mahajan, R Wattenhofer 15th IFIP Networking Conference (IFIP Networking 2016), 2016 | 66 | 2016 |
Characterizing the algorithmic complexity of reconfigurable data center architectures KT Foerster, M Ghobadi, S Schmid Proceedings of the 2018 Symposium on Architectures for Networking and …, 2018 | 35 | 2018 |
Understanding and mitigating packet corruption in data center networks D Zhuo, M Ghobadi, R Mahajan, KT Förster, A Krishnamurthy, T Anderson Proceedings of the Conference of the ACM Special Interest Group on Data …, 2017 | 35 | 2017 |
RADWAN: rate adaptive wide area network R Singh, M Ghobadi, KT Foerster, M Filer, P Gill Proceedings of the 2018 Conference of the ACM Special Interest Group on Data …, 2018 | 34 | 2018 |
Deterministic leader election in multi-hop beeping networks KT Förster, J Seidel, R Wattenhofer International Symposium on Distributed Computing, 212-226, 2014 | 34 | 2014 |
Local checkability, no strings attached:(A) cyclicity, reachability, loop free updates in SDNs KT Foerster, T Luedi, J Seidel, R Wattenhofer Theoretical Computer Science 709, 48-63, 2018 | 32* | 2018 |
Integrating Programming into the Mathematics Curriculum: Combining Scratch and Geometry in Grades 6 and 7 KT Foerster Proceedings of the 17th Annual Conference on Information Technology Education, 2016 | 31* | 2016 |
Congestion-Free Rerouting of Multiple Flows in Timed SDNs J Zheng, B Li, C Tian, KT Foerster, S Schmid, G Chen, J Wu, R Lia IEEE Journal on Selected Areas in Communications, 2019 | 27* | 2019 |
Loop-free route updates for software-defined networks KT Foerster, A Ludwig, J Marcinkowski, S Schmid IEEE/ACM Transactions on Networking (TON) 26 (1), 328-341, 2018 | 24 | 2018 |
The power of two in consistent network updates: Hard loop freedom, easy flow migration KT Forster, R Wattenhofer 2016 25th International Conference on Computer Communication and Networks …, 2016 | 24 | 2016 |
Directed graph exploration KT Förster, R Wattenhofer International Conference On Principles Of Distributed Systems, 151-165, 2012 | 22 | 2012 |
Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity KT Foerster, S Schmid SIGACT News 50 (2), 62-79, 2019 | 21 | 2019 |
Charting the Algorithmic Complexity of Waypoint Routing SA Amiri, KT Foerster, R Jacob, S Schmid ACM SIGCOMM Computer Communication Review 48 (1), 42-48, 2018 | 20* | 2018 |
Run, walk, crawl: Towards dynamic link capacities R Singh, M Ghobadi, KT Foerster, M Filer, P Gill Proceedings of the 16th ACM Workshop on Hot Topics in Networks, 143-149, 2017 | 20 | 2017 |
Deadline-aware multicast transfers in software-defined optical wide-area networks L Luo, KT Foerster, S Schmid, H Yu IEEE Journal on Selected Areas in Communications 38 (7), 1584-1599, 2020 | 18* | 2020 |
Lower and upper competitive bounds for online directed graph exploration KT Foerster, R Wattenhofer Theoretical Computer Science 655, 15-29, 2016 | 18 | 2016 |
Teaching spatial geometry in a virtual world: Using minecraft in mathematics in grade 5/6 KT Foerster 2017 IEEE Global Engineering Education Conference (EDUCON), 1411-1418, 2017 | 17 | 2017 |
Augmenting flows for the consistent migration of multi-commodity single-destination flows in sdns S Brandt, KT Foerster, R Wattenhofer Pervasive and Mobile Computing 36, 134-150, 2017 | 17* | 2017 |