​

• Principles for Internet Congestion Management
  Lloyd Brown et al. SIGCOMM 24.​​
   

• DOTE: Rethinking (Predictive) WAN Traffic Engineering
  Yarin Perry, Felipe Vieira Frujeri, Chaim Hoch, Srikanth Kandula, Ishai Menache, Michael Schapira, and Aviv Tamar. NSDI 23.​​

  • NSDI 2023 Best Paper Award​

​

• Verifying Generalization in Deep Learning
  Guy Amir, Osher Maayan, Tom Zelazny, Guy Katz, and Michael Schapira. CAV 23​ and Journal of Automated Reasoning, 2024.
   

• ​Verification-Aided Deep Ensemble Selection
  Guy Amir, Tom Zelazny, Guy Katz, and Michael Schapira. FMCAD 22. 
   

• Leveraging eBPF to Make TCP Path-Aware
  Mathieu Jadin, Quentin De Coninck, Louis Navarre, Michael Schapira, and Olivier Bonaventure. Transactions on Network and Service Management (TNSM), 2022.​

​

• Verifying Learning-Augmented Systems
  Tomer Eliyahu, Yafim Kazak, Guy Katz, and Michael Schapira. SIGCOMM 21.
   

• Towards Scalable Verification of Deep Reinforcement Learning
  Guy Amir, Michael Schapira, and Guy Katz. FMCAD 21.
   

• Revitalizing the Internet by Making it Extensible
  Balakrishnan et al. CCR 2021.
   

• A Devil of a Time: How Vulnerable is NTP to Malicious Timeservers? 
  Yarin Perry, Neta Rozen Schiff, and Michael Schapira. NDSS 21.​

​

• MPCC: Online Learning Multipath Transport
  Tomer Gilad, Neta Rozen Schiff, Brighten Godfrey, Costin Raiciu, and Michael Schapira. CoNEXT 20.
   

• Online Safety Assurance for Learning-Augmented Systems
  Noga H. Rotman, Michael Schapira, and Aviv Tamar. HotNets 20.
   

• On the Future of Congestion Control for the Public Internet
  Lloyd Brown et al. HotNets 20.
   

• PCC Proteus: Scavenger Transport and Beyond
  Meng Tong, Neta Rozen Schiff, Brighten Godfrey, and Michael Schapira. SIGCOMM 20.
   

• A Public Option for the Core
  Yotam Harchol, Dirk Bergemann, Nick Feamster, Eric Friedman, Arvind Krishnamurthy, Aurojit Panda, Sylvia Ratnasamy, Michael Schapira, and Scott Shenker. SIGCOMM 20.
   

• DISCO: Sidestepping RPKI’s Deployment Barriers
  Tomas Hlavacek, Italo Cunha, Yossi Gilad, Amir Herzberg, Ethan Katz-Bassett, Michael Schapira, and Haya Shulman. NDSS 20.

  • See also Perfect is the Enemy of Good: Setting Realistic Goals for BGP Security at HotNets 18.

​

• Robustifying Network Protocols with Adversarial Examples
  Tomer Gilad, Nathan Jay, Michael Shnaiderman, Brighten Godfrey, and Michael Schapira. HotNets 19.

 

• Beating BGP is Harder than We Thought
  Todd Arnold, Matt Calder, Italo Cuhna, Arpit Gupta, Harsha V. Madhysatha, Michael Schapira, and Ethan Katz-Bassett. HotNets 19.

 

• Approximate Moore Graphs are Good Expanders
  Michael Dinitz, Michael Schapira, and Gal Shahaf. Journal of Combinatorial Theory (Series B), 2019.

 

• TeaVaR: Striking the Right Utilization-Availability Balance in WAN Traffic Engineering
  Jeremy Bogle, Nikhil Bhatia, Manya Ghobadi, Ishai Menache, Nikolaj Bjorner, Asaf Valadarsky, and Michael Schapira. SIGCOMM 19.

  • See demo and code.

 

• Verifying Deep-RL-Driven Systems
  Yafim Kazak, Clark Barrett, Guy Katz, and Michael Schapira. NetAI 19.

 

• A Deep Reinforcement Learning Perspective on Internet Congestion Control
  Nathan Jay, Noga H. Rotman, Brighten Godfrey, Michael Schapira, and Aviv Tamar. ICML 19.
  See also Internet Congestion Control via Deep Reinforcement Learning at Deep Reinforcement Learning Symposium, NeurIPS 18.

 

• Axiomatizing Congestion Control
  Doron Zarchy, Radhika Mittal, Michael Schapira, and Scott Shenker. SIGMETRICS 19. POMACS 2019. 

  • See also An Axiomatic Approach to Congestion Control at HotNets 17.

​​​

