Stefan Schmid
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 6 in the filters
on a stage with
all 31 in the filters
who talks about the same things
- Sascha Fahl9 talks
- Nicole Dreyer-Langlet3 talks
- Thorsten Holz10 talks
- Ulrich Schmid2 talks
- Marcell Igneczi2 talks
| title | conference | date |
|---|---|---|
| Synthesis of dependable and self-driving communication networks | FRIDA 2025 | 2025-10-27 |
Claim: polynomial-time verification of MPLS label-stack reachability lets the tool check reachability and waypoint compliance under failures by modeling… | ||
| Pyrrha: Congestion-Root-Based Flow Control to Eliminate Head-of-Line Blocking in... | NSDI '25 | 2025-04-28 |
Claims a flow-control granularity tied to the congestion-root ID that provably eliminates head‑of‑line blocking by allocating isolation queues only for flows… | ||
| Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
CREDENCE augments commodity drop-tail buffers with ML predictions to emulate push-out behavior, using per-queue thresholds and an “arithmetic push-out” trick… | ||
| Reverie: Low Pass Filter-Based Switch Buffer Sharing for Datacenters with RDMA and TCP... | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
Reverie replaces the vendor Sonic model with a single shared pool, accounting each packet once and consolidating ingress and egress views to avoid… | ||
| Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks | ITCS 2023 | 2023-01-10 |
Proves that broadcast, k‑broadcast and cover‑of‑size‑k in synchronous adversarial dynamic networks all have asymptotically tight linear worst‑case time. Upper… | ||
| The Time Complexity of Consensus Under Oblivious Message Adversaries | ITCS 2023 | 2023-01-10 |
Establishes the first time complexity lower bounds for consensus under oblivious message adversaries and rephrases Coulouma et al.’s solvability criterion as a… | ||
| PowerTCP: Pushing the Performance Limits of Datacenter Networks | 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI '22) | 2022-04-04 |
Introduces PowerTCP, a congestion control that drives send-window updates from the bandwidth–window product (called power) and measures it via in-band network… | ||
| MTS: Bringing Multi-Tenancy to Virtual Networking | USENIX ATC '19 | 2019-07-10 |
MTS isolates tenant networks by moving virtual switching into dedicated VMs and connecting tenant VMs via SR‑IOV virtual functions on a Mellanox ConnectX‑4… | ||
| nothing matches | ||