Klaus-Tycho Förster

Orcid: 0000-0003-4635-4480

According to our database1, Klaus-Tycho Förster authored at least 110 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improving Scalability in Traffic Engineering via Optical Topology Programming.
IEEE Trans. Netw. Serv. Manag., April, 2024

On the Resilience of Fast Failover Routing Against Dynamic Link Failures.
CoRR, 2024

Brief Announcement: On the Feasibility of Local Failover Routing on Directed Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs.
Proceedings of the Structural Information and Communication Complexity, 2024

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks.
Proceedings of the IEEE INFOCOM 2024, 2024

Blockchain-Based Implementation of Service Function Chains in Multicloud and Multitenant Environments Over Containerized Networks.
Proceedings of the 6th Conference on Blockchain Research & Applications for Innovative Networks and Services , 2024

2023
Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing.
ACM Trans. Model. Perform. Evaluation Comput. Syst., September, 2023

Guest editorial: Structural Information and Communication Complexity 2021.
Theor. Comput. Sci., September, 2023

Analyzing the Communication Clusters in Datacenters✱.
Proceedings of the ACM Web Conference 2023, 2023

Transparent Fault Tolerance for Stateful Applications in Kubernetes with Checkpoint/Restore.
Proceedings of the 42nd International Symposium on Reliable Distributed Systems, 2023

A Tight Characterization of Fast Failover Routing: Resiliency to Two Link Failures is Possible.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Live Demonstration of ML-based PON Characterization and Monitoring.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2023

Towards Local Shortcutting of Fast Failover Routes.
Proceedings of the on CoNEXT Student Workshop 2023, 2023

2022
Improved Fast Rerouting Using Postprocessing.
IEEE Trans. Dependable Secur. Comput., 2022

Empirical evaluation of nodes and channels of the lightning network.
Pervasive Mob. Comput., 2022

Optimizing multicast flows in high-bandwidth reconfigurable datacenter networks.
J. Netw. Comput. Appl., 2022

A Centrality Analysis of the Lightning Network.
CoRR, 2022

Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Short Paper: A Centrality Analysis of the Lightning Network.
Proceedings of the Financial Cryptography and Data Security, 2022

On the Price of Locality in Static Fast Rerouting.
Proceedings of the 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2022

2021
Input-Dynamic Distributed Algorithms for Communication Networks.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion.
Perform. Evaluation, 2021

A Survey of Reconfigurable Optical Networks.
Opt. Switch. Netw., 2021

On Comparing and Enhancing Common Approaches to Network Community Detection.
CoRR, 2021

Are WANs Ready for Optical Topology Programming?
Proceedings of the OptSys '21: Proceedings of the ACM SIGCOMM 2021 Workshop on Optical Systems, 2021

Demand-Aware Plane Spanners of Bounded Degree.
Proceedings of the IFIP Networking Conference, 2021

Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network.
Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

On Comparing and Enhancing Two Common Approaches to Network Community Detection.
Proceedings of the IEEE Global Communications Conference, 2021

P4Update: fast and locally verifiable consistent network updates in the P4 data plane.
Proceedings of the CoNEXT '21: The 17th International Conference on emerging Networking EXperiments and Technologies, Virtual Event, Munich, Germany, December 7, 2021

Traffic engineering with joint link weight and segment optimization.
Proceedings of the CoNEXT '21: The 17th International Conference on emerging Networking EXperiments and Technologies, Virtual Event, Munich, Germany, December 7, 2021

On the Feasibility of Perfect Resilience with Local Fast Failover.
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

Shortcutting Fast Failover Routes in the Data Plane.
Proceedings of the ANCS '21: Symposium on Architectures for Networking and Communications Systems, Layfette, IN, USA, December 13, 2021

Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths).
Proceedings of the ANCS '21: Symposium on Architectures for Networking and Communications Systems, Layfette, IN, USA, December 13, 2021

On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies.
Proceedings of the ANCS '21: Symposium on Architectures for Networking and Communications Systems, Layfette, IN, USA, December 13, 2021