• Congestion Control for Future Mobile Networks
  Simone Mangiante et al. CHANTS 18.
   

• PCC Vivace: Online-Learning Congestion Control

  Mo Dong, Tong Meng, Doron Zarchy, Engin Arslan, Yossi Gilad, Brighten Godfrey, and Michael Schapira. NSDI 18.

  • Video streaming demo

  • See PCC project webpage for code and additional material.
     

• Network-Model-Based vs. Network-Model-Free Approaches to Internet Congestion Control
  Michael Schapira. HPSR 18.
   

• Large Fixed-Diameter Graphs are Good Expanders
  Michael Dinitz, Michael Schapira, and Gal Shahaf. ESA 18.
   

• Nash-Peering: A New Techno-Economic Framework for Internet Interconnections

  Doron Zarchy, Amogh Dhamdhere, Constantine Dovrolis, and Michael Schapira. GI 18.
   

• Preventing (Network) Time Travel with Chronos
  Omer Deutsch, Neta Rozen Schiff, Danny Dolev, and Michael Schapira. NDSS 18.

  • Awarded the IETF/IRTF Applied Networking Research Prize (2019). 

  • See coverage of Chronos in The Register.
     

• Congestion-Control Throwdown
  Michael Schapira and Keith Winstein. HotNets 17.

  • See video of Keith and I battling out our disagreements.
     

• Learning to Route
  Asaf Valadarsky, Michael Schapira, Dafna Shahaf, and Aviv Tamar. HotNets 17.
   

• Learning to Route with Deep RL

  Asaf Valadarsky, Michael Schapira, Dafna Shahaf, and Aviv Tamar.
  Deep Reinforcement Learning Symposium, NeurIPS 17.
   

• SIXPACK: Securing Internet eXchange Points Against Curious onlooKers
  Marco Chiesa, Daniel Demmler,  Marco Canini,  Michael Schapira, and Thomas Schneider. CoNEXT 17.
  ​​

• Beyond Fat-Trees without Antennae, Mirrors, and Disco Balls
  Simon Kassing, Asaf Valadarsky, Gal Shahaf, Michael Schapira, and Ankit Singla. SIGCOMM 17.

  • See code for datacenter network generator and packet-level simulator for datacenter routing and congestion control.
     

• Are We There Yet?) On RPKI’s Deployment and Security
  Yossi Gilad, Avichai Cohen, Amir Herzberg, Michael Schapira, and Haya Shulman. NDSS 17.
   

• Privacy-Preserving Interdomain Routing at Internet Scale
  Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, and Michael Zohner. PETS 17.
   

• Rethinking Security for Internet Routing
  Robert Lychev, Michael Schapira, and Sharon Goldberg. Communications of the ACM (CACM), 2016.
   

• Jumpstarting BGP Security with Path-End Validation
  Avichai Cohen, Yossi Gilad, Amir Herzberg, and Michael Schapira. SIGCOMM 16.

  • Awarded the IETF/IRTF Applied Networking Research Prize (2017). 

  • See also One Hop for RPKI, One Giant Leap for BGP Security at HotNets 15.

  • A prototype implementation is available here.
     

• Xpander: Towards Optimal-Performance Datacenters

  Asaf Valadarsky, Gal Shahaf, Michael Dinitz, and Michael Schapira. CoNEXT 16.

  • See also Xpander: Unveiling the Secrets of High-Performance Datacenters at HotNets 15.

  • See project page for more details
     

• Oblivious Routing in IP Networks
  Marco Chiesa, Gabor Retvari, and Michael Schapira. CoNEXT 16. Transactions on Networking (ToN), 2018.
   

• The Quest for Resilient (Static) Forwarding Tables
  Marco Chiesa, Slobodan Mitrovic, Ilya Nikolaevskiy, Andrei Gurtov, Aurojit Panda, Aleksander Madry, Michael Schapira, and Scott Shenker. INFOCOM 16. Transactions on Networking (ToN), 2017.
   

• On the Resiliency of Randomized Routing Against Multiple Edge Failures
  Marco Chiesa, Andrei Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Schapira, and Scott Shenker. ICALP 16.
   

• Measuring and Mitigating AS-Level Adversaries against Tor
  Rishab Nithyanand, Oleksii Starov, Adva Zair, Phillipa Gill and Michael Schapira. NDSS 16.

  • Selected media coverage: Daily Dot, The Register, Slash Gear.

  • See source code
     

• Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension
  Amit Daniely, Michael Schapira, and Gal Shahaf. STOC 15. SIAM Journal on Computing (SICOMP) Special Issue on Selected Papers from STOC 15 (invited), 2018.
   

• Explicit Expanding Expanders
  Michael Dinitz, Michael Schapira, and Asaf Valadarsky. ESA 15. Algorithmica, 2017.|

