@INPROCEEDINGS{nsdi27,
author = {Vamsi Addanki and Deeksha Panduranga Rao and Goran Dario Knabe and Chen Avin and Stefan Schmid},
title = {Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees},
booktitle = {Proc. USENIX NSDI},
year = {2027}
}
2026
A Control-Theoretic Perspective on BBR/CUBIC Congestion-Control Competition
@INPROCEEDINGS{peva26,
author = {Simon Scherrer and Adrian Perrig and Stefan Schmid},
title = {A Control-Theoretic Perspective on BBR/CUBIC Congestion-Control Competition},
booktitle = {Performance Evaluation (PEVA)},
year = {2026},
}
A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
Matthias Bentert, Chen Avin, Stefan Schmid
ACM Symposium on Principles of Distributed Computing (PODC), 2026
@INPROCEEDINGS{podc26throughput,
author = {Matthias Bentert and Chen Avin and Stefan Schmid},
title = {A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput},
booktitle = {ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2026},
address = {Egham, England},
}
Breaking Pseudonymity: Linkage Attacks on Blockchain Users with Off-Chain Cues
Alexander Smirnov, Stefan Schmid, Friedhelm Victor
@INPROCEEDINGS{pets26,
author = {Alexander Smirnov and Stefan Schmid and Friedhelm Victor},
title = {Breaking Pseudonymity: Linkage Attacks on Blockchain Users with Off-Chain Cues},
booktitle = {26th Privacy Enhancing Technologies Symposium (PETS)},
year = {2026},
}
@INPROCEEDINGS{sand26ba,
author = {Arash Pourdamghani and Chen Avin and Stefan Schmid}, title = {Brief Announcement: Demand-Aware Consistent Hashing with Bounded Loads \& Greedy Routing}, booktitle = {Symposium on Algorithmic Foundations of Dynamic Networks ({SAND})},
series = {LIPIcs}, year = {2026}, note = {Brief Announcement}
}
Communication Bias in Large Language Models: A Regulatory Perspective
@INPROCEEDINGS{cacm26,
author = {Adrian Kuenzler and Stefan Schmid},
title = {Communication Bias in Large Language Models: A Regulatory Perspective},
booktitle = {Communications of the ACM (CACM)},
year = {2026},
}
Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
Marcin Bienkowski, Julien Dallot, Dominik Danelski, Maciej Pacut, Stefan Schmid
IEEE International Conference on Distributed Computing Systems (ICDCS), 2026
@INPROCEEDINGS{icdcs26knapsack,
author = {Marcin Bienkowski and Julien Dallot and Dominik Danelski and Maciej Pacut and Stefan Schmid},
title = {Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items},
booktitle = {IEEE International Conference on Distributed Computing Systems (ICDCS)},
year = {2026},
address = {Seoul, South Korea},
}
Cost-Efficient Traffic Allocation for CDNs under Mixed Billing Models
Huiran Liu, Juan Vanerio, Stefan Schmid
IEEE Global Communications Conference (GLOBECOM), 2026
@INPROCEEDINGS{globecom26,
author = {Huiran Liu and Juan Vanerio and Stefan Schmid},
title = {Cost-Efficient Traffic Allocation for CDNs under Mixed Billing Models},
booktitle = {IEEE Global Communications Conference (GLOBECOM)},
year = {2026}
}
Covert Communication Channels in the O-RAN SC Near-Real Time RIC (Short Paper)
Daniel Balint, Kashyap Thimmaraju, Stefan Schmid
IFIP Networking, 2026
BibTeX
@INPROCEEDINGS{ifip26oran,
author = {Daniel Balint and Kashyap Thimmaraju and Stefan Schmid},
title = {Covert Communication Channels in the O-RAN SC Near-Real Time RIC (Short Paper)},
booktitle = {IFIP Networking},
year = {2026},
address = {Lugano, Switzerland},
}
D3: Enhancing Reconfigurable Datacenters with Adaptive Demand-Oblivious and Demand-Aware Integration
Alexander Smirnov, Stefan Schmid, Friedhelm Victor
@INPROCEEDINGS{comnet26,
author = {Alexander Smirnov and Stefan Schmid and Friedhelm Victor},
title = {D3: Enhancing Reconfigurable Datacenters with Adaptive Demand-Oblivious and Demand-Aware Integration},
booktitle = {Computer Networks (COMNET)},
year = {2026},
}
Designing Caterpillars for Graphs: Approximation and Hardness
Leon Kullmann, Phuoc Lucky Trinh, Leon Kellerhals, Mitja Krebs, André Nichterlein, Stefan Schmid
Workshop on Approximation and Online Algorithms (WAOA), 2026
@INPROCEEDINGS{waoa26,
author = {Leon Kullmann and Phuoc Lucky Trinh and Leon Kellerhals and Mitja Krebs and Andr{\'e} Nichterlein and Stefan Schmid},
title = {Designing Caterpillars for Graphs: Approximation and Hardness},
booktitle = {Workshop on Approximation and Online Algorithms (WAOA)},
year = {2026}
}
Distance-Amplified Power-Law Distributions Better Characterize Human Long-Distance Travel
Gregor Bankhamer, Huiran Liu, Souneil Park, Robert Elsaesser, Stefan Schmid
@INPROCEEDINGS{srep26,
author = {Gregor Bankhamer and Huiran Liu and Souneil Park and Robert Elsaesser and Stefan Schmid},
title = {Distance-Amplified Power-Law Distributions Better Characterize Human Long-Distance Travel},
booktitle = {Nature Scientific Reports (SREP)},
year = {2026},
}
DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters
Sophia Heck, Kathrin Hanauer, Stefan Schmid
ACM International Conference on Supercomputing (ICS), 2026
@INPROCEEDINGS{ics26,
author = {Sophia Heck and Kathrin Hanauer and Stefan Schmid},
title = {DistroMatch: Distributed Disjoint Weighted Matchings in Demand-Aware Reconfigurable Optical Datacenters},
booktitle = {ACM International Conference on Supercomputing (ICS)},
year = {2026},
}
Efficient Algorithms for Temporal Balanced Graph Partitioning of Datacenter Workloads
Aleksander Figiel, Andre Nichterlein, Stefan Schmid
SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), 2026
@INPROCEEDINGS{alenex26,
author = {Aleksander Figiel and Andre Nichterlein and Stefan Schmid},
title = {Efficient Algorithms for Temporal Balanced Graph Partitioning of Datacenter Workloads},
booktitle = {SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)},
year = {2026},
}
Exabit/s Scale Communications with a Single Microcomb for Ultra-Scalable Data Centers
Christian Koefoed Schou, Silas Lasak Hedeboe, Arjun Kurur, Oliver Malte Lølloff Larsen, Sameer Ahmad Mir, Sarah Michelle Hammer, Yang Liu, Haoyang Tan, Deming Kong, Flóra Viktória Kárpát, Yi Zheng, Yanjing Zhao, Max Franke, Minhao Pu, Kresten Yvind, Metodi Yankov, Søren Forchhammer, Michael Galili, David J. Moss, Stefan Schmid, Leif Katsuo Oxenløwe
Proc. 31st OptoElectronics and Communications Conference (OECC), 2026
@INPROCEEDINGS{oecc26,
author = {Christian Koefoed Schou and Silas Lasak Hedeboe and Arjun Kurur and Oliver Malte L{\o}lloff Larsen and Sameer Ahmad Mir and Sarah Michelle Hammer and Yang Liu and Haoyang Tan and Deming Kong and Fl{\'o}ra Vikt{\'o}ria K{\'a}rp{\'a}t and Yi Zheng and Yanjing Zhao and Max Franke and Minhao Pu and Kresten Yvind and Metodi Yankov and S{\o}ren Forchhammer and Michael Galili and David J. Moss and Stefan Schmid and Leif Katsuo Oxenl{\o}we},
title = {Exabit/s Scale Communications with a Single Microcomb for Ultra-Scalable Data Centers},
booktitle = {Proc. 31st OptoElectronics and Communications Conference (OECC)},
year = {2026}
}
Friend or Foe? Anomalous Peers in Monero's P2P Network
Yannik Kopyciok, Stefan Schmid, Friedhelm Victor
8th International Conference on Advances in Financial Technologies (AFT), 2026
@INPROCEEDINGS{aft26,
author = {Yannik Kopyciok and Stefan Schmid and Friedhelm Victor},
title = {Friend or Foe? Anomalous Peers in Monero's P2P Network},
booktitle = {8th International Conference on Advances in Financial Technologies (AFT)},
year = {2026}
}
FuseFSS: Efficient Secure LLM Inference with Function Secret Sharing
Yuhan Ma, Long Li, Stefan Schmid
International Conference on Machine Learning (ICML), 2026
@INPROCEEDINGS{icml26fusefss,
author = {Yuhan Ma and Long Li and Stefan Schmid},
title = {FuseFSS: Efficient Secure LLM Inference with Function Secret Sharing},
booktitle = {International Conference on Machine Learning (ICML)},
year = {2026},
address = {Seoul, South Korea},
}
GenCC: Heterogeneous Network Congestion Control using LLMs
Liron Schiff, Neta Rozen Schiff, Stefan Schmid
Proc. ACM SIGCOMM Workshop on Networks for AI Computing (NAIC), 2026
@INPROCEEDINGS{naic26,
author = {Liron Schiff and Neta Rozen Schiff and Stefan Schmid},
title = {GenCC: Heterogeneous Network Congestion Control using LLMs},
booktitle = {Proc. ACM SIGCOMM Workshop on Networks for AI Computing (NAIC)},
year = {2026}
}
More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems
Jonas Köppeler, Maciej Pacut, Tamás Lévai, Vamsi Addanki, Stefan Schmid, Gábor Rétvári
Symposium on Algorithmic Foundations of Dynamic Networks (SAND), 2026
@INPROCEEDINGS{sand26,
author = {Jonas K{\"o}ppeler and Maciej Pacut and Tam{\'a}s L{\'e}vai and Vamsi Addanki and Stefan Schmid and G{\'a}bor R{\'e}tv{\'a}ri},
title = {More Bang for the Buck: Superlinear Scaling with Distributed Self-Adjusting Systems},
booktitle = {Symposium on Algorithmic Foundations of Dynamic Networks (SAND)},
series = {LIPIcs},
volume = {373},
year = {2026},
}
Multi-Modal Measurements of Weather Effects and Link Quality Dynamics in LEO Satellite Networks
@INPROCEEDINGS{ifip26leo,
author = {Simon Damm and Clemens Lottermoser and Stefan Schmid},
title = {Multi-Modal Measurements of Weather Effects and Link Quality Dynamics in LEO Satellite Networks},
booktitle = {IFIP Networking},
year = {2026},
address = {Lugano, Switzerland},
}
Nonuniform Graph Partitioning With Just A Little Flex
Neil Olver, Harald Raecke, Stefan Schmid
58th ACM Symposium on Theory of Computing (STOC), 2026
@INPROCEEDINGS{stoc26partitioning,
author = {Neil Olver and Harald Raecke and Stefan Schmid},
title = {Nonuniform Graph Partitioning With Just A Little Flex},
booktitle = {58th ACM Symposium on Theory of Computing (STOC)},
year = {2026},
}
Online Graph Embedding in Star Graphs
Julien Dallot, Darya Melnyk, Maciej Pacut, Stefan Schmid
IEEE International Conference on Distributed Computing Systems (ICDCS), 2026
@INPROCEEDINGS{icdcs26stars,
author = {Julien Dallot and Darya Melnyk and Maciej Pacut and Stefan Schmid},
title = {Online Graph Embedding in Star Graphs},
booktitle = {IEEE International Conference on Distributed Computing Systems (ICDCS)},
year = {2026},
address = {Seoul, South Korea},
}
Perfect Network Resilience in Polynomial Time
Matthias Bentert, Stefan Schmid
58th ACM Symposium on Theory of Computing (STOC), 2026
@INPROCEEDINGS{stoc26frr,
author = {Matthias Bentert and Stefan Schmid},
title = {Perfect Network Resilience in Polynomial Time},
booktitle = {58th ACM Symposium on Theory of Computing (STOC)},
year = {2026},
}
Privacy Attacks on Stable Marriage
Stephan Fahrenkrog, Aleksander Figiel, Darya Melnyk, Tijana Milentijevic, Stefan Schmid
IEEE International Conference on Distributed Computing Systems (ICDCS), 2026
@INPROCEEDINGS{icdcs26marriage,
author = {Stephan Fahrenkrog and Aleksander Figiel and Darya Melnyk and Tijana Milentijevic and Stefan Schmid},
title = {Privacy Attacks on Stable Marriage},
booktitle = {IEEE International Conference on Distributed Computing Systems (ICDCS)},
year = {2026},
address = {Seoul, South Korea},
}
Ranking Opinions with Few States in Population Protocols
Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid
ACM Symposium on Principles of Distributed Computing (PODC), 2026
@INPROCEEDINGS{podc26ranking,
author = {Tom-Lukas Breitkopf and Julien Dallot and Antoine El-Hayek and Stefan Schmid},
title = {Ranking Opinions with Few States in Population Protocols},
booktitle = {ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2026},
address = {Egham, England},
}
Rethinking Fronthaul Topologies for Cell-Free 6G Networks
Max Franke, Arash Pourdamghani, Fabian Goettsch, Stefan Schmid, Giuseppe Caire
IEEE International Conference on Communications (ICC), 2026
@INPROCEEDINGS{icc26,
author = {Max Franke and Arash Pourdamghani and Fabian Goettsch and Stefan Schmid and Giuseppe Caire},
title = {Rethinking Fronthaul Topologies for Cell-Free 6G Networks},
booktitle = {IEEE International Conference on Communications (ICC)},
year = {2026},
}
Revisiting Bruck: Phase-Efficient All-to-All Communication in Reconfigurable Networks
Anton Juerss, Stefan Schmid
Proc. ACM SIGCOMM Workshop on Hot Topics in Optical Technologies and Applications in Networking (HotOptics), 2026
@INPROCEEDINGS{hotoptics26,
author = {Anton Juerss and Stefan Schmid},
title = {Revisiting Bruck: Phase-Efficient All-to-All Communication in Reconfigurable Networks},
booktitle = {Proc. ACM SIGCOMM Workshop on Hot Topics in Optical Technologies and Applications in Networking (HotOptics)},
year = {2026}
}
Single Microcomb Source for Ultra-Scalable Datacenters for Dense Deep Neural Network Workloads
Arjun Kurur, Silas Hedeboe, Christian Schou, Oliver Larsen, Sarah Hammer, Yang Liu, Haoyang Tan, Deming Kong, Flora Karpat, Yi Zheng, Yangjing Zhao, Max Franke, Minhao Pu, Kresten Yvind, Metodi Yankov, Soren Forchhammer, Michael Galili, David Moss, Stefan Schmid, Leif Oxenlowe
Optical Fiber Communication Conference (OFC), 2026
@INPROCEEDINGS{ofc26,
author = {Arjun Kurur and Silas Hedeboe and Christian Schou and Oliver Larsen and Sarah Hammer and Yang Liu
and Haoyang Tan and Deming Kong and
Flora Karpat and Yi Zheng and Yangjing Zhao and Max Franke and Minhao Pu and Kresten Yvind and Metodi Yankov and Soren Forchhammer and Michael Galili and David Moss and Stefan Schmid and Leif Oxenlowe},
title = {Single Microcomb Source for Ultra-Scalable Datacenters for Dense Deep Neural Network Workloads},
booktitle = {Optical Fiber Communication Conference (OFC)},
year = {2026},
}
SyOpt: Constrained Genetic Algorithm for Near-Optimal Resilient Routing Synthesis
Csaba Györgyi, Kim Larsen, Stefan Schmid, Jiri Srba
24th International Symposium on Automated Technology for Verification and Analysis (ATVA), 2026
@INPROCEEDINGS{atva26,
author = {Csaba Gy{\"o}rgyi and Kim Larsen and Stefan Schmid and Jiri Srba},
title = {SyOpt: Constrained Genetic Algorithm for Near-Optimal Resilient Routing Synthesis},
booktitle = {24th International Symposium on Automated Technology for Verification and Analysis (ATVA)},
year = {2026}
}
The Carrier Pigeon Internet Protocol: An Algorithmic (and Lighthearted) Perspective
Matthias Bentert, Shay Kutten, Darya Melnyk, Tijana Milentijević, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2026
@ARTICLE{ccr26,
author = {Matthias Bentert and Shay Kutten and Darya Melnyk and Tijana Milentijevi{\'c} and Stefan Schmid},
title = {The Carrier Pigeon Internet Protocol: An Algorithmic (and Lighthearted) Perspective},
journal = {ACM SIGCOMM Computer Communication Review ({CCR})},
year = {2026}
}
The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof
Vamsi Addanki, Julien Dallot, Leon Kellerhals, Maciej Pacut, Stefan Schmid
SIAM Symposium on Simplicity in Algorithms (SOSA), 2026
@INPROCEEDINGS{sosa26,
author = {Vamsi Addanki and Julien Dallot and Leon Kellerhals and Maciej Pacut and Stefan Schmid},
title = {The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof},
booktitle = {SIAM Symposium on Simplicity in Algorithms (SOSA)},
year = {2026},
}
Trivance: Latency-Optimal AllReduce by Shortcutting Multiport Networks
@INPROCEEDINGS{sigcomm26,
author = {Anton Juerss and Vamsi Addanki and Stefan Schmid},
title = {Trivance: Latency-Optimal AllReduce by Shortcutting Multiport Networks},
booktitle = {Proc. ACM SIGCOMM},
year = {2026}
}
2025
A Control-Theoretic Perspective on BBR/CUBIC Congestion-Control Competition
@INPROCEEDINGS{performance25,
author = {Simon Scherrer and Adrian Perrig and Stefan Schmid},
title = {A Control-Theoretic Perspective on BBR/CUBIC Congestion-Control Competition},
booktitle = {IFIP Performance},
year = {2025},
}
An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
Antoine El-Hayek, Robert Elsaesser, Stefan Schmid
ACM Symposium on Principles of Distributed Computing (PODC), 2025
@INPROCEEDINGS{podc25pp,
author = {Antoine El-Hayek and Robert Elsaesser and Stefan Schmid},
title = {An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model},
booktitle = {ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2025},
}
Approximate Agreement Algorithms for Byzantine Collaborative Learning
Melanie Cambus, Darya Melnyk, Tijana Milentijevic, Stefan Schmid
37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2025
@INPROCEEDINGS{spaa25agreement,
author = {Melanie Cambus and Darya Melnyk and Tijana Milentijevic and Stefan Schmid},
title = {Approximate Agreement Algorithms for Byzantine Collaborative Learning},
booktitle = {37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2025},
}
Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection
Krishnendu Chatterjee, Jan Matyas Kristan, Stefan Schmid, Jakub Svoboda, Michelle Yeo
International Symposium on Distributed Computing (DISC), 2025
@INPROCEEDINGS{disc25,
author = {Krishnendu Chatterjee and Jan Matyas Kristan and Stefan Schmid and Jakub Svoboda and Michelle Yeo},
title = {Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection},
booktitle = {International Symposium on Distributed Computing (DISC)},
year = {2025},
}
Breaking the Vision: Assessing and Mitigating the Impact of Video Artifacts on ML Models in Industrial Use Cases
Marco Reisacher, Ann-Kristin Bergmann, Andreas Blenk, Stefan Schmid
IEEE 23rd International Conference on Industrial Informatics (INDIN), 2025
@INPROCEEDINGS{indin25,
author = {Marco Reisacher and Ann-Kristin Bergmann and Andreas Blenk and Stefan Schmid},
title = {Breaking the Vision: Assessing and Mitigating the Impact of Video Artifacts on ML Models in Industrial Use Cases},
booktitle = {IEEE 23rd International Conference on Industrial Informatics (INDIN)},
year = {2025},
}
Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
Tom-Lukas Breitkopf, Julien Dallot, Antoine El-Hayek, Stefan Schmid
ACM Symposium on Principles of Distributed Computing (PODC), 2025
@INPROCEEDINGS{podc25ba,
author = {Tom-Lukas Breitkopf and Julien Dallot and Antoine El-Hayek and Stefan Schmid},
title = {Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols},
booktitle = {ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2025},
}
Coordinate-wise Median in Byzantine Federated Learning
Melanie Cambus, Darya Melnyk, Tijana Milentijevic, Stefan Schmid
ACM AsiaCCS Workshop on Secure and Efficient Federated Learning (FL-AsiaCCS), 2025
@INPROCEEDINGS{asiaccs25,
author = {Melanie Cambus and Darya Melnyk and Tijana Milentijevic and Stefan Schmid},
title = {Coordinate-wise Median in Byzantine Federated Learning},
booktitle = {ACM AsiaCCS Workshop on Secure and Efficient Federated Learning (FL-AsiaCCS)},
year = {2025},
}
Demand-Aware Multi-Source IP-Multicast: Minimal Congestion via Link Weight Optimization
Matthias Bentert, Max Franke, Darya Melnyk, Arash Pourdamghani, Stefan Schmid
@INPROCEEDINGS{ifip25mc,
author = {Matthias Bentert and Max Franke and Darya Melnyk and Arash Pourdamghani and Stefan Schmid},
title = {Demand-Aware Multi-Source IP-Multicast: Minimal Congestion via Link Weight Optimization},
booktitle = {IFIP Networking},
year = {2025},
}
Demand-Aware Small-World Networks on Clustered Demands
Chen Avin, Robert Elsaesser, Aleksander Figiel, Darya Melnyk, Stefan Schmid
29th International Conference on Principles of Distributed Systems (OPODIS), 2025
@INPROCEEDINGS{opodis25kleinberg,
author = {Chen Avin and Robert Elsaesser and Aleksander Figiel and Darya Melnyk and Stefan Schmid},
title = {Demand-Aware Small-World Networks on Clustered Demands},
booktitle = {29th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2025},
}
Democracy for DAOs: An Empirical Study of Decentralized Governance and Dynamics
Burak Arda Okutan, Yvonne-Anne Pignolet, Stefan Schmid
IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 2025
@INPROCEEDINGS{icbc25dao,
author = { Burak Arda Okutan and Yvonne-Anne Pignolet and Stefan Schmid},
title = {Democracy for DAOs: An Empirical Study of Decentralized Governance and Dynamics},
booktitle = {IEEE International Conference on Blockchain and Cryptocurrency (ICBC)},
year = {2025},
}
Distributed Construction of Demand-Aware Datacenter Networks
Aleksander Figiel, Darya Melnyk, Tijana Milentijevic, Stefan Schmid
39th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2025
@INPROCEEDINGS{ipdps25,
author = {Aleksander Figiel and Darya Melnyk and Tijana Milentijevic and Stefan Schmid},
title = {Distributed Construction of Demand-Aware Datacenter Networks},
booktitle = {39th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
year = {2025},
}
Eagle: Vulnerability and Congestion Aware Software Update Synthesis in Softwarized Networks
Nicolas Schnepf, Remi Badonnel, Damien Saucez, Stefan Schmid, Jiri Srba
IEEE/IFIP Network Operations and Management Symposium (NOMS), 2025
BibTeX
@INPROCEEDINGS{noms25,
author = {Nicolas Schnepf and Remi Badonnel and Damien Saucez and Stefan Schmid and Jiri Srba},
title = {Eagle: Vulnerability and Congestion Aware Software Update Synthesis in Softwarized Networks},
booktitle = {IEEE/IFIP Network Operations and Management Symposium (NOMS)},
year = {2025},
}
Efficient Cross-Datacenter Congestion Control with Fast Control Loops
Baosen Zhao, Jianan Sun, Xu Zhou, Wanghong Yang, Wenji Du, Fukang Chen, Yongmao Ren, Stefan Schmid
54th International Conference on Parallel Processing (ICPP), 2025
@INPROCEEDINGS{icpp25,
author = {Baosen Zhao and Jianan Sun and Xu Zhou and Wanghong Yang and Wenji Du and Fukang Chen and Yongmao Ren and Stefan Schmid},
title = {Efficient Cross-Datacenter Congestion Control with Fast Control Loops},
booktitle = {54th International Conference on Parallel Processing (ICPP)},
year = {2025},
}
Exp-PIFO: Scalable and Efficient Programmable Packet Scheduling
Habib Mostafaei, Mohammad Ezzati, Pieter J. L. Cuijpers, Stefan Schmid, Gabor Retvari, Sem Borst
21st ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT), 2025
@INPROCEEDINGS{conext25pifo,
author = {Habib Mostafaei and Mohammad Ezzati and Pieter J. L. Cuijpers and Stefan Schmid and Gabor Retvari and Sem Borst},
title = {Exp-PIFO: Scalable and Efficient Programmable Packet Scheduling},
booktitle = {21st ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT)},
year = {2025},
}
Fast Re-Routing in Networks: On the Complexity of Perfect Resilience
Matthias Bentert, Esra Ceylan, Valentin Huebner, Stefan Schmid, Jiri Srba
29th International Conference on Principles of Distributed Systems (OPODIS), 2025
@INPROCEEDINGS{opodis25complexity,
author = {Matthias Bentert and Esra Ceylan and Valentin Huebner and Stefan Schmid and Jiri Srba},
title = {Fast Re-Routing in Networks: On the Complexity of Perfect Resilience},
booktitle = {29th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2025},
}
Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity
Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid
29th International Conference on Principles of Distributed Systems (OPODIS), 2025
@INPROCEEDINGS{opodis25ear,
author = {Wenkai Dai and Klaus-Tycho Foerster and Stefan Schmid},
title = {Fast Rerouting Against Dynamic Failures: 2-Resilience via Ear-Decomposition and Planarity},
booktitle = {29th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2025},
}
GermanPartiesQA: Benchmarking Commercial Large Language Models and AI Companions for Political Alignment and Sycophancy
Jan Batzner, Volker Stocker, Stefan Schmid, Gjergji Kasneci
8th AAAI/ACM Conference on AI, Ethics, and Society (AIES), 2025
@INPROCEEDINGS{aies25sycophancy,
author = {Jan Batzner and Volker Stocker and Stefan Schmid and Gjergji Kasneci},
title = {GermanPartiesQA: Benchmarking Commercial Large Language Models and AI Companions for Political Alignment and Sycophancy},
booktitle = {8th AAAI/ACM Conference on AI, Ethics, and Society (AIES)},
year = {2025},
}
Have your CAKE and eat it too: Scaling software rate limiting across CPU cores
Jonas Koeppeler, Toke Hoiland-Jorgensen, Stefan Schmid
IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN), 2025
@INPROCEEDINGS{lanman25,
author = {Jonas Koeppeler and Toke Hoiland-Jorgensen and Stefan Schmid},
title = {Have your CAKE and eat it too: Scaling software rate limiting across CPU cores},
booktitle = {IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)},
year = {2025},
}
In the Search of Optimal Tree Networks: Hardness and Heuristics
Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid
The Genetic and Evolutionary Computation Conference (GECCO), 2025
@INPROCEEDINGS{gecco25,
author = {Maxim Buzdalov and Pavel Martynov and Sergey Pankratov and Vitaly Aksenov and Stefan Schmid},
title = {In the Search of Optimal Tree Networks: Hardness and Heuristics},
booktitle = {The Genetic and Evolutionary Computation Conference (GECCO)},
year = {2025},
}
Internet Computer as a Data Availability Layer (Poster Paper)
Dor Cohen, Yvonne-Anne Pignolet, Ognjen Maric, Stefan Schmid
IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 2025
BibTeX
@INPROCEEDINGS{icbc25poster,
author = {Dor Cohen and Yvonne-Anne Pignolet and Ognjen Maric and Stefan Schmid},
title = {Internet Computer as a Data Availability Layer (Poster Paper)},
booktitle = {IEEE International Conference on Blockchain and Cryptocurrency (ICBC)},
year = {2025},
}
Monero’s Decentralized P2P Exchanges: Functionality, Adoption, and Privacy Risks
Yannik Kopyciok, Friedhelm Victor, Stefan Schmid
9th Workshop on Trusted Smart Contracts (WTSC), 2025
@INPROCEEDINGS{wtsc25,
author = {Yannik Kopyciok and Friedhelm Victor and Stefan Schmid},
title = {Monero’s Decentralized P2P Exchanges: Functionality, Adoption, and Privacy Risks},
booktitle = {9th Workshop on Trusted Smart Contracts (WTSC)},
year = {2025},
}
mq-cake: Scaling Software Rate Limiting Across CPU Cores
Jonas Koeppeler, Toke Hoiland-Jorgensen, Stefan Schmid
The Technical Conference on Linux Networking (Netdev 0x19), 2025
@INPROCEEDINGS{netdev25,
author = {Jonas Koeppeler and Toke Hoiland-Jorgensen and Stefan Schmid},
title = {mq-cake: Scaling Software Rate Limiting Across CPU Cores},
booktitle = {The Technical Conference on Linux Networking (Netdev 0x19)},
year = {2025},
}
On Modeling the RIS as a Resource: Multi-User Allocation and Efficiency-Proportional Pricing
Alexandros Papadopoulos, Dimitrios Tyrovolas, Antonios Lalas, Konstantinos Votis, Stefan Schmid, Sotiris Ioannidis, George K. Karagiannidis, Christos K. Liaskos
IEEE Transactions on Network and Service Management (TNSM), 2025
@INPROCEEDINGS{tnsm25,
author = {Alexandros Papadopoulos and Dimitrios Tyrovolas and Antonios Lalas and Konstantinos Votis and Stefan Schmid and Sotiris Ioannidis and George K. Karagiannidis and Christos K. Liaskos},
title = {On Modeling the RIS as a Resource: Multi-User Allocation and Efficiency-Proportional Pricing},
booktitle = {IEEE Transactions on Network and Service Management (TNSM)},
year = {2025},
}
On the Resilience of Fast Failover Routing Against Dynamic Link Failures
@INPROCEEDINGS{ifip25frr,
author = {Wenkai Dai and Klaus-Tycho Foerster and Stefan Schmid},
title = {On the Resilience of Fast Failover Routing Against Dynamic Link Failures},
booktitle = {IFIP Networking},
year = {2025},
}
Optimizing Fronthaul Quantization for Flexible User Load in Cell-Free Massive MIMO
Fabian Goettsch, Max Franke, Arash Pourdamghani, Giuseppe Caire, Stefan Schmid
IEEE Globecom Workshop on Resilience in Next-Generation Wireless Communication Networks, 2025
@INPROCEEDINGS{globecom25w,
author = {Fabian Goettsch and Max Franke and Arash Pourdamghani and Giuseppe Caire and Stefan Schmid},
title = {Optimizing Fronthaul Quantization for Flexible User Load in Cell-Free Massive MIMO},
booktitle = {IEEE Globecom Workshop on Resilience in Next-Generation Wireless Communication Networks},
year = {2025},
}
Pyrrha: Congestion-Root-Based Flow Control to Eliminate Head-of-Line Blocking in Datacenter
@INPROCEEDINGS{nsdi25pyrrha,
author = {Kexin Liu and Zhaochen Zhang and Chang Liu and Yizhi Wang and Qingyue Wang and Vamsi Addanki and Stefan Schmid and Wei Chen and Xiaoliang Wang and Jiaqi Zheng and Wenhao Sun and Tao Wu and Ke Meng and Fei Chen and Weiguang Wang and Wanchun Dou and Guihai Chen and Chen Tian},
title = {Pyrrha: Congestion-Root-Based Flow Control to Eliminate Head-of-Line Blocking in Datacenter},
booktitle = {22nd USENIX Symposium on Networked Systems Design and Implementation (NSDI)},
year = {2025},
}
Reliability and QoS Assurance in RIS-assisted Indoor Networks
Cao Vien Phung, Max Franke, Ehsan Tohidi, June Heinemann, Andre Drummond, Stefan Schmid, Slawomir Stanczak, Admela Jukan
International Conference On The Design Of Reliable Communication Networks (DRCN), 2025
@INPROCEEDINGS{drcn25,
author = {Cao Vien Phung and Max Franke and Ehsan Tohidi and June Heinemann and Andre Drummond
and Stefan Schmid and Slawomir Stanczak and Admela Jukan},
title = {Reliability and QoS Assurance in RIS-assisted Indoor Networks},
booktitle = {International Conference On The Design Of Reliable Communication Networks (DRCN)},
year = {2025},
}
Revolutionizing Datacenter Networks via Reconfigurable Topologies
@INPROCEEDINGS{cacm25,
author = {Chen Avin and Stefan Schmid},
title = {Revolutionizing Datacenter Networks via Reconfigurable Topologies},
booktitle = {Communications of the ACM (CACM)},
year = {2025},
}
RIFO: Pushing the Efficiency of Programmable Packet Schedulers
@INPROCEEDINGS{ton25rifo,
author = {Habib Mostafaei and Maciej Pacut and Stefan Schmid},
title = {RIFO: Pushing the Efficiency of Programmable Packet Schedulers},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2025},
}
SpiderDAN: Matching Augmentation in Demand-Aware Networks
Aleksander Figiel, Darya Melnyk, Andre Nichterlein, Arash Pourdamghani, Stefan Schmid
SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), 2025
@INPROCEEDINGS{alenex25,
author = {Aleksander Figiel and Darya Melnyk and Andre Nichterlein and Arash Pourdamghani and Stefan Schmid},
title = {SpiderDAN: Matching Augmentation in Demand-Aware Networks},
booktitle = {SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)},
year = {2025},
}
Sycophancy Claims about Language Models: The Missing Human-in-the-Loop
Jan Batzner, Volker Stocker, Stefan Schmid, Gjergji Kasneci
ICLR 2025 Workshop on Bidirectional Human-AI Alignment (Bi-Align), 2025
@INPROCEEDINGS{iclr25,
author = {Jan Batzner and Volker Stocker and Stefan Schmid and Gjergji Kasneci},
title = {Sycophancy Claims about Language Models: The Missing Human-in-the-Loop},
booktitle = {ICLR 2025 Workshop on Bidirectional Human-AI Alignment (Bi-Align)},
year = {2025},
}
TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets
Bruno Maria Rene Gonzalez, Peter Gjol Jensen, Jiri Srba, Stefan Schmid, Martin Zimmermann
23rd International Symposium on Automated Technology for Verification and Analysis (ATVA), 2025
@INPROCEEDINGS{atva25,
author = {Bruno Maria Rene Gonzalez and Peter Gjol Jensen and Jiri Srba and Stefan Schmid and Martin Zimmermann},
title = {TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets},
booktitle = {23rd International Symposium on Automated Technology for Verification and Analysis (ATVA)},
year = {2025},
}
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
Harald Raecke, Stefan Schmid, Ruslan Zabrodin
37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2025
@INPROCEEDINGS{spaa25partition,
author = {Harald Raecke and Stefan Schmid and Ruslan Zabrodin},
title = {Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model},
booktitle = {37th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2025},
}
Towards Demand-Aware Peer Selection with XOR-based Routing (Invited Paper)
27th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)), 2025
BibTeX
@INPROCEEDINGS{sss25,
author = {Qingyun Ji and Darya Melnyk and Arash Pourdamghani and Stefan Schmid},
title = {Towards Demand-Aware Peer Selection with XOR-based Routing (Invited Paper)},
booktitle = {27th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS))},
year = {2025},
}
Trade-Offs Between Fingerprinting and Self-Organizing Maps in RIS-Based Indoor Positioning
Stanislava Slavova, Naveed Ali Khan, Stefan Schmid
@INPROCEEDINGS{access25,
author = {Stanislava Slavova and Naveed Ali Khan and Stefan Schmid},
title = {Trade-Offs Between Fingerprinting and Self-Organizing Maps in RIS-Based Indoor Positioning},
booktitle = {IEEE Access},
year = {2025},
}
When is liquid democracy possible? On the manipulation of variance
Krishnendu Chatterjee, Seth Gilbert, Stefan Schmid, Jakub Svoboda, Michelle Yeo
ACM Symposium on Principles of Distributed Computing (PODC), 2025
@INPROCEEDINGS{podc25gov,
author = {Krishnendu Chatterjee and Seth Gilbert and Stefan Schmid and Jakub Svoboda and Michelle Yeo},
title = {When is liquid democracy possible? On the manipulation of variance},
booktitle = {ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2025},
}
Whose Personae? Synthetic Persona Experiments in LLM Research and Pathways to Transparency
Jan Batzner, Volker Stocker, Bingjun Tang, Anusha Natarajan, Qinhao Chen, Stefan Schmid, Gjergji Kasneci
8th AAAI/ACM Conference on AI, Ethics, and Society (AIES), 2025
@INPROCEEDINGS{aies25personae,
author = {Jan Batzner and Volker Stocker and Bingjun Tang and Anusha Natarajan and Qinhao Chen and Stefan Schmid and Gjergji Kasneci},
title = {Whose Personae? Synthetic Persona Experiments in LLM Research and Pathways to Transparency},
booktitle = {8th AAAI/ACM Conference on AI, Ethics, and Society (AIES)},
year = {2025},
}
X-Transfer: Enabling and Optimizing Cross-PCN Transactions
Lukas Aumayr, Zeta Avarikioti, Iosif Salem, Stefan Schmid, Michelle Yeo
29th International Conference on Financial Cryptography and Data Security (FC), 2025
@INPROCEEDINGS{fc25,
author = {Lukas Aumayr and Zeta Avarikioti and Iosif Salem and Stefan Schmid and Michelle Yeo},
title = {X-Transfer: Enabling and Optimizing Cross-PCN Transactions},
booktitle = {29th International Conference on Financial Cryptography and Data Security (FC)},
year = {2025},
}
2024
A Centrality Analysis of the Lightning Network
Philipp Zabka, Klaus-Tycho Foerster, Christian Decker, Stefan Schmid
Telecommunications Policy (JTPO), Elsevier,
Special issue: Economic, social and political impact of blockchain, 2024
@INPROCEEDINGS{jtpo24,
author = {Philipp Zabka and Klaus-Tycho Foerster and Christian Decker and Stefan Schmid},
title = {A Centrality Analysis of the Lightning Network},
booktitle = {Telecommunications Policy (JTPO), Elsevier,
Special issue: Economic, social and political impact of blockchain},
year = {2024},
}
A Demand-aware Networked System Using Telemetry and ML with ReactNET
Milad Miri, Stefan Schmid, Habib Mostafaei
22nd International Symposium on Network Computing and Applications (NCA), 2024
@INPROCEEDINGS{nca24da,
author = {Milad Miri and Stefan Schmid and Habib Mostafaei},
title = {A Demand-aware Networked System Using Telemetry and ML with ReactNET},
booktitle = {22nd International Symposium on Network Computing and Applications (NCA)},
year = {2024},
}
A Subquadratic Bound for Online Bisection
Marcin Bienkowski, Stefan Schmid
41st International Symposium on Theoretical Aspects of Computer Science (STACS), 2024
@INPROCEEDINGS{stacs24,
author = {Marcin Bienkowski and Stefan Schmid},
title = {A Subquadratic Bound for Online Bisection},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS)},
year = {2024},
}
AI-RAN in 6G Networks State-of-the-Art and Challenges
Naveed Ali Kaim Khani, Stefan Schmid
IEEE Open Journal of the Communications Society, 2024
@INPROCEEDINGS{ieeeoj24,
author = {Naveed Ali Kaim Khani and Stefan Schmid},
title = {AI-RAN in 6G Networks State-of-the-Art and Challenges},
booktitle = {IEEE Open Journal of the Communications Society},
year = {2024},
}
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
Wenkai Dai, Mike Dinitz, Klaus-Tycho Foerster, Long Luo, Stefan Schmid
@INPROCEEDINGS{infocom24dan,
author = {Wenkai Dai and Mike Dinitz and Klaus-Tycho Foerster and Long Luo and Stefan Schmid},
title = {Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks},
booktitle = {IEEE INFOCOM},
year = {2024},
}
Baiji: Domain Planning for CDNs under the 95th Percentile Billing Model
@INPROCEEDINGS{ifip24cdn,
author = {Juan Vanerio and Huiran Liu and Qi Zhang and Stefan Schmid},
title = {Baiji: Domain Planning for CDNs under the 95th Percentile Billing Model},
booktitle = {IFIP Networking},
year = {2024},
}
Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation
Aleksander Figiel, Darya Melnyk, Andre Nichterlein, Arash Pourdamghani, Stefan Schmid
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2024
@INPROCEEDINGS{spaa24ba,
author = {Aleksander Figiel and Darya Melnyk and Andre Nichterlein and Arash Pourdamghani and Stefan Schmid},
title = {Brief Announcement: Minimizing the Weighted Average Shortest Path Length in Demand-Aware Networks via Matching Augmentation},
booktitle = {ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2024},
}
Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel Networks
Zeta Avarikioti, Stefan Schmid, Samarth Tawari
ACM Symposium on Principles of Distributed Computing (PODC), 2024
@INPROCEEDINGS{podc24ba,
author = {Zeta Avarikioti and Stefan Schmid and Samarth Tawari},
title = {Brief Announcement: Musketeer - Incentive-Compatible Rebalancing for Payment Channel Networks},
booktitle = {ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2024},
}
Broadcast and Consensus in Stochastic Dynamic Networks with
Byzantine Nodes and Adversarial Edges
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
International Symposium on Distributed Computing (DISC), 2024
@INPROCEEDINGS{disc24,
author = {Antoine El-Hayek and Monika Henzinger and Stefan Schmid},
title = {Broadcast and Consensus in Stochastic Dynamic Networks with
Byzantine Nodes and Adversarial Edges},
booktitle = {International Symposium on Distributed Computing (DISC)},
year = {2024},
}
Broomrocket: Open Source Text-to-3D Algorithm for 3D Object Placement
@INPROCEEDINGS{games24,
author = {Sanja Bonic and Janos Bonic and Stefan Schmid},
title = {Broomrocket: Open Source Text-to-3D Algorithm for 3D Object Placement},
booktitle = {ACM Games: Research and Practice},
year = {2024},
}
Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm
Esra Ceylan, Jakub Svoboda, Krishnendu Chatterjee, Stefan Schmid
IEEE/IFIP Network Operations and Management Symposium (NOMS), Mini-Conference, 2024
@INPROCEEDINGS{noms24,
author = {Esra Ceylan and Jakub Svoboda and Krishnendu Chatterjee and Stefan Schmid},
title = {Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm},
booktitle = {IEEE/IFIP Network Operations and Management Symposium (NOMS), Mini-Conference},
year = {2024},
}
Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions
Vamsi Addanki, Maciej Pacut, Stefan Schmid
21st USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2024
@INPROCEEDINGS{nsdi24credence,
author = {Vamsi Addanki and Maciej Pacut and Stefan Schmid},
title = {Credence: Augmenting Datacenter Switch Buffer Sharing with ML Predictions},
booktitle = {21st USENIX Symposium on Networked Systems Design and Implementation (NSDI)},
year = {2024},
}
DecentPeeR: A Self-Incentivised and Inclusive Decentralized Peer Review System (Poster Paper)
IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 2024
BibTeX
@INPROCEEDINGS{icbc24,
author = {Johannes Gruendler and Darya Melnyk and Arash Pourdamghani and Stefan Schmid},
title = {DecentPeeR: A Self-Incentivised and Inclusive Decentralized Peer Review System (Poster Paper)},
booktitle = {IEEE International Conference on Blockchain and Cryptocurrency (ICBC)},
year = {2024},
}
Dependency-Aware Online Caching
Julien Dallot, Amirmehdi Jafari Fesharaki, Maciej Pacut, Stefan Schmid
@INPROCEEDINGS{infocom24caching,
author = {Julien Dallot and Amirmehdi Jafari Fesharaki and Maciej Pacut and Stefan Schmid},
title = {Dependency-Aware Online Caching},
booktitle = {IEEE INFOCOM},
year = {2024},
}
Dynamic Probabilistic Reliable Broadcast
Joao Paulo Bezerra, Veronika Anikina, Petr Kuznetsov, Liron Schiff, Stefan Schmid
28th International Conference on Principles of Distributed Systems (OPODIS), 2024
@INPROCEEDINGS{opodis24bc,
author = {Joao Paulo Bezerra and Veronika Anikina and Petr Kuznetsov and Liron Schiff and Stefan Schmid},
title = {Dynamic Probabilistic Reliable Broadcast},
booktitle = {28th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2024},
}
Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding
Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid
28th International Conference on Principles of Distributed Systems (OPODIS), 2024
@INPROCEEDINGS{opodis24dan,
author = {Aleksander Figiel and Janne H. Korhonen and Neil Olver and Stefan Schmid},
title = {Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding},
booktitle = {28th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2024},
}
Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search
@INPROCEEDINGS{infocom24update,
author = {Radu Vintan and Harald Raecke and Stefan Schmid},
title = {Fast Algorithms for Loop-Free Network Updates using Linear Programming and Local Search},
booktitle = {IEEE INFOCOM},
year = {2024},
}
Gender-Specific Homophily on Instagram and Implications on Information Spread
Yvonne-Anne Pignolet, Stefan Schmid, Arne Seelisch
@INPROCEEDINGS{srep24,
author = {Yvonne-Anne Pignolet and Stefan Schmid and Arne Seelisch},
title = {Gender-Specific Homophily on Instagram and Implications on Information Spread},
booktitle = {Nature Scientific Reports},
year = {2024},
}
Hash and Adjust: Competitive Demand-Aware Consistent Hashing
Arash Pourdamghani, Chen Avin, Robert Sama, Maryam Shiran, Stefan Schmid
28th International Conference on Principles of Distributed Systems (OPODIS), 2024
@INPROCEEDINGS{opodis24hash,
author = {Arash Pourdamghani and Chen Avin and Robert Sama and Maryam Shiran and Stefan Schmid},
title = {Hash and Adjust: Competitive Demand-Aware Consistent Hashing},
booktitle = {28th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2024},
}
Invited Paper: Blockchain Governance and Liquid Democracy – Quantifying
Decentralization in Gitcoin and Internet Computer
@INPROCEEDINGS{applied24,
author = {Stefan Schmid and Dmitry Shestakov},
title = {Invited Paper: Blockchain Governance and Liquid Democracy – Quantifying
Decentralization in Gitcoin and Internet Computer},
booktitle = {ApPLIED Workshop at ACM PODC},
year = {2024},
}
L3: Latency-aware Load Balancing in Multi-Cluster Service Mesh
Olivier Michaelis, Stefan Schmid, Habib Mostafaei
25th ACM/IFIP International Middleware Conference (Middleware), 2024
@INPROCEEDINGS{mw24,
author = {Olivier Michaelis and Stefan Schmid and Habib Mostafaei},
title = {L3: Latency-aware Load Balancing in Multi-Cluster Service Mesh},
booktitle = {25th ACM/IFIP International Middleware Conference (Middleware)},
year = {2024},
}
Learning Minimum Linear Arrangement of Cliques and Lines
Julien Dallot, Maciej Pacut, Marcin Bienkowski, Darya Melnyk, Stefan Schmid
44th IEEE International Conference on Distributed Computing Systems (ICDCS), 2024
@INPROCEEDINGS{icdcs24,
author = {Julien Dallot and Maciej Pacut and Marcin Bienkowski and Darya Melnyk and Stefan Schmid},
title = {Learning Minimum Linear Arrangement of Cliques and Lines},
booktitle = {44th IEEE International Conference on Distributed Computing Systems (ICDCS)},
year = {2024},
}
MCQUIC - A Multicast Extension for QUIC
Max Franke, Jake Holland, Stefan Schmid
22nd International Symposium on Network Computing and Applications (NCA), 2024
@INPROCEEDINGS{nca24mc,
author = {Max Franke and Jake Holland and Stefan Schmid},
title = {MCQUIC - A Multicast Extension for QUIC},
booktitle = {22nd International Symposium on Network Computing and Applications (NCA)},
year = {2024},
}
Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks
@INPROCEEDINGS{aft24,
author = {Zeta Avarikioti and Stefan Schmid and Samarth Tawari},
title = {Musketeer: Incentive-Compatible Rebalancing for Payment Channel Networks},
booktitle = {Advances in Financial Technologies (AFT)},
year = {2024},
}
Optical Self-Adjusting Data Center Networks in the Scalable Matching Model
Caio Caldeira, Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Stefan Schmid
IEEE/ACM Transactions on Cloud Computing (TCC), 2024
@INPROCEEDINGS{tcc24,
author = {Caio Caldeira and Otavio Augusto de Oliveira Souza and Olga Goussevskaia and Stefan Schmid},
title = {Optical Self-Adjusting Data Center Networks in the Scalable Matching Model},
booktitle = {IEEE/ACM Transactions on Cloud Computing (TCC)},
year = {2024},
}
Optimizing Virtual Payment Channel Establishment in the Face of On-Path Adversaries
Lukas Aumayr, Esra Ceylan, Yannik Kopyciok, Matteo Maffei, Pedro Moreno-Sanchez, Iosif Salem, Stefan Schmid
@INPROCEEDINGS{ifip24pcn,
author = {Lukas Aumayr and Esra Ceylan and Yannik Kopyciok and Matteo Maffei and Pedro Moreno-Sanchez and Iosif Salem and Stefan Schmid},
title = {Optimizing Virtual Payment Channel Establishment in the Face of On-Path Adversaries},
booktitle = {IFIP Networking},
year = {2024},
}
Reliability Assurance in RIS-assisted 6G Campus Networks
Ehsan Tohidi, Max Franke, Cao Vien Phung, Naveed Ali Khan Kaim Khani, Andre C. Drummond, Stefan Schmid, Admela Jukan, Slawomir Stanczak
International Conference On The Design Of Reliable Communication Networks (DRCN), 2024
@INPROCEEDINGS{drcn24,
author = {Ehsan Tohidi and Max Franke and Cao Vien Phung and Naveed Ali Khan Kaim Khani and Andre C. Drummond and Stefan Schmid and Admela Jukan and Slawomir Stanczak},
title = {Reliability Assurance in RIS-assisted 6G Campus Networks},
booktitle = {International Conference On The Design Of Reliable Communication Networks (DRCN)},
year = {2024},
}
Reverie: Low Pass Filter-Based Switch Buffer Sharing for Datacenters with RDMA and TCP Traffic
Vamsi Addanki, Wei Bai, Stefan Schmid, Maria Apostolaki
21st USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2024
@INPROCEEDINGS{nsdi24reverie,
author = {Vamsi Addanki and Wei Bai and Stefan Schmid and Maria Apostolaki},
title = {Reverie: Low Pass Filter-Based Switch Buffer Sharing for Datacenters with RDMA and TCP Traffic},
booktitle = {21st USENIX Symposium on Networked Systems Design and Implementation (NSDI)},
year = {2024},
}
RIS as a Network Resource: Pricing and User Multiplexing Algorithms
Alexandros Ioannis Papadopoulos, Antonios Lalas, Konstantinos Votis, Stefan Schmid, Christos Liaskos
International Conference on 6G Networking (6GNet), 2024
@INPROCEEDINGS{6gnet24,
author = {Alexandros Ioannis Papadopoulos and Antonios Lalas and Konstantinos Votis and Stefan Schmid and Christos Liaskos},
title = {RIS as a Network Resource: Pricing and User Multiplexing Algorithms},
booktitle = {International Conference on 6G Networking (6GNet)},
year = {2024},
}
RIS-assisted 6G Networks: Challenges and Tradeoffs in Control Standardization
Ehsan Tohidi, Max Franke, Andre C. Drummond, Stefan Schmid, Admela Jukan, Slawomir Stanczak
IEEE Conference on Standards for Communications and Networking (CSCN), 2024
@INPROCEEDINGS{cscn24,
author = {Ehsan Tohidi and Max Franke and Andre C. Drummond and Stefan Schmid and Admela Jukan and Slawomir Stanczak},
title = {RIS-assisted 6G Networks: Challenges and Tradeoffs in Control Standardization},
booktitle = {IEEE Conference on Standards for Communications and Networking (CSCN)},
year = {2024},
}
Starlink Performance through the Edge Router Lens
Sarah-Michelle Hammer, Vamsi Addanki, Max Franke, Stefan Schmid
2nd ACM MobiCom Workshop on LEO Networking and Communication (LEO-NET), 2024
@INPROCEEDINGS{leonet24,
author = {Sarah-Michelle Hammer and Vamsi Addanki and Max Franke and Stefan Schmid},
title = {Starlink Performance through the Edge Router Lens},
booktitle = {2nd ACM MobiCom Workshop on LEO Networking and Communication (LEO-NET)},
year = {2024},
}
SyPer: Synthesis of Perfectly Resilient Local Fast Rerouting Rules for Highly Dependable Networks
Csaba Gyorgyi, Kim G. Larsen, Stefan Schmid, Jiri Srba
@INPROCEEDINGS{infocom24syper,
author = {Csaba Gyorgyi and Kim G. Larsen and Stefan Schmid and Jiri Srba},
title = {SyPer: Synthesis of Perfectly Resilient Local Fast Rerouting Rules for Highly Dependable Networks},
booktitle = {IEEE INFOCOM},
year = {2024},
}
SyRep: Efficient Synthesis and Repair of Fast Re-Route Forwarding Tables for Resilient Networks
Csaba Gyorgyi, Kim G. Larsen, Stefan Schmid, Jiri Srba
54th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2024
@INPROCEEDINGS{dsn24,
author = {Csaba Gyorgyi and Kim G. Larsen and Stefan Schmid and Jiri Srba},
title = {SyRep: Efficient Synthesis and Repair of Fast Re-Route Forwarding Tables for Resilient Networks},
booktitle = {54th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2024},
}
Tero: Offloading CDN Traffic to Massively Distributed Devices
Juan Vanerio, Lily Huegerich, Stefan Schmid
25th International Conference on Distributed Computing and Networking (ICDCN), 2024
@INPROCEEDINGS{icdcn24,
author = {Juan Vanerio and Lily Huegerich and Stefan Schmid},
title = {Tero: Offloading CDN Traffic to Massively Distributed Devices},
booktitle = {25th International Conference on Distributed Computing and Networking (ICDCN)},
year = {2024},
}
The Time Complexity of Consensus Under Oblivious Message Adversaries
Hugo Rincon Galeana, Ami Paz, Stefan Schmid, Ulrich Schmid, Kyrill Winkler
@INPROCEEDINGS{algo24,
author = {Hugo Rincon Galeana and Ami Paz and Stefan Schmid and Ulrich Schmid and Kyrill Winkler},
title = {The Time Complexity of Consensus Under Oblivious Message Adversaries},
booktitle = {Theoretical Computer Science (TCS), Elsevier},
year = {2024},
}
Toward Self-Adjusting k-ary Search Tree Networks
Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid
@INPROCEEDINGS{esa24,
author = {Evgeniy Feder and Anton Paramonov and Pavel Mavrin and Iosif Salem
and Vitaly Aksenov and Stefan Schmid},
title = {Toward Self-Adjusting k-ary Search Tree Networks},
booktitle = {European Symposium on Algorithms (ESA)},
year = {2024},
}
Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation
@INPROCEEDINGS{tcs24pcn,
author = {Stefan Schmid and Jakub Svoboda and Michelle Yeo},
title = {Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation},
booktitle = {Theoretical Computer Science (TCS), Elsevier},
year = {2024},
}
2023
A Tight Characterization of Fast Failover Routing: Resiliency
to Two Link Failures is Possible
Wenkai Dai, Klaus-Tycho Foerster, Stefan Schmid
35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023
@INPROCEEDINGS{spaa23frr,
author = {Wenkai Dai and Klaus-Tycho Foerster and Stefan Schmid},
title = {A Tight Characterization of Fast Failover Routing: Resiliency
to Two Link Failures is Possible},
booktitle = {35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2023},
}
AllSynth: A BDD-Based Approach for Network Update Synthesis
Kim Guldstrand Larsen, Anders Mariegaard, Stefan Schmid, Jiri Srba
@INPROCEEDINGS{scico23,
author = {Kim Guldstrand Larsen and Anders Mariegaard and Stefan Schmid and Jiri Srba},
title = {AllSynth: A BDD-Based Approach for Network Update Synthesis},
booktitle = {Science of Computer Programming (SCICO)},
year = {2023},
}
Analyzing the Communication Clusters in Datacenters
Klaus-Tycho Foerster, Thibault Marette, Stefan Neumann, Claudia Plant, Ylli Sadikaj, Stefan Schmid, Yllka Velaj
@INPROCEEDINGS{www23,
author = {Klaus-Tycho Foerster and Thibault Marette and Stefan Neumann and Claudia Plant and Ylli Sadikaj and Stefan Schmid and Yllka Velaj},
title = {Analyzing the Communication Clusters in Datacenters},
booktitle = {The Web Conference (WWW)},
year = {2023},
}
Asymptotically Tight Bounds on the Time Complexity of Broadcast
and its Variants in Dynamic Networks
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
14th Innovations in Theoretical Computer Science (ITCS), 2023
@INPROCEEDINGS{itcs23broadcast,
author = {Antoine El-Hayek and Monika Henzinger and Stefan Schmid},
title = {Asymptotically Tight Bounds on the Time Complexity of Broadcast
and its Variants in Dynamic Networks},
booktitle = {14th Innovations in Theoretical Computer Science (ITCS)},
year = {2023},
}
Comparison of Ethereum Smart Contract Analysis and Verification Methods
Vincent Happersberger, Frank-Walter Jaekel, Thomas Knothe, Yvonne-Anne Pignolet, Stefan Schmid
7th International Workshop on Cryptocurrencies and Blockchain Technology (CBT), 2023
@INPROCEEDINGS{cbt23,
author = {Vincent Happersberger and Frank-Walter Jaekel and Thomas Knothe and Yvonne-Anne Pignolet and Stefan Schmid},
title = {Comparison of Ethereum Smart Contract Analysis and Verification Methods},
booktitle = {7th International Workshop on Cryptocurrencies and Blockchain Technology (CBT)},
year = {2023},
}
Digital Twin-Empowered Resource Allocation for 6G-Enabled Massive IoT
Elif Bozkaya, Berk Canberk, Stefan Schmid
Workshop on the Evolution of Digital Twin Paradigm in Wireless Communications, 2023
@INPROCEEDINGS{icciot23,
author = {Elif Bozkaya and Berk Canberk and Stefan Schmid},
title = {Digital Twin-Empowered Resource Allocation for 6G-Enabled Massive IoT},
booktitle = {Workshop on the Evolution of Digital Twin Paradigm in Wireless Communications},
year = {2023},
}
Duo: A High-Throughput Reconfigurable Datacenter Network Using
Local Routing and Control
Johannes Zerwas, Csaba Gyorgyi, Andreas Blenk, Stefan Schmid, Chen Avin
@INPROCEEDINGS{sigmetrics23duo,
author = {Johannes Zerwas and Csaba Gyorgyi and Andreas Blenk and Stefan Schmid and Chen Avin},
title = {Duo: A High-Throughput Reconfigurable Datacenter Network Using
Local Routing and Control},
booktitle = {ACM SIGMETRICS},
year = {2023},
}
Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
Kathrin Hanauer, Monika Henzinger, Lara Ost, Stefan Schmid
@INPROCEEDINGS{infocom23matching,
author = {Kathrin Hanauer and Monika Henzinger and Lara Ost and Stefan Schmid},
title = {Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters},
booktitle = {IEEE INFOCOM},
year = {2023},
}
Dynamic Maintenance of Monotone Dynamic Programs and Applications
Monika Henzinger, Stefan Neumann, Harald Raecke, Stefan Schmid
40th International Symposium on Theoretical Aspects of Computer Science (STACS), 2023
@INPROCEEDINGS{stacs23,
author = {Monika Henzinger and Stefan Neumann and Harald Raecke and Stefan Schmid},
title = {Dynamic Maintenance of Monotone Dynamic Programs and Applications},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS)},
year = {2023},
}
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
Anya Chaturvedi, Chandra Chekuri, Andrea Richa, Matthias Rost, Stefan Schmid, Jamison Weber
@INPROCEEDINGS{ton23anf,
author = {Anya Chaturvedi and Chandra Chekuri and Andrea Richa and Matthias Rost and Stefan Schmid and Jamison Weber},
title = {Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2023},
}
Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing
Wenkai Dai, Klaus-Tycho Foerster, David Fuchssteiner, Stefan Schmid
Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS), 2023
@INPROCEEDINGS{tompecs23,
author = {Wenkai Dai and Klaus-Tycho Foerster and David Fuchssteiner and Stefan Schmid},
title = {Load-Optimization in Reconfigurable Networks: Algorithms and Complexity of Flow Routing},
booktitle = {Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS)},
year = {2023},
}
Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks
@INPROCEEDINGS{sigmetrics23mars,
author = {Vamsi Addanki and Chen Avin and Stefan Schmid},
title = {Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter Networks},
booktitle = {ACM SIGMETRICS},
year = {2023},
}
On the Convergence Time in Graphical Games: A Locality-Sensitive Approach
Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid
27th International Conference on Principles of Distributed Systems (OPODIS), 2023
@INPROCEEDINGS{opodis23,
author = {Juho Hirvonen and Laura Schmid and Krishnendu Chatterjee and Stefan Schmid},
title = {On the Convergence Time in Graphical Games: A Locality-Sensitive Approach},
booktitle = {27th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2023},
}
Online Algorithms with Randomly Infused Advice
Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid
@INPROCEEDINGS{esa23,
author = {Yuval Emek and Yuval Gil and Maciej Pacut and Stefan Schmid},
title = {Online Algorithms with Randomly Infused Advice},
booktitle = {European Symposium on Algorithms (ESA)},
year = {2023},
}
OpticNet: Self-Adjusting Networks for ToR-Matching-ToR Optical Switching Architectures
Caio Caldeira, Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Stefan Schmid
@INPROCEEDINGS{infocom23optic,
author = {Caio Caldeira and Otavio Augusto de Oliveira Souza and Olga Goussevskaia and Stefan Schmid},
title = {OpticNet: Self-Adjusting Networks for ToR-Matching-ToR Optical Switching Architectures},
booktitle = {IEEE INFOCOM},
year = {2023},
}
Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
Marcin Bienkowski, David Fuchssteiner, Stefan Schmid
International Conference for High Performance Computing, Networking, Storage, and Analysis (SC), aka ACM/IEEE Supercomputing, 2023
@INPROCEEDINGS{sc23,
author = {Marcin Bienkowski and David Fuchssteiner and Stefan Schmid},
title = {Optimizing Reconfigurable Optical Datacenters: The Power of Randomization},
booktitle = {International Conference for High Performance Computing, Networking, Storage, and Analysis (SC), aka ACM/IEEE Supercomputing},
year = {2023},
}
P4RROT: Generating P4 Code for the Application Layer
Csaba Györgyi, Sandor Laki, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2023
@INPROCEEDINGS{ccr23parrot,
author = {Csaba Györgyi and Sandor Laki and Stefan Schmid},
title = {P4RROT: Generating P4 Code for the Application Layer},
booktitle = { ACM SIGCOMM Computer Communication Review (CCR)},
year = {2023},
}
Performance Analysis of Machine Learning Centered Workload Prediction Models for Cloud
Deepika Saxena, Jitendra Kumar, Ashutosh Kumar Singh, Stefan Schmid
IEEE Transactions on Parallel and Distributed Systems (TPDS), 2023
@INPROCEEDINGS{tpds23,
author = {Deepika Saxena and Jitendra Kumar and Ashutosh Kumar Singh and Stefan Schmid},
title = {Performance Analysis of Machine Learning Centered Workload Prediction Models for Cloud},
booktitle = {IEEE Transactions on Parallel and Distributed Systems (TPDS)},
year = {2023},
}
Polylog-Competitive Algorithms for Dynamic Balanced Graph
Partitioning for Ring Demands
Harald Raecke, Stefan Schmid, Ruslan Zabrodin
35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2023
@INPROCEEDINGS{spaa23repartition,
author = {Harald Raecke and Stefan Schmid and Ruslan Zabrodin},
title = {Polylog-Competitive Algorithms for Dynamic Balanced Graph
Partitioning for Ring Demands},
booktitle = {35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2023},
}
R2: Boosting Liquidity in Payment Channel
Networks with Online Admission Control (Combining On-chain Recharging with Off-chain Rebalancing)
Mahsa Bastankhah, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, Michelle Yeo
Financial Cryptography and Data Security (FC), 2023
@INPROCEEDINGS{fc23,
author = {Mahsa Bastankhah and Krishnendu Chatterjee and Mohammad Ali Maddah-Ali and Stefan Schmid and Jakub Svoboda and Michelle Yeo},
title = {R2: Boosting Liquidity in Payment Channel
Networks with Online Admission Control (Combining On-chain Recharging with Off-chain Rebalancing)},
booktitle = {Financial Cryptography and Data Security (FC)},
year = {2023},
}
Resource Management for Programmable Metasurfaces: Concept, Prospects and Challenges
Christos Liaskos, Kostas Katsalis, Joan Triay, Stefan Schmid
@INPROCEEDINGS{commag23,
author = {Christos Liaskos and Kostas Katsalis and Joan Triay and Stefan Schmid},
title = {Resource Management for Programmable Metasurfaces: Concept, Prospects and Challenges},
booktitle = {IEEE Communications Magazine (COMMAG)},
year = {2023},
}
Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults
Christoph Lenzen, Moti Medina, Mehrdad Saberi, Stefan Schmid
@INPROCEEDINGS{ton23route,
author = {Christoph Lenzen and Moti Medina and Mehrdad Saberi and Stefan Schmid},
title = {Robust Routing Made Easy: Reinforcing Networks Against Non-Benign Faults},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2023},
}
Runtime Verification for Programmable Switches
Apoorv Shukla, Kevin Hudemann, Zsolt Vagi, Lily Hugerich, Georgios Smaragdakis, Artur Hecker, Stefan Schmid, Anja Feldmann
@INPROCEEDINGS{ton23p6,
author = {Apoorv Shukla and Kevin Hudemann and Zsolt Vagi and Lily Hugerich
and Georgios Smaragdakis and Artur Hecker and Stefan Schmid and Anja Feldmann},
title = {Runtime Verification for Programmable Switches},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2023},
}
SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree
@INPROCEEDINGS{infocom23seed,
author = {Arash Pourdamghani and Chen Avin and Robert Sama and Stefan Schmid},
title = {SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree},
booktitle = {IEEE INFOCOM},
year = {2023},
}
Self-Adjusting Grid Networks
Chen Avin, Ingo van Duijn, Maciej Pacut, Stefan Schmid
@INPROCEEDINGS{infocomp23,
author = {Chen Avin and Ingo van Duijn and Maciej Pacut and Stefan Schmid},
title = {Self-Adjusting Grid Networks},
booktitle = {Elsevier Information and Computation},
year = {2023},
}
Self-Adjusting Linear Networks with Ladder Demand Graph
Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid
30th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2023
@INPROCEEDINGS{sirocco23san,
author = {Vitaly Aksenov and Anton Paramonov and Iosif Salem and Stefan Schmid},
title = {Self-Adjusting Linear Networks with Ladder Demand Graph},
booktitle = {30th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2023},
}
Self-Adjusting Partially Ordered Lists
Vamsi Addanki, Maciej Pacut, Arash Pourdamghani, Gabor Retvari, Stefan Schmid, Juan Vanerio
@INPROCEEDINGS{infocom23lists,
author = {Vamsi Addanki and Maciej Pacut and Arash Pourdamghani and Gabor Retvari and Stefan Schmid
and Juan Vanerio},
title = {Self-Adjusting Partially Ordered Lists},
booktitle = {IEEE INFOCOM},
year = {2023},
}
Sinkless Orientation Made Simple
Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto
SIAM Symposium on Simplicity in Algorithm (SOSA), 2023
@INPROCEEDINGS{sosa23,
author = {Alkida Balliu and Janne H. Korhonen and Fabian Kuhn and Henrik Lievonen and Dennis Olivetti
and Shreyas Pai and Ami Paz and Joel Rybicki
and Stefan Schmid and Jan Studený and Jukka Suomela and Jara Uitto},
title = {Sinkless Orientation Made Simple},
booktitle = {SIAM Symposium on Simplicity in Algorithm (SOSA)},
year = {2023},
}
TCP's Third Eye: Leveraging eBPF for Telemetry-Powered Congestion Control
Joern-Thorben Hinz, Vamsi Addanki, Csaba Gyorgyi, Theo Jepsen, Stefan Schmid
SIGCOMM Workshop on eBPF and Kernel Extensions (eBPF), 2023
@INPROCEEDINGS{ebpf23,
author = {Joern-Thorben Hinz and Vamsi Addanki and Csaba Gyorgyi and Theo Jepsen and Stefan Schmid},
title = {TCP's Third Eye: Leveraging eBPF for Telemetry-Powered Congestion Control},
booktitle = {SIGCOMM Workshop on eBPF and Kernel Extensions (eBPF)},
year = {2023},
}
The Case for Stochastic Online Segment Routing Under Demand Uncertainty
@INPROCEEDINGS{ifipnet23,
author = {Jerome De Boeck and Bernard Fortz and Stefan Schmid},
title = {The Case for Stochastic Online Segment Routing Under Demand Uncertainty},
booktitle = {IFIP Networking},
year = {2023},
}
The Time Complexity of Consensus Under Oblivious Message
Adversaries
Hugo Rincon Galeana, Ami Paz, Stefan Schmid, Ulrich Schmid, Kyrill Winkler
14th Innovations in Theoretical Computer Science (ITCS), 2023
@INPROCEEDINGS{itcs23consensus,
author = {Hugo Rincon Galeana and Ami Paz and Stefan Schmid and Ulrich Schmid and Kyrill Winkler},
title = {The Time Complexity of Consensus Under Oblivious Message
Adversaries},
booktitle = {14th Innovations in Theoretical Computer Science (ITCS)},
year = {2023},
}
Tokenizing Assets with Dividend Payouts - a Legally Compliant and Flexible Design
@INPROCEEDINGS{digfin23,
author = {Efim Zhitomirskiy and Stefan Schmid and Martin Walther},
title = {Tokenizing Assets with Dividend Payouts - a Legally Compliant and Flexible Design},
booktitle = {Digital Finance, Springer},
year = {2023},
}
Toward Highly Reliable Programmable Data Planes: Verification of P4 Code Generation
Csaba Gyorgyi, Sandor Laki, Stefan Schmid
9th IEEE International Conference on Network Softwarization (NetSoft), 2023
@INPROCEEDINGS{netsoft23,
author = {Csaba Gyorgyi and Sandor Laki and Stefan Schmid},
title = {Toward Highly Reliable Programmable Data Planes: Verification of P4 Code Generation},
booktitle = {9th IEEE International Conference on Network Softwarization (NetSoft)},
year = {2023},
}
Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation
Stefan Schmid, Jakub Svoboda, Michelle Yeo
30th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2023
@INPROCEEDINGS{sirocco23pcn,
author = {Stefan Schmid and Jakub Svoboda and Michelle Yeo},
title = {Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation},
booktitle = {30th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2023},
}
XR-RF Imaging Enabled by Software-Defined Metasurfaces and Machine Learning: Foundational Vision, Technologies and Challenges
C. Liaskos, A. Tsioliaridou, K. Georgopoulos, G. Morianos, S. Ioannidis, I. Salem, D. Manessis, S. Schmid, D. Tyrovolas, S. A. Tegos, P.-V. Mekikis, P. D. Diamantoulakis, A. Pitilakis, N. Kantartzis, G. K. Karagiannidis, A. Tasolamprou, O. Tsilipakos, M. Kafesaki, I.F. Akyildiz, A. Pitsillides, M. Pateraki, M. Vakalellis, I. Spais
@INPROCEEDINGS{access23xr,
author = {C. Liaskos and A. Tsioliaridou and K. Georgopoulos and G. Morianos and S. Ioannidis and I. Salem and D. Manessis and S. Schmid and D. Tyrovolas and S. A. Tegos and P.-V. Mekikis and P. D. Diamantoulakis and A. Pitilakis and N. Kantartzis and G. K. Karagiannidis and A. Tasolamprou and O. Tsilipakos and M. Kafesaki and I.F. Akyildiz and A. Pitsillides
and M. Pateraki and M. Vakalellis and I. Spais},
title = {XR-RF Imaging Enabled by Software-Defined Metasurfaces and Machine Learning: Foundational Vision, Technologies and Challenges},
booktitle = {IEEE Access},
year = {2023},
}
2022
ABM: Active Buffer Management in Datacenters
Vamsi Addanki, Maria Apostolaki, Manya Ghobadi, Stefan Schmid, Laurent Vanbever
@INPROCEEDINGS{sigcomm22,
author = {Vamsi Addanki and Maria Apostolaki and Manya Ghobadi and Stefan Schmid and Laurent Vanbever},
title = {ABM: Active Buffer Management in Datacenters},
booktitle = {Proc. ACM SIGCOMM},
year = {2022},
}
AllSynth: Transiently Correct Network Update Synthesis Accounting for Operator Preferences
Kim Guldstrand Larsen, Anders Mariegaard, Stefan Schmid, Jiri Srba
Proc. 16th International Symposium on Theoretical Aspects of Software Engineerin (TASE), 2022
@INPROCEEDINGS{tase22,
author = {Kim Guldstrand Larsen and Anders Mariegaard and Stefan Schmid and Jiri Srba},
title = {AllSynth: Transiently Correct Network Update Synthesis Accounting for Operator Preferences},
booktitle = {Proc. 16th International Symposium on Theoretical Aspects of Software Engineerin (TASE)},
year = {2022},
}
Approximate Dynamic Balanced Graph Partitioning
Harald Raecke, Stefan Schmid, Ruslan Zabrodin
Proc. 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022
@INPROCEEDINGS{spaa22,
author = {Harald Raecke and Stefan Schmid and Ruslan Zabrodin},
title = {Approximate Dynamic Balanced Graph Partitioning},
booktitle = {Proc. 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2022},
}
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear
Antoine El-Hayek, Monika Henzinger, Stefan Schmid
Proc. ACM Symposium on Principles of Distributed Computing (PODC), 2022
@INPROCEEDINGS{podc22,
author = {Antoine El-Hayek and Monika Henzinger and Stefan Schmid},
title = {Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear},
booktitle = {Proc. ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2022},
}
Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, Stefan Schmid
International Symposium on Distributed Computing (DISC), 2022
@INPROCEEDINGS{disc22ba2,
author = {Wenkai Dai and Michael Dinitz and Klaus-Tycho Foerster and Stefan Schmid},
title = {Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies},
booktitle = {International Symposium on Distributed Computing (DISC)},
year = {2022},
}
Brief Announcement: Temporal Locality in Online Algorithms
Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, Aleksandr Tereshchenko
International Symposium on Distributed Computing (DISC), 2022
@INPROCEEDINGS{disc22ba1,
author = {Maciej Pacut and Mahmoud Parham and Joel Rybicki and Stefan Schmid and Jukka Suomela and Aleksandr Tereshchenko},
title = {Brief Announcement: Temporal Locality in Online Algorithms},
booktitle = {International Symposium on Distributed Computing (DISC)},
year = {2022},
}
CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design
@INPROCEEDINGS{comnet22,
author = {Chen Griner and Stefan Schmid and Chen Avin},
title = {CacheNet: Leveraging the Principle of Locality in Reconfigurable Network Design},
booktitle = {Journal Computer Networks (COMNET)},
year = {2022},
}
CBNet: Demand-Aware Tree Topologies for Reconfigurable Datacenter Networks<
Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Stefan Schmid
@INPROCEEDINGS{comnet22cb,
author = {Otavio Augusto de Oliveira Souza and Olga Goussevskaia and Stefan Schmid},
title = {CBNet: Demand-Aware Tree Topologies for Reconfigurable Datacenter Networks<},
booktitle = {Journal Computer Networks (COMNET)},
year = {2022},
}
Cerberus: The Power of Choices in Datacenter Topology Design (A Throughput Perspective)
Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2022
@INPROCEEDINGS{pomacs22cerberus,
author = {Chen Griner and Johannes Zerwas and Andreas Blenk and Manya Ghobadi and Stefan Schmid and Chen Avin},
title = {Cerberus: The Power of Choices in Datacenter Topology Design (A Throughput Perspective)},
booktitle = {Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS)},
year = {2022},
}
Cerberus: The Power of Choices in Datacenter Topology Design (A Throughput Perspective)
Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
@INPROCEEDINGS{sigmetrics22cerberus,
author = {Chen Griner and Johannes Zerwas and Andreas Blenk and Manya Ghobadi and Stefan Schmid and Chen Avin},
title = {Cerberus: The Power of Choices in Datacenter Topology Design (A Throughput Perspective)},
booktitle = {Proc. ACM SIGMETRICS},
year = {2022},
}
Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks
Neta Rozen Schiff, Klaus-Tycho Foerster, Stefan Schmid, David Hay
25th International Conference on Principles of Distributed Systems (OPODIS), 2022
@INPROCEEDINGS{opodis22,
author = {Neta Rozen Schiff and Klaus-Tycho Foerster and Stefan Schmid and David Hay},
title = {Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks},
booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2022},
}
Demand-Aware Network Design with Minimal Congestion and Route Lengths
@INPROCEEDINGS{ton22dan,
author = {Chen Avin and Kaushik Mondal and Stefan Schmi},
title = {Demand-Aware Network Design with Minimal Congestion and Route Lengths},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2022},
}
Deterministic Self-Adjusting Tree Networks Using Rotor Walks
Chen Avin, Marcin Bienkowski, Iosif Salem, Robert Sama, Stefan Schmid, Paweł Schmidt
Proc. 42nd IEEE International Conference on Distributed Computing Systems (ICDCS), 2022
@INPROCEEDINGS{icdcs22,
author = {Chen Avin and Marcin Bienkowski and Iosif Salem and Robert Sama and Stefan Schmid and Paweł Schmidt},
title = {Deterministic Self-Adjusting Tree Networks Using Rotor Walks},
booktitle = {Proc. 42nd IEEE International Conference on Distributed Computing Systems (ICDCS)},
year = {2022},
}
Die technologischen Ansätze und Herausforderungen des Web3 und Metaverse
Yvonne-Anne Pignolet, Stefan Schmid
Telemedicus – Recht der Informationsgesellschaft, Tagungsband zur Sommerkonferenz, Deutscher Fachverlag, 2022
@INPROCEEDINGS{telemedicus22,
author = {Yvonne-Anne Pignolet and Stefan Schmid},
title = {Die technologischen Ansätze und Herausforderungen des Web3 und Metaverse},
booktitle = {Telemedicus – Recht der Informationsgesellschaft, Tagungsband zur Sommerkonferenz, Deutscher Fachverlag},
year = {2022},
}
Empirical Evaluation of Nodes and Channels of the Lightning Network
Philipp Zabka, Klaus-Tycho Foerster, Stefan Schmid, Christian Decker
@INPROCEEDINGS{pmc22,
author = {Philipp Zabka and Klaus-Tycho Foerster and Stefan Schmid and Christian Decker},
title = {Empirical Evaluation of Nodes and Channels of the Lightning Network},
booktitle = {Pervasive and Mobile Computing (PMC)},
year = {2022},
}
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
Kathrin Hanauer, Monika Henzinger, Stefan Schmid, Jonathan Trummer
Proc. IEEE Conference on Computer Communications (INFOCOM), 2022
@INPROCEEDINGS{infocom22matching,
author = {Kathrin Hanauer and Monika Henzinger and Stefan Schmid and Jonathan Trummer},
title = {Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies},
booktitle = {Proc. IEEE Conference on Computer Communications (INFOCOM)},
year = {2022},
}
FBR: Dynamic Memory-Aware Fast Rerouting
Nicklas Johansen, Lasse Kaer, Andreas Madsen, Kristian Nielsen, Stefan Schmid, Jiri Srba, Rasmus Tollund
@INPROCEEDINGS{gi22frr,
author = {Nicklas Johansen and Lasse Kaer and Andreas Madsen and Kristian Nielsen and Stefan Schmid and Jiri Srba and Rasmus Tollund},
title = {FBR: Dynamic Memory-Aware Fast Rerouting},
booktitle = {IEEE Global Internet Symposium (GI)},
year = {2022},
}
Hide and Seek: Privacy-Preserving Rebalancing on Payment Channel Networks
Zeta Avarikioti, Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, Michelle Yeo
Proc. Financial Cryptography and Data Security (FC), 2022
BibTeX
@INPROCEEDINGS{fc22hideandseek,
author = {Zeta Avarikioti and Krzysztof Pietrzak and Iosif Salem and Stefan Schmid and Samarth Tiwari and Michelle Yeo},
title = {Hide and Seek: Privacy-Preserving Rebalancing on Payment Channel Networks},
booktitle = {Proc. Financial Cryptography and Data Security (FC)},
year = {2022},
}
Inferring Sensitive Information in Cryptocurrency Off-chain Networks using Probing and Timing Attacks
Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid, Christian Decker
Information Systems Security and Privacy, Communications in Computer and Information Science
(CCIS), 2022
@INPROCEEDINGS{icissp20journal,
author = {Utz Nisslmueller and Klaus-Tycho Foerster and Stefan Schmid and Christian Decker},
title = {Inferring Sensitive Information in Cryptocurrency Off-chain Networks using Probing and Timing Attacks},
booktitle = {Information Systems Security and Privacy, Communications in Computer and Information Science
(CCIS)},
year = {2022},
}
Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model
Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid
Proc. IEEE Conference on Computer Communications (INFOCOM), 2022
@INPROCEEDINGS{infocom22lazy,
author = {Evgeniy Feder and Ichha Rathod and Punit Shyamsukha
and Robert Sama and Vitaly Aksenov and Iosif Salem and Stefan Schmid},
title = {Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model},
booktitle = {Proc. IEEE Conference on Computer Communications (INFOCOM)},
year = {2022},
}
Local Fast Rerouting with Low Congestion: A Randomized Approach
@INPROCEEDINGS{ton22frr,
author = {Gregor Bankhamer and Robert Elsaesser and Stefan Schmid},
title = {Local Fast Rerouting with Low Congestion: A Randomized Approach},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2022},
}
Model-Based Insights on the Performance, Fairness, and Stability of BBR
Simon Scherrer, Markus Legner, Adrian Perrig, Stefan Schmid
@INPROCEEDINGS{imc22,
author = {Simon Scherrer and Markus Legner and Adrian Perrig and Stefan Schmid},
title = {Model-Based Insights on the Performance, Fairness, and Stability of BBR},
booktitle = {ACM Internet Measurement Conference (IMC)},
year = {2022},
}
MPLS-Kit: An MPLS Data Plane Toolkit
Juan Vanerio, Stefan Schmid, Morten Schou, Jiri Srba
@INPROCEEDINGS{gi22mpls,
author = {Juan Vanerio and Stefan Schmid and Morten Schou and Jiri Srba},
title = {MPLS-Kit: An MPLS Data Plane Toolkit},
booktitle = {IEEE Global Internet Symposium (GI)},
year = {2022},
}
NetStack: A Game Approach to Synthesizing Consistent Network Updates
@INPROCEEDINGS{ifip22,
author = {Stefan Schmid and Bernhard Schrenk and Alvaro Torralba},
title = {NetStack: A Game Approach to Synthesizing Consistent Network Updates},
booktitle = {Proc. IFIP Networking},
year = {2022},
}
On the Price of Locality in Static Fast Rerouting
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. 52nd IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2022
@INPROCEEDINGS{dsn22frr,
author = {Klaus-Tycho Foerster and Juho Hirvonen and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {On the Price of Locality in Static Fast Rerouting},
booktitle = {Proc. 52nd IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2022},
}
Optimizing Multicast Flows in High-Bandwidth Reconfigurable Datacenter Networks<
Long Luo, Klaus-Tycho Foerster, Stefan Schmid, Hongfang Yu
Journal of Network and Computer Applications (JNCA), 2022
@INPROCEEDINGS{jnca22,
author = {Long Luo and Klaus-Tycho Foerster and Stefan Schmid and Hongfang Yu},
title = {Optimizing Multicast Flows in High-Bandwidth Reconfigurable Datacenter Networks<},
booktitle = {Journal of Network and Computer Applications (JNCA)},
year = {2022},
}
PDAAAL: A Library for Reachability Analysis of Weighted Pushdown Systems
Peter Gjol Jensen, Stefan Schmid, Morten Konggaard Schou, Jirí Srba
20th International Symposium on Automated Technology for Verification and Analysis (ATVA), 2022
@INPROCEEDINGS{atva22,
author = {Peter Gjol Jensen and Stefan Schmid and Morten Konggaard Schou and Jirí Srba},
title = {PDAAAL: A Library for Reachability Analysis of Weighted Pushdown Systems},
booktitle = {20th International Symposium on Automated Technology for Verification and Analysis (ATVA)},
year = {2022},
}
PowerTCP: Pushing the Performance Limits of Datacenter Networks
Vamsi Addanki, Oliver Michel, Stefan Schmid
Proc. 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2022
@INPROCEEDINGS{nsdi22,
author = {Vamsi Addanki and Oliver Michel and Stefan Schmid},
title = {PowerTCP: Pushing the Performance Limits of Datacenter Networks},
booktitle = {Proc. 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI)},
year = {2022},
}
Push-Down Trees: Optimal Self-Adjusting Complete Trees
@INPROCEEDINGS{ton22push,
author = {Chen Avin and Kaushik Mondal and Stefan Schmi},
title = {Push-Down Trees: Optimal Self-Adjusting Complete Trees},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2022},
}
R-MPLS: Recursive Protection for Highly Dependable MPLS Networks
Stefan Schmid, Morten Konggaard Schou, Jiri Srba, Juan Vanerio
18th ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT), 2022
@INPROCEEDINGS{conext22,
author = {Stefan Schmid and Morten Konggaard Schou and Jiri Srba and Juan Vanerio},
title = {R-MPLS: Recursive Protection for Highly Dependable MPLS Networks},
booktitle = {18th ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT)},
year = {2022},
}
Renaissance: A Self-Stabilizing Distributed SDN Control Plane using In-band Communications
Marco Canini, Iosif Salem, Liron Schiff, Elad Michael Schiller, Stefan Schmid
Journal of Computer and System Sciences (JCSS), 2022
@INPROCEEDINGS{jcss22,
author = {Marco Canini and Iosif Salem and Liron Schiff and Elad Michael Schiller and Stefan Schmid},
title = {Renaissance: A Self-Stabilizing Distributed SDN Control Plane using In-band Communications},
booktitle = {Journal of Computer and System Sciences (JCSS)},
year = {2022},
}
Short Paper: A Centrality Analysis of the Lightning Network
Philipp Zabka, Klaus-Tycho Foerster, Christian Decker, Stefan Schmid
Proc. Financial Cryptography and Data Security (FC), 2022
@INPROCEEDINGS{fc22centrality,
author = {Philipp Zabka and Klaus-Tycho Foerster and Christian Decker and Stefan Schmid},
title = {Short Paper: A Centrality Analysis of the Lightning Network},
booktitle = {Proc. Financial Cryptography and Data Security (FC)},
year = {2022},
}
Software-Defined Reconfigurable Intelligent Surfaces: From Theory to End-to-End Implementation
Christos Liaskos, Lefteris Mamatas, Arash Pourdamghani, Atsioli Tsioliaridou, Sotiris Ioannidis, Andreas Pitsillides, Stefan Schmid, Ian F. Akyildi
@INPROCEEDINGS{ieee22,
author = {Christos Liaskos and Lefteris Mamatas and Arash Pourdamghani and Atsioli Tsioliaridou
and Sotiris Ioannidis and Andreas Pitsillides and Stefan Schmid and Ian F. Akyildi},
title = {Software-Defined Reconfigurable Intelligent Surfaces: From Theory to End-to-End Implementation},
booktitle = {Proceedings of the IEEE (PIEEE)},
year = {2022},
}
The Augmentation-Speed Tradeoff for Consistent Network Updates
@INPROCEEDINGS{sosr22,
author = {Monika Henzinger and Ami Paz and Arash Pourdamghani and Stefan Schmid},
title = {The Augmentation-Speed Tradeoff for Consistent Network Updates},
booktitle = {ACM SIGCOMM Symposium on SDN Research (SOSR)},
year = {2022},
}
The Hazard Value: A Quantitative Network Connectivity Measure Accounting for Failures
Pieter Cuijpers, Stefan Schmid, Nicolas Schnepf, Jiri Srba
Proc. 52nd IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2022
@INPROCEEDINGS{dsn22hazard,
author = {Pieter Cuijpers and Stefan Schmid and Nicolas Schnepf and Jiri Srba},
title = {The Hazard Value: A Quantitative Network Connectivity Measure Accounting for Failures},
booktitle = {Proc. 52nd IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2022},
}
Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation
Samarth Tiwari, Michelle Yeo, Zeta Avarikioti, Iosif Salem, Krzysztof Pietrzak, Stefan Schmid
Proc. 4th ACM Conference on Advances in Financial Technologies (AFT), 2022
@INPROCEEDINGS{aft22,
author = {Samarth Tiwari and Michelle Yeo and Zeta Avarikioti and Iosif Salem and Krzysztof Pietrzak
and Stefan Schmid},
title = {Wiser: Increasing Throughput in Payment Channel Networks with Transaction Aggregation},
booktitle = {Proc. 4th ACM Conference on Advances in Financial Technologies (AFT)},
year = {2022},
}
2021
A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks
Marco Chiesa, Andrzej Kamisinski, Jacek Rak, Gabor Retvari, Stefan Schmid
IEEE Communications Surveys and Tutorials (COMST), 2021
@article{frr-survey,
title={A Survey of Fast-Recovery Mechanisms in Packet-Switched Networks},
author={Marco Chiesa and Andrzej Kamisinski and Jacek Rak and Gabor Retvari and Stefan Schmid},
journal={IEEE Communications Surveys and Tutorials (COMST)},
year={2021},
}
A Survey of Reconfigurable Optical Networks
Matthew Nance Hall, Klaus-Tycho Foerster, Stefan Schmid, Ramakrishnan Durairajan
Optical Switching and Networking (OSN), Elsevier, 2021
@INPROCEEDINGS{osn21,
author = {Matthew Nance Hall and Klaus-Tycho Foerster and Stefan Schmid and Ramakrishnan Durairajan},
title = {A Survey of Reconfigurable Optical Networks},
booktitle = {Optical Switching and Networking (OSN), Elsevier},
year = {2021},
}
An Axiomatic Perspective on the Performance Effects of End-Host Path Selection
Simon Scherrer, Markus Legner, Adrian Perrig, Stefan Schmid
39th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2021
@INPROCEEDINGS{perf21axiom,
author = {Simon Scherrer and Markus Legner and Adrian Perrig and Stefan Schmid},
title = {An Axiomatic Perspective on the Performance Effects of End-Host Path Selection},
booktitle = {39th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2021},
}
Automata Theoretic Approach to Verification of MPLS Networks under Link Failures
Peter Gjol Jensen, Jesper Stenbjerg Jensen, Troels Beck Krogh, Jonas Sand Madsen, Stefan Schmid, Jiri Srba, Marc Tom Thorgersen, Ingo van Duijn
@INPROCEEDINGS{ton21prex,
author = {Peter Gjol Jensen and Jesper Stenbjerg Jensen and Troels Beck Krogh
and Jonas Sand Madsen and Stefan Schmid and Jiri Srba and Marc Tom Thorgersen and Ingo van Duijn},
title = {Automata Theoretic Approach to Verification of MPLS Networks under Link Failures},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2021},
}
Brief Announcement: Sinkless Orientation Is Hard also in the Supported LOCAL Model<
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela
International Symposium on Distributed Computing (DISC), 2021
@INPROCEEDINGS{disc21ba,
author = {Janne H. Korhonen and Ami Paz and Joel Rybicki and Stefan Schmid and Jukka Suomela},
title = {Brief Announcement: Sinkless Orientation Is Hard also in the Supported LOCAL Model<},
booktitle = {International Symposium on Distributed Computing (DISC)},
year = {2021},
}
Brief Announcement: Toward Self-Adjusting Networks for the Matching Model
Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid
33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021
@INPROCEEDINGS{spaa21lazy,
author = {Evgeniy Feder and Ichha Rathod and Punit Shyamsukha
and Robert Sama and Vitaly Aksenov and Iosif Salem and Stefan Schmid},
title = {Brief Announcement: Toward Self-Adjusting Networks for the Matching Model},
booktitle = {33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2021},
}
CBNet: Minimizing Adjustments in Concurrent Demand-Aware Tree Networks
Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Stefan Schmid
Proc. 35th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2021
@INPROCEEDINGS{ipdps21,
author = {Otavio Augusto de Oliveira Souza and Olga Goussevskaia and Stefan Schmid},
title = {CBNet: Minimizing Adjustments in Concurrent Demand-Aware Tree Networks},
booktitle = {Proc. 35th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
year = {2021},
}
Demand matrix optimization for offchain payments in blockchain
Julia Khamis, Stefan Schmid, Ori Rottenstreich
2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), 2021
@inproceedings{icbc21,
title={Demand matrix optimization for offchain payments in blockchain},
author={Khamis, Julia and Schmid, Stefan and Rottenstreich, Ori},
booktitle={2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC)},
pages={1--9},
year={2021},
organization={IEEE}
}
Demand-Aware Plane Spanners of Bounded Degree
Esra Ceylan, Klaus-Tycho Foerster, Stefan Schmid, Katsiaryna Zaitsava
@INPROCEEDINGS{ifip21dan,
author = {Esra Ceylan and Klaus-Tycho Foerster and Stefan Schmid and Katsiaryna Zaitsava},
title = {Demand-Aware Plane Spanners of Bounded Degree},
booktitle = {Proc. IFIP Networking},
year = {2021},
}
Distributed Self-Adjusting Tree Networks
Bruna Peres, Otavio Augusto de Oliveira Souza, Olga Goussevskaia, Chen Avin, Stefan Schmid
@INPROCEEDINGS{tcc21,
author = {Bruna Peres and Otavio Augusto de Oliveira Souza
and Olga Goussevskaia and Chen Avin and Stefan Schmid},
title = {Distributed Self-Adjusting Tree Networks},
booktitle = {IEEE Transactions on Cloud Computing (TCC)},
year = {2021},
}
Efficient Network Monitoring Applications in the Kernel with eBPF and XDP
Marcelo Abranches, Oliver Michel, Eric Keller, Stefan Schmid
Proc. 7th IEEE Conference on Network Functions Virtualization and Software-Defined Networking (NFV-SDN), 2021
@INPROCEEDINGS{nfvsdn21,
author = {Marcelo Abranches and Oliver Michel and Eric Keller and Stefan Schmid},
title = {Efficient Network Monitoring Applications in the Kernel with eBPF and XDP},
booktitle = {Proc. 7th IEEE Conference on Network Functions Virtualization and Software-Defined Networking (NFV-SDN)},
year = {2021},
}
Enabling Novel Interconnection Agreements with Path-Aware Network Architectures
Simon Scherrer, Markus Legner, Adrian Perrig, Stefan Schmid
Proc. 51st IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2021
@INPROCEEDINGS{dsn21,
author = {Simon Scherrer and Markus Legner and Adrian Perrig and Stefan Schmid},
title = {Enabling Novel Interconnection Agreements with Path-Aware Network Architectures},
booktitle = {Proc. 51st IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2021},
}
ExRec: Experimental Framework for Reconfigurable Networks Based on Off-the-Shelf Hardware
Johannes Zerwas, Chen Avin, Stefan Schmid, Andreas Blenk
ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2021
@INPROCEEDINGS{ancs21exrec,
author = {Johannes Zerwas and Chen Avin and Stefan Schmid and Andreas Blenk},
title = {ExRec: Experimental Framework for Reconfigurable Networks Based on Off-the-Shelf Hardware},
booktitle = {ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},
year = {2021},
}
Fast ReRoute on Programmable Switches
Marco Chiesa, Roshan Sedar, Gianni Antichi, Michael Borokhovich, Andrzej Kamisinski, Georgios Nikolaidis, Stefan Schmid
@INPROCEEDINGS{ton21purr,
author = {Marco Chiesa and Roshan Sedar and Gianni Antichi
and Michael Borokhovich and Andrzej Kamisinski and Georgios Nikolaidis and Stefan Schmid},
title = {Fast ReRoute on Programmable Switches},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2021},
}
Faster Pushdown Reachability Analysis with Applications in Network Verification
Peter Gjol Jensen, Stefan Schmid, Morten Konggaard Schou, Jirí Srba, Juan Vanerio, Ingo van Duijn
19th International Symposium on Automated Technology for Verification and Analysis (ATVA), 2021
@INPROCEEDINGS{atva21,
author = {Peter Gjol Jensen and Stefan Schmid and Morten Konggaard Schou and Jirí Srba
and Juan Vanerio and Ingo van Duijn},
title = {Faster Pushdown Reachability Analysis with Applications in Network Verification},
booktitle = {19th International Symposium on Automated Technology for Verification and Analysis (ATVA)},
year = {2021},
}
Fix with P6: Verifying Programmable Switches at Runtime
Apoorv Shukla, Kevin Hudemann, Zsolt Vagi, Lily Huegerich, Georgios Smaragdakis, Artur Hecker, Stefan Schmid, Anja Feldmann
@INPROCEEDINGS{infocom21p6,
author = {Apoorv Shukla and Kevin Hudemann and Zsolt Vagi and Lily Huegerich and Georgios Smaragdakis and Artur Hecker and Stefan Schmid and Anja Feldmann},
title = {Fix with P6: Verifying Programmable Switches at Runtime},
booktitle = {Proc. IEEE INFOCOM},
year = {2021},
}
Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes
Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
@INPROCEEDINGS{infocom21arbo,
author = {Klaus-Tycho Foerster and Andrzej Kamisinski and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Grafting Arborescences for Extra Resilience of Fast Rerouting Schemes},
booktitle = {Proc. IEEE INFOCOM},
year = {2021},
}
Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion
Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid
@INPROCEEDINGS{peva21scal,
author = {Maciej Pacut and Wenkai Dai and Alexandre Labbe and Klaus-Tycho Foerster and Stefan Schmid},
title = {Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion},
booktitle = {Performance Evaluation (PEVA)},
year = {2021},
}
Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion
Maciej Pacut, Wenkai Dai, Alexandre Labbe, Klaus-Tycho Foerster, Stefan Schmid
39th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2021
@INPROCEEDINGS{perf21dan,
author = {Maciej Pacut and Wenkai Dai and Alexandre Labbe and Klaus-Tycho Foerster and Stefan Schmid},
title = {Improved Scalability of Demand-Aware Datacenter Topologies With Minimal Route Lengths and Congestion},
booktitle = {39th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2021},
}
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
Anya Chaturvedi, Chandra Chekuri, Andrea Richa, Matthias Rost, Stefan Schmid, Jamison Weber
39th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2021
@INPROCEEDINGS{perf21anf,
author = {Anya Chaturvedi and Chandra Chekuri and Andrea Richa and Matthias Rost and Stefan Schmid and Jamison Weber},
title = {Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands},
booktitle = {39th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2021},
}
Improving the Resilience of Fast Failover Routing: TREE
(Tree Routing to Extend Edge disjoint paths)
Oliver Schweiger, Klaus-Tycho Foerster, Stefan Schmid
ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2021
@INPROCEEDINGS{ancs21frr,
author = {Oliver Schweiger and Klaus-Tycho Foerster and Stefan Schmid},
title = {Improving the Resilience of Fast Failover Routing: TREE
(Tree Routing to Extend Edge disjoint paths)},
booktitle = {ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},
year = {2021},
}
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid
@INPROCEEDINGS{sigmetrics21dynlocal,
author = {Klaus-Tycho Foerster and Janne Korhonen and Ami Paz and Joel Rybicki and Stefan Schmid},
title = {Input-Dynamic Distributed Algorithms for Communication Networks},
booktitle = {Proc. ACM SIGMETRICS},
year = {2021},
}
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints
Robin Muenk, Matthias Rost, Harald Raecke, Stefan Schmid
@INPROCEEDINGS{ifip21vnep,
author = {Robin Muenk and Matthias Rost and Harald Raecke and Stefan Schmid},
title = {It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints},
booktitle = {Proc. IFIP Networking},
year = {2021},
}
LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks
Krzysztof Pietrzak, Iosif Salem, Stefan Schmid, Michelle Yeo
@INPROCEEDINGS{ifip21pir,
author = {Krzysztof Pietrzak and Iosif Salem and Stefan Schmid and Michelle Yeo},
title = {LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks},
booktitle = {Proc. IFIP Networking},
year = {2021},
}
Macchiato: Importing Cache Side Channels to SDNs
Amir Sabzi, Liron Schiff, Kashyap Thimmaraju, Andreas Blenk, Stefan Schmid
ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2021
@INPROCEEDINGS{ancs21sidechannel,
author = {Amir Sabzi and Liron Schiff and Kashyap Thimmaraju and Andreas Blenk and Stefan Schmid},
title = {Macchiato: Importing Cache Side Channels to SDNs},
booktitle = {ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},
year = {2021},
}
Network Traffic Characteristics of Machine Learning Frameworks Under the Microscope
Johannes Zerwas, Kaan Aykurt, Stefan Schmid, Andreas Blenk
17th International Conference on Network and Service Management (CNSM), 2021
@INPROCEEDINGS{cnsm21,
author = {Johannes Zerwas and Kaan Aykurt and Stefan Schmid and Andreas Blenk},
title = {Network Traffic Characteristics of Machine Learning Frameworks Under the Microscope},
booktitle = {17th International Conference on Network and Service Management (CNSM)},
year = {2021},
}
Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network
Philipp Zabka, Klaus-Tycho Foerster, Stefan Schmid, Christian Decker
Proc. 22nd International Conference on Distributed Computing and Networking (ICDCN), 2021
@INPROCEEDINGS{icdcn21ln,
author = {Philipp Zabka and Klaus-Tycho Foerster and Stefan Schmid and Christian Decker},
title = {Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network},
booktitle = {Proc. 22nd International Conference on Distributed Computing and Networking (ICDCN)},
year = {2021},
}
On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies
Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid
ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2021
@INPROCEEDINGS{ancs21ancs21obl,
author = {Thomas Fenz and Klaus-Tycho Foerster and Stefan Schmid},
title = {On Efficient Oblivious Wavelength Assignments for Programmable Wide-Area Topologies},
booktitle = {ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},
year = {2021},
}
On the Benefits of Joint Optimization of Reconfigurable CDN-ISP Infrastructure
Johannes Zerwas, Ingmar Poese, Stefan Schmid, Andreas Blenk
IEEE Transactions on Network and Service Management (TNSM), 2021
@INPROCEEDINGS{tnsm21reconfig,
author = {Johannes Zerwas and Ingmar Poese and Stefan Schmid and Andreas Blenk},
title = {On the Benefits of Joint Optimization of Reconfigurable CDN-ISP Infrastructure},
booktitle = {IEEE Transactions on Network and Service Management (TNSM)},
year = {2021},
}
On the Complexity of Weight-Dynamic Network Algorithms
@INPROCEEDINGS{ifip21dynalgo,
author = {Monika Henzinger and Ami Paz and Stefan Schmid},
title = {On the Complexity of Weight-Dynamic Network Algorithms},
booktitle = {Proc. IFIP Networking},
year = {2021},
}
On the Feasibility of Perfect Resilience with Local Fast Failover
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), 2021
@INPROCEEDINGS{apocs21resilience,
author = {Klaus-Tycho Foerster and Juho Hirvonen and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {On the Feasibility of Perfect Resilience with Local Fast Failover},
booktitle = {Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS)},
year = {2021},
}
On the Implications of Routing Models on Network Optimization
Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
IEEE Transactions on Network and Service Management (TNSM), 2021
@INPROCEEDINGS{tnsm21routing,
author = {Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {On the Implications of Routing Models on Network Optimization},
booktitle = {IEEE Transactions on Network and Service Management (TNSM)},
year = {2021},
}
Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time
Tobias Forner, Harald Raecke, Stefan Schmid
Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), 2021
@INPROCEEDINGS{apocs21repartition,
author = {Tobias Forner and Harald Raecke and Stefan Schmid},
title = {Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time},
booktitle = {Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS)},
year = {2021},
}
@INPROCEEDINGS{spaa21vnep,
author = {Aleksander Figiel and Leon Kellerhals and Rolf Niedermeier and Matthias Rost
and Stefan Schmid and Philipp Zschoche},
title = {Optimal Virtual Network Embeddings for Tree Topologies},
booktitle = {33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2021},
}
P4Fuzz: Compiler Fuzzer for Dependable Programmable Dataplanes
Andrei Alexandru Agape, Madalin Claudiu Danceanu, Rene Rydhof Hansen, Stefan Schmid
Proc. 22nd International Conference on Distributed Computing and Networking (ICDCN), 2021
@INPROCEEDINGS{icdcn21p4,
author = {Andrei Alexandru Agape and Madalin Claudiu Danceanu and Rene Rydhof Hansen and Stefan Schmid},
title = {P4Fuzz: Compiler Fuzzer for Dependable Programmable Dataplanes},
booktitle = {Proc. 22nd International Conference on Distributed Computing and Networking (ICDCN)},
year = {2021},
}
Preacher: Network Policy Checker for Adversarial Environments
@INPROCEEDINGS{ton21preacher,
author = {Kashyap Thimmaraju and Liron Schiff and Stefan Schmid},
title = {Preacher: Network Policy Checker for Adversarial Environments},
booktitle = {IEEE/ACM Transactions on Networking},
year = {2021},
}
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
International Symposium on Distributed Computing (DISC), 2021
@INPROCEEDINGS{disc21,
author = {Gregor Bankhamer and Robert Elsässer and Stefan Schmid},
title = {Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion},
booktitle = {International Symposium on Distributed Computing (DISC)},
year = {2021},
}
ReNets: Statically-Optimal Demand-Aware Networks
Chen Avin, Stefan Schmid
Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS), 2021
@INPROCEEDINGS{apocs21renets,
author = {Chen Avin and Stefan Schmid},
title = {ReNets: Statically-Optimal Demand-Aware Networks},
booktitle = {Proc. SIAM Symposium on Algorithmic Principles of Computer Systems (APOCS)},
year = {2021},
}
Resilient Capacity-Aware Routing
Stefan Schmid, Nicolas Schnepf, Jiri Srba
Proc. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2021
@INPROCEEDINGS{tacas21,
author = {Stefan Schmid and Nicolas Schnepf and Jiri Srba},
title = {Resilient Capacity-Aware Routing},
booktitle = {Proc. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)},
year = {2021},
}
Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters
Janardhan Kulkarni, Stefan Schmid, Pawel Schmidt
33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021
@INPROCEEDINGS{spaa21rdcn,
author = {Janardhan Kulkarni and Stefan Schmid and Pawel Schmidt},
title = {Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters},
booktitle = {33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2021},
}
Survey on Blockchain Networking: Context, State-of-the-Art, Challenges
Maya Dotan, Yvonne-Anne Pignolet, Stefan Schmid, Saar Tochner, Aviv Zohar.
@INPROCEEDINGS{csur21crypto,
author = {Maya Dotan and Yvonne-Anne Pignolet and Stefan Schmid and Saar Tochner and Aviv Zohar.},
title = {Survey on Blockchain Networking: Context, State-of-the-Art, Challenges},
booktitle = {Proc. ACM Computing Surveys (CSUR)},
year = {2021},
}
The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications
Oliver Michel, Roberto Bifulco, Gabor Retvari, Stefan Schmid
@INPROCEEDINGS{csur21,
author = {Oliver Michel and Roberto Bifulco and Gabor Retvari and Stefan Schmid},
title = {The Programmable Data Plane: Abstractions, Architectures, Algorithms, and Applications},
booktitle = {Proc. ACM Computing Surveys (CSUR)},
year = {2021},
}
Tight Bounds for Online Graph Partitioning
Monika Henzinger, Stefan Neumann, Harald Raecke, Stefan Schmid
Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021
@INPROCEEDINGS{soda21,
author = {Monika Henzinger and Stefan Neumann and Harald Raecke and Stefan Schmid},
title = {Tight Bounds for Online Graph Partitioning},
booktitle = {Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA)},
year = {2021},
}
Traffic Engineering with Joint Link Weight and Segment Optimization
Mahmoud Parham, Thomas Fenz, Nikolaus Suess, Klaus-Tycho Foerster, Stefan Schmid
Proc. 17th ACM International Conference on emerging Networking EXperiments and Technologies
(CoNEXT), 2021
@INPROCEEDINGS{conext21te,
author = {Mahmoud Parham and Thomas Fenz and Nikolaus Suess and Klaus-Tycho Foerster and Stefan Schmid},
title = {Traffic Engineering with Joint Link Weight and Segment Optimization},
booktitle = {Proc. 17th ACM International Conference on emerging Networking EXperiments and Technologies
(CoNEXT)},
year = {2021},
}
2020
AalWiNes: A Fast and Quantitative What-If Analysis Tool for MPLS Networks
Peter Gjol Jensen, Morten Konggaard, Dan Kristiansen, Stefan Schmid, Bernhard Clemens Schrenk, Jiri Srba
Proc. 16th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2020
@INPROCEEDINGS{conext20,
author = {Peter Gjol Jensen and Morten Konggaard and Dan Kristiansen and Stefan Schmid and Bernhard Clemens Schrenk and Jiri Srba},
title = {AalWiNes: A Fast and Quantitative What-If Analysis Tool for MPLS Networks},
booktitle = {Proc. 16th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
year = {2020},
}
AirNet: Energy-Aware Deployment and Scheduling of Aerial Networks
Elif Bozkaya, Klaus-Tycho Foerster, Stefan Schmid, Berk Canberk
IEEE Transactions on Vehicular Technology (TVT), 2020
@INPROCEEDINGS{tvt20,
author = {Elif Bozkaya and Klaus-Tycho Foerster and Stefan Schmid and Berk Canberk},
title = {AirNet: Energy-Aware Deployment and Scheduling of Aerial Networks},
booktitle = {IEEE Transactions on Vehicular Technology (TVT)},
year = {2020},
}
Area Convergence of Monoculus Robots with Additional Capabilities
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
@INPROCEEDINGS{compj20,
author = {Debasish Pattanayak and Kaushik Mondal and Partha Sarathi Mandal and Stefan Schmid},
title = {Area Convergence of Monoculus Robots with Additional Capabilities},
booktitle = {The Computer Journal (COMPJ)},
year = {2020},
}
Breeding Unicorns: Developing Trustworthy and Scalable Randomness Beacons
Samvid Dharanikota, Michael Toft Jensen, Sebastian Rom Kristensen, Mathias Sass Michno, Yvonne-Anne Pignolet, Rene Rydhof Hansen, Stefan Schmid
@INPROCEEDINGS{pone20,
author = {Samvid Dharanikota and Michael Toft Jensen
and Sebastian Rom Kristensen and
Mathias Sass Michno and Yvonne-Anne Pignolet and Rene Rydhof Hansen
and Stefan Schmid},
title = {Breeding Unicorns: Developing Trustworthy and Scalable Randomness Beacons},
booktitle = {PLOS ONE},
year = {2020},
}
Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning
Maciej Pacut, Mahmoud Parham, Stefan Schmid
Proc. ACM Symposium on Principles of Distributed Computing (PODC), 2020
@INPROCEEDINGS{podc20ba,
author = {Maciej Pacut and Mahmoud Parham and Stefan Schmid},
title = {Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning},
booktitle = {Proc. ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2020},
}
Brief Announcement: What Can(not) Be
Perfectly Rerouted Locally
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. International Symposium on Distributed Computing (DISC), 2020
@INPROCEEDINGS{disc20,
author = {Klaus-Tycho Foerster and Juho Hirvonen and Yvonne-Anne Pignolet and Stefan Schmid
and Gilles Tredan},
title = {Brief Announcement: What Can(not) Be
Perfectly Rerouted Locally},
booktitle = {Proc. International Symposium on Distributed Computing (DISC)},
year = {2020},
}
Chameleon: Predictable Latency and High Utilization with Queue-Aware and Adaptive Source Routing
Amaury Van Bemten, Nemanja Deric, Amir Varasteh, Stefan Schmid, Carmen Mas Machuca, Andreas Blenk, Wolfgang Kellerer
Proc. 16th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2020
@INPROCEEDINGS{conext20chameleon,
author = {Amaury Van Bemten and Nemanja Deric and Amir Varasteh
and Stefan Schmid and Carmen Mas Machuca and Andreas Blenk and Wolfgang Kellerer},
title = {Chameleon: Predictable Latency and High Utilization with Queue-Aware and Adaptive Source Routing},
booktitle = {Proc. 16th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
year = {2020},
}
Conic Formation in Presence of Faulty Robots
Debasish Pattanayak, Klaus-Tycho Foerster, Partha Sarathi Mandal, Stefan Schmid
Proc. 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2020
@INPROCEEDINGS{algosensors20,
author = {Debasish Pattanayak and Klaus-Tycho Foerster and Partha Sarathi Mandal and Stefan Schmid},
title = {Conic Formation in Presence of Faulty Robots},
booktitle = {Proc. 16th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)},
year = {2020},
}
@INPROCEEDINGS{ares20,
author = {Maya Dotan and Yvonne-Anne Pignolet and Saar Tochner and Stefan Schmid and Aviv Zohar},
title = {Cryptocurrency Networking: Context, State-of-the-Art, Challenges},
booktitle = {Proc. 15th International Conference on Availability, Reliability and Security (ARES)},
year = {2020},
}
Deadline-Aware Multicast Transfers in Software-Defined Optical Wide-Area Networks
Long Luo, Klaus-Tycho Foerster, Stefan Schmid, Hongfang Yu
IEEE Journal on Selected Areas in Communications (JSAC), 2020
BibTeX
@INPROCEEDINGS{jsac20multicast,
author = {Long Luo and Klaus-Tycho Foerster and Stefan Schmid and Hongfang Yu},
title = {Deadline-Aware Multicast Transfers in Software-Defined Optical Wide-Area Networks},
booktitle = {IEEE Journal on Selected Areas in Communications (JSAC)},
year = {2020},
}
@INPROCEEDINGS{dist20dan,
author = {Chen Avin and Kaushik Mondal and Stefan Schmid},
title = {Demand-Aware Network Designs of Bounded Degree},
booktitle = {Distributed Computing (DIST)},
year = {2020},
}
Dynamically Optimal Self-Adjusting Single-Source Tree Networks
Chen Avin, Kaushik Mondal, Stefan Schmid
Proc. Latin American Theoretical Informatics Symposium (LATIN), 2020
@INPROCEEDINGS{latin20,
author = {Chen Avin and Kaushik Mondal and Stefan Schmid},
title = {Dynamically Optimal Self-Adjusting Single-Source Tree Networks},
booktitle = {Proc. Latin American Theoretical Informatics Symposium (LATIN)},
year = {2020},
}
Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks
Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anais Villedieu
@INPROCEEDINGS{comcom20,
author = {Thomas Fenz and Klaus-Tycho Foerster and Stefan Schmid and Anais Villedieu},
title = {Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks},
booktitle = {Journal Elsevier Computer Communications (COMCOM)},
year = {2020},
}
Implications of Routing Coherence and Consistency on Network Optimization
Balazs Nemeth, Yvonne-Anne Pignolet, Matthias Rost, Stefan Schmid, Balazs Vass
@INPROCEEDINGS{ifip20vnep,
author = {Balazs Nemeth and Yvonne-Anne Pignolet
and Matthias Rost and Stefan Schmid and Balazs Vass},
title = {Implications of Routing Coherence and Consistency on Network Optimization},
booktitle = {Proc. IFIP Networking},
year = {2020},
}
Implications of Routing Coherence and Consistency on Network Optimization
Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
@INPROCEEDINGS{ifip20coherence,
author = {Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Implications of Routing Coherence and Consistency on Network Optimization},
booktitle = {Proc. IFIP Networking},
year = {2020},
}
Improved Fast Rerouting Using Postprocessing
Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
IEEE Transactions on Dependable and Secure Computing (TDSC), 2020
@INPROCEEDINGS{tdsc20,
author = {Klaus-Tycho Foerster and Andrzej Kamisinski and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Improved Fast Rerouting Using Postprocessing},
booktitle = {IEEE Transactions on Dependable and Secure Computing (TDSC)},
year = {2020},
}
Incentivizing Stable Path Selection in Future Internet Architectures
Simon Scherrer, Markus Legner, Adrian Perrig, Stefan Schmid
@INPROCEEDINGS{peva20,
author = {Simon Scherrer and Markus Legner and Adrian Perrig and Stefan Schmid},
title = {Incentivizing Stable Path Selection in Future Internet Architectures},
booktitle = {Performance Evaluation (PEVA), Elsevier},
year = {2020},
}
Incentivizing Stable Path Selection in Future Internet Architectures
Simon Scherrer, Markus Legner, Adrian Perrig, Stefan Schmid
Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2020
@INPROCEEDINGS{perf20stablepath,
author = {Simon Scherrer and Markus Legner and Adrian Perrig and Stefan Schmid},
title = {Incentivizing Stable Path Selection in Future Internet Architectures},
booktitle = {Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2020},
}
Inter-Datacenter Bulk Transfers: Trends and Challenges
Long Luo, Hongfang Yu, Klaus-Tycho Foerster, Max Noormohammadpour, Stefan Schmid
@INPROCEEDINGS{netmag20,
author = {Long Luo and Hongfang Yu and Klaus-Tycho Foerster and
Max Noormohammadpour and Stefan Schmid},
title = {Inter-Datacenter Bulk Transfers: Trends and Challenges},
booktitle = {IEEE Network Magazine},
year = {2020},
}
Latte: Improving the Latency of Transiently Consistent Network Update Schedules
Mark Glavind, Niels Christensen, Jiri Srba, Stefan Schmid
Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2020
@INPROCEEDINGS{perf20latte,
author = {Mark Glavind and Niels Christensen and Jiri Srba and Stefan Schmid},
title = {Latte: Improving the Latency of Transiently Consistent Network Update Schedules},
booktitle = {Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2020},
}
Load-Optimization in Reconfigurable Networks:
Algorithms and Complexity of Flow Routing
Wenkai Dai, Klaus-Tycho Foerster, David Fuchssteiner, Stefan Schmid
Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2020
@INPROCEEDINGS{perf20loaddan,
author = {Wenkai Dai and Klaus-Tycho Foerster and David Fuchssteiner and Stefan Schmid},
title = {Load-Optimization in Reconfigurable Networks:
Algorithms and Complexity of Flow Routing},
booktitle = {Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2020},
}
Local Fast Rerouting with Low Congestion: A Randomized Approach
Gregor Bankhamer, Robert Elsaesser, Stefan Schmid
Proc. 27th IEEE International Conference on Network Protocols (ICNP), 2020
@INPROCEEDINGS{icnp19,
author = {Gregor Bankhamer and Robert Elsaesser and Stefan Schmid},
title = {Local Fast Rerouting with Low Congestion: A Randomized Approach},
booktitle = {Proc. 27th IEEE International Conference on Network Protocols (ICNP)},
year = {2020},
}
Maximally Resilient Replacement Paths for a Family of Product Graphs
Mahmoud Parham, Klaus-Tycho Foerster, Petar Kosic, Stefan Schmid
@INPROCEEDINGS{opodis20,
author = {Mahmoud Parham and Klaus-Tycho Foerster and Petar Kosic and Stefan Schmid},
title = {Maximally Resilient Replacement Paths for a Family of Product Graphs},
booktitle = {Proc. OPODIS},
year = {2020},
}
On Search Friction of Route Discovery in Offchain Networks
Saar Tochner, Stefan Schmid
Proc. IEEE International Conference on Blockchain (Blockchain), 2020
@INPROCEEDINGS{blockchain20,
author = {Saar Tochner and Stefan Schmid},
title = {On Search Friction of Route Discovery in Offchain Networks},
booktitle = {Proc. IEEE International Conference on Blockchain (Blockchain)},
year = {2020},
}
On the Complexity of Traffic Traces and Implications
Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS), 2020
@INPROCEEDINGS{pomacs20complexity,
author = {Chen Avin and Manya Ghobadi and Chen Griner and Stefan Schmid},
title = {On the Complexity of Traffic Traces and Implications},
booktitle = {Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS)},
year = {2020},
}
On the Complexity of Traffic Traces and Implications
Chen Avin, Manya Ghobadi, Chen Griner, Stefan Schmid
@INPROCEEDINGS{sigmetrics20complexity,
author = {Chen Avin and Manya Ghobadi and Chen Griner and Stefan Schmid},
title = {On the Complexity of Traffic Traces and Implications},
booktitle = {Proc. ACM SIGMETRICS},
year = {2020},
}
On the Hardness and Inapproximability of Virtual Network Embeddings
@INPROCEEDINGS{ton20hard,
author = {Matthias Rost and Stefan Schmid},
title = {On the Hardness and Inapproximability of Virtual Network Embeddings},
booktitle = {IEEE/ACM Transactions on Networking (TON)},
year = {2020},
}
Online Dynamic B-Matching with Applications to
Reconfigurable Datacenter Networks
Marcin Bienkowski, David Fuchssteiner, Jan Marcinkowski, Stefan Schmid
Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE), 2020
@INPROCEEDINGS{perf20bmatch,
author = {Marcin Bienkowski and David Fuchssteiner
and Jan Marcinkowski and Stefan Schmid},
title = {Online Dynamic B-Matching with Applications to
Reconfigurable Datacenter Networks},
booktitle = {Proc. 38th International Symposium on Computer Performance, Modeling, Measurements and Evaluation (PERFORMANCE)},
year = {2020},
}
P4CONSIST: Towards Consistent P4 SDNs
Apoorv Shukla, Seifeddine Fathalli, Thomas Zinner, Artur Hecker, Stefan Schmid
IEEE Journal on Selected Areas in Communications (JSAC), 2020
@INPROCEEDINGS{jsac20p4,
author = {Apoorv Shukla and Seifeddine Fathalli and Thomas Zinner and Artur Hecker and Stefan Schmid},
title = {P4CONSIST: Towards Consistent P4 SDNs},
booktitle = {IEEE Journal on Selected Areas in Communications (JSAC)},
year = {2020},
}
Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs
Chen Griner, Johannes Zerwas, Andreas Blenk, Manya Ghobadi, Stefan Schmid, Chen Avin
ArXiv Technical Report, 2020
BibTeX
@INPROCEEDINGS{cerberus-analysis,
author = {Chen Griner and Johannes Zerwas and Andreas Blenk and Manya Ghobadi and Stefan Schmid and Chen Avin},
title = {Performance Analysis of Demand-Oblivious and Demand-Aware Optical Datacenter Network Designs},
booktitle = {ArXiv Technical Report},
year = {2020},
}
RoSCo: Robust Updates for Software-Defined Networks
James Lembke, Srivatsan Ravi, Patrick Eugster, Stefan Schmid
IEEE Journal on Selected Areas in Communications (JSAC), 2020
@INPROCEEDINGS{jsac20rosco,
author = {James Lembke and Srivatsan Ravi and Patrick Eugster and Stefan Schmid},
title = {RoSCo: Robust Updates for Software-Defined Networks},
booktitle = {IEEE Journal on Selected Areas in Communications (JSAC)},
year = {2020},
}
Route Hijacking and DoS in Off-Chain Networks
Saar Tochner, Aviv Zohar, Stefan Schmid
Proc. ACM Conference on Advances in Financial Technologies (AFT), 2020
@INPROCEEDINGS{aft20,
author = {Saar Tochner and Aviv Zohar and Stefan Schmid},
title = {Route Hijacking and DoS in Off-Chain Networks},
booktitle = {Proc. ACM Conference on Advances in Financial Technologies (AFT)},
year = {2020},
}
SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks
Long Luo, Klaus-Tycho Foerster, Stefan Schmid, Hongfang Yu
@INPROCEEDINGS{infocom20split,
author = {Long Luo and Klaus-Tycho Foerster and Stefan Schmid and Hongfang Yu},
title = {SplitCast: Optimizing Multicast Flows in Reconfigurable Datacenter Networks},
booktitle = {Proc. IEEE INFOCOM},
year = {2020},
}
Survey on Algorithms for Self-Stabilizing Overlay Networks
Michael Feldmann, Christian Scheideler, Stefan Schmid
@INPROCEEDINGS{csur20,
author = {Michael Feldmann and Christian Scheideler and Stefan Schmid},
title = {Survey on Algorithms for Self-Stabilizing Overlay Networks},
booktitle = {ACM Computing Surveys (CSUR)},
year = {2020},
}
The Value of Information in Selfish Routing
Simon Scherrer, Adrian Perrig, Stefan Schmid
Proc. 27th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2020
@INPROCEEDINGS{sirocco20,
author = {Simon Scherrer and Adrian Perrig and Stefan Schmid},
title = {The Value of Information in Selfish Routing},
booktitle = {Proc. 27th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2020},
}
Toward Active and Passive Confidentiality Attacks On Cryptocurrency Off-Chain Networks
Klaus-Tycho Foerster Stefan Schmid Utz Nisslmueller, Christian Decker
Proc. 6th International Conference on Information Systems Security and Privacy (ICISSP), 2020
@INPROCEEDINGS{icissp20,
author = {Utz Nisslmueller, Klaus-Tycho Foerster, Stefan Schmid, and Christian Decker},
title = {Toward Active and Passive Confidentiality Attacks On Cryptocurrency Off-Chain Networks},
booktitle = {Proc. 6th International Conference on Information Systems Security and Privacy (ICISSP)},
year = {2020},
}
Towards Consistent SDNs: A Case for Network State Fuzzing
Apoorv Shukla, Said Jawad Saidi, Stefan Schmid, Marco Canini, Thomas Zinner, Anja Feldmann
IEEE Transactions on Network and Service Management (TNSM), 2020
@INPROCEEDINGS{tnsm20fuzz,
author = {Apoorv Shukla and Said Jawad Saidi and Stefan Schmid
and Marco Canini and Thomas Zinner and Anja Feldmann},
title = {Towards Consistent SDNs: A Case for Network State Fuzzing},
booktitle = {IEEE Transactions on Network and Service Management (TNSM)},
year = {2020},
}
Walking Through Waypoints
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
@INPROCEEDINGS{algo20,
author = {Saeed Akhoondian Amiri and Klaus-Tycho Foerster and Stefan Schmid},
title = {Walking Through Waypoints},
booktitle = {Algorithmica (ALGO)},
year = {2020},
}
Working Set Theorems for Routing in Self-Adjusting Skip List Networks
@INPROCEEDINGS{infocom20ws,
author = {Chen Avin and Iosif Salem and Stefan Schmid},
title = {Working Set Theorems for Routing in Self-Adjusting Skip List Networks},
booktitle = {Proc. IEEE INFOCOM},
year = {2020},
}
2019
A Constant Approximation for Maximum Throughput Multicommodity Routing
Mengxue Liu, Andrea Richa, Stefan Schmid, Matthias Rost
@INPROCEEDINGS{infocom19mcf,
author = {Mengxue Liu and Andrea Richa and Stefan Schmid and Matthias Rost},
title = {A Constant Approximation for Maximum Throughput Multicommodity Routing},
booktitle = {Proc. IEE INFOCOM},
year = {2019},
}
Adaptable and Data-Driven Softwarized
Networks: Review, Opportunities, and Challenges
Wolfgang Kellerer, Patrick Kalmbach, Andreas Blenk, Arsany Basta, Martin Reisslein, Stefan Schmid
@INPROCEEDINGS{pieee19,
author = {Wolfgang Kellerer and Patrick Kalmbach
and Andreas Blenk and Arsany Basta and
Martin Reisslein and Stefan Schmid},
title = {Adaptable and Data-Driven Softwarized
Networks: Review, Opportunities, and Challenges},
booktitle = {Proceedings of the IEEE (PIEEE)},
year = {2019},
}
Bonsai: Efficient Fast Failover Routing Using Small Arborescences
Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. 49th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2019
@INPROCEEDINGS{dsn19,
author = {Klaus-Tycho Foerster and Andrzej Kamisinski and
Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Bonsai: Efficient Fast Failover Routing Using Small Arborescences},
booktitle = {Proc. 49th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2019},
}
Breeding Unicorns: Developing Trustworthy and Scalable Randomness Beacons
Samvid Dharanikota, Rene Rydhof Hansen, Michael Jensen, Sebastian Ro Kristensen, Matthias Sass Michno, Yvonne-Anne Pignolet, Stefan Schmi
Proc. IEEE International Conference on Blockchain (Blockchain), 2019
@INPROCEEDINGS{blockchain19,
author = {Samvid Dharanikota and Rene Rydhof Hansen and Michael Jensen and Sebastian Ro Kristensen
and Matthias Sass Michno and Yvonne-Anne Pignolet and Stefan Schmi},
title = {Breeding Unicorns: Developing Trustworthy and Scalable Randomness Beacons},
booktitle = {Proc. IEEE International Conference on Blockchain (Blockchain)},
year = {2019},
}
Brief Announcement: Does Preprocessing Help under Congestion?
Klaus-Tycho Foerster, Janne Korhonen, Joel Rybicki, Stefan Schmid
Proc. ACM Symposium on Principles of Distributed Computing (PODC), 2019
@INPROCEEDINGS{podc19ba,
author = {Klaus-Tycho Foerster and Janne Korhonen and Joel Rybicki and Stefan Schmid},
title = {Brief Announcement: Does Preprocessing Help under Congestion?},
booktitle = {Proc. ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2019},
}
Brief Announcement: On Self-Adjusting Skip List Networks
Chen Avin, Iosif Salem, Stefan Schmid
Proc. 33rd International Symposium on Distributed Computing (DISC), 2019
@INPROCEEDINGS{disc19ba,
author = {Chen Avin and Iosif Salem and Stefan Schmid},
title = {Brief Announcement: On Self-Adjusting Skip List Networks},
booktitle = {Proc. 33rd International Symposium on Distributed Computing (DISC)},
year = {2019},
}
CASA: Congestion and Stretch Aware Static Fast Rerouting
Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
@INPROCEEDINGS{infocom19casa,
author = {Klaus-Tycho Foerster and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {CASA: Congestion and Stretch Aware Static Fast Rerouting},
booktitle = {Proc. IEE INFOCOM},
year = {2019},
}
Compact Oblivious Routing
Harald Raecke, Stefan Schmid
Proc. European Symposium on Algorithms (ESA), 2019
@INPROCEEDINGS{esa19,
author = {Harald Raecke and Stefan Schmid},
title = {Compact Oblivious Routing},
booktitle = {Proc. European Symposium on Algorithms (ESA)},
year = {2019},
}
Congestion-Free Rerouting of Multiple Flows in Timed SDNs
Jiaqi Zheng, Bo Li, Klaus-Tycho Foerster, Stefan Schmid, Guihai Chen, Jie Wu, Rui Li
IEEE Journal on Selected Areas in Communications (JSAC), 2019
@INPROCEEDINGS{jsac19sdn,
author = {Jiaqi Zheng and Bo Li and Klaus-Tycho Foerster and Stefan Schmid
and Guihai Chen and Jie Wu and Rui Li},
title = {Congestion-Free Rerouting of Multiple Flows in Timed SDNs},
booktitle = {IEEE Journal on Selected Areas in Communications (JSAC)},
year = {2019},
}
DeepMPLS: Fast Analysis of MPLS Configurations Using Deep Learning
@INPROCEEDINGS{ifip19mpls,
author = {Fabien Geyer and Stefan Schmid},
title = {DeepMPLS: Fast Analysis of MPLS Configurations Using Deep Learning},
booktitle = {Proc. IFIP Networking},
year = {2019},
}
Demand-Aware Network Design with Minimal Congestion and Route Lengths
@INPROCEEDINGS{infocom19dan,
author = {Chen Avin and Kaushik Mondal and Stefan Schmid},
title = {Demand-Aware Network Design with Minimal Congestion and Route Lengths},
booktitle = {Proc. IEE INFOCOM},
year = {2019},
}
Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees
Klaus-Tycho Foerster, Stefan Schmid
Proc. IEEE International Symposium on Network Computing and Applications (NCA), 2019
@INPROCEEDINGS{nca19up,
author = {Klaus-Tycho Foerster and Stefan Schmid},
title = {Distributed Consistent Network Updates in SDNs: Local Verification for Global Guarantees},
booktitle = {Proc. IEEE International Symposium on Network Computing and Applications (NCA)},
year = {2019},
}
Distributed Dominating Set Approximations beyond Planar Graphs
@INPROCEEDINGS{talg19,
author = {Saeed Amiri and Stefan Schmid and Sebastian Siebertz},
title = {Distributed Dominating Set Approximations beyond Planar Graphs},
booktitle = {ACM Transactions on Algorithms (TALG)},
year = {2019},
}
Distributed Self-Adjusting Tree Networks
Bruna Peres, Otavio Souza, Olga Goussevskaia, Stefan Schmid, Chen Avin
@INPROCEEDINGS{infocom19splay,
author = {Bruna Peres and Otavio Souza and Olga Goussevskaia and Stefan Schmid and Chen Avin},
title = {Distributed Self-Adjusting Tree Networks},
booktitle = {Proc. IEE INFOCOM},
year = {2019},
}
Dynamic Balanced Graph Partitioning
Chen Avin, Marcin Bienkowski, Andreas Loukas, Maciej Pacut, Stefan Schmid
@INPROCEEDINGS{sidma19,
author = {Chen Avin
and Marcin Bienkowski and Andreas Loukas and Maciej Pacut and Stefan Schmid},
title = {Dynamic Balanced Graph Partitioning},
booktitle = {SIAM J. Discrete Math (SIDMA)},
year = {2019},
}
Efficient Distributed Workload (Re-)Embedding
Monika Henzinger, Stefan Neumann, Stefan Schmid
Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS), Vol. 3, No. 1, Article 13, 2019
@INPROCEEDINGS{pomacs19re,
author = {Monika Henzinger and Stefan Neumann and Stefan Schmid},
title = {Efficient Distributed Workload (Re-)Embedding},
booktitle = {Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS), Vol. 3, No. 1, Article 13},
year = {2019},
}
@INPROCEEDINGS{sigmetrics19learn,
author = {Monika Henzinger and Stefan Neumann and Stefan Schmid},
title = {Efficient Distributed Workload (Re-)Embedding},
booktitle = {Proc. ACM SIGMETRICS / IFIP PERFORMANCE},
year = {2019},
}
Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks
Thomas Fenz, Klaus-Tycho Foerster, Stefan Schmid, Anais Villedieu
@INPROCEEDINGS{ifip19dan,
author = {Thomas Fenz and Klaus-Tycho Foerster and Stefan Schmid and Anais Villedieu},
title = {Efficient Non-Segregated Routing for Reconfigurable Demand-Aware Networks},
booktitle = {Proc. IFIP Networking},
year = {2019},
}
Empirical Predictability Study of SDN Switches
Amaury Van Bemten, Nemanja Deric, Amir Varasteh, Andreas Blenk, Stefan Schmid, Wolfgang Kellerer
Proc. ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2019
@INPROCEEDINGS{ancs19,
author = {Amaury Van Bemten and Nemanja Deric and Amir Varasteh
and Andreas Blenk and Stefan Schmid and Wolfgang Kellerer},
title = {Empirical Predictability Study of SDN Switches},
booktitle = {Proc. ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},
year = {2019},
}
Improved Fast Rerouting Using Postprocessing
Klaus-Tycho Foerster, Andrzej Kamisinski, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. 38th International Symposium on Reliable Distributed Systems (SRDS), 2019
@INPROCEEDINGS{srds19failover,
author = {Klaus-Tycho Foerster and Andrzej Kamisinski and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Improved Fast Rerouting Using Postprocessing},
booktitle = {Proc. 38th International Symposium on Reliable Distributed Systems (SRDS)},
year = {2019},
}
ISMAEL: Using Machine Learning To Predict Acceptance of Virtual Clusters in Data Centers
Johannes Zerwas, Patrick Kalmbach, Stefan Schmid, Andreas Blenk
IEEE Transactions on Network and Service Management (Special Issue), 2019
@INPROCEEDINGS{tnsm19ismael,
author = {Johannes Zerwas and Patrick Kalmbach and Stefan Schmid and Andreas Blenk},
title = {ISMAEL: Using Machine Learning To Predict Acceptance of Virtual Clusters in Data Centers},
booktitle = {IEEE Transactions on Network and Service Management (Special Issue)},
year = {2019},
}
Loko: Predictable Latency in Small Networks
Amaury Van Bemten, Nemanja Deric, Johannes Zerwas, Andreas Blenk, Stefan Schmid, Wolfgang Kellerer
Proc. ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2019
@INPROCEEDINGS{conext19loko,
author = {Amaury Van Bemten and Nemanja Deric and Johannes Zerwas and Andreas Blenk and Stefan Schmid and Wolfgang Kellerer},
title = {Loko: Predictable Latency in Small Networks},
booktitle = {Proc. ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
year = {2019},
}
mSwitch: Bringing Multi-Tenancy to Virtual Switches
Kashyap Thimmaraju, Saad Hermak, Gabor Retvari, Stefan Schmid
Proc. USENIX Annual Technical Conference (ATC), 2019
BibTeX
@INPROCEEDINGS{atc19,
author = {Kashyap Thimmaraju and Saad Hermak and Gabor Retvari and Stefan Schmid},
title = {mSwitch: Bringing Multi-Tenancy to Virtual Switches},
booktitle = {Proc. USENIX Annual Technical Conference (ATC)},
year = {2019},
}
Nap: Network-Aware Data Partitions for Efficient Distributed Processing
Or Raz, Chen Avin, Stefan Schmid
Proc. IEEE International Symposium on Network Computing and Applications (NCA), 2019
@INPROCEEDINGS{nca19nap,
author = {Or Raz and Chen Avin and Stefan Schmid},
title = {Nap: Network-Aware Data Partitions for Efficient Distributed Processing},
booktitle = {Proc. IEEE International Symposium on Network Computing and Applications (NCA)},
year = {2019},
}
NetBOA: Self-Driving Network Benchmarking
Johannes Zerwas, Patrick Kalmbach, Laurenz Henkel, Gabor Retvari, Wolfgang Kellerer, Andreas Blenk, Stefan Schmid
Proc. ACM SIGCOMM Workshop on Network Meets AI and ML (NetAI), 2019
@INPROCEEDINGS{netai19a,
author = {Johannes Zerwas and Patrick Kalmbach and Laurenz Henkel and Gabor Retvari and
Wolfgang Kellerer and Andreas Blenk and Stefan Schmid},
title = {NetBOA: Self-Driving Network Benchmarking},
booktitle = {Proc. ACM SIGCOMM Workshop on Network Meets AI and ML (NetAI)},
year = {2019},
}
On Polynomial-Time Congestion-Free Software-Defined Network Updates
Saeed Amiri, Szymon Dudycz, Mahmoud Parham, Stefan Schmid, Sebastian Wiederrech
@INPROCEEDINGS{ifip19sdnup,
author = {Saeed Amiri and Szymon Dudycz
and Mahmoud Parham and Stefan Schmid and Sebastian Wiederrech},
title = {On Polynomial-Time Congestion-Free Software-Defined Network Updates},
booktitle = {Proc. IFIP Networking},
year = {2019},
}
On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures
Klaus-Tycho Foerster, Maciej Pacut, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2019
@INPROCEEDINGS{ccr19danr,
author = {Klaus-Tycho Foerster and Maciej Pacut and Stefan Schmid},
title = {On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures},
booktitle = {ACM SIGCOMM Computer Communication Review (CCR)},
year = {2019},
}
On The Impact of the Network Hypervisor on Virtual Network Performance
Andreas Blenk, Arsany Basta, Wolfgang Kellerer, Stefan Schmid
@INPROCEEDINGS{ifip19hypervisor,
author = {Andreas Blenk and Arsany Basta and
Wolfgang Kellerer and Stefan Schmid},
title = {On The Impact of the Network Hypervisor on Virtual Network Performance},
booktitle = {Proc. IFIP Networking},
year = {2019},
}
On the Power of Preprocessing in Decentralized Network Optimization
Klaus-Tycho Foerster, Juho Hirvonen, Stefan Schmid, Jukka Suomela
@INPROCEEDINGS{infocom19preprocess,
author = {Klaus-Tycho Foerster and Juho Hirvonen and Stefan Schmid and Jukka Suomela},
title = {On the Power of Preprocessing in Decentralized Network Optimization},
booktitle = {Proc. IEE INFOCOM},
year = {2019},
}
Preacher: Network Policy Checker for Adversarial Environments
Kashyap Thimmaraju, Liron Schiff, Stefan Schmid
Proc. 38th International Symposium on Reliable Distributed Systems (SRDS), 2019
@INPROCEEDINGS{srds19sats,
author = {Kashyap Thimmaraju and Liron Schiff and Stefan Schmid},
title = {Preacher: Network Policy Checker for Adversarial Environments},
booktitle = {Proc. 38th International Symposium on Reliable Distributed Systems (SRDS)},
year = {2019},
}
PURR: A Primitive for Reconfigurable Fast Reroute
Marco Chiesa, Roshan Sedar, Gianni Antichi, Michael Borokhovich, Andrzej Kamisinski, Georgios Nikolaidis, Stefan Schmid
Proc. ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2019
@INPROCEEDINGS{conext19failover,
author = {Marco Chiesa and Roshan Sedar and Gianni Antichi and Michael Borokhovich and Andrzej Kamisinski and Georgios Nikolaidis and Stefan Schmid},
title = {PURR: A Primitive for Reconfigurable Fast Reroute},
booktitle = {Proc. ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
year = {2019},
}
@INPROCEEDINGS{netai19b,
author = {Apoorv Shukla and Kevin Nico Hudemann and Artur Hecker and Stefan Schmid},
title = {Runtime Verification of P4 Switches with Reinforcement Learning},
booktitle = {Proc. ACM SIGCOMM Workshop on Network Meets AI and ML (NetAI)},
year = {2019},
}
Scalability Issues and Solutions for Software Defined Networks (Editorial)
Oliver Hohlfeld, James Kempf, Martin Reisslein, Stefan Schmid, Nadir Shah
IEEE JSAC Special Issue on Scalability Issues and Solutions for Software Defined Networks (JSAC), 2019
BibTeX
@INPROCEEDINGS{jsac19editorial,
author = {Oliver Hohlfeld and James Kempf and Martin Reisslein
and Stefan Schmid and Nadir Shah},
title = {Scalability Issues and Solutions for Software Defined Networks (Editorial)},
booktitle = {IEEE JSAC Special Issue on Scalability Issues and Solutions for Software Defined Networks (JSAC)},
year = {2019},
}
Self-Adjusting Line Networks
Ingo van Duijn, Stefan Schmid, Chen Avin
26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019
@INPROCEEDINGS{sirocco19,
author = {Ingo van Duijn and Stefan Schmid and Chen Avin},
title = {Self-Adjusting Line Networks},
booktitle = {26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2019},
}
Self-Adjusting Linear Networks
Chen Avin, Ingo van Duijn, Stefan Schmid
Proc. 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS), 2019
@INPROCEEDINGS{sss19,
author = {Chen Avin and Ingo van Duijn and Stefan Schmid},
title = {Self-Adjusting Linear Networks},
booktitle = {Proc. 21st International Symposium on Stabilization, Safety,
and Security of Distributed Systems (SSS)},
year = {2019},
}
Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity
@INPROCEEDINGS{sigact19,
author = {Klaus-Tycho Foerster and Stefan Schmid},
title = {Survey of Reconfigurable Data Center Networks: Enablers, Algorithms, Complexity},
booktitle = {SIGACT News},
year = {2019},
}
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game
Laura Schmid, Krishnendu Chatterjee, Stefan Schmid
Proc. 22nd International Conference on Principles of Distributed Systems (OPODIS), 2019
@INPROCEEDINGS{opodis19,
author = {Laura Schmid and Krishnendu Chatterjee and Stefan Schmid},
title = {The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game},
booktitle = {Proc. 22nd International Conference on Principles of Distributed Systems (OPODIS)},
year = {2019},
}
Toward Consistent State Management of Adaptive Programmable Networks Based on P4
Mu He, Andreas Blenk, Stefan Schmid, Wolfgang Kellerer
Proc.ACM SIGCOMM Workshop on Networking for Emerging Applications and Technologies (NEAT), 2019
@INPROCEEDINGS{neat19,
author = {Mu He and Andreas Blenk and Stefan Schmid and Wolfgang Kellerer},
title = {Toward Consistent State Management of Adaptive Programmable Networks Based on P4},
booktitle = {Proc.ACM SIGCOMM Workshop on Networking for Emerging Applications and Technologies (NEAT)},
year = {2019},
}
Tuple Space Explosion: A Denial-of-Service Attack Against a Software Packet Classifier
Levente Csikor, Dinil Mon Divakaran, Min Suk Kang, Attila Korosi, Balazs Sonkoly, David Haja, Dimitrios Pezaros, Stefan Schmid, Gabor Retvari
Proc. ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2019
@INPROCEEDINGS{conext19tuple,
author = {Levente Csikor and Dinil Mon Divakaran and Min Suk Kang and Attila Korosi and Balazs Sonkoly and David Haja and Dimitrios Pezaros and Stefan Schmid and Gabor Retvari},
title = {Tuple Space Explosion: A Denial-of-Service Attack Against a Software Packet Classifier},
booktitle = {Proc. ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
year = {2019},
}
@INPROCEEDINGS{ifip18ahab,
author = {Johannes Zerwas and Patrick Kalmbach and Carlo Fuerst
and Arne Ludwig and Andreas Blenk and Wolfgang Kellerer and Stefan Schmid},
title = {Ahab: Data-Driven Virtual Cluster Hunting},
booktitle = {Proc. IFIP Networking},
year = {2018},
}
Approximate and Incremental Network Function Placement
Tamas Lukovszki, Matthias Rost, Stefan Schmid
Journal of Parallel and Distributed Computing (JPDC), 2018
@INPROCEEDINGS{jpdc18,
author = {Tamas Lukovszki and Matthias Rost and Stefan Schmid},
title = {Approximate and Incremental Network Function Placement},
booktitle = {Journal of Parallel and Distributed Computing (JPDC)},
year = {2018},
}
Characterizing the Algorithmic Complexity of
Reconfigurable Data Center Architectures
Klaus-Tycho Foerster, Monia Ghobadi, Stefan Schmid
Proc. ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2018
@INPROCEEDINGS{ancs18,
author = {Klaus-Tycho Foerster and Monia Ghobadi and Stefan Schmid},
title = {Characterizing the Algorithmic Complexity of
Reconfigurable Data Center Architectures},
booktitle = {Proc. ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)},
year = {2018},
}
Charting the Algorithmic Complexity of Waypoint Routing
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Riko Jacob, Stefan Schmid
Proc. ACM SIGCOMM Computer Communication Review (CCR), 2018
@INPROCEEDINGS{ccr18waypoint,
author = {Saeed Akhoondian Amiri and Klaus-Tycho Foerster and Riko Jacob and Stefan Schmid},
title = {Charting the Algorithmic Complexity of Waypoint Routing},
booktitle = {Proc. ACM SIGCOMM Computer Communication Review (CCR)},
year = {2018},
}
Charting the Complexity Landscape of Virtual Network Embeddings
@INPROCEEDINGS{ifip18landscape,
author = {Matthias Rost and Stefan Schmid},
title = {Charting the Complexity Landscape of Virtual Network Embeddings},
booktitle = {Proc. IFIP Networking},
year = {2018},
}
Competitive Clustering of Stochastic Communication Patterns on a Ring
Chen Avin, Louis Cohen, Mahmoud Parham, Stefan Schmid
@INPROCEEDINGS{computing18,
author = {Chen Avin and Louis Cohen and Mahmoud Parham and Stefan Schmid},
title = {Competitive Clustering of Stochastic Communication Patterns on a Ring},
booktitle = {Journal of Computing},
year = {2018},
}
Congestion-Free Rerouting of Flows on DAGs
Saeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht
Proc. 45th International Colloquium on Automata, Languages, and Programming (ICALP), 2018
@INPROCEEDINGS{icalp18,
author = {Saeed Akhoondian Amiri and Szymon Dudycz and Stefan Schmid and Sebastian Wiederrecht},
title = {Congestion-Free Rerouting of Flows on DAGs},
booktitle = {Proc. 45th International Colloquium on Automata, Languages, and Programming (ICALP)},
year = {2018},
}
Efficient Loop-Free Rerouting of Multiple SDN Flows
Arsany Basta, Andreas Blenk, Szymon Dudycz, Arne Ludwig, Stefan Schmid
Proc. IEEE/ACM Transactions on Networking (ToN), 2018
@INPROCEEDINGS{ton18touch,
author = {Arsany Basta and Andreas Blenk and Szymon Dudycz and Arne Ludwig and Stefan Schmid},
title = {Efficient Loop-Free Rerouting of Multiple SDN Flows},
booktitle = {Proc. IEEE/ACM Transactions on Networking (ToN)},
year = {2018},
}
Empowering Self-Driving Networks
Patrick Kalmbach, Johannes Zerwas, Peter Babarczi, Andreas Blenk, Wolfgang Kellerer, Stefan Schmid
Proc. ACM SIGCOMM 2018 Workshop on Self-Driving Networks (SDN), 2018
@INPROCEEDINGS{sdn18,
author = {Patrick Kalmbach and Johannes Zerwas and Peter Babarczi and
Andreas Blenk and Wolfgang Kellerer and Stefan Schmid},
title = {Empowering Self-Driving Networks},
booktitle = {Proc. ACM SIGCOMM 2018 Workshop on Self-Driving Networks (SDN)},
year = {2018},
}
Fast and Efficient Network Service Embedding Method with Adaptive Offloading to the Edge
Balazs Nemeth, Mark Szalay, Janos Doka, Matthias Rost, Stefan Schmid, Laszlo Toka, Balazs Sonkoly
Proc. INFOCOM Workshop on Integrating Edge Computing, Caching, and Offloading in Next Generation Networks, 2018
@INPROCEEDINGS{iecco18,
author = {Balazs Nemeth and Mark Szalay and Janos Doka and Matthias Rost and Stefan Schmid and Laszlo Toka and Balazs Sonkoly},
title = {Fast and Efficient Network Service Embedding Method with Adaptive Offloading to the Edge},
booktitle = {Proc. INFOCOM Workshop on Integrating Edge Computing, Caching, and Offloading in Next Generation Networks},
year = {2018},
}
I DPID It My Way! A Covert Timing Channel in Software-Defined Networks
Robert Kroesche, Kashyap Thimmaraju, Liron Schiff, Stefan Schmid
@INPROCEEDINGS{ifip18covert,
author = {Robert Kroesche and Kashyap Thimmaraju and Liron Schiff and Stefan Schmid},
title = {I DPID It My Way! A Covert Timing Channel in Software-Defined Networks},
booktitle = {Proc. IFIP Networking},
year = {2018},
}
Kraken: Online and Elastic Resource Reservations for Cloud Datacenters
Carlo Fuerst, Stefan Schmid, Lalith Suresh, Paolo Costa
Proc. IEEE/ACM Transactions on Networking (ToN), 2018
@INPROCEEDINGS{ton18kraken,
author = {Carlo Fuerst and Stefan Schmid and Lalith Suresh and Paolo Costa},
title = {Kraken: Online and Elastic Resource Reservations for Cloud Datacenters},
booktitle = {Proc. IEEE/ACM Transactions on Networking (ToN)},
year = {2018},
}
Load-Optimal Local Fast Rerouting for Dense Networks
Michael Borokhovich, Yvonne-Anne Pignolet, Gilles Tredan, Stefan Schmid
Proc. IEEE/ACM Transactions on Networking (ToN), 2018
@INPROCEEDINGS{ton18failover,
author = {Michael Borokhovich and Yvonne-Anne Pignolet and Gilles Tredan and Stefan Schmid},
title = {Load-Optimal Local Fast Rerouting for Dense Networks},
booktitle = {Proc. IEEE/ACM Transactions on Networking (ToN)},
year = {2018},
}
Local Fast Failover Routing With Low Stretch
Klaus-Tycho Foerster, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. ACM SIGCOMM Computer Communication Review (CCR), 2018
@INPROCEEDINGS{ccr18failover,
author = {Klaus-Tycho Foerster and Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Local Fast Failover Routing With Low Stretch},
booktitle = {Proc. ACM SIGCOMM Computer Communication Review (CCR)},
year = {2018},
}
Local Fast Segment Rerouting on Hypercubes
Klaus-Tycho Foerster, Mahmoud Parham, Stefan Schmid, Tao Wen
22nd International Conference on Principles of Distributed Systems (OPODIS), 2018
@INPROCEEDINGS{opodis18,
author = {Klaus-Tycho Foerster and Mahmoud Parham and Stefan Schmid and Tao Wen},
title = {Local Fast Segment Rerouting on Hypercubes},
booktitle = {22nd International Conference on Principles of Distributed Systems (OPODIS)},
year = {2018},
}
Loop-Free Route Updates for Software-Defined Networks
Klaus-Tycho Foerster, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Proc. IEEE/ACM Transactions on Networking (ToN), 2018
@INPROCEEDINGS{ton18up,
author = {Klaus-Tycho Foerster and Arne Ludwig and Jan Marcinkowski and Stefan Schmid},
title = {Loop-Free Route Updates for Software-Defined Networks},
booktitle = {Proc. IEEE/ACM Transactions on Networking (ToN)},
year = {2018},
}
Modeling IP-to-IP Communication using the Weighted Stochastic Block Model
Patrick Kalmbach, Lion Gleiter, Johannes Zerwas, Andreas Blenk, Wolfgang Kellerer, Stefan Schmid
@INPROCEEDINGS{sigcomm18sbm,
author = {Patrick Kalmbach and Lion Gleiter
and Johannes Zerwas and Andreas Blenk and Wolfgang Kellerer and Stefan Schmid},
title = {Modeling IP-to-IP Communication using the Weighted Stochastic Block Model},
booktitle = {ACM SIGCOMM 2018 Poster Paper},
year = {2018},
}
NetSlicer: Automated and Traffic-Pattern Based Application
Clustering in Datacenters
Liron Schiff, Ofri Ziv, Manfred Jaeger, Stefan Schmid
Proc. ACM SIGCOMM 2018 Workshop on Big Data Analytics and Machine Learning for Data Communication Networks (Big-DAMA), 2018
@INPROCEEDINGS{bigdama18,
author = {Liron Schiff and Ofri Ziv and Manfred Jaeger and Stefan Schmid},
title = {NetSlicer: Automated and Traffic-Pattern Based Application
Clustering in Datacenters},
booktitle = {Proc. ACM SIGCOMM 2018 Workshop on Big Data Analytics and Machine Learning for Data Communication Networks (Big-DAMA)},
year = {2018},
}
NeuroViNE: A Neural Preprocessor for Your Virtual Network Embedding Algorithm
Andreas Blenk, Patrick Kalmbach, Johannes Zerwas, Michael Jarschel, Stefan Schmid, Wolfgang Kellerer
@INPROCEEDINGS{infocom18neuro,
author = { Andreas Blenk and Patrick Kalmbach and Johannes Zerwas and Michael Jarschel
and Stefan Schmid and Wolfgang Kellerer},
title = {NeuroViNE: A Neural Preprocessor for Your Virtual Network Embedding Algorithm},
booktitle = {Proc. IEE INFOCOM},
year = {2018},
}
Online Aggregation of the Forwarding Information Base: Accounting
for Locality and Churn
Marcin Bienkowski, Nadi Sarrar, Stefan Schmid, Steve Uhlig
Proc. IEEE/ACM Transactions on Networking (ToN), 2018
@INPROCEEDINGS{ton18fib,
author = {Marcin Bienkowski and Nadi Sarrar and Stefan Schmid and Steve Uhlig},
title = {Online Aggregation of the Forwarding Information Base: Accounting
for Locality and Churn},
booktitle = {Proc. IEEE/ACM Transactions on Networking (ToN)},
year = {2018},
}
P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures
Jesper Stenbjerg Jensen, Troels Beck Krogh, Jonas Sand Madsen, Stefan Schmid, Jiri Srba, Marc Tom Thorgersen
14th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT), 2018
@INPROCEEDINGS{conext18,
author = {Jesper Stenbjerg Jensen and Troels Beck Krogh and Jonas Sand Madsen
and Stefan Schmid and Jiri Srba and Marc Tom Thorgersen},
title = {P-Rex: Fast Verification of MPLS Networks with Multiple Link Failures},
booktitle = {14th ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT)},
year = {2018},
}
Parametrized Complexity of Virtual Network Embeddings:
Dynamic & Linear Programming Approximations
Matthias Rost, Elias Doehne, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2018
@INPROCEEDINGS{ccr19tw,
author = {Matthias Rost and Elias Doehne and Stefan Schmid},
title = {Parametrized Complexity of Virtual Network Embeddings:
Dynamic \& Linear Programming Approximations},
booktitle = {ACM SIGCOMM Computer Communication Review (CCR)},
year = {2018},
}
Perfbench: A Tool for Predictability Analysis in
Multi-Tenant Software-Defined Networks
Andreas Blenk, Arsany Basta, Laurenz Henkel, Johannes Zerwas, Wolfgang Kellerer, Stefan Schmid
@INPROCEEDINGS{sigcomm18perfbench,
author = {Andreas Blenk and Arsany Basta and Laurenz Henkel and Johannes Zerwas and
Wolfgang Kellerer and Stefan Schmid},
title = {Perfbench: A Tool for Predictability Analysis in
Multi-Tenant Software-Defined Networks},
booktitle = {ACM SIGCOMM 2018 Poster Paper},
year = {2018},
}
Policy Injection: A Cloud Dataplane DoS Attack
Levente Csikor, Christian Rothenberg, Dimitrios P. Pezaros, Stefan Schmid, Laszlo Toka, Gabor Retvari
@INPROCEEDINGS{sigcomm18policy,
author = {Levente Csikor and Christian Rothenberg and Dimitrios P. Pezaros and Stefan Schmid
and Laszlo Toka and Gabor Retvari},
title = {Policy Injection: A Cloud Dataplane DoS Attack},
booktitle = {ACM SIGCOMM 2018 Demo Paper},
year = {2018},
}
Polynomial-Time What-If Analysis for Prefix-Manipulating MPLS Networks
@INPROCEEDINGS{ipl18,
author = {Chen Avin and Alexandr Hercules and Andreas Loukas and Stefan Schmid},
title = {rDAN: Toward Robust Demand-Aware Network Designs},
booktitle = {Information Processing Letters (IPL)},
year = {2018},
}
Renaissance: A Self-Stabilizing Distributed SDN Control Plane
Marco Canini, Iosif Salem, Liron Schiff, Elad Michael Schiller, Stefan Schmid
@INPROCEEDINGS{icdcs18selfstab,
author = {Marco Canini and Iosif Salem and Liron Schiff and Elad Michael Schiller and Stefan Schmid},
title = {Renaissance: A Self-Stabilizing Distributed SDN Control Plane},
booktitle = {Proc. IEEE ICDCS},
year = {2018},
}
Scheduling Congestion-Free Updates of Multiple Flows with Chronicle in Timed SDNs
Jiaqi Zheng, Bo Li, Chen Tian, Klaus-Tycho Foerster, Stefan Schmid, Guihai Chen, Jie Wu
@INPROCEEDINGS{icdcs18netup,
author = {Jiaqi Zheng and Bo Li and Chen Tian
and Klaus-Tycho Foerster and Stefan Schmid and Guihai Chen and Jie Wu},
title = {Scheduling Congestion-Free Updates of Multiple Flows with Chronicle in Timed SDNs},
booktitle = {Proc. IEEE ICDCS},
year = {2018},
}
Supporting Emerging Applications With Low-Latency Failover in
P4
Roshan Sedar, Michael Borokhovich, Marco Chiesa, Gianni Antichi, Stefan Schmid
Proc. ACM SIGCOMM 2018 Workshop on Networking for Emerging Applications and Technologies (NEAT), 2018
@INPROCEEDINGS{neat18,
author = {Roshan Sedar and Michael Borokhovich and Marco Chiesa and
Gianni Antichi and Stefan Schmid},
title = {Supporting Emerging Applications With Low-Latency Failover in
P4},
booktitle = {Proc. ACM SIGCOMM 2018 Workshop on Networking for Emerging Applications and Technologies (NEAT)},
year = {2018},
}
Survey of Consistent Software-Defined Network Updates
Klaus-Tycho Foerster, Stefan Schmid, Stefano Vissicchio
IEEE Communications Surveys and Tutorials (COMST), 2018
@INPROCEEDINGS{ieeesurvey,
author = {Klaus-Tycho Foerster and Stefan Schmid and Stefano Vissicchio},
title = {Survey of Consistent Software-Defined Network Updates},
booktitle = {IEEE Communications Surveys and Tutorials (COMST)},
year = {2018},
}
Taking Control of SDN-based Cloud Systems via the Data Plane
@INPROCEEDINGS{sosr18,
author = {Kashyap Thimmaraju and Bhargava Shastry and Tobias Fiebig and Felicitas Hetzelt and Jean-Pierre Seifert
and Anja Feldmann and Stefan Schmid},
title = {Taking Control of SDN-based Cloud Systems via the Data Plane},
booktitle = {Proc. ACM Symposium on SDN Research (SOSR)},
year = {2018},
}
The Show Must Go On: Fundamental Data Plane Connectivity Services for Dependable SDNs
Michael Borokhovich, Clement Rault, Liron Schiff, Stefan Schmid
@INPROCEEDINGS{comcom18,
author = {Michael Borokhovich and Clement Rault and Liron Schiff and Stefan Schmid},
title = {The Show Must Go On: Fundamental Data Plane Connectivity Services for Dependable SDNs},
booktitle = {Elsevier Computer Communications (COMCOM)},
year = {2018},
}
Themis: A Data-Driven Approach to Bot Detection (Short Abstract)
Patrick Kalmbach, Andreas Blenk, Wolfgang Kellerer, Stefan Schmid
Proc. IEE INFOCOM, 2018
BibTeX
@INPROCEEDINGS{infocom18ba,
author = {Patrick Kalmbach and Andreas Blenk and Wolfgang Kellerer and Stefan Schmid},
title = {Themis: A Data-Driven Approach to Bot Detection (Short Abstract)},
booktitle = {Proc. IEE INFOCOM},
year = {2018},
}
TI-MFA: Keep Calm and Reroute Segments Fast
Klaus-Tycho Foerster, Mahmoud Parham, Marco Chiesa, Stefan Schmid
@INPROCEEDINGS{gi18,
author = {Klaus-Tycho Foerster and Mahmoud Parham and Marco Chiesa and Stefan Schmid},
title = {TI-MFA: Keep Calm and Reroute Segments Fast},
booktitle = {Proc. IEEE Global Internet Symposium (GI)},
year = {2018},
}
Tomographic Node Placement Strategies and the Impact of the Routing Model
Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
@INPROCEEDINGS{sigmetrics18tomography,
author = {Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Tomographic Node Placement Strategies and the Impact of the Routing Model},
booktitle = {Proc. ACM SIGMETRICS},
year = {2018},
}
Toward Demand-Aware Networking:
A Theory for Self-Adjusting Networks
Chen Avin, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2018
@INPROCEEDINGS{ccr18san,
author = {Chen Avin and Stefan Schmid},
title = {Toward Demand-Aware Networking:
A Theory for Self-Adjusting Networks},
booktitle = {ACM SIGCOMM Computer Communication Review (CCR)},
year = {2018},
}
Transiently Policy-Compliant Network Updates
Arne Ludwig, Szymon Dudycz, Matthias Rost, Stefan Schmid
Proc. IEEE/ACM Transactions on Networking (ToN), 2018
@INPROCEEDINGS{ton18policy,
author = {Arne Ludwig and Szymon Dudycz and Matthias Rost and Stefan Schmid},
title = {Transiently Policy-Compliant Network Updates},
booktitle = {Proc. IEEE/ACM Transactions on Networking (ToN)},
year = {2018},
}
@INPROCEEDINGS{secson18,
author = {Kashyap Thimmaraju and Gabor Retvari and Stefan Schmid},
title = {Virtual Network Isolation: Are We There Yet?},
booktitle = {Proc. ACM SIGCOMM 2018 Workshop on Security in Softwarized Networks: Prospects and Challenges (SecSon)},
year = {2018},
}
Walking Through Waypoints
Saeed Akhoondian Amiri, Klaus-Tycho Foerster, Stefan Schmid
Proc. 13th Latin American Theoretical Informatics Symposium (LATIN), 2018
@INPROCEEDINGS{latin18,
author = {Saeed Akhoondian Amiri and Klaus-Tycho Foerster and Stefan Schmid},
title = {Walking Through Waypoints},
booktitle = {Proc. 13th Latin American Theoretical Informatics Symposium (LATIN)},
year = {2018},
}
@INPROCEEDINGS{ifip18waypoints,
author = {Saeed Akhoondian Amiri and Klaus-Tycho Foerster and Riko Jacob and Mahmoud Parham and Stefan Schmid},
title = {Waypoint Routing in Special Networks},
booktitle = {Proc. IFIP Networking},
year = {2018},
}
2017
A Walk in the Clouds: Routing through VNFs on Bidirected Networks
Klaus-Tycho Foerster, Mahmoud Parham, Stefan Schmid
Proc. 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2017
@INPROCEEDINGS{algocloud17,
author = {Klaus-Tycho Foerster and Mahmoud Parham and Stefan Schmid},
title = {A Walk in the Clouds: Routing through VNFs on Bidirected Networks},
booktitle = {Proc. 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)},
year = {2017},
}
Algorithm-Data Driven Optimization of Adaptive Communication Networks
Mu He, Patrick Kalmbach, Andreas Blenk, Stefan Schmid, Wolfgang Kellerer
Proc. IEEE ICNP Workshop on Machine Learning and Artificial Intelligence in Computer Networks, 2017
@INPROCEEDINGS{icnp17ws,
author = {Mu He and Patrick Kalmbach and Andreas Blenk
and Stefan Schmid and Wolfgang Kellerer},
title = {Algorithm-Data Driven Optimization of Adaptive Communication Networks},
booktitle = {Proc. IEEE ICNP Workshop on Machine Learning and Artificial Intelligence in Computer Networks},
year = {2017},
}
Brief Announcement: Distributed SplayNets
Bruna Peres, Olga Goussevskaia, Stefan Schmid, Chen Avin
Proc. International Symposium on Distributed Computing (DISC), 2017
@INPROCEEDINGS{disc17ba,
author = {Bruna Peres and Olga Goussevskaia and Stefan Schmid and Chen Avin},
title = {Brief Announcement: Distributed SplayNets},
booktitle = {Proc. International Symposium on Distributed Computing (DISC)},
year = {2017},
}
Competitive Clustering of Stochastic Communication Patterns on the Ring
Chen Avin, Louis Cohen, Stefan Schmid
Proc. 5th International Conference on Networked Systems (NETYS), 2017
@INPROCEEDINGS{netys17learn,
author = {Chen Avin and Louis Cohen and Stefan Schmid},
title = {Competitive Clustering of Stochastic Communication Patterns on the Ring},
booktitle = {Proc. 5th International Conference on Networked Systems (NETYS)},
year = {2017},
}
Consistent Network Updates in Timed SDNs
Jiaqi Zheng, Guihai Chen, Stefan Schmid, Haipeng Dai, Jie Wu
IEEE JSAC Special Issue on Emerging Technologies in Software-Driven Communication, 2017
BibTeX
@INPROCEEDINGS{jsac17,
author = {Jiaqi Zheng and Guihai Chen and Stefan Schmid and Haipeng Dai and Jie Wu},
title = {Consistent Network Updates in Timed SDNs},
booktitle = {IEEE JSAC Special Issue on Emerging Technologies in Software-Driven Communication},
year = {2017},
}
Convergence of Even Simpler Robots without Location Information
Debasish Pattanayak, Kaushik Mondal, Partha Sarathi Mandal, Stefan Schmid
Proc. 5th International Conference on Networked Systems (NETYS), 2017
@INPROCEEDINGS{netys17robot,
author = {Debasish Pattanayak and Kaushik Mondal and Partha Sarathi Mandal and Stefan Schmid},
title = {Convergence of Even Simpler Robots without Location Information},
booktitle = {Proc. 5th International Conference on Networked Systems (NETYS)},
year = {2017},
}
Data Locality and Replica Aware Virtual Cluster Embeddings
@INPROCEEDINGS{tcs17rep,
author = {Carlo Fuerst and Maciej Pacut and Stefan Schmid},
title = {Data Locality and Replica Aware Virtual Cluster Embeddings},
booktitle = {Journal Theoretical Computer Science (TCS), Elsevier},
year = {2017},
}
Demand-Aware Network Designs of Bounded Degree
Chen Avin, Kaushik Mondal, Stefan Schmid
Proc. International Symposium on Distributed Computing (DISC), 2017
@INPROCEEDINGS{disc17,
author = {Chen Avin and Kaushik Mondal and Stefan Schmid},
title = {Demand-Aware Network Designs of Bounded Degree},
booktitle = {Proc. International Symposium on Distributed Computing (DISC)},
year = {2017},
}
Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal, Stefan Schmid
Proc. 19th International Conference on Distributed Computing and Networking (ICDCN), 2017
@INPROCEEDINGS{icdcn18,
author = {Debasish Pattanayak and H. Ramesh and Partha Sarathi Mandal and Stefan Schmid},
title = {Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk},
booktitle = {Proc. 19th International Conference on Distributed Computing and Networking (ICDCN)},
year = {2017},
}
Large Cuts with Local Algorithms on Triangle-Free Graphs
Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela
The Electronic Journal of Combinatorics (EJC), 2017
@INPROCEEDINGS{ejc17,
author = {Juho Hirvonen and Joel Rybicki and Stefan Schmid and Jukka Suomela},
title = {Large Cuts with Local Algorithms on Triangle-Free Graphs},
booktitle = {The Electronic Journal of Combinatorics (EJC)},
year = {2017},
}
Load-Optimal Local Fast Rerouting for Resilient Networks
Yvonne-Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. 47th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2017
@INPROCEEDINGS{dsn17,
author = {Yvonne-Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Load-Optimal Local Fast Rerouting for Resilient Networks},
booktitle = {Proc. 47th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2017},
}
o'zapft is: Tap Your Network Algorithm's Big Data!
Andreas Blenk, Patrick Kalmbach, Stefan Schmid, Wolfgang Kellerer
Proc. ACM SIGCOMM 2017 Workshop on Big Data Analytics and Machine Learning for Data Communication Networks (Big-DAMA), 2017
@INPROCEEDINGS{bigdama17,
author = {Andreas Blenk and Patrick Kalmbach and Stefan Schmid and Wolfgang Kellerer},
title = {o'zapft is: Tap Your Network Algorithm's Big Data!},
booktitle = {Proc. ACM SIGCOMM 2017 Workshop on Big Data Analytics and Machine Learning for Data Communication Networks (Big-DAMA)},
year = {2017},
}
Online Tree Caching
Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra
Proc. 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017
@INPROCEEDINGS{spaa17caching,
author = {Marcin Bienkowski and Jan Marcinkowski and Maciej Pacut and Stefan Schmid and Aleksandra Spyra},
title = {Online Tree Caching},
booktitle = {Proc. 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
year = {2017},
}
Outsmarting Network Security with SDN Teleportation
Kashyap Thimmaraju, Liron Schiff, Stefan Schmid
Proc. 2nd IEEE European Symposium on Security and Privacy (EuroSP), 2017
@INPROCEEDINGS{eurosp17,
author = {Kashyap Thimmaraju and Liron Schiff and Stefan Schmid},
title = {Outsmarting Network Security with SDN Teleportation},
booktitle = {Proc. 2nd IEEE European Symposium on Security and Privacy (EuroSP)},
year = {2017},
}
Sade: Competitive MAC under Adversarial SINR
Adrian Ogierman, Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
@INPROCEEDINGS{dist17sinr,
author = {Adrian Ogierman and Andrea Richa and Christian Scheideler and Stefan Schmid and Jin Zhang},
title = {Sade: Competitive MAC under Adversarial SINR},
booktitle = {Journal Distributed Computing (DIST)},
year = {2017},
}
Scheduling Congestion- and Loop-free Network Update in Timed SDNs
Jiaqi Zheng, Guihai Chen, Stefan Schmid, Haipeng Dai, Jie Wu
Proc. 37th IEEE International Conference on Distributed Computing Systems (ICDCS), 2017
@INPROCEEDINGS{icdcs17,
author = {Jiaqi Zheng and Guihai Chen and Stefan Schmid and Haipeng Dai and Jie Wu},
title = {Scheduling Congestion- and Loop-free Network Update in Timed SDNs},
booktitle = {Proc. 37th IEEE International Conference on Distributed Computing Systems (ICDCS)},
year = {2017},
}
Static Program Analysis as a Fuzzing Aid
Bhargava Shastry, Markus Leutner, Tobias Fiebig, Kashyap Thimmaraju, Fabian Yamaguchi, Konrad Rieck, Jean-Pierre Seifert Stefan Schmid, Anja Feldmann
Proc. 20th International Symposium on Research in Attacks, Intrusions and Defenses
(RAID), 2017
@INPROCEEDINGS{raid17,
author = {Bhargava Shastry and Markus Leutner and Tobias Fiebig and Kashyap Thimmaraju and Fabian Yamaguchi
and Konrad Rieck and Stefan Schmid,
Jean-Pierre Seifert and Anja Feldmann},
title = {Static Program Analysis as a Fuzzing Aid},
booktitle = {Proc. 20th International Symposium on Research in Attacks, Intrusions and Defenses
(RAID)},
year = {2017},
}
The Grand CRU Challenge
Marcel Bloecher, Malte Viering, Stefan Schmid, Patrick Eugster
Proc. ACM SIGCOMM 2017 International Workshop on Hot Topics in Container Networking and Networked Systems (HotConNet), 2017
@INPROCEEDINGS{hotconnet17,
author = {Marcel Bloecher and Malte Viering and Stefan Schmid and Patrick Eugster},
title = {The Grand CRU Challenge},
booktitle = {Proc. ACM SIGCOMM 2017 International Workshop on Hot Topics in Container Networking and Networked Systems (HotConNet)},
year = {2017},
}
The vAMP Attack: Taking Control of Cloud Systems via the Unified Packet Parser
@INPROCEEDINGS{ccsw17,
author = {Kashyap Thimmaraju and Bhargava Shastry and Tobias Fiebig and Felicitas Hetzelt and Jean-Pierre Seifert and Anja Feldmann and Stefan Schmid},
title = {The vAMP Attack: Taking Control of Cloud Systems via the Unified Packet Parser},
booktitle = {Proc. 9th ACM Cloud Computing Security Workshop (CCSW)},
year = {2017},
}
Tomographic Node Placement Strategies and the Impact of the Routing Model
Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS), Vol. 1, No. 2, Article 42, 2017
@INPROCEEDINGS{pomacs17tomo,
author = {Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Tomographic Node Placement Strategies and the Impact of the Routing Model},
booktitle = {Proc. of the ACM on Measurement and Analysis of Computing Systems (POMACS), Vol. 1, No. 2, Article 42},
year = {2017},
}
Toward a Taxonomy and Attacker Model for Secure Routing Protocols
Matthias Hollick, Cristina Nita-Rotaru, Panagiotis Papadimitratos, Adrian Perrig, Stefan Schmid
Proc. ACM SIGCOMM Computer Communication Review (CCR), 2017
@INPROCEEDINGS{ccr17taxo,
author = {Matthias Hollick and Cristina Nita-Rotaru
and Panagiotis Papadimitratos and Adrian Perrig and Stefan Schmid},
title = {Toward a Taxonomy and Attacker Model for Secure Routing Protocols},
booktitle = {Proc. ACM SIGCOMM Computer Communication Review (CCR)},
year = {2017},
}
Unified Programmability of Virtualized Network Functions and Software-Defined Wireless Networks
Julius Schulz-Zander, Carlos Mayer, Bogdan Ciobotaru, Raphael Lisicki, Stefan Schmid, Anja Feldmann
IEEE Transactions on Network and Service Management (TNSM), 2017
@INPROCEEDINGS{tnsm17,
author = {Julius Schulz-Zander and Carlos Mayer and Bogdan Ciobotaru and Raphael Lisicki
and Stefan Schmid and Anja Feldmann},
title = {Unified Programmability of Virtualized Network Functions and Software-Defined Wireless Networks},
booktitle = {IEEE Transactions on Network and Service Management (TNSM)},
year = {2017},
}
2016
A Local Constant Factor MDS Approximation for Bounded Genus Graphs
Saeed Amiri, Stefan Schmid, Sebastian Siebertz
Proc. ACM Symposium on Principles of Distributed Computing (PODC), 2016
@INPROCEEDINGS{podc16,
author = {Saeed Amiri and Stefan Schmid and Sebastian Siebertz},
title = {A Local Constant Factor MDS Approximation for Bounded Genus Graphs},
booktitle = {Proc. ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2016},
}
An Approximation Algorithm for Path
Computation and Function Placement in SDNs
Guy Even, Matthias Rost, Stefan Schmid
Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2016
@INPROCEEDINGS{sirocco16path,
author = {Guy Even and Matthias Rost and Stefan Schmid},
title = {An Approximation Algorithm for Path
Computation and Function Placement in SDNs},
booktitle = {Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2016},
}
Brief Announcement: A Log-star-Time Local MDS Approximation Scheme for Bounded Genus Graphs
Saeed Akhoondian Amiri, Stefan Schmid
Proc. 30th International Symposium on Distributed Computing (DISC), 2016
BibTeX
@INPROCEEDINGS{disc16ba,
author = {Saeed Akhoondian Amiri and Stefan Schmid},
title = {Brief Announcement: A Log-star-Time Local MDS Approximation Scheme for Bounded Genus Graphs},
booktitle = {Proc. 30th International Symposium on Distributed Computing (DISC)},
year = {2016},
}
Can't Touch This: Consistent Network Updates for Multiple Policies
Szymon Dudycz, Arne Ludwig, Stefan Schmid
Proc. 46th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2016
@INPROCEEDINGS{dsn16,
author = {Szymon Dudycz and Arne Ludwig and Stefan Schmid},
title = {Can't Touch This: Consistent Network Updates for Multiple Policies},
booktitle = {Proc. 46th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)},
year = {2016},
}
Efficient Service Graph Embedding: A Practical Approach
Balazs Nemeth, Balazs Sonkoly, Matthias Rost, Stefan Schmid
@INPROCEEDINGS{o4sdi16,
author = {Balazs Nemeth and Balazs Sonkoly and Matthias Rost and Stefan Schmid},
title = {Efficient Service Graph Embedding: A Practical Approach},
booktitle = {Proc.IEEE NFV-SDN Workshop O4SDI},
year = {2016},
}
Ground Control to Major Faults: Towards a Fault
Tolerant and Adaptive SDN Control Network
Liron Schiff, Stefan Schmid, Marco Canini
Proc. IEEE/IFIP DSN Workshop on Dependability Issues on SDN and NFV (DISN), 2016
@INPROCEEDINGS{disn16medieval,
author = {Liron Schiff and Stefan Schmid and Marco Canini},
title = {Ground Control to Major Faults: Towards a Fault
Tolerant and Adaptive SDN Control Network},
booktitle = {Proc. IEEE/IFIP DSN Workshop on Dependability Issues on SDN and NFV (DISN)},
year = {2016},
}
In-Band Synchronization for Distributed SDN Control Planes
Liron Schiff, Petr Kuznetsov, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2016
@article{ccr16sync,
author = {Liron Schiff and Petr Kuznetsov and Stefan Schmid},
title = {In-Band Synchronization for Distributed SDN Control Planes},
journal = {ACM SIGCOMM Computer Communication Review (CCR)},
year = {2016},
}
It's a Match! Near-Optimal and Incremental Middlebox Deployment
Tamas Lukovszki, Matthias Rost, Stefan Schmid
ACM SIGCOMM Computer Communication Review (CCR), 2016
@article{ccr16match,
author = {Tamas Lukovszki and Matthias Rost and Stefan Schmid},
title = {It's a Match! Near-Optimal and Incremental Middlebox Deployment},
journal = {ACM SIGCOMM Computer Communication Review (CCR)},
year = {2016},
}
Kraken: Online and Elastic Resource Reservations for Multi-tenant Datacenters
Carlo Fuerst, Stefan Schmid, Lalith Suresh, Paolo Costa
Proc. 35th IEEE Conference on Computer Communications (INFOCOM), 2016
@INPROCEEDINGS{infocom16,
author = {Carlo Fuerst and Stefan Schmid and Lalith Suresh and Paolo Costa},
title = {Kraken: Online and Elastic Resource Reservations for Multi-tenant Datacenters},
booktitle = {Proc. 35th IEEE Conference on Computer Communications (INFOCOM)},
year = {2016},
}
LegoFi the WiFi Building Blocks! The Case for a Modular WiFi Architecture
Julius Schulz-Zander, Stefan Schmid, James Kempf, Roberto Riggio, Anja Feldmann
Proc. ACM MOBICOM Workshop on Mobility in the Evolving Internet Architecture (MobiArch), 2016
@INPROCEEDINGS{mobiarch16,
author = {Julius Schulz-Zander and Stefan Schmid and James Kempf and Roberto Riggio and Anja Feldmann},
title = {LegoFi the WiFi Building Blocks! The Case for a Modular WiFi Architecture},
booktitle = {Proc. ACM MOBICOM Workshop on Mobility in the Evolving Internet Architecture (MobiArch)},
year = {2016},
}
NetCo: Reliable Routing With Unreliable Routers
Anja Feldmann, Philipp Heyder, Michael Kreutzer, Stefan Schmid, Jean-Pierre Seifert, Haya Shulman, Kashyap Thimmaraju, Michael Waidner, Jens Sieberg
Proc. IEEE/IFIP DSN Workshop on Dependability Issues on SDN and NFV (DISN), 2016
@INPROCEEDINGS{disn16netco,
author = {Anja Feldmann and Philipp Heyder and
Michael Kreutzer and Stefan Schmid and Jean-Pierre Seifert and
Haya Shulman and Kashyap Thimmaraju and Michael Waidner
and Jens Sieberg},
title = {NetCo: Reliable Routing With Unreliable Routers},
booktitle = {Proc. IEEE/IFIP DSN Workshop on Dependability Issues on SDN and NFV (DISN)},
year = {2016},
}
Network Service Chaining with Optimized
Network Function Embedding Supporting Service Decompositions
Sahel Sahhaf, Wouter Tavernier, Matthias Rost, Stefan Schmid, Didier
Colle, Mario Pickavet, Piet Demeester
@INPROCEEDINGS{comnet15emb,
author = {Sahel Sahhaf and Wouter Tavernier and Matthias Rost and Stefan Schmid and Didier
Colle and Mario Pickavet and Piet Demeester},
title = {Network Service Chaining with Optimized
Network Function Embedding Supporting Service Decompositions},
booktitle = {Journal Computer Networks (COMNET), Elsevier},
year = {2016},
}
Online Balanced Repartitioning
Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
Proc. 30th International Symposium on Distributed Computing (DISC), 2016
@INPROCEEDINGS{disc16,
author = {Chen Avin and Andreas Loukas and Maciej Pacut and Stefan Schmid},
title = {Online Balanced Repartitioning},
booktitle = {Proc. 30th International Symposium on Distributed Computing (DISC)},
year = {2016},
}
PRI: Privacy Preserving Inspection of Encrypted Network Traffic
Liron Schiff, Stefan Schmid
Proc. IEEE Security&Privacy Workshop on Research for Insider Threats (WRIT), 2016
@INPROCEEDINGS{writ16,
author = {Liron Schiff and Stefan Schmid},
title = {PRI: Privacy Preserving Inspection of Encrypted Network Traffic},
booktitle = {Proc. IEEE Security\&Privacy Workshop on Research for Insider Threats (WRIT)},
year = {2016},
}
@INPROCEEDINGS{disn16clients,
author = {Liron Schiff and Kashyap Thimmaraju and Stefan Schmid},
title = {Routing-Verification-as-a-Service (RVaaS):
Trustworthy Routing Despite Insecure Providers},
booktitle = {Proc. IEEE/IFIP DSN Workshop on Dependability Issues on SDN and NFV (DISN)},
year = {2016},
}
@article{ton15splay,
author = {Stefan Schmid and Chen Avin and Christian Scheideler and Michael Borokhovich and Bernhard Haeupler and Zvi Lotker},
title = {SplayNet: Towards Locally Self-Adjusting Networks},
journal = {IEEE/ACM Transactions on Networking (ToN)},
year = {2016},
}
Stitching Inter-Domain Paths over IXPs
Vasileios Kotronis, Rowan Kloti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, Xenofontas Dimitropoulos
@INPROCEEDINGS{sosr16,
author = {Vasileios Kotronis and Rowan Kloti and Matthias Rost and Panagiotis Georgopoulos
and Bernhard Ager and Stefan Schmid and Xenofontas Dimitropoulos},
title = {Stitching Inter-Domain Paths over IXPs},
booktitle = {Proc. ACM Symposium on SDN Research (SOSR)},
year = {2016},
}
Study the past if you would define the future: Implementing Secure Multi-Party SDN Updates
@INPROCEEDINGS{swste16,
author = {Liron Schiff and Stefan Schmid},
title = {Study the past if you would define the future: Implementing Secure Multi-Party SDN Updates},
booktitle = {Proc. IEEE SwSTE},
year = {2016},
}
Topological Self-Stabilization with Name-Passing Process Calculi
Christina Rickmann, Christoph Wagner, Uwe Nestmann, Stefan Schmid
Proc. 27th International Conference on Concurrency Theory (CONCUR), 2016
@INPROCEEDINGS{concur16,
author = {Christina Rickmann and Christoph Wagner and Uwe Nestmann and Stefan Schmid},
title = {Topological Self-Stabilization with Name-Passing Process Calculi},
booktitle = {Proc. 27th International Conference on Concurrency Theory (CONCUR)},
year = {2016},
}
Towards Transiently Secure Updates in Asynchronous SDNs
Apoorv Shukla, Andre Schütze, Arne Ludwig, Szymon Dudycz, Stefan Schmid, Anja Feldmann
@INPROCEEDINGS{sigcomm16,
author = {Apoorv Shukla and Andre Schütze and Arne Ludwig and Szymon Dudycz and Stefan Schmid and Anja Feldmann},
title = {Towards Transiently Secure Updates in Asynchronous SDNs},
booktitle = {Proc. ACM SIGCOMM Demo},
year = {2016},
}
Transiently Consistent SDN Updates: Being Greedy is Hard
Saeed Amiri, Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2016
@INPROCEEDINGS{sirocco16update,
author = {Saeed Amiri and Arne Ludwig and Jan Marcinkowski and Stefan Schmid},
title = {Transiently Consistent SDN Updates: Being Greedy is Hard},
booktitle = {Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
year = {2016},
}
Transiently Secure Network Updates
Arne Ludwig, Szymon Dudycz, Matthias Rost, Stefan Schmid
@INPROCEEDINGS{sigmetrics16,
author = {Arne Ludwig and Szymon Dudycz and Matthias Rost and Stefan Schmid},
title = {Transiently Secure Network Updates},
booktitle = {Proc. ACM SIGMETRICS},
year = {2016},
}
Upper and Lower Bounds for Deterministic Broadcast in Powerline Communication Networks
Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
@article{dist16,
author = {Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Upper and Lower Bounds for Deterministic Broadcast in Powerline Communication Networks},
journal = {Springer Distributed Computing (DIST)},
year = {2016},
}
WNetKAT: A Weighted SDN Programming and Verification Language
Kim G. Larsen, Stefan Schmid, Bingtian Xue
Proc. 20th International Conference on Principles of Distributed Systems (OPODIS), 2016
@INPROCEEDINGS{opodis16,
author = {Kim G. Larsen and Stefan Schmid and Bingtian Xue},
title = {WNetKAT: A Weighted SDN Programming and Verification Language},
booktitle = {Proc. 20th International Conference on Principles of Distributed Systems (OPODIS)},
year = {2016},
}
WNetKAT: Programming and Verifying Weighted Software-Defined Networks
Kim G. Larsen, Stefan Schmid, Bingtian Xue
Proc. 28th Nordic Workshop on Programming Theory (NWPT), 2016
@INPROCEEDINGS{nwpt16,
author = {Kim G. Larsen and Stefan Schmid and Bingtian Xue},
title = {WNetKAT: Programming and Verifying Weighted Software-Defined Networks},
booktitle = {Proc. 28th Nordic Workshop on Programming Theory (NWPT)},
year = {2016},
}
2015
A Distributed and Robust SDN Control Plane for Transactional Network Updates
Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid
Proc. 34th IEEE Conference on Computer Communications (INFOCOM), 2015
@INPROCEEDINGS{infocom15,
author = {Marco Canini and Petr Kuznetsov and Dan Levin and Stefan Schmid},
title = {A Distributed and Robust SDN Control Plane for Transactional Network Updates},
booktitle = {Proc. 34th IEEE Conference on Computer Communications (INFOCOM)},
year = {2015},
}
Adversarial Topology Discovery in Network Virtualization
Environments: A Threat for ISPs?
Yvonne Anne Pignolet, Gilles Tredan, Stefan Schmid
@article{dist14,
author = {Yvonne Anne Pignolet and Gilles Tredan and Stefan Schmid},
title = {Adversarial Topology Discovery in Network Virtualization
Environments: A Threat for ISPs?},
journal = {Distributed Computing (DIST)},
volume = {28},
issue = {2},
year = {2015},
}
Beyond the Stars: Revisiting Virtual Cluster Embeddings
Matthias Rost, Carlo Fuerst, Stefan Schmid
Proc. ACM SIGCOMM Computer Communication Review (CCR), 2015
@INPROCEEDINGS{ccr15emb,
author = {Matthias Rost and Carlo Fuerst and Stefan Schmid},
title = {Beyond the Stars: Revisiting Virtual Cluster Embeddings},
booktitle = {Proc. ACM SIGCOMM Computer Communication Review (CCR)},
year = {2015},
}
C3: Cutting Tail Latency in Cloud Data Stores via Adaptive
Replica Selection
Lalith Suresh, Marco Canini, Stefan Schmid, Anja Feldmann
Proc. 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2015
@INPROCEEDINGS{nsdi15,
author = {Lalith Suresh and Marco Canini and Stefan Schmid and Anja Feldmann},
title = {C3: Cutting Tail Latency in Cloud Data Stores via Adaptive
Replica Selection},
booktitle = {Proc. 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI)},
year = {2015},
}
Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem
Xinhui Hu, Arne Ludwig, Andrea Richa, Stefan Schmid
Proc. 35th IEEE International Conference on Distributed
Computing Systems (ICDCS), 2015
@INPROCEEDINGS{icdcs15,
author = {Xinhui Hu and Arne Ludwig and Andrea Richa and Stefan Schmid},
title = {Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem},
booktitle = {Proc. 35th IEEE International Conference on Distributed
Computing Systems (ICDCS)},
year = {2015},
}
Distributed Alarming in the On-Duty and Off-Duty Models
Marcin Bienkowski, Leszek Gasieniec, Marek Klonowski, Miroslaw Korzeniowski, Bernard Mans, Stefan Schmid, Roger Wattenhofer
@article{ton14alarm,
author = {Marcin Bienkowski and Leszek Gasieniec and Marek Klonowski and Miroslaw Korzeniowski and Bernard Mans and Stefan Schmid and Roger Wattenhofer},
title = {Distributed Alarming in the On-Duty and Off-Duty Models},
journal = {IEEE/ACM Transactions on Networking (ToN)},
year = {2015},
}
Distributed Cloud Computing: Applications, Status Quo, and Challenges (Editorial)
Yvonne Coady, Oliver Hohlfeld, James Kempf, Rick McGeer, Stefan Schmid
Proc. ACM SIGCOMM Computer Communication Review (CCR), 2015
BibTeX
@INPROCEEDINGS{ccr15,
author = {Yvonne Coady and Oliver Hohlfeld and James Kempf and Rick McGeer and Stefan Schmid},
title = {Distributed Cloud Computing: Applications, Status Quo, and Challenges (Editorial)},
booktitle = {Proc. ACM SIGCOMM Computer Communication Review (CCR)},
year = {2015},
}
Distributed Cloud Market: Who Benefits from Specification Flexibilities?
Arne Ludwig, Stefan Schmid
Proc. 3rd SIGMETRICS Workshop on Distributed Cloud Computing (DCC) and
Special Issue ACM Performance Evaluation Review (PER), 2015
@INPROCEEDINGS{dcc15,
author = {Arne Ludwig and Stefan Schmid},
title = {Distributed Cloud Market: Who Benefits from Specification Flexibilities?},
booktitle = {Proc. 3rd SIGMETRICS Workshop on Distributed Cloud Computing (DCC) and
Special Issue ACM Performance Evaluation Review (PER)},
year = {2015},
}
How Hard Can It Be? Understanding the Complexity of Replica Aware Virtual Cluster Embeddings
Carlo Fuerst, Maciej Pacut, Paolo Costa, Stefan Schmid
Proc. 23rd IEEE International Conference on Network Protocols (ICNP), 2015
@INPROCEEDINGS{icnp15loc,
author = {Carlo Fuerst and Maciej Pacut and Paolo Costa and Stefan Schmid},
title = {How Hard Can It Be? Understanding the Complexity of Replica Aware Virtual Cluster Embeddings},
booktitle = {Proc. 23rd IEEE International Conference on Network Protocols (ICNP)},
year = {2015},
}
Investigating the Potential of the Inter-IXP Multigraph for
the Provisioning of Guaranteed End-to-End Services
Vasileios Kotronis, Rowan Kloeti, Matthias Rost, Panagiotis Georgopoulos, Bernhard Ager, Stefan Schmid, Xenofontas Dimitropoulos
@INPROCEEDINGS{sigmetrics15cxp,
author = {Vasileios Kotronis and Rowan Kloeti and Matthias Rost and Panagiotis Georgopoulos and Bernhard Ager and Stefan Schmid and Xenofontas Dimitropoulos},
title = {Investigating the Potential of the Inter-IXP Multigraph for
the Provisioning of Guaranteed End-to-End Services},
booktitle = {Proc. ACM SIGMETRICS},
year = {2015},
}
Kraken: Towards Elastic Performance Guarantees in Multi-tenant Data Centers
Carlo Fuerst, Stefan Schmid, Lalith Suresh, Paolo Costa
@INPROCEEDINGS{sigmetrics15kraken,
author = {Carlo Fuerst and Stefan Schmid and Lalith Suresh and Paolo Costa},
title = {Kraken: Towards Elastic Performance Guarantees in Multi-tenant Data Centers},
booktitle = {Proc. ACM SIGMETRICS},
year = {2015},
}
Large Cuts With Local Algorithms on Triangle-free Graphs
Juho Hirvonen, Joel Rybicki, Stefan Schmid, Jukka Suomela
Proc. 29th International Symposium on Distributed Computing (DISC), 2015
@INPROCEEDINGS{disc15,
author = {Juho Hirvonen and Joel Rybicki and Stefan Schmid and Jukka Suomela},
title = {Large Cuts With Local Algorithms on Triangle-free Graphs},
booktitle = {Proc. 29th International Symposium on Distributed Computing (DISC)},
year = {2015},
}
Medieval: Towards A Self-Stabilizing, Plug & Play, In-Band SDN Control Network
Liron Schiff, Stefan Schmid, Marco Canini
Proc. ACM Sigcomm Symposium on SDN Research (SOSR), 2015
@INPROCEEDINGS{sosr15medieval,
author = {Liron Schiff and Stefan Schmid and Marco Canini},
title = {Medieval: Towards A Self-Stabilizing, Plug \& Play, In-Band SDN Control Network},
booktitle = {Proc. ACM Sigcomm Symposium on SDN Research (SOSR)},
year = {2015},
}
Online Admission Control and Embedding of Service Chains
Tamas Lukovszki, Stefan Schmid
Proc. 22nd International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 2015
@INPROCEEDINGS{sirocco15,
author = {Tamas Lukovszki and Stefan Schmid},
title = {Online Admission Control and Embedding of Service Chains},
booktitle = {Proc. 22nd International Colloquium on Structural Information
and Communication Complexity (SIROCCO)},
year = {2015},
}
OpenSDWN: Programmatic control over home and enterprise WiFi
Julius Schulz-Zander, Carlos Mayer, Bogdan Ciobotaru, Stefan Schmid, Anja Feldmann
Proc. ACM Sigcomm Symposium on SDN Research (SOSR), 2015
@INPROCEEDINGS{sosr15,
author = {Julius Schulz-Zander and Carlos Mayer and Bogdan Ciobotaru and Stefan Schmid and Anja Feldmann},
title = {OpenSDWN: Programmatic control over home and enterprise WiFi},
booktitle = {Proc. ACM Sigcomm Symposium on SDN Research (SOSR)},
year = {2015},
}
Programming the Home and Enterprise WiFi with OpenSDWN (Demo)
Julius Schulz-Zander, Carlos Mayer, Bogdan Ciobotaru, Stefan Schmid, Anja Feldmann, Roberto Riggio
Proc. ACM SIGCOMM, 2015
BibTeX
@INPROCEEDINGS{sigcomm15,
author = {Julius Schulz-Zander and Carlos Mayer and Bogdan Ciobotaru and Stefan Schmid and Anja Feldmann and Roberto Riggio},
title = {Programming the Home and Enterprise WiFi with OpenSDWN (Demo)},
booktitle = {Proc. ACM SIGCOMM},
year = {2015},
}
Scheduling Loop-free Network Updates: It's Good to Relax!
Arne Ludwig, Jan Marcinkowski, Stefan Schmid
Proc. ACM Symposium on Principles of Distributed Computing (PODC), 2015
@INPROCEEDINGS{podc15,
author = {Arne Ludwig and Jan Marcinkowski and Stefan Schmid},
title = {Scheduling Loop-free Network Updates: It's Good to Relax!},
booktitle = {Proc. ACM Symposium on Principles of Distributed Computing (PODC)},
year = {2015},
}
SHEAR: A Highly Available and Flexible Network Architecture: Marrying Distributed and Logically Centralized Control Planes
Michael Markovitch, Stefan Schmid
Proc. 23rd IEEE International Conference on Network Protocols (ICNP), 2015
@INPROCEEDINGS{icnp15shear,
author = {Michael Markovitch and Stefan Schmid},
title = {SHEAR: A Highly Available and Flexible Network Architecture: Marrying Distributed and Logically Centralized Control Planes},
booktitle = {Proc. 23rd IEEE International Conference on Network Protocols (ICNP)},
year = {2015},
}
2014
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization
Dominik Gall, Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Taeubig
@article{tocs13,
author = {Dominik Gall and Riko Jacob and Andrea Richa and Christian Scheideler and Stefan Schmid and Hanjo Taeubig},
title = {A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization},
journal = { Theory of Computing Systems (TOCS)},
year = {2014},
}
AeroFlux: A Near-Sighted Controller Architecture
for Software-Defined Wireless Networks
@INPROCEEDINGS{ons14wireless,
author = {Julius Schulz-Zander and Nadi Sarrar and Stefan Schmid},
title = {AeroFlux: A Near-Sighted Controller Architecture
for Software-Defined Wireless Networks},
booktitle = {Proc. Open Networking Summit (ONS)},
year = {2014},
}
ColorCast: Deterministic Broadcast in Powerline Networks with Uncertainties
Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. 5th IEEE International Conference on Smart Grid Communications (SmartGridComm), 2014
@INPROCEEDINGS{smartgridcomm14,
author = {Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {ColorCast: Deterministic Broadcast in Powerline Networks with Uncertainties},
booktitle = {Proc. 5th IEEE International Conference on Smart Grid Communications (SmartGridComm)},
year = {2014},
}
Competitive FIB Aggregation without Update Churn
Marcin Bienkowski, Nadi Sarrar, Stefan Schmid, Steve Uhlig
Proc. 34th International Conference on Distributed
Computing Systems (ICDCS), 2014
@INPROCEEDINGS{icdcs14,
author = {Marcin Bienkowski and Nadi Sarrar and Stefan Schmid and Steve Uhlig},
title = {Competitive FIB Aggregation without Update Churn},
booktitle = {Proc. 34th International Conference on Distributed
Computing Systems (ICDCS)},
year = {2014},
}
Competitive MAC under Adversarial SINR
Adrian Ogierman, Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
@InProceedings{infocom14,
author = {Adrian Ogierman and Andrea Richa and Christian Scheideler and Stefan Schmid and Jin Zhang},
title = {Competitive MAC under Adversarial SINR},
booktitle = {Proc. IEEE INFOCOM},
month = {April},
year = {2014},
}
Control Exchange Points: Providing QoS-enabled End-to-End Services
via SDN-based Inter-domain Routing Orchestration
Vasileios Kotronis, Xenofontas Dimitropoulos, Rowan Klöti, Bernhard Ager, Panagiotis Georgopoulos, Stefan Schmid
@INPROCEEDINGS{ons14cxp,
author = {Vasileios Kotronis and Xenofontas Dimitropoulos and Rowan Kl\"oti and Bernhard Ager and Panagiotis Georgopoulos and Stefan Schmid},
title = {Control Exchange Points: Providing QoS-enabled End-to-End Services
via SDN-based Inter-domain Routing Orchestration},
booktitle = {Proc. Open Networking Summit (ONS)},
year = {2014},
}
Good Network Updates for Bad Packets:
Waypoint Enforcement Beyond Destination-Based Routing Policies
Arne Ludwig, Matthias Rost, Damien Foucard, Stefan Schmid
Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2014
@INPROCEEDINGS{hotnets14update,
author = {Arne Ludwig and Matthias Rost and Damien Foucard and Stefan Schmid},
title = {Good Network Updates for Bad Packets:
Waypoint Enforcement Beyond Destination-Based Routing Policies},
booktitle = {Proc. ACM Workshop on Hot Topics in Networks (HotNets)},
year = {2014},
}
It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities
Matthias Rost, Stefan Schmid, Anja Feldmann
Proc. IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2014
@InProceedings{ipdps14,
author = {Matthias Rost and Stefan Schmid and Anja Feldmann},
title = {It's About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities},
booktitle = {Proc. IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
month = {May},
year = {2014},
}
Leveraging Locality for FIB Aggregation
Nadi Sarrar, Robert Wuttke, Stefan Schmid, Marcin Bienkowski, Steve Uhlig
@INPROCEEDINGS{globecom14,
author = {Nadi Sarrar and Robert Wuttke and Stefan Schmid and Marcin Bienkowski and Steve Uhlig},
title = {Leveraging Locality for FIB Aggregation},
booktitle = {Proc. IEEE GLOBECOM},
year = {2014},
}
Modeling and Measuring Graph Similarity: The Case for Centrality Distance
Matthieu Roy, Stefan Schmid, Gilles Tredan
Proc. 10th ACM International Workshop on Foundations of Mobile Computing (FOMC), 2014
@INPROCEEDINGS{fomc14,
author = {Matthieu Roy and Stefan Schmid and Gilles Tredan},
title = {Modeling and Measuring Graph Similarity: The Case for Centrality Distance},
booktitle = {Proc. 10th ACM International Workshop on Foundations of Mobile Computing (FOMC)},
year = {2014},
}
On the Windfall and Price of Friendship: Inoculation Strategies on Social Networks
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
@article{comnet14,
author = {Dominic Meier and Yvonne Anne Oswald and Stefan Schmid and Roger Wattenhofer},
title = {On the Windfall and Price of Friendship: Inoculation Strategies on Social Networks},
journal = { Elsevier Computer Networks (COMNET)},
year = {2014},
}
Panopticon: Incremental Deployment of Software-Defined Networking
Marco Canini, Anja Feldmann, Dan Levin, Fabian Schaffert, Stefan Schmid
@article{comsi14,
author = {Marco Canini and Anja Feldmann and Dan Levin and Fabian Schaffert and Stefan Schmid},
title = {Panopticon: Incremental Deployment of Software-Defined Networking},
journal = {IEEE Computer},
year = {2014},
}
Panopticon: Reaping the Benefits of Incremental SDN Deployment in Enterprise Networks
Dan Levin, Marco Canini, Stefan Schmid, Fabian Schaffert, Anja Feldmann
Proc. USENIX Annual Technical Conference (ATC), 2014
@INPROCEEDINGS{atc14,
author = {Dan Levin and Marco Canini and Stefan Schmid and Fabian Schaffert and Anja Feldmann},
title = {Panopticon: Reaping the Benefits of Incremental SDN Deployment in Enterprise Networks},
booktitle = {Proc. USENIX Annual Technical Conference (ATC)},
year = {2014},
}
Provable Data Plane Connectivity with Local Fast Failover: Introducing OpenFlow Graph Algorithms
Michael Borokhovich, Liron Schiff, Stefan Schmid
Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), 2014
@INPROCEEDINGS{hotsdn14failover,
author = {Michael Borokhovich and Liron Schiff and Stefan Schmid},
title = {Provable Data Plane Connectivity with Local Fast Failover: Introducing OpenFlow Graph Algorithms},
booktitle = {Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN)},
year = {2014},
}
Reclaiming the Brain: Useful OpenFlow Functions in the Data Plane
Liron Schiff, Michael Borokhovich, Stefan Schmid
Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2014
@INPROCEEDINGS{hotnets14inband,
author = {Liron Schiff and Michael Borokhovich and Stefan Schmid},
title = {Reclaiming the Brain: Useful OpenFlow Functions in the Data Plane},
booktitle = {Proc. ACM Workshop on Hot Topics in Networks (HotNets)},
year = {2014},
}
SKIP$+$: A Self-Stabilizing Skip Graph
Riko Jacob, Andrea Richa, Christian Scheideler, Stefan Schmid, Hanjo Taeubig
@article{jacm14,
author = {Jacob, Riko and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Taeubig, Hanjo},
title = {SKIP$+$: A Self-Stabilizing Skip Graph},
journal = {Journal of the ACM (JACM)},
year = {2014},
}
STN: A Robust and Distributed SDN Control Plane
Marco Canini, Daniele De Cicco, Petr Kuznetsov, Dan Levin, Stefan Schmid, Stefano
Vissicchio
@INPROCEEDINGS{ons14ccc,
author = {Marco Canini and Daniele De Cicco and Petr Kuznetsov and Dan Levin and Stefan Schmid and Stefano
Vissicchio},
title = {{STN}: A Robust and Distributed SDN Control Plane},
booktitle = {Proc. Open Networking Summit (ONS)},
year = {2014},
}
The Wide-Area Virtual Service Migration Problem:
A Competitive Analysis Approach
Marcin Bienkowski, Anja
Feldmann, Johannes Grassler, Gregor Schaffrath, Stefan Schmid
@article{ton13mig,
Title = {The Wide-Area Virtual Service Migration Problem:
A Competitive Analysis Approach},
Author = {Marcin Bienkowski and Anja
Feldmann and Johannes Grassler and Gregor Schaffrath and Stefan Schmid},
Journal = {IEEE/ACM Transactions on Networking (ToN)},
Year = {2014} }
Toward a Scalable and Near-Sighted Control Plane Architecture for WiFi SDNs (Poster)
Julius Schulz-Zander, Nadi Sarrar, Stefan Schmid
Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), 2014
BibTeX
@INPROCEEDINGS{hotsdn14aero,
author = {Julius Schulz-Zander and Nadi Sarrar and Stefan Schmid},
title = {Toward a Scalable and Near-Sighted Control Plane Architecture for WiFi SDNs (Poster)},
booktitle = {Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN)},
year = {2014},
}
Towards Unified Programmability of
Cloud and Carrier Infrastructure
P.~Skoldstrom et al.
Proc. European Workshop on Software Defined Networking (EWSDN), 2014
@INPROCEEDINGS{ewsdn14,
author = {{P.~Skoldstrom et al.}},
title = {Towards Unified Programmability of
Cloud and Carrier Infrastructure},
booktitle = {Proc. European Workshop on Software Defined Networking (EWSDN)},
year = {2014},
}
Urban Mobility Scaling: Lessons from Little Data
Galen Wilkerson, Ramin
Khalili, Stefan Schmid
Proc. 6th IEEE International Workshop on Network
Science for Communication Networks (NetSciCom), 2014
@INPROCEEDINGS{netscicom14,
author = {Galen Wilkerson and Ramin
Khalili and Stefan Schmid},
title = {Urban Mobility Scaling: Lessons from Little Data},
booktitle = {Proc. 6th IEEE International Workshop on Network
Science for Communication Networks (NetSciCom)},
year = {2014},
}
2013
A Federated CloudNet Architecture: The PIP and the VNP Role
Johannes Grassler, Gregor Schaffrath, Stefan Schmid
@article{it13,
author = {Johannes Grassler and Gregor Schaffrath and Stefan Schmid},
title = {A Federated CloudNet Architecture: The PIP and the VNP Role},
journal = {Information Technology, Oldenbourg Verlag},
issue = {4},
year = {2013},
}
Adversarial VNet Embeddings: A Threat for ISPs?
Yvonne-Anne Pignolet, Gilles Tredan, Stefan Schmid
@InProceedings{pimrc13,
author = {Ishan Vaishnavi and David Perez-Caparros and Stefan Schmid, and Ashiq Khan},
title = {An Architecture for Creating and Managing Virtual Networks},
booktitle = {Proc. 24th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)},
month = {September},
year = {2013},
}
An Efficient and Fair MAC Protocol Robust to
Reactive Interference
Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
@article{ton12ste, Title = {An Efficient and Fair MAC Protocol Robust to
Reactive Interference}, Author = {Andrea Richa and Christian Scheideler and
Stefan Schmid and Jin Zhang}, Journal = {IEEE/ACM Transactions on Networking
(ToN)}, Year = {2013} }
An Efficient and Fair MAC Protocol Robust to
Reactive Interference
Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
@article{dist12ste, Title = {An Efficient and Fair MAC Protocol Robust to
Reactive Interference}, Author = {Andrea Richa and Christian Scheideler and
Stefan Schmid and Jin Zhang}, Journal = { Distributed Computing
(DIST)}, Year = {2013} }
Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes
Marcin Bienkowski, Nadi Sarrar, Stefan Schmid, Steve Uhlig
Proc. 27th International Symposium on Distributed Computing (DISC), 2013
@InProceedings{disc13fib,
author = {Marcin Bienkowski and Nadi Sarrar and Stefan Schmid and Steve Uhlig},
title = {Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes},
booktitle = {Proc. 27th International Symposium on Distributed Computing (DISC)},
month = {October},
year = {2013},
}
Brief Announcement: Towards Distributed and Reliable
Software Defined Networking
Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid
Proc. 27th International Symposium on Distributed Computing (DISC), 2013
@InProceedings{disc13cpc,
author = {Marco Canini and Petr Kuznetsov and Dan Levin and Stefan Schmid},
title = {Brief Announcement: Towards Distributed and Reliable
Software Defined Networking},
booktitle = {Proc. 27th International Symposium on Distributed Computing (DISC)},
month = {October},
year = {2013},
}
Competitive and Deterministic Embeddings of Virtual Networks
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid
@article{tcs12vnet,
author = {Even, Guy and Medina, Moti and Schaffrath,
Gregor and Schmid, Stefan},
title = {Competitive and Deterministic Embeddings of Virtual Networks},
Journal = {Elsevier Theoretical Computer Science
(TCS)}, Year = {2013} }
Competitive FIB Aggregation: Online Ski Rental on
the Trie
Marcin Bienkowski, Stefan Schmid
Proc. 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2013
@InProceedings{sirocco2013,
author = {Marcin Bienkowski and Stefan Schmid},
title = {Competitive FIB Aggregation: Online Ski Rental on
the Trie},
booktitle = {Proc. 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
month = {July},
year = {2013},}
Exploiting Locality in Distributed SDN Control
Stefan Schmid, Jukka Suomela
Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), 2013
@InProceedings{hotsdn13loc,
author = {Stefan Schmid and Jukka Suomela},
title = {Exploiting Locality in Distributed SDN Control},
booktitle = {Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN)},
month = {August},
year = {2013},
}
How (Not) to Shoot in Your Foot with SDN Local Fast Failover: A Load-Connectivity Tradeoff
Michael Borokhovich, Stefan Schmid
Proc. 17th International Conference on Principles of Distributed Systems (OPODIS), 2013
@InProceedings{opodis13shoot,
author = {Michael Borokhovich and Stefan Schmid},
title = {How (Not) to Shoot in Your Foot with SDN Local Fast Failover: A Load-Connectivity Tradeoff},
booktitle = {Proc. 17th International Conference on Principles of Distributed Systems (OPODIS)},
month = {December},
year = {2013},
}
Locally Self-Adjusting Tree Networks
Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid
27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013
@InProceedings{ipdps13,
author = {Chen Avin and Bernhard Haeupler and Zvi Lotker and Christian Scheideler and Stefan Schmid},
title = {Locally Self-Adjusting Tree Networks},
booktitle = {27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
month = {May},
year = {2013},
}
Misleading Stars: What Cannot Be Measured in the
Internet?
Yvonne-Anne Pignolet, Stefan Schmid, Gilles
Tredan
@article{dist13, Title = {Misleading Stars: What Cannot Be Measured in the
Internet?}, Author = {Yvonne-Anne Pignolet and Stefan Schmid and Gilles
Tredan}, Journal = { Distributed Computing (DIST)}, Year = {2013} }
Move-with-the-Sun or Move-with-the-Moon? Wide-Area CloudNet Migrations Under Latency and Resource Constraints
Johannes Grassler, Anja Feldmann, Stefan Schmid
Demo at 32nd IEEE Conference on Computer Communications (INFOCOM), 2013
@InProceedings{infocom13demo,
author = {Grassler, Johannes and Feldmann, Anja and Schmid, Stefan},
title = {Move-with-the-Sun or Move-with-the-Moon? Wide-Area CloudNet Migrations Under Latency and Resource Constraints},
booktitle = {Demo at 32nd IEEE Conference on Computer Communications (INFOCOM)},
location = {Turin, Italy},
month = {April},
year = {2013},
}
OBST: A Self-Adjusting Peer-to-Peer Overlay Based on Multiple BSTs
Chen Avin, Michael Borokhovich, Stefan Schmid
Proc. 13th IEEE International Conference on Peer-to-Peer Computing (P2P), 2013
@InProceedings{p2p13,
author = {Chen Avin and Michael Borokhovich and Stefan Schmid},
title = {OBST: A Self-Adjusting Peer-to-Peer Overlay Based on Multiple BSTs},
booktitle = {Proc. 13th IEEE International Conference on Peer-to-Peer Computing (P2P)},
month = {September},
year = {2013},
}
Optimal Bounds for Online Page Migration with Generalized Migration Costs
Johannes Schneider, Stefan Schmid
32nd IEEE Conference on Computer Communications (INFOCOM), 2013
@inproceedings{icdcn13,
author = {Xinhui Hu and Stefan
Schmid and Andrea Richa and Anja Feldmann},
title = {Optimal Migration Contracts in Virtual Networks: Pay-as-You-Come vs Pay-as-You-Go Pricing},
booktitle = {Proc. 14th International Conference on Distributed Computing and
Networking (ICDCN)},
year = 2013,
}
Principles of Robust Medium Access and an
Application to Leader Election
Baruch Awerbuch, Andrea Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
@article{talg13,
Title = {Principles of Robust Medium Access and an
Application to Leader Election},
Author = {Baruch Awerbuch and Andrea Richa
and Christian Scheideler and Stefan Schmid and Jin Zhang},
Journal = {ACM
Transactions on Algorithms (TALG)},
Year = {2013} }
Request Complexity of VNet Topology Extraction:
Dictionary-Based Attacks
Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
International Conference on Networked Systems (NETYS), 2013
@InProceedings{netys13,
author = {Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Request Complexity of VNet Topology Extraction:
Dictionary-Based Attacks},
booktitle = {International Conference on Networked Systems (NETYS)},
month = {May},
year = {2013},
}
Software Transactional Networking:
Concurrent and Consistent Policy Composition
Marco Canini, Petr Kuznetsov, Dan Levin, Stefan Schmid
Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN), 2013
@InProceedings{hotsdn13ccc,
author = {Marco Canini and Petr Kuznetsov and Dan Levin and Stefan Schmid},
title = {Software Transactional Networking:
Concurrent and Consistent Policy Composition},
booktitle = {Proc. ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN)},
month = {August},
year = {2013},}
Specificity vs. Flexibility: On the Embedding Cost of a Virtual Network
Arne Ludwig, Stefan Schmid, Anja Feldmann
Proc. 25th International Teletraffic Congress (ITC), 2013
@InProceedings{itc13,
author = {Arne Ludwig and Stefan Schmid and Anja Feldmann},
title = {Specificity vs. Flexibility: On the Embedding Cost of a Virtual Network},
booktitle = {Proc. 25th International Teletraffic Congress (ITC)},
month = {September},
year = {2013},
}
Strategies for Traffic-Aware VM Migration (Poster Paper)
Chen Avin, Omer Dunay, Stefan Schmid
Proc. 6th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), 2013
BibTeX
@InProceedings{ucc13,
author = {Chen Avin and Omer Dunay and Stefan Schmid},
title = {Strategies for Traffic-Aware VM Migration (Poster Paper)},
booktitle = {Proc. 6th IEEE/ACM International Conference on Utility and Cloud Computing (UCC)},
month = {December},
year = {2013},
}
Toward Transitional SDN Deployment in Enterprise Networks
Dan Levin, Marco Canini, Stefan Schmid, Anja Feldmann
@INPROCEEDINGS{ons13,
author = {Levin, Dan and Canini, Marco and Schmid, Stefan and Feldmann, Anja},
title = {Toward Transitional SDN Deployment in Enterprise Networks},
booktitle = {Proc. Open Networking Summit (ONS},
year = {2013},
month = {Apr}
}
Virtual Network Embedding with Collocation: Benefits and Limitations of Pre-Clustering
Carlo Fuerst, Stefan Schmid, Anja Feldmann
Proc. 2nd IEEE International Conference on Cloud Networking (CLOUDNET), 2013
@InProceedings{cloudnet13,
author = {Carlo Fuerst and Stefan Schmid and Anja Feldmann},
title = {Virtual Network Embedding with Collocation: Benefits and Limitations of Pre-Clustering},
booktitle = {Proc. 2nd IEEE International Conference on Cloud Networking (CLOUDNET)},
month = {November},
year = {2013},
}
VirtuCast: Multicast and Aggregation with In-Network Processing (An Exact Single-Commodity Algorithm)
Matthias Rost, Stefan Schmid
Proc. 17th International Conference on Principles of Distributed Systems (OPODIS), 2013
@InProceedings{opodis13cvsap,
author = {Matthias Rost and Stefan Schmid},
title = {VirtuCast: Multicast and Aggregation with In-Network Processing (An Exact Single-Commodity Algorithm)},
booktitle = {Proc. 17th International Conference on Principles of Distributed Systems (OPODIS)},
month = {December},
year = {2013},
}
2012
A Resource Description Language with Vagueness Support for Multi-Provider Cloud
Networks
Gregor Schaffrath, Stefan Schmid, Ishan Vaishnavi, Ashiq Khan, Anja Feldmann
Proc. International Conference on Computer Communication Networks (ICCCN), 2012
@inproceedings{icccn12ste,
author = {Gregor Schaffrath and Stefan Schmid and Ishan Vaishnavi and Ashiq Khan and Anja Feldmann},
title = {A Resource Description Language with Vagueness Support for Multi-Provider Cloud
Networks},
booktitle = {Proc. International Conference on Computer Communication Networks (ICCCN)},
year = 2012,
}
Boosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading
Raphael Eidenbenz, Thomas Locher, Stefan Schmid, Roger Wattenhofer
Proc. 12th IEEE International Conference on Peer-to-Peer Computing (P2P), 2012
@inproceedings{p2p12ste,
author = {Raphael Eidenbenz and Thomas Locher and Stefan Schmid and Roger Wattenhofer},
title = {Boosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading},
booktitle = {Proc. 12th IEEE International Conference on Peer-to-Peer Computing (P2P)},
year = 2012,
}
Brief Announcement: Do VNet Embeddings Reveal ISP Topology?
Yvonne Anne Pignolet, Stefan Schmid, Gilles Tredan
Proc. 26th International Symposium on Distributed Computing (DISC), 2012
@inproceedings{disc12ba1,
author = {Yvonne Anne Pignolet and Stefan Schmid and Gilles Tredan},
title = {Brief Announcement: Do VNet Embeddings Reveal ISP Topology?},
booktitle = {Proc. 26th International Symposium on Distributed Computing (DISC)},
year = 2012,
}
Brief Announcement: SplayNets (Towards Self-Adjusting Distributed Data Structures)
Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler
Proc. 26th International Symposium on Distributed Computing (DISC), 2012
@inproceedings{disc12ba2,
author = {Stefan Schmid and Chen Avin and Christian Scheideler and Bernhard Haeupler},
title = {Brief Announcement: SplayNets (Towards Self-Adjusting Distributed Data Structures)},
booktitle = {Proc. 26th International Symposium on Distributed Computing (DISC)},
year = 2012,
}
@article{ercim12ste,
Title = {CloudNets: Combining Clouds with Networking},
Author = {Feldmann, Anja and Schaffrath, Gregor and Schmid, Stefan},
Pages = {56�57},
Year = {2012},
Issn = {0926-4981},
Journal = {ERCIM News},
Number = {88},
Month = {January},
Abstract = {In the future, Internet Service Providers (ISP) may offer on-demand, flexible
virtual networks connecting different locations and heterogeneous cloud resources with Quality of Service (QoS)
connectivity guarantees (such as maximal latency or minimal bandwidth).},
}
Competitive and Deterministic Embeddings of Virtual Networks
Guy Even, Moti Medina, Gregor Schaffrath, Stefan Schmid
13th International Conference on Distributed Computing and
Networking (ICDCN), 2012
@inproceedings{icdcn12ste,
author = {Even, Guy and Medina, Moti and Schaffrath, Gregor and
Schmid, Stefan},
title = {Competitive and Deterministic Embeddings of Virtual Networks},
booktitle = {13th International Conference on Distributed Computing and
Networking (ICDCN)},
location = {Hong Kong, China},
year = 2012,
abstract = {Network virtualization is an important concept to overcome
the ossification of today's Internet as if facilitates innovation
also in the network core and as it promises a more efficient
use of the given resources and infrastructure. Virtual networks
(VNets) provide an abstraction of the physical network: multiple
VNets may cohabit the same physical network, but can be based on
completely different protocol stacks (also beyond IP). One of the
main challenges in network virtualization is the efficient admission
control and embedding of VNets. The demand for virtual networks
(e.g., for a video conference) can be hard to predict, and once the
request is accepted, the specification / QoS guarantees must be
ensured throughout the VNet�s lifetime. This requires an admission
control algorithm which only selects high-benefit VNets in times
of scarce resources, and an embedding algorithm which realizes the
VNet in such a way that the likelihood that future requests can be
embedded as well is maximized.
This paper describes a generic algorithm for the online VNet
embedding problem which does not rely on any knowledge of the
future VNet requests but whose performance is competitive to an
optimal offline algorithm that has complete knowledge of the request
sequence in advance: the so-called competitive ratio is, loosely
speaking, logarithmic in the sum of the resources. Our algorithm
is generic in the sense that it supports multiple traffic models,
multiple routing models, and even allows for nonuniform benefits
and durations of VNet requests. Concretely, the routing models
considered in this paper include: multipaths, single paths, and tree
routing. For modeling traffic, we study the customer-pipe model, the
hose model, and a new traffic model, called {\it aggregate ingress
model}, that is well suited for modeling multicasts and multi-party
video conferences.},
}
Competitive and Fair Throughput for Co-Existing Networks
Under Adversarial Interference
Andréa Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
Proc. 31st Annual ACM Symposium on Principles of Distributed
Computing (PODC), 2012
@inproceedings{podc12ste,
author = {Richa, Andr{\'e}a and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin},
title = {Competitive and Fair Throughput for Co-Existing Networks
Under Adversarial Interference},
booktitle = {Proc. 31st Annual ACM Symposium on Principles of Distributed
Computing (PODC)},
year = 2012,
}
On the Benefit of Collocation in Virtual Network Embeddings (Short Paper)
Carlo Fuerst, Stefan Schmid, Anja Feldmann
Proc. 1st IEEE International Conference on Cloud Networking (CLOUDNET), 2012
BibTeX
@inproceedings{cloudnet12,
author = {Carlo Fuerst and Stefan Schmid and Anja Feldmann},
title = {On the Benefit of Collocation in Virtual Network Embeddings (Short Paper)},
booktitle = {Proc. 1st IEEE International Conference on Cloud Networking (CLOUDNET)},
year = 2012,
}
Optimizing Long-Lived CloudNets with Migrations
Gregor Schaffrath, Stefan Schmid, Anja Feldmann
Proc. 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), 2012
@inproceedings{ucc12mip,
author = {Gregor Schaffrath and Stefan Schmid and Anja Feldmann},
title = {Optimizing Long-Lived CloudNets with Migrations},
booktitle = {Proc. 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC)},
year = 2012,
}
Poster: Impact of FIB Aggregation on Traffic Offloading
Nadi Sarrar, Stefan Schmid, Steve
Uhlig, Anja Feldmann
9th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2012
@inproceedings{nsdi12ste,
author = {Nadi Sarrar and Stefan Schmid and Steve
Uhlig and Anja Feldmann},
title = {Poster: Impact of FIB Aggregation on Traffic Offloading},
booktitle = {9th USENIX Symposium on Networked Systems Design and Implementation (NSDI)},
year = 2012,
}
The Price of Specificity in the Age of Network Virtualization (Short Paper)
Arne Ludwig, Stefan Schmid, Anja Feldmann
Proc. 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC), 2012
BibTeX
@inproceedings{ucc12pos,
author = {Arne Ludwig and Stefan Schmid and Anja Feldmann},
title = {The Price of Specificity in the Age of Network Virtualization (Short Paper)},
booktitle = {Proc. 5th IEEE/ACM International Conference on Utility and Cloud Computing (UCC)},
year = 2012,
}
Towards Higher-Dimensional Topological Self-Stabilization: A Distributed
Algorithm for Delaunay Graphs
Riko Jacob, Stephan Ritscher, Christian
Scheideler, Stefan Schmid
@article{tcs12ss,
author = {Riko Jacob and Stephan Ritscher and Christian
Scheideler and Stefan Schmid},
title = {Towards Higher-Dimensional Topological Self-Stabilization: A Distributed
Algorithm for Delaunay Graphs},
Journal = {Elsevier Theoretical Computer Science
(TCS)},
volume = {457},
Year = {2012}
}
Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google$+$
Doris Schioeberg, Fabian Schneider, Harald Schioeberg, Stefan Schmid, Steve
Uhlig, Anja Feldmann
@inproceedings{websci12ste,
author = {Doris Schioeberg and Fabian Schneider and Harald Schioeberg and Stefan Schmid and Steve
Uhlig and Anja Feldmann},
title = {Tracing the Birth of an OSN: Social Graph and Profile Analysis in Google$+$},
booktitle = {ACM Web Science (WebSci)},
location = {Evanston, Illinois},
year = 2012,
}
2011
Competitive and Fair Medium Access despite Reactive Jamming
Andréa Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
Proc. 31st International Conference on Distributed
Computing Systems (ICDCS), 2011
@inproceedings{icdcs11ste,
author = {Richa, Andr{\'e}a and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin},
title = {Competitive and Fair Medium Access despite Reactive Jamming},
booktitle = {Proc. 31st International Conference on Distributed
Computing Systems (ICDCS)},
OPTlocation = {Minneapolis, MN, USA},
year = 2011,
organization = {IEEE ComSco},
publisher = {IEEE},
address = {New York, NY, USA},
month = {June},
abstract = {Intentional interference constitutes a major threat
for communication networks operating over a shared medium where
availability is imperative. Jamming attacks are often simple and
cheap to implement. Today's jammers can perform physical carrier
sensing in order to disrupt communication more efficiently,
especially in a network of simple wireless devices such as
sensor nodes, which usually operate over a single frequency (or
a limited frequency band) and which cannot benefit from the use
of spread spectrum or other more advanced technologies. This
paper proposes the medium access (MAC) protocol ANTIJAM which is
provably robust against a powerful reactive adversary who can jam
a (1-$\varepsilon$)-portion of the time steps, where $\varepsilon$
is an arbitrary constant. The adversary uses carrier sensing to
make informed decisions on when it is most harmful to disrupt
communications. Moreover, we allow the adversary to be adaptive
and to have complete knowledge of the entire protocol history.
Our MAC protocol is able to make efficient use of the nonjammed
time periods and achieves a $\Theta$(1)-competitive throughput in
this harsh scenario, if $\varepsilon$ is constant. In addition,
ANTIJAM features a low convergence time and has excellent fairness
properties in the sense that channel access probabilities among
nodes do not differ by more than a small constant factor.},
}
Cost and Complexity of Harnessing Games with Payments
Raphael Eidenbenz, Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer
@article{igtr11ste,
author = {Eidenbenz, Raphael and Pignolet, Yvonne Anne and Schmid, Stefan
and Wattenhofer, Roger},
title = {Cost and Complexity of Harnessing Games with Payments},
journal = {International Game Theory Review},
year = 2011,
toappear = 1,
publisher = {World Scientific},
volume = 13,
number = 1,
abstract = {This article studies how a mechanism designer can
influence games by promising payments to the players depending
on their mutual choice of strategies. First, we investigate the
cost of implementing a desirable behavior and present algorithms
to compute this cost. Whereas a mechanism designer can decide
efficiently whether strategy profiles can be implemented at no cost
at all our complexity analysis indicates that computing an optimal
implementation is generally {\bf NP}-hard.
Second, we introduce and analyze the concept of {\it leverage} in
a game. The leverage captures the benefits that a benevolent or a
malicious mechanism designer can achieve by implementing a certain
strategy profile region within economic reason, i.e., by taking the
implementation cost into account. Mechanism designers can often
manipulate games and change the social welfare by a larger extent
than the amount of money invested. Unfortunately, computing the
leverage turns out to be intractable as well in the general case.},
}
eDonkey and eMule's Kad: Measurements and Attacks
Thomas Locher, Stefan Schmid, Roger Wattenhofer
Fundamenta Informaticae, 2011
BibTeX
@article{fi11ste,
author = {Locher, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {eDonkey and eMule's Kad: Measurements and Attacks},
journal = {Fundamenta Informaticae},
year = 2011,
volume = 109,
number = 4,
pages = {383--403},
organization = {Polish Mathematical Society},
publisher = {IOS Press},
abstract = {This article reports on the results of our measurement
study of the Kad network. Although several fully decentralized
peer-to-peer systems have been proposed in the literature, most
existing systems still employ a centralized architecture. The Kad
network is a notable exception. Since the demise of the Overnet
network, the Kad network has become the most popular peer-to-peer
system based on a distributed hash table. It is likely that its user
base will continue to grow in numbers over the next few years due to
the system's scalability and reliability.
The contribution of the article is twofold. First, we compare the
two networks accessed by eMule: the centralized paradigm of the
eDonkey network and the structured, distributed approach pursued
by the Kad network. We re-engineer the eDonkey server software
and integrate two modified servers into the eDonkey network in
order to monitor traffic. Additionally, we implement a Kad client
exploiting a design weakness to spy on the traffic at arbitrary
locations in the ID space. The collected data provides insights
into the spacial and temporal distributions of the peers' activity.
Moreover, it allows us to study the searched content. The article
also discusses problems related to the collection of such data sets
and investigates techniques to verify the representativeness of the
measured data.
Second, this article shows that today's Kad network can be attacked
in several ways. Our simple attacks could be used either to hamper
the correct functioning of the network itself, to censor content, or
to harm other entities in the Internet not participating in the Kad
network, such as ordinary web servers. While there are heuristics to
improve the robustness of Kad, we believe that the attacks cannot be
thwarted easily in a fully decentralized peer-to-peer system, i.e.,
without some kind of a centralized certification and verification
authority. This result may be relevant in the context of the current
debate on the design of a clean-slate network architecture for the
Internet which is based on concepts known from the peer-to-peer
paradigm.},
}
Misleading Stars: What Cannot Be Measured in the Internet?
Yvonne Anne Pignolet, Gilles Trédan, Stefan Schmid
Proc. 25th International Symposium on
Distributed Computing (DISC), 2011
@inproceedings{disc11ste,
author = {Pignolet, Yvonne Anne and Tr{\'e}dan, Gilles and Schmid, Stefan},
title = {Misleading Stars: What Cannot Be Measured in the Internet?},
booktitle = {Proc. 25th International Symposium on
Distributed Computing (DISC)},
location = {Rome, Italy},
year = 2011,
editor = {David Peleg},
abstract = {Traceroute measurements are one of our main instruments
to shed light onto the structure and properties of today's complex
networks such as the Internet. This paper studies the feasibility
and infeasibility of inferring the network topology given traceroute
data from a worst-case perspective, i.e., without any probabilistic
assumptions on, e.g., the nodes' degree distribution. We attend to
a scenario where some of the routers are anonymous, and propose
two fundamental axioms that model two basic assumptions on the
traceroute data: (1) each trace corresponds to a real path in the
network, and (2) the routing paths are at most a factor 1/$\alpha$
off the shortest paths, for some parameter $\alpha$ $\in$ (0, 1]. In
contrast to existing literature that focuses on the cardinality of
the set of (often only minimal) inferrable topologies, we argue that
a large number of possible topologies alone is often unproblematic,
as long as the networks have a similar structure. We hence seek
to characterize the set of topologies inferred with our axioms.
We introduce the notion of star graphs whose colorings capture
the differences among inferred topologies; it also allows us to
construct inferred topologies explicitly. We find that in general,
inferrable topologies can differ significantly in many important
aspects, such as the nodes' distances or the number of triangles.
These negative results are complemented by a discussion of a
scenario where the trace set is best possible, i.e., ''complete''. It
turns out that while some properties such as the node degrees are
still hard to measure, a complete trace set can help to determine
global properties such as the connectivity.")"},
}
On the Benefit of Virtualization: Strategies for Flexible Server
Allocation
Dushyant Arora, Anja Feldmann, Gregor Schaffrath, Stefan Schmid
Proc. USENIX Workshop on Hot Topics in Management of
Internet, Cloud, and Enterprise Networks and Services (Hot-ICE), 2011
@inproceedings{hotice11ste,
author = {Arora, Dushyant and Feldmann, Anja and Schaffrath, Gregor and
Schmid, Stefan},
title = {On the Benefit of Virtualization: Strategies for Flexible Server
Allocation},
booktitle = {Proc. USENIX Workshop on Hot Topics in Management of
Internet, Cloud, and Enterprise Networks and Services (Hot-ICE)},
location = {Boston, MA, USA},
year = 2011,
abstract = {Virtualization technology facilitates a dynamic,
demand-driven allocation and migration of servers. This paper
studies how the flexibility offered by network virtualization can
be used to improve Quality-of-Service parameters such as latency,
while taking into account allocation costs. A generic use case
is considered where both the overall demand issued for a certain
service (for example, an SAP application in the cloud, or a gaming
application) as well as the origins of the requests change over
time (e.g., due to time zone effects or due to user mobility),
and we present online and optimal offline strategies to compute
the number and location of the servers implementing this service.
These algorithms also allow us to study the fundamental benefits
of dynamic resource allocation compared to static systems. Our
simulation results confirm our expectations that the gain of
flexible server allocation is particularly high in scenarios with
moderate dynamics.},
}
Online Strategies for Intra and Inter Provider Service
Migration in Virtual Networks
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, Gregor Schaffrath, Stefan Schmid
Proc. Principles, Systems and Applications
of IP Telecommunications (IPTComm), 2011
@inproceedings{iptcomm11ste,
author = {Arora, Dushyant and Bienkowski, Marcin and Feldmann, Anja and
Schaffrath, Gregor and Schmid, Stefan},
title = {Online Strategies for Intra and Inter Provider Service
Migration in Virtual Networks},
booktitle = {Proc. Principles, Systems and Applications
of IP Telecommunications (IPTComm)},
location = {Chicago, IL, USA},
year = 2011,
abstract = {Network virtualization allows one to build dynamic
distributed systems in which resources can be dynamically allocated
at locations where they are most useful. In order to fully exploit
the benefits of this new technology, protocols need to be devised
which react efficiently to changes in the demand. This paper argues
that the field of online algorithms and competitive analysis
provides useful tools to deal with and reason about the uncertainty
in the request dynamics, and to design algorithms with provable
performance guarantees.
As a case study, we describe a system (e.g., a gaming application)
where network virtualization is used to support thin client
applications for mobile devices to improve their QoS. By decoupling
the service from the underlying resource infrastructure, it can be
migrated closer to the current client locations while taking into
account migration cost. This paper identifies the major cost factors
in such a system, and formalizes the corresponding optimization
problem. Both randomized and deterministic, gravity center based
online algorithms are presented which achieve a good tradeoff
between improved QoS and migration cost in the worst-case, both for
service migration within an infrastructure provider as well as for
networks supporting cross-provider migration. The paper reports on
our simulation results and also presents an explicit construction
of an optimal offline algorithm which allows, e.g., to evaluate the
competitive ratio empirically.},
}
Peer-to-Peer
Stefan Schmid, Roger Wattenhofer
Encyclopedia of Parallel Computing, 2011
BibTeX
@inCollection{enc11ste,
author = {Schmid, Stefan and Wattenhofer, Roger},
editor = {Padua, David},
booktitle = {Encyclopedia of Parallel Computing},
title = {Peer-to-Peer},
publisher = {Springer},
year = 2011,
}
Self-Stabilizing Leader Election for Single-Hop Wireless Networks
Despite Jamming
Andréa Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
Proc. 12th ACM International Symposium on Mobile
Ad Hoc Networking and Computing (MobiHoc), 2011
@inproceedings{mobihoc11ste,
author = {Richa, Andr{\'e}a and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin},
title = {Self-Stabilizing Leader Election for Single-Hop Wireless Networks
Despite Jamming},
booktitle = {Proc. 12th ACM International Symposium on Mobile
Ad Hoc Networking and Computing (MobiHoc)},
location = {Paris, France},
year = 2011,
abstract = {Electing a leader is a fundamental task in distributed
computations. Many coordination problems, such as the access to a
shared resource, and the resulting inefficiencies, can be avoided by
relying on a leader. This paper presents SELECT, a leader election
protocol for wireless networks where nodes communicate over a
shared medium. SELECT is very robust in two respects. First, the
protocol is self-stabilizing in the sense that it converges to a
correct solution from any possible initial network state (e.g.,
where no or multiple nodes consider themselves a leader). This is
an appealing property, especially for dynamic networks. Second, the
described protocol is resilient against a powerful reactive jammer
that blocks a significant fraction of all communication rounds. The
reactive model is general and of interest beyond jamming (e.g., in
the context of co-existing networks). The paper also reports on
experimental results obtained from our simulation framework which
allows us to study convergence behavior under different types of
adversarial jammers.},
}
Topological Implications of Selfish Neighbor Selection in
Unstructured Peer-to-Peer Networks
Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
@Article{algo11ste,
author = {Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {Topological Implications of Selfish Neighbor Selection in
Unstructured Peer-to-Peer Networks},
journal = {Algorithmica},
year = 2011,
volume = 61,
number = 2,
pages = {419-446},
url = {http://www.net.t-labs.tu-berlin.de/papers/MSW-TIOSNSIUP2PN-11.pdf},
abstract = {Current peer-to-peer (P2P) systems often suffer from a
large fraction of freeriders not contributing any resources to the
network. Various mechanisms have been designed to overcome this
problem. However, the selfish behavior of peers has aspects which
go beyond resource sharing. This paper studies the effects on the
topology of a P2P network if peers selfishly select the peers to
connect to. In our model, a peer exploits locality properties in
order to minimize the latency (or response times) of its lookup
operations. At the same time, the peer aims at not having to
maintain links to too many other peers in the system. By giving
tight bounds on the price of anarchy, we show that the resulting
topologies can be much worse than if peers collaborated. Moreover,
the network may never stabilize, even in the absence of churn.
Finally, we establish the complexity of Nash equilibria in our game
theoretic model of P2P networks. Specifically, we prove that it is
NP-hard to decide whether our game has a Nash equilibrium and can
stabilize.},
}
Towards Jamming-Resistant and Competitive Medium Access in
the SINR Model
Andréa Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
@inproceedings{s311ste,
author = {Richa, Andr{\'e}a and Scheideler, Christian and Schmid, Stefan
and Zhang, Jin},
title = {Towards Jamming-Resistant and Competitive Medium Access in
the SINR Model},
booktitle = {Proc. 3rd Annual ACM S3 Workshop},
location = {Las Vegas, NA, USA},
year = 2011,
abstract = {The efficient coordination of medium access is arguably
one of the most relevant applications of distributed computing.
Recently, progress has been made in the design of robust medium
access (MAC) protocols that guarantee a competitive throughput
against a powerful jammer which can block the medium an arbitrary
constant fraction (1-$\epsilon$) of the time. These MAC protocols
exploit the remaining $\epsilon$-fraction optimally in the sense
that a significant part is used for successful transmissions.
However, so far these throughput guarantees only hold for rather
simplistic interference models such as Unit Disk Graphs. This paper
reports on our first insights on the design of a robust medium
access protocol SinrMac for the more realistic physical interference
model which takes into account the signal to interference plus noise
ratio (SINR) at the receiver. This model is more difficult, as
there is no longer an objective distinction of idling and busy time
periods which can be used to dynamically adjust the wireless nodes'
backoff periods. We discuss an approach that introduces individual
``idle/busy thresholds'' which are adapted dynamically and, unlike
the multiplicative backoff periods, in an {\it additive} manner. We
find that a reasonable convergence speed (and throughput) can be
achieved if there exists some meaningful upper bound $\tau$
on the noise level in the network; surprisingly, however, our first
simulation results indicate that adaptive changes of the idly/busy
thresholds do not yield a better throughput than static thresholds
set to $\tau$.},
}
2010
A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks
Andréa Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
24th International Symposium on Distributed Computing (DISC), 2010
@inproceedings{disc10ste,
author = {Richa, Andr{\'e}a and Scheideler, Christian and
Schmid, Stefan and Zhang, Jin},
title = {A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks},
booktitle = {24th International Symposium on Distributed Computing (DISC)},
location = {Cambridge, MA, USA},
year = 2010,
pages = {179--193},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = {6343},
abstract = {This paper presents a simple local medium access control
protocol, called Jade, for multi-hop wireless networks with a
single channel that is provably robust against adaptive adversarial
jamming. The wireless network is modeled as a unit disk graph on a
set of nodes distributed arbitrarily in the plane. In addition to
these nodes, there are adversarial jammers that know the protocol
and its entire history and that are allowed to jam the wireless
channel at any node for an arbitrary (1-$\epsilon$)-fraction of the
time steps, where 0<$\epsilon$<1 is an arbitrary constant. We assume
that the nodes cannot distinguish between jammed transmissions
and collisions of regular messages. Nevertheless, we show that
Jade achieves an asymptotically optimal throughput if there is a
sufficiently dense distribution of nodes.},
}
Brief Announcement: Towards Robust Medium Access in Multi-Hop
Networks
Andréa Richa, Christian Scheideler, Stefan Schmid, Jin Zhang
Proc. 29th Annual ACM SIGACT-SIGOPS Symposium
on Principles of Distributed Computing (PODC 2010), 2010
@inproceedings{podc10ste,
author = {Richa, Andr{\'e}a and Scheideler, Christian and
Schmid, Stefan and Zhang, Jin},
title = {Brief Announcement: Towards Robust Medium Access in Multi-Hop
Networks},
booktitle = {Proc. 29th Annual ACM SIGACT-SIGOPS Symposium
on Principles of Distributed Computing (PODC 2010)},
location = {Zurich, Switzerland},
year = 2010,
pages = {114--115},
publisher = {ACM},
address = {New York, NY, USA},
month = {July},
note = {Brief Announcement},
isbn = {978-1-60558-888-9},
url = {http://www.net.t-labs.tu-berlin.de/papers/RSSZ-TRMAMN-10.pdf},
abstract = {This paper presents the distributed and randomized Medium
Access Control protocol Jade for multi-hop wireless networks with
a single communication channel. Jade guarantees a high throughput
despite a powerful adversary that is able to jam (groups of) nodes
individually and during a (1-$\epsilon$)-fraction of the entire
time, where $\epsilon$>0 is an arbitrarily small constant. We
show that despite this harsh environment, Jade features a good
performance as nodes are able to exploit the few non- jammed slots
effectively.},
}
Competitive Analysis for Service Migration in VNets
Marcin Bienkowski, Anja Feldmann, Dan Jurca, Wolfgang Kellerer, Gregor Schaffrath, Stefan Schmid, Jörg Widmer
Proc. 2nd ACM SIGCOMM Workshop on Virtualized
Infrastructure Systems and Architectures (VISA), 2010
@inproceedings{visa10ste,
author = {Bienkowski, Marcin and Feldmann, Anja and Jurca, Dan and
Kellerer, Wolfgang and Schaffrath, Gregor and Schmid, Stefan and
Widmer, J{\"o}rg},
title = {Competitive Analysis for Service Migration in VNets},
booktitle = {Proc. 2nd ACM SIGCOMM Workshop on Virtualized
Infrastructure Systems and Architectures (VISA)},
location = {New Delhi, India},
year = 2010,
pages = {17--24},
abstract = {Network virtualization promises a high flexibility by
decoupling services from the underlying substrate network and
allowing the virtual network to adapt to the needs of the service,
e.g., by migrating servers or/and parts of the network. We study a
system (e.g., a gaming application) where network virtualization
is used to support thin client applications for mobile devices to
improve their QoS. To deal with the dynamics of both the mobile
clients as well as the ability to migrate services closer to the
client location we advocate, in this paper, the use of competitive
analysis. After identifying the parameters that characterize the
cost-benefit tradeoff for this kind of application we propose an
online migration strategy. The strength of the strategy is that it
is robust with regards to any arbitrary request access pattern. In
particular, it is close to the optimal offline algorithm that knows
the access pattern in advance.
In this paper we present both an optimal offline algorithm based on
dynamic programming techniques to find the best migration paths for
a given request sequence, and a {\it O($\mu;$log n)}-competitive
migration strategy Mig where $\mu$ is the ratio between maximal and
minimal link capacity in the substrate network for a simplified
model. This is almost optimal for small $\mu;$, as we also show that
there are networks where no online algorithm can achieve a ratio
below {\it $\Omega$(log n/log log n)}. In contrast, the optimal
solution without migration can only achieve a competitive ratio that
is linear in the network diameter. Our simulations indicate that the
competitive ratio of Mig is robust to the network size, and that the
ratio is small if the request},
}
Event Extent Estimation
Marcin Bienkowski, Leszek Gasieniec, Marek Klonowski, Miroslaw Korzeniowski, Stefan Schmid
Proc. 17th International Colloquium on
Structural Information and Communication Complexity (SIROCCO), 2010
@InProceedings{sirocco10stefan2,
author = {Bienkowski, Marcin and Gasieniec, Leszek and
Klonowski, Marek and Korzeniowski, Miroslaw and Schmid, Stefan},
title = {Event Extent Estimation},
booktitle = {Proc. 17th International Colloquium on
Structural Information and Communication Complexity (SIROCCO)},
year = 2010,
series = {Lecture Notes in Computer Science (LNCS)},
number = {6058},
editor = {Patt-Schamir, Boaz and Ekim, Tinaz},
pages = {57--71},
month = {June},
isbn = {978-3-642-13283-4},
abstract = {This paper studies local-control strategies to estimate
the size of a certain event affecting an arbitrary connected subset
of the nodes in a network. For example, our algorithms allow
nodes in a peer-to-peer system to explore the remaining connected
components after a Denial-of-Service attack, or nodes in a sensor
network to assess the magnitude of a certain environmental event.
In our model, each node can keep some extra information about its
neighborhood computed during the deployment phase of the network. On
the arrival of the event, the goal of the active nodes is to learn
the network topology induced by the event, without the help of the
remaining nodes. This paper studies the tradeoffs between message
and time complexity of possible distributed solutions.},
}
Online Function Tracking with Generalized Penalties
Marcin Bienkowski, Stefan Schmid
Proc. 12th Scandinavian Symposium and Workshops
on Algorithm Theory (SWAT 2010), 2010
@InProceedings{swat10ste,
author = {Bienkowski, Marcin and Schmid, Stefan},
title = {Online Function Tracking with Generalized Penalties},
booktitle = {Proc. 12th Scandinavian Symposium and Workshops
on Algorithm Theory (SWAT 2010)},
location = {Bergen, Norway},
year = 2010,
pages = {359--370},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = {6139},
month = {June},
isbn = {978-3-642-13730-3},
url = {http://www.net.t-labs.tu-berlin.de/papers/BS-OFTWGP-10.pdf},
abstract = {We attend to the classic setting where an observer needs
to inform a tracker about an arbitrary time varying function {\it
f:N_0-->Z}. This is an optimization problem, where both wrong
values at the tracker and sending updates entail a certain cost.
We consider an online variant of this problem, i.e., at time {\it
t}, the observer only knows {\it f(t')} for all {\it t'=<t}. In
this paper, we generalize existing cost models (with an emphasis on
concave and convex penalties) and present two online algorithms. Our
analysis shows that these algorithms perform well in a large class
of models, and are even optimal in some settings.},
}
Poisoning the Kad Network
Thomas Locher, David Mysicka, Stefan Schmid, Roger Wattenhofer
11th International Conference on Distributed Computing
and Networking (ICDCN), 2010
@InProceedings{icdcn10ste,
author = {Locher, Thomas and Mysicka, David and
Schmid, Stefan and Wattenhofer, Roger},
title = {Poisoning the Kad Network},
booktitle = {11th International Conference on Distributed Computing
and Networking (ICDCN)},
location = {Kolkata, India},
pages = {195-206},
isbn = {978-3-642-11321-5},
doi = {http://dx.doi.org/10.1007/978-3-642-11322-2_22},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 5935,
ISSN = {0302-9743},
eissn = {1611-3349},
month = {January},
year = 2010,
url = {http://www.net.t-labs.tu-berlin.de/papers/LMSW-PKN-10.pdf},
abstract = {Since the demise of the Overnet network, the Kad network
has become not only the most popular but also the only widely
used peer-to-peer system based on a distributed hash table. It is
likely that its user base will continue to grow in numbers over the
next few years as, unlike the eDonkey network, it does not depend
on central servers, which increases scalability and reliability.
Moreover, the Kad network is more efficient than unstructured
systems such as Gnutella. However, we show that today's Kad network
can be attacked in several ways by carrying out several (well-known)
attacks on the Kad network. The presented attacks could be used
either to hamper the correct functioning of the network itself,
to censor contents, or to harm other entities in the Internet not
participating in the Kad network such as ordinary web servers. While
there are simple heuristics to reduce the impact of some of the
attacks, we believe that the presented attacks cannot be thwarted
easily in any fully decentralized peer-to-peer system without some
kind of a centralized certification and verification authority.},
}
Robust Architectures for Open Distributed Systems and
Topological Self-Stabilization (Invited Paper)
Stefan Schmid
Proc. 3rd ACM SIGOPS/SIGACT Workshop on
Reliability, Availability, and Security (WRAS), 2010
BibTeX
@inproceedings{wras10ste,
author = {Schmid, Stefan},
title = {Robust Architectures for Open Distributed Systems and
Topological Self-Stabilization (Invited Paper)},
booktitle = {Proc. 3rd ACM SIGOPS/SIGACT Workshop on
Reliability, Availability, and Security (WRAS)},
location = {Zurich, Switzerland},
year = 2010,
month = {July},
note = {Invited Paper},
abstract = {Distributed systems are often dynamic in the sense
that there are frequent membership changes (nodes joining and
leaving the network), either due to regular churn or due to an
attack. Maintaining availability and full functionality of such
a system under continuous topological changes hence constitutes
an important algorithmic challenge. This paper reports on some of
our recent results on robust distributed systems. We review two
randomized architectures that build upon the continuous-discrete
approach by Naor and Wieder, namely the {\it SHELL network} which
allows for fast joins and leaves and organizes more reliable (or
stronger) nodes in a core network where their communication is
not affected by malicious (or weak) nodes, and the {\it Chameleon
network} whose replica placement strategy and whose intentional
topological updates ensure resiliency against denial-of-service
attacks, even from past insiders. To complement our investigations
on randomized architectures, we discuss algorithms to maintain
hypercubic networks under worstcase churn. Finally, we advocate the
design of self-stabilizing topologies---a very appealing and still
not well-understood notion of robustness---that converge quickly
to a desirable structure from arbitrarily degenerated states. As
a use case, graph linearization is examined in more detail. This
invited paper complements the WRAS talk and is joint work with
Matthias Baumgart, Dominik Gall, Riko Jacob, Fabian Kuhn, Andrea
Richa, Stephan Ritscher, Christian Scheideler, Joest Smit, Hanjo
T{\"a}ubig, and Roger Wattenhofer.},
}
Tight Bounds for Delay-Sensitive Aggregation
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer
Discrete Mathematics and Theoretical Computer Science Journal, 2010
@Article{dmtcs10ste,
author = {Pignolet, Yvonne Anne and Schmid, Stefan and Wattenhofer, Roger},
title = {Tight Bounds for Delay-Sensitive Aggregation},
journal = {Discrete Mathematics and Theoretical Computer Science Journal},
year = 2010,
volume = 12,
number = 1,
pages = {39--58},
ISSN = {1365-8050},
abstract = {This article studies the fundamental trade-off between
delay and communication cost in networks. We consider an online
optimization problem where nodes are organized in a tree topology.
The nodes seek to minimize the time until the root is informed about
the changes of their states and to use as few transmissions as
possible. We derive an upper bound on the competitive ratio of {\it
O(min(h,c))} where {\it h} is the tree's height, and {\it c} is the
transmission cost per edge. Moreover, we prove that this upper bound
is tight in the sense that any oblivious algorithm has a ratio of at
least {\it $\Omega$(min(h,c))}. For chain networks, we prove a tight
competitive ratio of {\it $\Theta$(min(radic(h),c))}. Furthermore,
we introduce a model for value-sensitive aggregation, where the cost
depends on the number of transmissions and the error at the root.},
}
Time Complexity of Distributed Topological
Self-Stabilization: The Case of Graph Linearization
Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
Proc. 9th Latin American Theoretical Informatics
Symposium (LATIN), 2010
@InProceedings{latin10ste,
author = {Gall, Dominik and Jacob, Riko and Richa, Andr{\'e}a and
Scheideler, Christian and Schmid, Stefan and T{\"a}ubig, Hanjo},
title = {Time Complexity of Distributed Topological
Self-Stabilization: The Case of Graph Linearization},
booktitle = {Proc. 9th Latin American Theoretical Informatics
Symposium (LATIN)},
location = {Oaxaca, Mexico},
year = 2010,
pages = {294--305},
publisher = {Springer},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 6034,
address = {Berlin / Heidelberg, Germany},
month = {April},
isbn = {978-3-642-12199-9},
doi = {http://dx.doi.org/10.1007/978-3-642-12200-2_27},
abstract = {Topological self-stabilization is an important concept
to build robust open distributed systems (such as peer-to-peer
systems) where nodes can organize themselves into meaningful network
topologies. The goal is to devise distributed algorithms that
converge quickly to such a desirable topology, independently of the
initial network state. This paper proposes a new model to study the
parallel convergence time. Our model sheds light on the achievable
parallelism by avoiding bottlenecks of existing models that can
yield a distorted picture. As a case study, we consider local graph
linearization--i.e., how to build a sorted list of the nodes of a
connected graph in a distributed and self-stabilizing manner. We
propose two variants of a simple algorithm, and provide an extensive
formal analysis of their worst-case and best-case parallel time
complexities, as well as their performance under a greedy selection
of the actions to be executed.},
}
Towards Network Games with Social Preferences
Petr Kuznetsov, Stefan Schmid
Proc. 17th International Colloquium on
Structural Information and Communication Complexity (SIROCCO), 2010
@InProceedings{sirocco10ste,
author = {Kuznetsov, Petr and Schmid, Stefan},
title = {Towards Network Games with Social Preferences},
booktitle = {Proc. 17th International Colloquium on
Structural Information and Communication Complexity (SIROCCO)},
location = {Sirinice, Turkey},
year = 2010,
series = {Lecture Notes of Computer Science},
number = {6058},
editor = {Patt-Schamir, Boaz and Ekim, Tinaz},
pages = {14--28},
OPTorganization = {},
publisher = {Springer},
address = {Berlin, Heidelberg, New York},
month = {June},
note = {See also arXiv TechReport No. 1001.5134.},
OPTkey = {},
issn = {0302-9743},
eISSN = {1611-3349},
isbn = {978-3-642-13283-4},
doi = {http://dx.doi.org/10.1007/978-3-642-13284-1_3},
url = {http://www.net.t-labs.tu-berlin.de/papers/KS-TNGWSP-10.pdf},
OPTurl = {},
abstract = {Many distributed systems can be modeled as network games:
a collection of {\it selfish} players that communicate in order to
maximize their individual utilities. The performance of such games
can be evaluated through the costs of the system {\it equilibria}:
the system states in which no player can increase her utility by
unilaterally changing her behavior. However, assuming that all
players are selfish and in particular that all players have the
same utility function may not always be appropriate. Hence, several
extensions to incorporate also altruistic and malicious behavior
in addition to selfishness have been proposed over the last years.
In this paper, we seek to go one step further and study arbitrary
relationships between participants. In particular, we introduce the
notion of the {\it social range matrix} and explore the effects of
the social range matrix on the equilibria in a network game. In
order to derive concrete results, we propose a simplistic network
creation game that captures the effect of social relationships among
players.},
}
Towards Worst-Case Churn Resistant Peer-to-Peer Systems
@Article{dc10ste,
author = {Kuhn, Fabian and Schmid, Stefan and Wattenhofer, Roger},
title = {Towards Worst-Case Churn Resistant Peer-to-Peer Systems},
journal = {Distributed Computing Journal (DC)},
year = 2010,
month = {May},
publisher = {Springer},
volume = {22},
number = {4},
pages = {249--267},
url = {http://www.net.t-labs.tu-berlin.de/papers/KSW-TWCCRP2PS-10.pdf},
abstract = {Until now, the analysis of fault tolerance of peer-to-peer
systems usually only covers random faults of some kind. Contrary
to traditional algorithmic research, faults as well as joins and
leaves occurring in a worst-case manner are hardly considered. In
this article, we devise techniques to build dynamic peer-to-peer
systems which remain fully functional in spite of an adversary who
continuously adds and removes peers. We exemplify our algorithms
on hypercube and pancake topologies and present a system which
maintains small peer degree and network diameter.},
}
2009
A Distributed and Oblivious Heap
Christian Scheideler, Stefan Schmid
36th International Colloquium on Automata, Languages and
Programming (ICALP), 2009
@InProceedings{icalp09ste,
author = {Scheideler, Christian and Schmid, Stefan},
title = {A Distributed and Oblivious Heap},
booktitle = {36th International Colloquium on Automata, Languages and
Programming (ICALP)},
location = {Rhodes, Greece},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 5556,
pages = {571--582},
isbn = {978-3-642-02929-5},
issn = {0302-9743},
eISSN = {1611-3349},
doi = {http://dx.doi.org/10.1007/978-3-642-02930-1_47},
month = {July},
year = 2009,
url = {http://www.net.t-labs.tu-berlin.de/papers/SS-DOH-09.pdf},
abstract = {This paper shows how to build and maintain a distributed
heap which we call SHELL. In contrast to standard heaps, our heap is
oblivious in the sense that its structure only depends on the nodes
currently in the network but not on the past. This allows for fast
join and leave operations which is desirable in open distributed
systems with high levels of churn and frequent faults. In fact,
a node fault or departure can be fixed in SHELL in a constant
number of communication rounds, which significantly improves the
best previous bound for distributed heaps. SHELL has interesting
applications. First, we describe a robust distributed information
system which is resilient to Sybil attacks of arbitrary scale.
Second, we show how to organize heterogeneous nodes of arbitrary
non-uniform capabilities in an overlay network such that the paths
between any two nodes do not include nodes of lower capacities. This
property is useful, e.g., for streaming. All these features can be
achieved without sacrificing scalability: our heap has a de Bruijn
like topology with node degree {\it O(log^2 n)} and network diameter
{\it O(log n)}, {\it n} being the total number of nodes in the
system.},
}
A DoS-Resilient Information System for Dynamic Data Management
Matthias Baumgart, Christian Scheideler, Stefan Schmid
21st ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA), 2009
@InProceedings{spaa09ste,
author = {Baumgart, Matthias and Scheideler, Christian and Schmid, Stefan},
title = {A DoS-Resilient Information System for Dynamic Data Management},
booktitle = {21st ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)},
location = {Calgary, Alberta, Canada},
month = {August},
year = 2009,
url = {http://www.net.t-labs.tu-berlin.de/papers/BSS-DRISDDM-09.pdf},
pages = {300--309},
isbn = {978-1-60558-606-9},
doi = {http://dx.doi.org/10.1145/1583991.1584064},
abstract = {Denial of service (DoS) attacks are arguably one of the
most cumbersome problems in the Internet. This paper presents a
distributed information system (over a set of completely connected
servers) called Chameleon which is robust to DoS attacks on the
nodes as well as the operations of the system. In particular, it
allows nodes to efficiently look up and insert data items at any
time, despite a powerful ``past-insider adversary'' which has
complete knowledge of the system up to some time point t0 and can
use that knowledge in order to block a constant fraction of the
nodes and inject lookup and insert requests to selected data. This
is achieved with a smart randomized replication policy requiring a
polylogarithmic overhead only and the interplay of a permanent and a
temporary distributed hash table. All requests in Chameleon can be
processed in polylog-arithmic time and work at every node.},
}
A Peer Activity Study in eDonkey and Kad
Thomas Locher, David Mysicka, Stefan Schmid, Roger Wattenhofer
International Workshop on Dynamic Networks: Algorithms
and Security (DYNAS), 2009
@InProceedings{dynas09ste,
author = {Locher, Thomas and Mysicka, David and Schmid, Stefan and
Wattenhofer, Roger},
title = {A Peer Activity Study in eDonkey and Kad},
booktitle = {International Workshop on Dynamic Networks: Algorithms
and Security (DYNAS)},
location = {Wroclaw, Poland},
month = {Sepbember},
year = 2009,
note = {Invited Paper},
url = {http://www.net.t-labs.tu-berlin.de/papers/LMSW-PASEK-09.pdf},
abstract = {Although several fully decentralized peer-to-peer systems
have been proposed in the literature, most existing systems still
employ a centralized architecture. In order to compare these two
paradigms, as a case study, we conduct measurements in the eDonkey
and the Kad network—two of the most popular peer-to-peer
systems in use today. We reengineered the eDonkey server software
and integrated two modified servers into the eDonkey network in
order to monitor traffic. Additionally, we implemented a Kad client
exploiting a design weakness to spy on the traffic at arbitrary
locations in the ID space. The goal of this study is to provide
insight into the spacial and temporal distributions of the peers'
activities and also examine the searched contents. Finally, we
discuss problems related to the collection of such data sets and
investigate techniques to verify the representativeness of the
measured data.},
}
A Polylogarithmic Time Algorithm for Distributed
Self-Stabilizing Skip Graphs
Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
28th ACM Symposium on Principles of Distributed Computing
(PODC), 2009
@InProceedings{podc09ste,
author = {Jacob, Riko and Richa, Andr{\'e}a and Scheideler, Christian and
Schmid, Stefan and T{\"a}ubig, Hanjo},
title = {A Polylogarithmic Time Algorithm for Distributed
Self-Stabilizing Skip Graphs},
booktitle = {28th ACM Symposium on Principles of Distributed Computing
(PODC)},
location = {Calgary, Alberta, Canada},
pages = {131--140},
isbn = {978-1-60558-396-9},
doi = {http://dx.doi.org/10.1145/1582716.1582741},
month = {August},
year = 2009,
url = {http://www.net.t-labs.tu-berlin.de/papers/JRSST-PTADSSG-09.pdf},
abstract = {Peer-to-peer systems rely on scalable overlay networks
that enable efficient routing between its members. Hypercubic
topologies facilitate such operations while each node only needs
to connect to a small number of other nodes. In contrast to static
communication networks, peer-to-peer networks allow nodes to adapt
their neighbor set over time in order to react to join and leave
events and failures. This paper shows how to maintain such networks
in a robust manner. Concretely, we present a distributed and
self-stabilizing algorithm that constructs a (variant of the) skip
graph in polylogarithmic time from any initial state in which the
overlay network is still weakly connected. This is an exponential
improvement compared to previously known self-stabilizing algorithms
for overlay networks. In addition, individual joins and leaves are
handled locally and require little work.},
}
A Self-Stabilizing and Local Delaunay Graph Construction
Riko Jacob, Stephan Ritscher, Christian Scheideler, Stefan Schmid
Algorithms and Computations: Proc. 20th
International Symposium on Algorithms and Computation (ISAAC), 2009
@InProceedings{isaac09ste,
author = {Jacob, Riko and Ritscher, Stephan and
Scheideler, Christian and Schmid, Stefan},
title = {A Self-Stabilizing and Local Delaunay Graph Construction},
booktitle = {Algorithms and Computations: Proc. 20th
International Symposium on Algorithms and Computation (ISAAC)},
location = {Hawaii, USA},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 5878,
month = {December},
year = 2009,
url = {http://www.net.t-labs.tu-berlin.de/papers/JRSS-SLDGC-09.pdf},
doi = {http://dx.doi.org/10.1007/978-3-642-10631-6_78},
ISBN = {978-3-642-10630-9},
ISSN = {0302-9743},
eissn = {1611-3349},
page = {771--780},
abstract = {This paper studies the construction of self-stabilizing
topologies for distributed systems. While recent research has
focused on chain topologies where nodes need to be linearized with
respect to their identifiers, we go a step further and explore a
natural 2-dimensional generalization. In particular, we present a
local self-stabilizing algorithm that constructs a Delaunay graph
from any initial connected topology and in a distributed manner.
This algorithm terminates in time {\it O(n_3)} in the worst-case.
We believe that such self-stabilizing Delaunay networks have
interesting applications and give insights into the necessary
geometric reasoning that is required for higher-dimensional
linearization problems.},
}
Brief Announcement: On the Time Complexity of
Distributed Topological Self-Stabilization
Dominik Gall, Riko Jacob, Andréa Richa, Christian Scheideler, Stefan Schmid, Hanjo Täubig
Stabilization, Safety, and Security of Distributed
Systems -- Proc. 11th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS), 2009
@InProceedings{sss09ste,
author = {Gall, Dominik and Jacob, Riko and Richa, Andr{\'e}a and
Scheideler, Christian and Schmid, Stefan and T{\"a}ubig, Hanjo},
title = {Brief Announcement: On the Time Complexity of
Distributed Topological Self-Stabilization},
booktitle = {Stabilization, Safety, and Security of Distributed
Systems -- Proc. 11th International Symposium on
Stabilization, Safety, and Security of Distributed Systems (SSS)},
note = {Brief Announcement},
location = {Lyon, France},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 5873,
ISBN = {978-3-642-05117-3},
ISSN = {0302-9743},
eissn = {1611-3349},
pages = {781--782},
doi = {http://dx.doi.org/10.1007/978-3-642-05118-0_58},
month = {November},
year = 2009,
url = {http://www.net.t-labs.tu-berlin.de/papers/GJRSST-OTCDTS-09.pdf},
abstract = {This brief announcement proposes a new model to measure
the distributed time complexity of topological self-stabilization.
In the field of topological self-stabilization, nodes---e.g.,
machines in a p2p network---seek to establish a certain network
structure in a robust manner (see, e.g., [2] for a distributed
algorithm for skip graphs). While several complexity models have
been proposed and analyzed over the last years, these models are
often inappropriate to adequately model parallel efficiency: either
they are overly pessimistic in the sense that they can force the
algorithm to work serially, or they are too optimistic in the sense
that contention issues are neglected. We hope that our approach will
inspire researchers in the community to analyze other problems from
this perspective. For a complete technical report about our model,
related literature and algorithms, the reader is referred to [1].},
}
Combinatorial Agency with Audits
Raphael Eidenbenz, Stefan Schmid
IEEE International Conference on Game Theory for Networks
(GameNets), 2009
@InProceedings{gamenets09ste,
author = {Eidenbenz, Raphael and Schmid, Stefan},
title = {Combinatorial Agency with Audits},
booktitle = {IEEE International Conference on Game Theory for Networks
(GameNets)},
location = {Istanbul, Turkey},
month = {May},
year = 2009,
pages = {374--383},
isbn = {978-1-4244-4176-1},
doi = {http://dx.doi.org/10.1109/GAMENETS.2009.5137423},
url = {http://www.net.t-labs.tu-berlin.de/papers/ES-CAWA-09.pdf},
abstract = {This paper studies the question of how to overcome
inefficiencies due to hidden actions in a rational milieu, such as a
grid computing system with open clientele. We consider the so-called
principal-agent model known from economic theory, where the members
(or agents) of a distributed system collaborate in complex ways.
We adopt the perspective of the principal and investigate auditing
mechanisms that incentivize participants to contribute more to a
common project. As conducting audits might be costly, the principal
must balance the tradeoff between low auditing costs and the level
of incentives offered to the participants to exert high effort.
We present optimal solutions for this optimization problem in
scenarios, where the project success either depends on all, on any
or on the majority of the participants succeeding in their subtask.
In the first case, we additionally find that with an increasing
principal valuation, there is exactly one transition point where the
optimal choices for achieving the maximal principal utility switch.
Compared to a combinatorial agency without the leverage of audits,
this transition occurs earlier.},
}
On Mechanism Design Without Payments for Throughput Maximization
Thomas Moscibroda, Stefan Schmid
28th IEEE Conference on Computer Communications (INFOCOM), 2009
@InProceedings{infocom09ste,
author = {Moscibroda, Thomas and Schmid, Stefan},
title = {On Mechanism Design Without Payments for Throughput Maximization},
booktitle = {28th IEEE Conference on Computer Communications (INFOCOM)},
location = {Rio de Janeiro, Brazil},
month = {April},
year = {2009},
pages = {972--980},
isbn = {978-1-4244-3512-8},
issn = {0743-166X},
doi = {http://dx.doi.org/10.1109/INFCOM.2009.5062008},
url = {http://www.net.t-labs.tu-berlin.de/papers/MS-MDWPTM-09.pdf},
abstract = {Many wireless standards and protocols today, such as
WLAN and Bluetooth, operate on similar frequency bands. While
this permits an efficient usage of the limited medium capacity,
transmissions of nodes running different protocols can interfere.
This paper studies how to design node discovery algorithms for
wireless multichannel networks which are robust against contending
protocols on the shared medium. We pursue a conservative approach
and consider a Byzantine adversary who prevents the communication of
our protocol on {\it t} channels in a worst-case fashion. Our model
also captures disruptions controlled by an adversarial jammer. This
paper presents algorithms for scenarios where {\it t} is not known.
The analytical findings are complemented by simulations providing
evidence that the proposed protocols perform well in practice.},
}
Robust Live Media Streaming in Swarms
Thomas Locher, Remo Meier, Roger Wattenhofer, Stefan Schmid
19th International Workshop on Network and Operating
Systems Support for Digital Audio and Video (NOSSDAV), 2009
@InProceedings{nossdav09ste,
author = {Locher, Thomas and Meier, Remo and Wattenhofer, Roger and
Schmid, Stefan},
title = {Robust Live Media Streaming in Swarms},
booktitle = {19th International Workshop on Network and Operating
Systems Support for Digital Audio and Video (NOSSDAV)},
location = {Williamsburg, Virginia, USA},
month = {June},
year = 2009,
pages = {121--126},
isbn = {978-1-60558-433-1},
doi = {http://dx.doi.org/10.1145/1542245.1542273},
url = {http://www.net.t-labs.tu-berlin.de/papers/LMWS-RLMSS-09.pdf},
abstract = {Data dissemination in decentralized networks is often
realized by using some form of swarming technique. Swarming enables
nodes to gather dynamically in order to fulfill a certain task
collaboratively and to exchange resources (typically pieces of files
or packets of a multimedia data stream). As in most distributed
systems, swarming applications face the problem that the nodes in
a network have heterogeneous capabilities or act selfishly. We
investigate the problem of efficient live data dissemination (e.g.,
TV streams) in swarms. The live streams should be distributed in
such a way that only nodes with sufficiently large contributions
to the system are able to fully receive it---even in the presence
of freeloading nodes or nodes that upload substantially less
than required to sustain the multimedia stream. In contrast,
uncooperative nodes cannot properly receive the data stream as they
are unable to fill their data buffers in time, incentivizing a fair
sharing of resources. If the number of selfish nodes increases, our
emulation results reveal that the situation steadily deteriorates
for them, while obedient nodes continue to receive virtually all
packets in time.},
}
Speed Dating despite Jammers
Dominic Meier, Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenhofer
5th IEEE International Conference on Distributed
Computing in Sensor Systems (DCOSS), 2009
@InProceedings{dcoss09ste,
author = {Meier, Dominic and Pignolet, Yvonne Anne and
Schmid, Stefan and Wattenhofer, Roger},
title = {Speed Dating despite Jammers},
booktitle = {5th IEEE International Conference on Distributed
Computing in Sensor Systems (DCOSS)},
location = {Marina del Rey, California, USA},
month = {June},
year = 2009,
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 5516,
pages = {1--14},
doi = {http://dx.doi.org/10.1007/978-3-642-02085-8_1},
isbn = {978-3-642-02084-1},
issn = {0302-9743},
eISSN = {1611-3349},
url = {http://www.net.t-labs.tu-berlin.de/papers/MPSW-SDDJ-09.pdf},
abstract = {Many wireless standards and protocols today, such as
WLAN and Bluetooth, operate on similar frequency bands. While
this permits an efficient usage of the limited medium capacity,
transmissions of nodes running different protocols can interfere.
This paper studies how to design node discovery algorithms for
wireless multichannel networks which are robust against contending
protocols on the shared medium. We pursue a conservative approach
and consider a Byzantine adversary who prevents the communication of
our protocol on {\it t} channels in a worst-case fashion. Our model
also captures disruptions controlled by an adversarial jammer. This
paper presents algorithms for scenarios where {\it t} is not known.
The analytical findings are complemented by simulations providing
evidence that the proposed protocols perform well in practice.},
}
The Price of Malice: A Game-Theoretic Framework for
Malicious Behavior in Distributed Systems
Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
@Article{im09stefan,
author = {Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {The Price of Malice: {A} Game-Theoretic Framework for
Malicious Behavior in Distributed Systems},
journal = {Internet Mathematics (IM)},
year = 2009,
volume = 6,
number = 2,
pages = {125--155},
url = {http://akpeters.metapress.com/content/232760m416nt7671/},
abstract = {Over the last years, game theory has provided insights
into the behavior of distributed systems by modeling the players
as utility maximizing agents. In particular, it has been shown
that selfishness causes many systems to perform in a globally
suboptimal fashion. Such systems are said to have a large {\it Price
of Anarchy}. In this article, we extend this field of research by
allowing some players to be malicious rather than selfish. We ask:
What is the impact of malicious players on the system consisting
of otherwise selfish players? In particular, we introduce the {\it
Price of Malice} as a measure that captures how much the system's
efficiency degrades in the presence of malicious players, compared
to a purely selfish environment. As a specific example, we analyze
the Price of Malice of a game which models the containment of the
spread of viruses. In this game, each player or node can choose
whether or not to install anti-virus software. Then, a virus starts
from a random node and recursively infects all neighboring nodes
which are not inoculated. We establish various results about this
game. For instance, we quantify how much the presence of malicious
players can deteriorate or--in case of highly risk-averse selfish
players--improve the social welfare of the distributed system.},
}
2008
Distributed Asymmetric Verification in Computational Grids
Michael Kuhn, Stefan Schmid, Roger Wattenhofer
22nd IEEE International Parallel and Distributed
Processing Symposium (IPDPS), 2008
@InProceedings{ipdps08ste,
author = {Kuhn, Michael and Schmid, Stefan and Wattenhofer, Roger},
title = {Distributed Asymmetric Verification in Computational Grids},
booktitle = {22nd IEEE International Parallel and Distributed
Processing Symposium (IPDPS)},
location = {Miami, Florida, USA},
month = {April},
year = 2008,
pages = {1--10},
issn = {1530-2075},
isbn = {978-1-4244-1693-6},
doi = {http://dx.doi.org/10.1109/IPDPS.2008.4536244},
url = {http://www.net.t-labs.tu-berlin.de/papers/KSW-DAVCG-08.pdf},
abstract = {Lucrative incentives in grid computing do not only attract
honest participants, but also cheaters. To prevent selfish behavior,
verification mechanisms are required. Today's solutions mostly base
on redundancy and inherently exhibit a considerable overhead. Often,
however, the verification of a result takes much less time than its
computation. In this paper we propose a distributed checking scheme
that exploits this asymmetry. Our mechanism detects wrong results
and excludes cheaters in a distributed manner and hence disburdens
the central grid server. We show how the verification scheme is used
in an application which aims at breaking the discrete logarithm
problem by a parallel implementation of the Pollard-$\rho$ algorithm.
Our implementation extends the BOINC server software and is robust
to various rational attacks even in the presence of colluders.},
}
Distributed Computation of the Mode
Fabian Kuhn, Thomas Locher, Stefan Schmid
27th ACM Symposium on Principles of Distributed Computing
(PODC), 2008
@InProceedings{podc08ste,
author = {Fabian Kuhn and Thomas Locher and Schmid, Stefan},
title = {Distributed Computation of the Mode},
booktitle = {27th ACM Symposium on Principles of Distributed Computing
(PODC)},
location = {Toronto, Canada},
month = {August},
year = 2008,
isbn = {978-1-59593-989-0},
pages = {15--24},
doi = {http://dx.doi.org/10.1145/1400751.1400756},
url = {http://www.net.t-labs.tu-berlin.de/papers/KLS-DCM-08.pdf},
abstract = {This paper studies the problem of computing the most
frequent element (the mode) by means of a distributed algorithm
where the elements are located at the nodes of a network. Let {\it
k} denote the number of distinct elements and further let {\it m_i}
be the number of occurrences of the element {\it e_i} in the ordered
list of occurrences {\it m_1>m_2>=...>=m_k}. We give a deterministic
distributed algorithm with time complexity {\it O(D+k)} where {\it
D} denotes the diameter of the graph, which is essentially tight. As
our main contribution, a Monte Carlo algorithm is presented which
computes the mode in {\it O(D + F_2/m_1^2 log k)} time with high
probability, where the frequency moment {\it F_l} is defined as {\it
F_l = Sum_(i=1)^k m_i^l}. This algorithm is substantially faster
than the deterministic algorithm for various relevant frequency
distributions. Moreover, we provide a lower bound of {\it $\Omega$(D
+ F_5/(m_1^5 B))}, where {\it B} is the maximum message size,
that captures the eect of the frequency distribution on the time
complexity to compute the mode.},
}
Distributed Disaster Disclosure
Bernard Mans, Stefan Schmid, Roger Wattenhofer
11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008
@InProceedings{swat08ste,
author = {Mans, Bernard and Schmid, Stefan and Wattenhofer, Roger},
title = {Distributed Disaster Disclosure},
booktitle = {11th Scandinavian Workshop on Algorithm Theory (SWAT)},
editor = {Gudmundsson, Joachim},
location = {Gothenburg, Sweden},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 5124,
month = {July},
year = 2008,
pages = {246--257},
doi = {http://dx.doi.org/10.1007/978-3-540-69903-3_23},
isbn = {978-3-540-69900-2},
issn = {0302-9743},
eISSN = {1611-3349},
url = {http://www.net.t-labs.tu-berlin.de/papers/MSW-DDD-08.pdf},
abstract = {Assume a set of distributed nodes which are equipped with
a sensor device. When nodes sense an event, they want to know (the
size of) the connected component consisting of nodes which have
also sensed the event, in order to raise--if necessary--a disaster
alarm. This paper presents distributed algorithms for this problem.
Concretely, our algorithms aim at minimizing both the response time
as well as the message complexity.},
}
Dynamics and Cooperation: Algorithmic Challenges in
Peer-to-Peer Computing
@Book{diss-ste,
author = {Schmid, Stefan},
title = {Dynamics and Cooperation: Algorithmic Challenges in
Peer-to-Peer Computing},
publisher = {Hartung Gorre Verlag},
ISBN = {978-3-86628-205-6},
isbn10 = {3866282052},
month = {April},
year = 2008,
abstract = {Peer-to-peer (p2p) computing is one of the most
intriguing new networking paradigms of the last ten years, and many
applications today use peer-to-peer technology, e.g. for large
distributed computations, for file sharing, or for live media
streaming. At the heart of the paradigm lies the idea of leveraging
the resources of the system's participants. Thus, potentially
scalable and robust architectures can be built.
However, making use of the decentralized resources is challenging.
The peers are under the control of the individual users who may only
connect to the network for a short period of time. Consequently,
there are frequent membership changes and p2p systems are highly
dynamic. In addition to regular joins and leaves, the participating
machines (often unreliable desktops) may crash. Peer-to-peer
solutions are also faced with the fact that it is not always in
the (anonymous) users' interest to contribute their resources.
Rather, a user may be selfish and seek to exploit the system without
reciprocating.
This dissertation studies the challenges of the dynamics in p2p
computing and of cooperation. We describe a system which is
based on a hypercubic topology and which applies algorithms that
maintain desirable network properties despite worst-case joins
and leaves; these algorithms can also be used for pancake graphs.
Besides membership dynamics, we investigate dynamic changes of
the available bandwidth between two peers, and we analyze the
throughput of different transfer protocols. In order to emphasize
the importance of the cooperation challenge, we conduct a case study
of BitTorrent--one of the most traffic intensive applications on
the Internet--, and show that today's peer-to-peer networks still
fail to fend off uncooperative peers. A game-theoretic analysis
of a p2p network creation game is presented which estimates the
impact of selfish behavior. We find that both the performance and
the stability of a system can suffer severely. In addition, this
dissertation introduces a mathematical framework which allows
us to evaluate a system's robustness to malicious attacks; the
framework is also useful for the analysis of social networks. The
theoretic findings are complemented by a case study which identifies
vulnerabilities in the popular Kad network.},
}
Dynamics and Cooperation: Algorithmic Challenges in Peer-to-Peer Computing
Stefan Schmid
Diss ETH No. 17731, TIK-Schriftenreihe Nr. 96
Hartung-Gorre Verlag, ISBN 3-86628-205, 2008
@article{phd-thesis,
author = {Stefan Schmid},
title = {Dynamics and Cooperation: Algorithmic Challenges in Peer-to-Peer Computing},
journal = {Diss ETH No. 17731, TIK-Schriftenreihe Nr. 96
Hartung-Gorre Verlag, ISBN 3-86628-205},
year = {2008},
}
Modeling Sensor Networks
Stefan Schmid, Roger Wattenhofer
Algorithms and Protocols for Sensor Networks, 2008
@InProceedings{ec08ste,
author = {Meier, Dominic and Oswald, Yvonne Anne and
Schmid, Stefan and Wattenhofer, Roger},
title = {On the Windfall of Friendship: Inoculation Strategies on
Social Networks},
booktitle = {9th ACM Conference on Electronic Commerce (EC)},
location = {Chicago, Illinois, USA},
month = {July},
year = 2008,
pages = {294--301},
isbn = {978-1-60558-169-9},
doi = {http://dx.doi.org/978-1-60558-169-9},
url = {http://www.net.t-labs.tu-berlin.de/papers/MOSW-OWFISSN-08.pdf},
abstract = {This paper studies a virus inoculation game on social
networks. A framework is presented which allows the measuring of
the windfall of friendship, i.e., how much players benefit if they
care about the welfare of their direct neighbors in the social
network graph compared to purely selfish environments. We analyze
the corresponding equilibria and show that the computation of the
worst and best Nash equilibrium is {\bf NP}-hard. Intriguingly, even
though the windfall of friendship can never be negative, the social
welfare does not increase monotonically with the extent to which
players care for each other. While these phenomena are known on an
anecdotal level, our framework allows us to quantify these effects
analytically.},
}
Tight Bounds for Delay-Sensitive Aggregation
Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
27th ACM Symposium on Principles of Distributed Computing
(PODC), 2008
@InProceedings{podc08stefan2,
author = {Oswald, Yvonne Anne and Schmid, Stefan and Wattenhofer, Roger},
title = {Tight Bounds for Delay-Sensitive Aggregation},
booktitle = {27th ACM Symposium on Principles of Distributed Computing
(PODC)},
location = {Toronto, Canada},
month = {August},
year = 2008,
pages = {195--202},
isbn = {978-1-59593-989-0},
doi = {http://dx.doi.org/10.1145/1400751.1400778},
url = {http://www.net.t-labs.tu-berlin.de/papers/OSW-TBDSA-08.pdf},
abstract = {This paper studies the fundamental trade-off between
communication cost and delay cost arising in various contexts
such as control message aggregation or organization theory. An
optimization problem is considered where nodes are organized in a
tree topology. The nodes seek to minimize the time until the root
is informed about their states and to use as few transmissions
as possible at the same time. We derive an upper bound on the
competitive ratio of {\it O(min(h,c))} where {\it h} is the tree's
height, and {\it c} is the transmission cost per edge. Moreover, we
prove that this upper bound is tight in the sense that any oblivious
algorithm has a ratio of at least {\it $\Omega$(min(h,c))}.
For chain networks, we prove a tight competitive ratio of {\it
$\Theta$(min(h,c))}. Furthermore, the paper introduces a new model
for online event aggregation where the importance of an event
depends on its difference to previous events.},
}
2007
Manipulation in Games
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
18th International Symposium on Algorithms and
Computation (ISAAC), 2007
@InProceedings{isaac07ste,
author = {Eidenbenz, Raphael and Oswald, Yvonne Anne and
Schmid, Stefan and Wattenhofer, Roger},
title = {Manipulation in Games},
booktitle = {18th International Symposium on Algorithms and
Computation (ISAAC)},
location = {Sendai, Japan},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 4835,
pages = {365--376},
doi = {http://dx.doi.org/10.1007/978-3-540-77120-3_33},
isbn = {978-3-540-77118-0},
issn = {0302-9743},
eISSN = {1611-3349},
month = {December},
year = {2007},
url = {http://www.net.t-labs.tu-berlin.de/papers/EOSW-MIG-07.pdf},
abstract = {This paper studies to which extent the social welfare of a
game can be influenced by an interested third party within economic
reason, i.e., by taking the implementation cost into account.
Besides considering classic, benevolent mechanism designers, we also
analyze malicious mechanism designers. For instance, this paper
shows that a malicious mechanism designer can often corrupt games
and worsen the players' situation to a larger extent than the amount
of money invested. Surprisingly, no money is needed at all in some
cases. We provide algorithms for finding the so-called leverage in
games and show that for optimistic mechanism designers, computing
the leverage or approximations thereof is {\bf NP}-hard.},
}
Mechanism Design by Creditability
Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer
1st International Conference on Combinatorial
Optimization and Applications (COCOA), 2007
@InProceedings{cocoa07ste,
author = {Eidenbenz, Raphael and Oswald, Yvonne Anne and
Schmid, Stefan and Wattenhofer, Roger},
title = {Mechanism Design by Creditability},
booktitle = {1st International Conference on Combinatorial
Optimization and Applications (COCOA)},
location = {Xi'an, Shaanxi, China},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 4616,
issn = {0302-9743},
eISSN = {1611-3349},
isbn = {978-3-540-73555-7},
doi = {http://dx.doi.org/10.1007/978-3-540-73556-4_24},
pages = {208--219},
month = {August},
year = 2007,
url = {http://www.net.t-labs.tu-berlin.de/papers/EOSW-MDBC-07a.pdf},
abstract = {This paper attends to the problem of a mechanism designer
seeking to influence the outcome of a strategic game based on her
creditability. The mechanism designer offers additional payments
to the players depending on their mutual choice of strategies in
order to steer them to certain decisions. Of course, the mechanism
designer aims at spending as little as possible and yet implementing
her desired outcome. We present several algorithms for this
optimization problem both for singleton target strategy profiles and
target strategy profile regions. Furthermore, the paper shows how a
bankrupt mechanism designer can decide efficiently whether strategy
profiles can be implemented at no cost at all. Finally, risk-averse
players and dynamic games are examined.},
}
Push-to-Pull Peer-to-Peer Live Streaming
Thomas Locher, Remo Meier, Stefan Schmid, Roger Wattenhofer
21st International Symposium on Distributed Computing
(DISC), 2007
@InProceedings{disc07ste,
author = {Locher, Thomas and Meier, Remo and Schmid, Stefan and
Wattenhofer, Roger},
title = {Push-to-Pull Peer-to-Peer Live Streaming},
booktitle = {21st International Symposium on Distributed Computing
(DISC)},
location = {Lemesos, Cyprus},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 4731,
issn = {0302-9743},
eISSN = {1611-3349},
pages = {388--402},
doi = {http://dx.doi.org/10.1007/978-3-540-75142-7_30},
isbn = {978-3-540-75141-0},
month = {September},
year = 2007,
url = {http://www.net.t-labs.tu-berlin.de/papers/LMSW-PPLS-07.pdf},
abstract = {In contrast to peer-to-peer file sharing, live streaming
based on peer-to-peer technology is still awaiting its breakthrough.
This may be due to the additional challenges live streaming faces,
e.g., the need to meet real-time playback deadlines, or the
increased demands on robustness under churn. This paper presents
and evaluates novel neighbor selection and data distribution
schemes for peer-to-peer live streaming. Concretely, in order to
distribute data efficiently and with minimal delay, our algorithms
combine low-latency push operations along a structured overlay with
the flexibility of pull operations. The protocols ensure that all
peers are able to obtain the required data blocks of a live stream
in time, and that due to the loop-free dissemination paths, the
overhead is low.},
}
Rescuing Tit-for-Tat with Source Coding
Thomas Locher, Stefan Schmid, Roger Wattenhofer
7th IEEE International Conference on Peer-to-Peer
Computing (P2P), 2007
@InProceedings{p2p07ste,
author = {Locher, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {Rescuing Tit-for-Tat with Source Coding},
booktitle = {7th IEEE International Conference on Peer-to-Peer
Computing (P2P)},
location = {Galway, Ireland},
month = {September},
year = 2007,
pages = {3--10},
isbn = {978-0-7695-2986-8},
doi = {http://dx.doi.org/10.1109/P2P.2007.10},
url = {http://www.net.t-labs.tu-berlin.de/papers/LSW-RTSC-07.pdf},
abstract = {Tit-for-tat is widely believed to be the most effective
strategy to enforce collaboration among selfish users. However, it
has been shown that its usefulness for decentralized and dynamic
environments such as peer-to-peer networks is marginal, as peers
can rapidly end up in a deadlock situation. Many proposed solutions
to this problem are either less resilient to freeloading behavior
or induce a computational overhead that cannot be sustained by
regular peers. In contrast, we retain tit-for-tat, but enhance the
system with a novel form of source coding and an effective scheme to
prevent peers from freeloading from seeding peers. We show that our
system performs well without the risk of peer starvation and without
sacrificing fairness. The proposed solution has a reasonably low
overhead, and may hence be suitable for fully distributed content
distribution applications in real networks.},
}
Structuring Unstructured Peer-to-Peer Networks
Stefan Schmid, Roger Wattenhofer
14th Annual IEEE International Conference on High
Performance Computing (HiPC), 2007
@InProceedings{hipc07ste,
author = {Schmid, Stefan and Wattenhofer, Roger},
title = {Structuring Unstructured Peer-to-Peer Networks},
booktitle = {14th Annual IEEE International Conference on High
Performance Computing (HiPC)},
location = {Goa, India},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 4873,
pages = {432--442},
doi = {http://dx.doi.org/10.1007/978-3-540-77220-0_40},
isbn = {978-3-540-77219-4},
issn = {0302-9743},
eISSN = {1611-3349},
month = {December},
year = 2007,
url = {http://www.net.t-labs.tu-berlin.de/papers/SW-SUPN-07.pdf},
abstract = {Flooding is a fundamental building block of unstructured
peer-to-peer (P2P) systems. In this paper, we investigate techniques
to improve the performance of flooding. In particular, we present
{\it Clustella}, a novel semi-structured P2P architecture with
bounded peer degree. Clustella decomposes the network into different
clusters, allowing peers to quickly find those neighbors which
contribute much to their routing efficiency. By its link selection
strategy, Clustella achieves a good performance in static and
dynamic environments.},
}
2006
A Blueprint for Constructing Peer-to-Peer Systems Robust to
Dynamic Worst-Case Joins and Leaves
Fabian Kuhn, Stefan Schmid, Joest Smit, Roger Wattenhofer
14th IEEE International Workshop on Quality of Service
(IWQoS), 2006
@InProceedings{iwqos06ste,
author = {Kuhn, Fabian and Schmid, Stefan and Smit, Joest and
Wattenhofer, Roger},
title = {A Blueprint for Constructing Peer-to-Peer Systems Robust to
Dynamic Worst-Case Joins and Leaves},
booktitle = {14th IEEE International Workshop on Quality of Service
(IWQoS)},
location = {Yale University, New Haven, Connectitut, USA},
pages = {12--19},
month = {June},
year = 2006,
isbn = {1-4244-0476-2},
issn = {1548-615X},
abstract = {Until now, the analysis of fault tolerance of peer-to-peer
systems usually only covers random faults of some kind. Contrary
to traditional algorithmic research, faults as well as joins and
leaves occurring in a worst-case manner are hardly considered. In
this paper, we devise techniques to build dynamic peer-to-peer
systems which remain fully functional in spite of an adversary which
continuously adds and removes peers. We exemplify our algorithms on
a pancake topology and present a system which maintains peer degree
and network diameter {\it O(log n/log log n)}, where {\it n} is the
total number of peers in the system.},
}
A TCP with Guaranteed Performance in Networks with Dynamic
Congestion and Random Wireless Losses
Stefan Schmid, Roger Wattenhofer
2nd Annual International Wireless Internet Conference
(WICON), 2006
@InProceedings{wicon06ste,
author = {Schmid, Stefan and Wattenhofer, Roger},
title = {A TCP with Guaranteed Performance in Networks with Dynamic
Congestion and Random Wireless Losses},
booktitle = {2nd Annual International Wireless Internet Conference
(WICON)},
location = {Boston, Massachusetts, USA},
month = {August},
year = 2006,
isbn = {1-59593-510-X},
abstract = {It is well-known that TCP performs poorly in the presence
of packet losses happening for reasons other than Internet
congestion. One increasingly important source of such errors are
wireless links. In this paper, networks are studied where the
congestion--and thus the bandwidth available to a host--varies over
time, and where in addition packets are lost at random. First, we
propose a network comprising both dynamically varying congestion and
random errors. Second, our model is extended with network calculus
concepts in order to study bursty changes of congestion. Finally, we
present the transfer protocol TCP ``Wichita'' (TCPW) which achieves
a provable worst-case performance in this environment.},
}
Algorithmic Models for Sensor Networks
Stefan Schmid, Roger Wattenhofer
14th International Workshop on Parallel and Distributed
Real-Time Systems (WPDRTS), in conjunction with IPDPS, 2006
@InProceedings{wpdrts06ste,
author = {Schmid, Stefan and Wattenhofer, Roger},
title = {Algorithmic Models for Sensor Networks},
booktitle = {14th International Workshop on Parallel and Distributed
Real-Time Systems (WPDRTS), in conjunction with IPDPS},
location = {Island of Rhodes, Greece},
month = {April},
year = 2006,
note = {Invited Paper},
pages = {1--11},
isbn = {1-4244-0054-6},
doi = {http://dx.doi.org/10.1109/IPDPS.2006.1639417},
url = {http://www.net.t-labs.tu-berlin.de/papers/SW-AMFSN-06.pdf},
abstract = {Developing algorithms for sensor networks---and proving
their correctness and performance---requires simplifying but still
realistic models. This paper surveys various models in use today
and puts them into perspective. In addition, we propose interesting
models which are not widely adopted by the community so far.},
}
Cryptree: A Folder Tree Structure for Cryptographic File
Systems
Dominik Grolimund, Luzius Meisser, Stefan Schmid, Roger Wattenhofer
25th IEEE Symposium on Reliable Distributed Systems
(SRDS), 2006
@InProceedings{srds06ste,
author = {Grolimund, Dominik and Meisser, Luzius and Schmid, Stefan and
Wattenhofer, Roger},
title = {Cryptree: {A} Folder Tree Structure for Cryptographic File
Systems},
booktitle = {25th IEEE Symposium on Reliable Distributed Systems
(SRDS)},
location = {Leeds, United Kingdom},
month = {October},
year = 2006,
pages = {189--198},
isbn = {0-7695-2677-2},
issn = {1060-9857},
abstract = {We present Cryptree, a cryptographic tree structure which
facilitates access control in file systems operating on untrusted
storage. Cryptree leverages the file system's folder hierarchy to
achieve efficient and intuitive, yet simple, access control. The
highlights are its ability to recursively grant access to a folder
and all its subfolders in constant time, the dynamic inheritance
of access rights which inherently prevents scattering of access
rights, and the possibility to grant someone access to a file or
folder without revealing the identities of other accessors. To
reason about and to visualize Cryptree, we introduce the notion
of cryptographic links. We describe the Cryptrees we have used to
enforce read and write access in our own file system. Finally, we
measure the performance of the Cryptree and compare it to other
approaches.},
}
Dynamic Internet Congestion with Bursts
Stefan Schmid, Roger Wattenhofer
13th Annual IEEE International Conference on High
Performance Computing (HiPC), 2006
@InProceedings{hipc06ste,
author = {Schmid, Stefan and Wattenhofer, Roger},
title = {Dynamic Internet Congestion with Bursts},
booktitle = {13th Annual IEEE International Conference on High
Performance Computing (HiPC)},
location = {Bangalore, India},
editor = {Robert, Yves and Parashar, Manish and
Badrinath, Ramamurthy and Prasanna, Viktor K.},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 4297,
issn = {0302-9743},
eISSN = {1611-3349},
doi = {http://dx.doi.org/10.1007/11945918_20},
pages = {159--170},
isbn = {978-3-540-68039-0},
month = {December},
year = 2006,
url = {http://www.net.t-labs.tu-berlin.de/papers/SW-DICWB-06.pdf},
abstract = {This paper studies throughput maximization in networks
with dynamically changing congestion. First, we give a new and
simple analysis of an existing model where the bandwidth available
to a flow varies multiplicatively over time. The main contribution
however is the introduction of a novel model for dynamics based on
concepts of network calculus. This model features a limited form
of amortization: After quiet times where the available bandwidth
was roughly constant, the congestion may change more abruptly. We
present a competitive algorithm for this model and also derive a
lower bound.},
}
eQuus: A Provably Robust and Locality-Aware
Peer-to-Peer System
Thomas Locher, Stefan Schmid, Roger Wattenhofer
6th IEEE International Conference on Peer-to-Peer
Computing (P2P), 2006
@InProceedings{p2p05ste,
author = {Locher, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {eQuus: {A} Provably Robust and Locality-Aware
Peer-to-Peer System},
booktitle = {6th IEEE International Conference on Peer-to-Peer
Computing (P2P)},
loaction = {Cambridge, United Kingdom},
month = {September},
year = 2006,
isbn = {0-7695-2679-9},
pages = {3--11},
abstract = {Peer-to-peer systems (p2p) are highly dynamic in nature.
They may consist of millions of peers joining only for a limited
period of time, resulting in hundreds of join and leave events
per second. In this paper we introduce eQuus, a novel distributed
hash table (DHT) suitable for highly dynamic environments. eQuus
guarantees that lookups are always fast---in terms of both the delay
and the total number of routing hops---, although peers may join and
leave the network at any time and concurrently.},
}
Free Riding in BitTorrent is Cheap
Thomas Locher, Patrick Moor, Stefan Schmid, Roger Wattenhofer
5th Workshop on Hot Topics in Networks (HotNets), 2006
@InProceedings{hotnets06ste,
author = {Locher, Thomas and Moor, Patrick and Schmid, Stefan and
Wattenhofer, Roger},
title = {Free Riding in BitTorrent is Cheap},
booktitle = {5th Workshop on Hot Topics in Networks (HotNets)},
location = {Irvine, California, USA},
month = {November},
year = 2006,
pages = {85--90},
abstract = {While it is well-known that BitTorrent is vulnerable to
selfish behavior, this paper demonstrates that even entire files
can be downloaded without reciprocating at all in BitTorrent. To
this end, we present {\it BitThief}, a free riding client that
never contributes any real data. First, we show that simple tricks
suffice in order to achieve high download rates, {\it even in the
absence of seeders}. We also illustrate how peers in a swarm react
to various sophisticated attacks. Moreover, our analysis reveals
that {\it sharing communities}---communities originally intended to
offer downloads of good quality and to promote cooperation among
peers---provide many incentives to cheat.},
}
Havelaar: A Robust and Efficient Reputation System for
Active Peer-to-Peer Systems
Dominik Grolimund, Luzius Meisser, Stefan Schmid, Roger Wattenhofer
1st Workshop on the Economics of Networked Systems (NetEcon), 2006
@InProceedings{netecon06ste,
author = {Grolimund, Dominik and Meisser, Luzius and Schmid, Stefan and
Wattenhofer, Roger},
title = {Havelaar: {A} Robust and Efficient Reputation System for
Active Peer-to-Peer Systems},
booktitle = {1st Workshop on the Economics of Networked Systems (NetEcon)},
location = {University of Michigan, Ann Arbor, Michigan, USA},
pages = {69--74},
month = {June},
year = 2006,
abstract = {Peer-to-peer (p2p) systems have the potential to harness
huge amounts of resources. Unfortunately, however, it has been shown
that most of today's p2p networks suffer from a large fraction
of free-riders, who consume resources without contributing much
to the system themselves. This results in an overall performance
degradation, and hence proper incentives are needed to encourage
contributions. One interesting resource is bandwidth. Thereby, a
service differentiation approach seems appropriate, where peers
contributing higher upload bandwidths are rewarded with higher
download bandwidths in return. Keeping track of the contribution
of each peer in an open, decentralized environment, however, is
a difficult task; many proposed systems are susceptible to false
reports. Besides being prone to attacks, some solutions have a
large communication and computation overhead, which can even be
linear in the number of transactions---an unacceptable burden in
practical and active systems. In this paper, we propose a reputation
system which is robust to false reports and overcomes this scaling
problem. Our results are promising, indicating that the mechanism
is accurate and efficient especially when applied in systems where
there are lots of transactions. For a more detailed technical
report, we refer the reader to the TIK Report 246 (available at
http://www.tik.ee.ethz.ch/).},
}
On the Topologies Formed by Selfish Peers
Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
5th International Workshop on Peer-to-Peer Systems
(IPTPS), 2006
@InProceedings{iptps06ste,
author = {Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {On the Topologies Formed by Selfish Peers},
booktitle = {5th International Workshop on Peer-to-Peer Systems
(IPTPS)},
location = {Santa Barbara, California, USA},
month = {February},
year = 2006,
pages = {133--142},
abstract = {Current peer-to-peer (P2P) systems often suffer from a
large fraction of freeriders not contributing any resources to the
network. Various mechanisms have been designed to overcome this
problem. However, the selfish behavior of peers has aspects which
go beyond resource sharing. This paper studies the effects on the
topology of a P2P network if peers selfishly select the peers to
connect to. In our model, a peer exploits locality properties in
order to minimize the latency (or response times) of its lookup
operations. At the same time, the peer aims at not having to
maintain links to too many other peers in the system. We show
that the resulting topologies can be much worse than if peers
collaborated. Moreover, the network may never stabilize, even in the
absence of churn.},
}
On the Topologies Formed by Selfish Peers
Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
25th Annual Symposium on Principles of Distributed
Computing (PODC), 2006
@InProceedings{podc06ste,
author = {Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {On the Topologies Formed by Selfish Peers},
booktitle = {25th Annual Symposium on Principles of Distributed
Computing (PODC)},
location = {Denver, Colorado, USA},
month = {July},
year = 2006,
pages = {133--142},
isbn = {1-59593-384-0},
abstract = {Current peer-to-peer (P2P) systems often suffer from a
large fraction of freeriders not contributing any resources to the
network. Various mechanisms have been designed to overcome this
problem. However, the selfish behavior of peers has aspects which
go beyond resource sharing. This paper studies the effects on the
topology of a P2P network if peers selfishly select the peers to
connect to. In our model, a peer exploits locality properties in
order to minimize the latency (or response times) of its lookup
operations. At the same time, the peer aims at not having to
maintain links to too many other peers in the system. We show
that the resulting topologies can be much worse than if peers
collaborated. Moreover, the network may never stabilize, even in the
absence of churn.},
}
When Selfish Meets Evil: Byzantine Players in a Virus
Inoculation Game
Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
25th Annual Symposium on Principles of Distributed
Computing (PODC), 2006
@InProceedings{podc06stefan2,
author = {Moscibroda, Thomas and Schmid, Stefan and Wattenhofer, Roger},
title = {When Selfish Meets Evil: Byzantine Players in a Virus
Inoculation Game},
booktitle = {25th Annual Symposium on Principles of Distributed
Computing (PODC)},
location = {Denver, Colorado, USA},
month = {July},
year = 2006,
pages = {35--44},
isbn = {1-59593-384-0},
abstract = {Over the last years, game theory has provided great
insights into the behavior of distributed systems by modeling the
players as utility-maximizing agents. In particular, it has been
shown that selfishness causes many systems to perform in a globally
suboptimal fashion. Such systems are said to have a large Price of
Anarchy. In this paper, we extend this active field of research
by allowing some players to be malicious or Byzantine rather than
selfish. We ask: What is the impact of Byzantine players on the
system's efficiency compared to purely selfish environments or
compared to the social optimum? In particular, we introduce the
Price of Malice which captures this efficiency degradation. As an
example, we analyze the Price of Malice of a game which models the
containment of the spread of viruses. In this game, each node can
choose whether or not to install anti-virus software. Then, a virus
starts from a random node and iteratively infects all neighboring
nodes which are not inoculated. We establish various results about
this game. For instance, we quantify how much the presence of
Byzantine players can deteriorate or---in case of highly risk-averse
selfish players---improve the social welfare of the distributed
system.},
keyword = {gt},
}
2005
A Robust Interference Model for Wireless Ad-Hoc Networks
Pascal von Rickenbach, Stefan Schmid, Roger Wattenhofer, Aaron Zollinger
5th International Workshop on Algorithms for Wireless,
Mobile, Ad Hoc and Sensor Networks (WMAN), 2005
@InProceedings{wman05ste,
author = {von Rickenbach, Pascal and Schmid, Stefan and
Wattenhofer, Roger and Zollinger, Aaron},
title = {A Robust Interference Model for Wireless Ad-Hoc Networks},
booktitle = {5th International Workshop on Algorithms for Wireless,
Mobile, Ad Hoc and Sensor Networks (WMAN)},
location = {Denver, Colorado, USA},
month = {April},
pages = {1--8},
year = 2005,
abstract = {Among the foremost goals of topology control in wireless
ad-hoc networks is interference reduction. This paper presents a
receiver-centric interference model featuring two main advantages
over previous work. First, it reflects the fact that interference
occurs at the intended receiver of a message. Second, the presented
interference measure is robust with respect to addition or removal
of single network nodes. Regarding both of these aspects our
model intuitively corresponds to the behavior of interference in
reality. Based on this interference model, we show that currently
known topology control algorithms poorly reduce interference.
Motivated by the observation that already one-dimensional network
instances display the intricacy of the considered problem, we
continue to focus on the so-called highway model. Setting out
to analyze the special case of the exponential node chain, we
eventually describe an algorithm guaranteeing to achieve a {\it
&nthroot;$\Delta$}-approximation (where {\it n=4}) of the optimal
connectivity-preserving topology in the general highway model.},
ISBN = {0-7695-2312-9},
}
A Self-Repairing Peer-to-Peer System Resilient to
Dynamic Adversarial Churn
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
4th International Workshop on Peer-To-Peer Systems
(IPTPS), 2005
@InProceedings{iptps05ste,
author = {Kuhn, Fabian and Schmid, Stefan and Wattenhofer, Roger},
title = {A Self-Repairing Peer-to-Peer System Resilient to
Dynamic Adversarial Churn},
booktitle = {4th International Workshop on Peer-To-Peer Systems
(IPTPS)},
location = {Cornell University, Ithaca, New York, USA},
publisher = {Springer},
address = {Berlin / Heidelberg, Germany},
series = {Lecture Notes in Computer Science (LNCS)},
volume = 3640,
isbn = {978-3-540-29068-1},
pages = {13--23},
year = 2005,
abstract = {We present a dynamic distributed hash table where peers
may join and leave at any time. Our system tolerates a powerful
adversary which has complete visibility of the entire state
of the system and can continuously add and remove peers. Our
system provides worst-case fault-tolerance, maintaining desirable
properties such as a low peer degree and a low network diameter.},
}
2004
Parallel Compilation of CMS Software
Shaun Ashby, Giulio Eulisse, Stefan Schmid, Lassi Tuura
Computing in High Energy and Nuclear Physics Conference
(CHEP), 2004
@InProceedings{chep04ste,
author = {Ashby, Shaun and Eulisse, Giulio and Schmid, Stefan and
Tuura, Lassi},
title = {Parallel Compilation of {CMS} Software},
booktitle = {Computing in High Energy and Nuclear Physics Conference
(CHEP)},
location = {Interlaken, Switzerland},
month = {September},
year = 2004,
abstract = {LHC experiments have large amounts of software to build.
CMS has studied ways to shorten project build times using parallel
and distributed builds as well as improved ways to decide what to
rebuild. We have experimented with making idle desktop and server
machines easily available as a virtual build cluster using distcc
and zeroconf. We have also tested variations of ccache and more
traditional make dependency analysis. We report on our test results,
with analysis of the factors that most improve or limit build
performance.},
}