2020
AirNet: Energy-Aware Deployment and Scheduling of Aerial Networks.
IEEE Trans. Veh. Technol., 2020

Wireless evacuation on <i>m</i> rays with <i>k</i> searchers.
Theor. Comput. Sci., 2020

Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs.
Theor. Comput. Sci., 2020

Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing.
SIGMETRICS Perform. Evaluation Rev., 2020

Inter-Datacenter Bulk Transfers: Trends and Challenges.
IEEE Netw., 2020

Deadline-Aware Multicast Transfers in Software-Defined Optical Wide-Area Networks.
IEEE J. Sel. Areas Commun., 2020

Input-dynamic distributed graph algorithms for congested networks.
CoRR, 2020

Distributed Pattern Formation With Faulty Robots.
CoRR, 2020

Efficient non-segregated routing for reconfigurable demand-aware networks.
Comput. Commun., 2020

Walking Through Waypoints.
Algorithmica, 2020

Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

OptFlow: A Flow-based Abstraction for Programmable Topologies.
Proceedings of the SOSR '20: Symposium on SDN Research, San Jose, CA, USA, March 3, 2020, 2020

Maximally Resilient Replacement Paths for a Family of Product Graphs.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks.
Proceedings of the 39th IEEE Conference on Computer Communications, 2020

Inferring Sensitive Information in Cryptocurrency Off-Chain Networks Using Probing and Timing Attacks.
Proceedings of the Information Systems Security and Privacy - 6th International Conference, 2020

Toward Active and Passive Confidentiality Attacks on Cryptocurrency Off-chain Networks.
Proceedings of the 6th International Conference on Information Systems Security and Privacy, 2020

Conic Formation in Presence of Faulty Robots.
Proceedings of the Algorithms for Sensor Systems, 2020

2019
Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity.
SIGACT News, 2019

Congestion-Free Rerouting of Multiple Flows in Timed SDNs.
IEEE J. Sel. Areas Commun., 2019

Brief Announcement: Does Preprocessing Help under Congestion?
CoRR, 2019

Survey of Consistent Software-Defined Network Updates.
IEEE Commun. Surv. Tutorials, 2019

On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures.
Comput. Commun. Rev., 2019

Does Preprocessing Help under Congestion?
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Latency and Consistent Flow Migration: Relax for Lossless Updates.
Proceedings of the 2019 IFIP Networking Conference, 2019

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees.
Proceedings of the 18th IEEE International Symposium on Network Computing and Applications, 2019

DaRTree: deadline-aware multicast transfers in reconfigurable wide-area networks.
Proceedings of the International Symposium on Quality of Service, 2019

CASA: Congestion and Stretch Aware Static Fast Rerouting.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

On the Power of Preprocessing in Decentralized Network Optimization.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Bonsai: Efficient Fast Failover Routing Using Small Arborescences.
Proceedings of the 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2019

2018
Loop-Free Route Updates for Software-Defined Networks.
IEEE/ACM Trans. Netw., 2018

Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs.
Theor. Comput. Sci., 2018

Local Fast Failover Routing With Low Stretch.
Comput. Commun. Rev., 2018

Charting the Algorithmic Complexity of Waypoint Routing.
Comput. Commun. Rev., 2018

RADWAN: rate adaptive wide area network.
Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication, 2018

Local Fast Segment Rerouting on Hypercubes.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Waypoint Routing in Special Networks.
Proceedings of the 2018 IFIP Networking Conference and Workshops, 2018

On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities.
Proceedings of the 17th IEEE International Symposium on Network Computing and Applications, 2018

TI-MFA: Keep calm and reroute segments fast.
Proceedings of the IEEE INFOCOM 2018, 2018

Scheduling Congestion-Free Updates of Multiple Flows with Chronicle in Timed SDNs.
Proceedings of the 38th IEEE International Conference on Distributed Computing Systems, 2018