• PCC: Re-architecting Congestion Control for Consistent High Performance
  Mo Dong, Qingxi Li, Doron Zarchy, P. Brighten Godfrey, and Michael Schapira. NSDI 15.

  • See PCC project webpage for demo, code and more.
    dd

• New Directions for Network Verification
  Aurojit Panda, Katerina Argyraki, Mooly Sagiv, Michael Schapira, and Scott Shenker. SNAPL 15.
   

• Capturing Resource Tradeoffs in Fair Multi-Resource Allocation
  Doron Zarchy, David Hay, and Michael Schapira. INFOCOM 15.

​

• VeriCon: Towards Verifying Controller Programs in Software-Defined Networks
  Thomas Ball, Nikolaj Bjørner, Aaron Gember, Shachar Itzhaky, Aleksandr Karbyshev, Mooly Sagiv, Michael Schapira, and Asaf Valadarsky. PLDI 14.
   

• Traffic Engineering with Equal-Cost-MultiPath: An Algorithmic Perspective

  Marco Chiesa, Guy Kindler, and Michael Schapira. INFOCOM 14. Transactions on Networking (ToN), 2017.

  • Awarded the IEEE Communication Society William R. Bennett Prize. 
     

• Self-Stabilizing Uncoupled Dynamics
  Aaron D. Jaggard, Neil Lutz, Michael Schapira and Rebecca N. Wright. SAGT 14.
   

• A Survey of Interdomain Routing Policies
  Phillipa Gill, Michael Schapira and Sharon Goldberg. Computer Communication Review (CCR), 2014.

  • Presented at NANOG 56 (2012). See slides.

​

• BGP Security in Partial Deployment: Is the Juice Worth the Squeeze?

  Robert Lychev, Sharon Goldberg and Michael Schapira. SIGCOMM 13.

  • Awarded the IETF/IRTF Applied Networking Research Prize (2014). 

  • See video of talk.

  • See coverage in the IETF Journal
     

• Pay or Play

  Sigal Oren, Michael Schapira and Moshe Tennenholtz. UAI 13.
   

• Best-Response Dynamics Out of Sync: Complexity and Characterization
  Roee Engelberg, Alex Fabrikant, Michael Schapira and David Wajc. EC 13.
   

• Ensuring Connectivity via Data-Plane Mechanisms
  Junda Liu, Aurojit Panda, Ankit Singla, P. Brighten Godfrey, Michael Schapira and Scott Shenker. NSDI 13.

  • See video of talk

  • See also Data-Driven Network Connectivity, Junda Liu, Baohua Yang, Michael Schapira and Scott Shenker. HotNets 11.

​

• A New Approach to Interdomain Routing Based on Secure Multi-Party Computation
  Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford and Scott Shenker. HotNets 12.
  
  Network Cooperation for Client-AP Association Optimization
  Akash Baid, Michael Schapira, Ivan Seskar, Jennifer Rexford, Dipankar Raychaudhuri. WiOpt 12.
   

• Rehoming Edge Links for Better Traffic Engineering
  Eric Keller, Michael Schapira and Jennifer Rexford. Computer Communication Review (CCR), 2012.
   

• Modeling on Quicksand: Dealing with the Scarcity of Ground Truth in Interdomain Routing Data
  Phillipa Gill, Michael Schapira and Sharon Goldberg. Computer Communication Review (CCR), 2012.

​

• Let the Market Drive Deployment: a Strategy for Transitioning to BGP Security

  Phillipa Gill, Michael Schapira and Sharon Goldberg. SIGCOMM 11.

  • Presented at NANOG 52 (2011).

  • See project page for videos, an extended abstract, and a results browser (an interactive interface for exploring BGP security deployment dynamics in our simulation results).

  • Our results spurred the creation of an FCC (Federal Communications Commission) Working Group on “Secure BGP Deployment”. See here.
     

• Weakly-Acyclic (Internet) Routing Games
  Roee Engelberg and Michael Schapira. SAGT 11. Theory of Computing Systems (TOCS), 2014.
   

• On Communication Protocols that Compute (Almost) Privately
  Marco Comi, Bhaskar Dasgupta, Michael Schapira and Venkatakumar Srinivasan. SAGT 11. Theoretical Computer Science (TCS), 2012.
   

• Best-Response Auctions
  Noam Nisan, Michael Schapira, Gregory Valiant and Aviv Zohar. EC 11.
   

• Distributed Computing With Adaptive Heuristics
  Aaron D. Jaggard, Michael Schapira and Rebecca N. Wright. ITCS 11.

  • See Brief Announcement: Distributed Computing with Rules of Thumb for a short exposition and overview of results. PODC 11.
     

