
On the Complexity of WeightDynamic Network Algorithms
While operating communication networks adaptively may improve utilizatio...
read it

Optimal Virtual Network Embeddings for Tree Topologies
The performance of distributed and datacentric applications often criti...
read it

It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints
This paper proposes a new approximation algorithm for the offline Virtua...
read it

Online List Access with Precedence Constraints
This paper considers a natural generalization of the online list access ...
read it

LightPIR: PrivacyPreserving Route Discovery for Payment Channel Networks
Payment channel networks are a promising approach to improve the scalabi...
read it

Enabling Novel Interconnection Agreements with PathAware Networking Architectures
Pathaware networks (PANs) are emerging as an intriguing new paradigm wi...
read it

Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
Graphical games are a useful framework for modeling the interactions of ...
read it

Locality in Online Algorithms
Online algorithms make decisions based on past inputs. In general, the d...
read it

ConTraKG: Contrastivebased Transfer Learning for Visual Object Recognition using Knowledge Graphs
Deep learning techniques achieve high accuracy in computer vision tasks....
read it

DemandAware Payment Channel Networks
This paper initiates the study of demandaware payment channel networks:...
read it

Tight Bounds for Online Graph Partitioning
We consider the following online optimization problem. We are given a gr...
read it

Performance Analysis of DemandOblivious and DemandAware Optical Datacenter Network Designs
This paper presents a performance analysis of the design space of optica...
read it

Scheduling Opportunistic Links in TwoTiered Reconfigurable Datacenters
Reconfigurable optical topologies are emerging as a promising technology...
read it

Incentivizing Stable Path Selection in Future Internet Architectures
By delegating path control to endhosts, future Internet architectures o...
read it

Local Fast Rerouting with Low Congestion: A Randomized Approach
Most modern communication networks include fast rerouting mechanisms, im...
read it

Survey on Cryptocurrency Networking: Context, StateoftheArt, Challenges
Cryptocurrencies such as Bitcoin are realized using distributed systems ...
read it

An Online Matching Model for SelfAdjusting ToRtoToR Networks
This is a short note that formally presents the matching model for the t...
read it

A Competitive BMatching Algorithm for Reconfigurable Datacenter Networks
This paper initiates the study of online algorithms for the maintaining ...
read it

On the Feasibility of Perfect Resilience with Local Fast Failover
In order to provide a high resilience and to react quickly to link failu...
read it

On Search Friction of Route Discovery in Offchain Networks
Offchain networks provide a promising solution to overcome the scalabili...
read it

Inputdynamic distributed graph algorithms for congested networks
Consider a distributed system, where the topology of the communication n...
read it

The Value of Information in Selfish Routing
Path selection by selfish agents has traditionally been studied by compa...
read it

Improved Bicriteria Approximation for the AllorNothing Multicommodity Flow Problem in Arbitrary Networks
This paper addresses the following fundamental maximum throughput routin...
read it

Towards Runtime Verification of Programmable Switches
Is it possible to patch software bugs in P4 programs without human invol...
read it

Towards FineGrained Billing For Cloud Networking
We revisit multitenant network virtualization in data centers, and make...
read it

Distributed Pattern Formation With Faulty Robots
Pattern formation is one of the most fundamental problems in distributed...
read it

Toward Active and Passive Confidentiality Attacks On Cryptocurrency OffChain Networks
Cryptocurrency offchain networks such as Lightning (e.g., Bitcoin) or R...
read it

Hijacking Routes in Payment Channel Networks: A Predictability Tradeoff
Offchain transaction networks can mitigate the scalability issues of to...
read it

Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees
While SDNs enable more flexible and adaptive network operations, (logica...
read it

The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game
The Price of Anarchy (PoA) is a wellestablished gametheoretic concept ...
read it

Measuring the Complexity of Packet Traces
This paper studies the structure of several realworld traces (including...
read it

Brief Announcement: Does Preprocessing Help under Congestion?
This paper investigates the power of preprocessing in the CONGEST model....
read it

SelfAdjusting Linear Networks
Emerging networked systems become increasingly flexible and reconfigurab...
read it

Consistent SDNs through Network State Fuzzing
The conventional wisdom is that a softwaredefined network (SDN) operate...
read it

Efficient Distributed Workload (Re)Embedding
Modern networked systems are increasingly reconfigurable, enabling deman...
read it

ReNets: Toward Statically Optimal SelfAdjusting Networks
This paper studies the design of selfadjusting networks whose topology ...
read it

Compact Oblivious Routing
Oblivious routing is an attractive paradigm for large distributed system...
read it

On the Power of Preprocessing in Decentralized Network Optimization
As communication networks are growing at a fast pace, the need for more ...
read it

PushDown Trees: Optimal SelfAdjusting Complete Trees
Since Sleator and Tarjan's seminal work on selfadjusting lists, heaps a...
read it

Toward DemandAware Networking: A Theory for SelfAdjusting Networks
The physical topology is emerging as the next frontier in an ongoing eff...
read it

Charting the Security Landscape of Programmable Dataplanes
Emerging programmable dataplanes will revamp communication networks, all...
read it

Short Schedules for Fast Flow Rerouting
This paper studies the fundamental problem of how to reroute k unsplitta...
read it

(FPT)Approximation Algorithms for the Virtual Network Embedding Problem
Many resource allocation problems in the cloud can be described as a bas...
read it

Virtual Network Embedding Approximations: Leveraging Randomized Rounding
The Virtual Network Embedding Problem (VNEP) captures the essence of man...
read it

NPCompleteness and Inapproximability of the Virtual Network Embedding Problem and Its Variants
Many resource allocation problems in the cloud can be described as a bas...
read it

Renaissance: SelfStabilizing Distributed SDN Control Plane
By introducing programmability, automated verification, and innovative d...
read it
Stefan Schmid
is this you? claim profile