eBPF (extended Berkeley Packet Filter) is an innovative technology that has been gaining popularity in the networking and operating system community for its flexibility, safety, and efficiency in programming end-host network and OS stacks. Despite the numerous advantages of eBPF, there are several research challenges in leveraging it for novel use cases. These challenges include the difficulty in integrating eBPF into current systems, the potential performance overhead when executed in the kernel, limitations of existing programming hooks and APIs, and the programming restrictions and challenges imposed by the need for safety as enforced by the eBPF verifier. To tackle these issues, a cross-disciplinary approach is necessary, combining techniques across network protocol design, programming languages, operating systems, compilers, hardware architecture, and formal verification.
The workshop aims to bring together experts and practitioners in the field of eBPF, end-host networking, and operating systems to discuss and present the latest advances to support and apply this cutting edge technology. Submissions may show the benefits that eBPF can bring to real-world systems, explore mechanisms to improve or re-design existing eBPF mechanisms, examine the security implications of end-host programmability, or present measurement studies that reveal new and interesting directions for this ecosystem. We are looking for novel and previously unpublished ideas, systems, and measurements that address key issues and challenges in this growing area, position papers that outline directions for the research community, as well as preliminary papers from ongoing projects that could benefit from early community feedback.
We welcome submissions including, but not limited to the following topics:
The 2nd workshop on eBPF and kernel extensions solicits submissions. We are looking for two-types of submissions:
Both types of papers can use as many additional pages as necessary for citations, and should be written using the two-column 10pt ACM sigconf format (https://github.com/scyue/latex-sigcomm18). All submissions are double-blind. The program committee will review papers to determine relevance to the workshop, quality, and on the likelihood that it will elicit discussion among the attendees. At least one author from each accepted submission must attend the workshop to present and discuss their work.
Please submit your paper via https://ebpf24.hotcrp.com/
If you have any questions or problems with your submission, please get in touch with Sebastiano Miano (sebastiano.miano@polimi.it) or Srinivas Narayana Ganapathy (sn624@cs.rutgers.edu).
Workshop Chairs | |
Sebastiano Miano | Politecnico di Milano |
Srinivas Narayana | Rutgers University |
Gianni Antichi | Politecnico di Milano |
Aurojit Panda | New York University |
Programe Committee | |
Yang Zhou | Harvard University |
Stefan Schmid | TU Berlin |
Marios Kogias | Imperial College London |
Santosh Nagarakatte | Rutgers University |
Kostis Kaffes | Columbia University |
Yu Jiang | Tsinghua University |
Daniel Balasubramanian | Vanderbilt University |
Xiaoqi Chen | VMware research / Purdue University |
Gábor Rétvári | BME |
Salvatore Pontarelli | Sapienza Università di Roma |
Tom Barbette | UCLouvain |
Tamás Lévai | Budapest University of Technology and Economics |
Oliver Michel | Princeton University |
Tianyin Xu | University of Illinois Urbana-Champaign |
Paul Chaignon | Isovalent |
Toke Høiland-Jørgensen | Red Hat |
Ben Pfaff | Feldera |
Theophilus A. Benson | Carnegie Mellon University |
Quentin De Coninck | Université de Mons (UMONS) |
Ryan Stutsman | University of Utah |
Dan Williams | Virginia Tech |
Rémi Delmas | Amazon Web Services |
Alireza Farshin | NVIDIA |
Asaf Cidon | Columbia University |
Alireza Sanaee | Queen Mary University of London |
Rishabh Iyer | UC Berkeley |
Ilias Marinos | Microsoft Research |
Luca Niccolini | Meta |