• Best-Response Mechanisms
  Noam Nisan, Michael Schapira, Gregory Valiant and Aviv Zohar. ITCS 11.

  • See Brief Announcement: Incentive-Compatible Distributed Greedy Protocols for a high-level CS-friendly exposition. PODC 11.

  • See also short exposition of the motivation and results in When is it Best to Best-Respond? SIGecom Exchanges, June 2011.

​

• Putting BGP on the Right Path: Better Performance via Next-Hop Routing
  Michael Schapira, Yaping Zhu and Jennifer Rexford. HotNets 10.
   

• How Secure are Secure Interdomain Routing Protocols?
  Sharon Goldberg, Michael Schapira, Pete Hummon and Jennifer Rexford. SIGCOMM 10.

  • Presented at NANOG 49 (2010). See video.

  • Presented at Microsoft Techfest (2010). See video.
     

• Incentive Compatibility and Dynamics of Congestion Control
  P. Brighten Godfrey, Michael Schapira, Aviv Zohar and Scott Shenker. SIGMETRICS 10.
   

• On the Structure of Weakly-Acyclic Games
  Alex Fabraikant, Aaron D. Jaggard and Michael Schapira. SAGT 10. Theory of Computing Systems (TOCS), 2013.

  • Presented at the International Conference on Game Theory at Stony Brook University (2010).
     

• Approximate Privacy: Foundations and Quantification
  Joan Feigenbaum, Aaron Jaggard and Michael Schapira. EC 10. Transactions on Algorithms (TALG), 2014.
   

• Computation and Incentives in Combinatorial Public Projects\
  Dave Buchfuhrer, Michael Schapira and Yaron Singer. EC 10.
   

• VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
  Elchanan Mossel, Christos Papadimitriou, Michael Schapira and Yaron Singer.

  • See Inapproximability for VCG-based Combinatorial Auctions (merged paper), Dave Buchfuhrer et al. SODA 10.

• Neighbor-Specific BGP: More Flexible Routing Policies While Improving Global Stability
  Yi Wang, Michael Schapira and Jennifer Rexford. SIGMETRICS 09.

  • See also write-up for practitioners.
     

• Searching for Stability in Interdomain Routing
  Rahul Sami, Michael Schapira and Aviv Zohar. INFOCOM 09.

​

• On the Hardness of Being Truthful
  Christos Papadimitriou, Michael Schapira and Yaron Singer. FOCS 08.
   

• Informational Overhead of Incentive Compatibility
  Moshe Babaioff, Liad Blumrosen, Moni Naor and Michael Schapira. EC 08. Games and Economic Behavior (GEB), 2012.
   

• Tight Information-Theoretic Lower Bounds For Welfare Maximization in Combinatorial Auctions
  Vahab Mirrokni, Michael Schapira and Jan Vondrak. EC 08.
   

• Mechanism Design Over Discrete Domains

  • See short exposition of the motivation and some of the results in Characterizing Truthfulness in Discrete Domains, SIGecom Exchanges, June 2008.
    Ahuva Mu'alem and Michael Schapira. EC 08.
     

• Interdomain Routing and Games
  Hagay Levin, Michael Schapira and Aviv Zohar. STOC 08. SIAM Journal on Computing (SICOMP) Special Issue on Selected Papers from STOC 08 (invited), 2011.
   

• Asynchronous Best-Reply Dynamics
  Noam Nisan, Michael Schapira and Aviv Zohar. WINE 08.
   

• Inapproximability of Combinatorial Public Projects

  Michael Schapira and Yaron Singer. WINE 08.
   

• Bayesian Combinatorial Auctions
  George Christodoulou, Annamaria Kovacs and Michael Schapira. ICALP 08.  Journal of the ACM (JACM), 2015.

​

• Distributed Algorithmic Mechanism Design
  Joan Feigenbaum, Michael Schapira and Scott Shenker. Chapter in Algorithmic Game Theory, Cambridge University Press, 2007.
  ​

• Setting Lower Bounds on Truthfulness
  Ahuva Mu'alem and Michael Schapira. SODA 07. Games and Economic Behavior (GEB), 2018.

​

• Incentive-Compatible Interdomain Routing
  Joan Feigenbaum, Vijay Ramachandran and Michael Schapira. EC 06. Distributed Computing, 2011.
   

• Truthful Randomized Mechanisms for Combinatorial Auctions

  Shahar Dobzinski, Noam Nisan and Michael Schapira. STOC 06. JCSS Special Issue on Knowledge Representation and Reasoning (invited), 2011.
   

• An Improved Approximation Algorithm for Combinatorial Auctions with Submodular Bidders
  Shahar Dobzinski and Michael Schapira. SODA 06

​

• Approximation Algorithms for Combinatorial Auctions with Complement Free Bidders
  Shahar Dobzinski, Noam Nisan and Michael Schapira. STOC 05. Mathematics of Operations Research, 2010.