Teaching programming skills in primary school mathematics classes: An evaluation using game programming.
Proceedings of the 2018 IEEE Global Engineering Education Conference, 2018

Beyond Binary Failures in Networks.
Proceedings of the Applied Networking Research Workshop, 2018

Characterizing the algorithmic complexity of reconfigurable data center architectures.
Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018

2017
Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs.
Pervasive Mob. Comput., 2017

Charting the Complexity Landscape of Waypoint Routing.
CoRR, 2017

Wireless Evacuation on m Rays with k Searchers.
Proceedings of the Structural Information and Communication Complexity, 2017

Understanding and Mitigating Packet Corruption in Data Center Networks.
Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017

Vom Flaggenalphabet zur Vorratsdatenspeicherung: Schülerinnen und Schüler als Multiplikatoren technischer Aspekte der digitalen Welt.
Proceedings of the Informatische Bildung zum Verstehen und Gestalten der digitalen Welt, 2017

On the consistent migration of unsplittable flows: Upper and lower complexity bounds.
Proceedings of the 16th IEEE International Symposium on Network Computing and Applications, 2017

Local Checkability in Dynamic Networks.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

Run, Walk, Crawl: Towards Dynamic Link Capacities.
Proceedings of the 16th ACM Workshop on Hot Topics in Networks, Palo Alto, CA, USA, 2017

Teaching spatial geometry in a virtual world: Using minecraft in mathematics in grade 5/6.
Proceedings of the 2017 IEEE Global Engineering Education Conference, 2017

Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Distributed discussion diarisation.
Proceedings of the 14th IEEE Annual Consumer Communications & Networking Conference, 2017

A Walk in the Clouds: Routing Through VNFs on Bidirected Networks.
Proceedings of the Algorithmic Aspects of Cloud Computing - Third International Workshop, 2017

2016
Don't disturb my Flows: Algorithms for Consistent Network Updates in Software Defined Networks.
PhD thesis, 2016

Lower and upper competitive bounds for online directed graph exploration.
Theor. Comput. Sci., 2016

Survey of Consistent Network Updates.
CoRR, 2016

A Concept for an Introduction to Parallelization in Java: Multithreading with Programmable Robots in Minecraft.
Proceedings of the 17th Annual Conference on Information Technology Education and the 5th Annual Conference on Research in Information Technology, 2016

Integrating Programming into the Mathematics Curriculum: Combining Scratch and Geometry in Grades 6 and 7.
Proceedings of the 17th Annual Conference on Information Technology Education and the 5th Annual Conference on Research in Information Technology, 2016

Consistent updates in software defined networks: On dependencies, loop freedom, and blackholes.
Proceedings of the 2016 IFIP Networking Conference, 2016

Reducing the latency-tail of short-lived flows: Adding forward error correction in data centers.
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

RTDS: real-time discussion statistics.
Proceedings of the 15th International Conference on Mobile and Ubiquitous Multimedia, 2016

On consistent migration of flows in SDNs.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Local checkability, no strings attached.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

Augmenting anycast network flows.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

The Power of Two in Consistent Network Updates: Hard Loop Freedom, Easy Flow Migration.
Proceedings of the 25th International Conference on Computer Communication and Networks, 2016

2015
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond.
Proceedings of the Structural Information and Communication Complexity, 2015

Programming in Scratch and Mathematics: Augmenting Your Geometry Curriculum, Today!
Proceedings of the 16th Annual Conference on Information Technology Education, 2015

Destroying networks for fun (and profit).
Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Philadelphia, PA, USA, November 16, 2015

2014
Deterministic Leader Election in Multi-hop Beeping Networks - (Extended Abstract).
Proceedings of the Distributed Computing - 28th International Symposium, 2014

SpareEye: enhancing the safety of inattentionally blind smartphone users.
Proceedings of the 13th International Conference on Mobile and Ubiquitous Multimedia, 2014

2013
Approximating Fault-Tolerant Domination in General Graphs.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012
Directed Graph Exploration.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012


  Loading...