Anja Feldmann

Prof. Anja Feldmann, Ph.D.

Adresse
Max-Planck-Institut für Informatik
Saarland Informatics Campus
Campus E1 4
66123 Saarbrücken
Standort
E1 4 - 501
Telefon
+49 681 9325 3501
Fax
+49 681 9325 3599

Personal Information

I studied computer science at Universitaet Paderborn in Germany and received my degree in 1990. After that I continued my studies at Carnegie Mellon University, where I earned my M.Sc. in 1991 and, four years later, my Ph.D. The next four years I did postdoctoral work at AT&T Labs Research, before holding research positions at Saarland University and the Technical University Munich. Since 2006, I have been professor of Internet Network Architectures at Telekom Innovation Laboratories at Technische Universitaet Berlin. In May 2012, I was elected the first woman on the employer side of the Supervisory Board of SAP. Since the beginning of 2018 I am director at the Max Planck Institute for Informatics in Saarbruecken.

Recent Publications

2020
Feldmann, A., Gasser, O., Lichtblau, F., Pujol, E., Poese, I., Dietzel, C., … Smaragdakis, G. (2020). The Lockdown Effect: Implications of the COVID-19 Pandemic on Internet Traffic. Retrieved from http://arxiv.org/abs/2008.10959
(arXiv: 2008.10959)
Abstract
Due to the COVID-19 pandemic, many governments imposed lockdowns that forced hundred millions to stay at home. As a result of these measures, Internet traffic of residential users increased, in particular, for remote working, entertainment, commerce, and education. In turn, traffic demands in the Internet core shifted as well. In this paper, using data from a diverse set of vantage points (one ISP, three IXPs, and one metropolitan educational network), we study the effect of these lockdowns on traffic shifts. We find that the traffic volume increased by 15-20% almost within a week--while overall still modest, this constitutes a large increase within this short time period. The Internet infrastruct ure is able to handle this increase, as most traffic shifts occur outside of traditional peak hours. When looking at traffic sources, we find that while hypergiants still contribute a significant fraction of traffic, we see a higher increase in traffic of non-hypergiants. We observe traffic increases in applications such as Web conferencing, VPN, gaming, messaging that people use when at home. While many networks see increased traffic demands, in particular, residential users, others see major decreases, e.g., the in/out ratio of the educational network switched.
Export
BibTeX
@online{Feldmann_arXiv2008.10959, TITLE = {The Lockdown Effect: Implications of the {COVID}-19 Pandemic on Internet Traffic}, AUTHOR = {Feldmann, Anja and Gasser, Oliver and Lichtblau, Franziska and Pujol, Enric and Poese, Ingmar and Dietzel, Christoph and Wagner, Daniel and Wichtlhuber, Matthias and Tapiador, Juan and Vallina-Rodriguez, Narseo and Hohlfeld, Oliver and Smaragdakis, Georgios}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/2008.10959}, EPRINT = {2008.10959}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {Due to the COVID-19 pandemic, many governments imposed lockdowns that forced hundred millions to stay at home. As a result of these measures, Internet traffic of residential users increased, in particular, for remote working, entertainment, commerce, and education. In turn, traffic demands in the Internet core shifted as well. In this paper, using data from a diverse set of vantage points (one ISP, three IXPs, and one metropolitan educational network), we study the effect of these lockdowns on traffic shifts. We find that the traffic volume increased by 15-20% almost within a week--while overall still modest, this constitutes a large increase within this short time period. The Internet infrastruct ure is able to handle this increase, as most traffic shifts occur outside of traditional peak hours. When looking at traffic sources, we find that while hypergiants still contribute a significant fraction of traffic, we see a higher increase in traffic of non-hypergiants. We observe traffic increases in applications such as Web conferencing, VPN, gaming, messaging that people use when at home. While many networks see increased traffic demands, in particular, residential users, others see major decreases, e.g., the in/out ratio of the educational network switched.}, }
Endnote
%0 Report %A Feldmann, Anja %A Gasser, Oliver %A Lichtblau, Franziska %A Pujol, Enric %A Poese, Ingmar %A Dietzel, Christoph %A Wagner, Daniel %A Wichtlhuber, Matthias %A Tapiador, Juan %A Vallina-Rodriguez, Narseo %A Hohlfeld, Oliver %A Smaragdakis, Georgios %+ Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T The Lockdown Effect: Implications of the COVID-19 Pandemic on Internet Traffic : %G eng %U http://hdl.handle.net/21.11116/0000-0007-0641-9 %U http://arxiv.org/abs/2008.10959 %D 2020 %X Due to the COVID-19 pandemic, many governments imposed lockdowns that forced hundred millions to stay at home. As a result of these measures, Internet traffic of residential users increased, in particular, for remote working, entertainment, commerce, and education. In turn, traffic demands in the Internet core shifted as well. In this paper, using data from a diverse set of vantage points (one ISP, three IXPs, and one metropolitan educational network), we study the effect of these lockdowns on traffic shifts. We find that the traffic volume increased by 15-20% almost within a week--while overall still modest, this constitutes a large increase within this short time period. The Internet infrastruct ure is able to handle this increase, as most traffic shifts occur outside of traditional peak hours. When looking at traffic sources, we find that while hypergiants still contribute a significant fraction of traffic, we see a higher increase in traffic of non-hypergiants. We observe traffic increases in applications such as Web conferencing, VPN, gaming, messaging that people use when at home. While many networks see increased traffic demands, in particular, residential users, others see major decreases, e.g., the in/out ratio of the educational network switched. %K Computer Science, Networking and Internet Architecture, cs.NI,Computer Science, Computers and Society, cs.CY
Maghsoudlou, A., Gasser, O., & Feldmann, A. (2020). Reserved: Dissecting Internet Traffic on Port 0. In Extended abstract of a poster presented at Passive and Active Measurement Conference (PAM) 2020. Virtual Conference. Retrieved from http://arxiv.org/abs/2004.03653
(arXiv: 2004.03653)
Abstract
Transport protocols use port numbers to allow connection multiplexing on Internet hosts. TCP as well as UDP, the two most widely used transport protocols, have limitations on what constitutes a valid and invalid port number. One example of an invalid port number for these protocols is port 0. In this work, we present preliminary results from analyzing port 0 traffic at a large European IXP. In one week of traffic we find 74GB port 0 traffic. The vast majority of this traffic has both source and destination ports set to 0, suggesting scanning or reconnaissance as its root cause. Our analysis also shows that more than half of all port 0 traffic is targeted to just 18 ASes, whereas more than half of all traffic is originated by about 100 ASes, suggesting a more diverse set of source ASes.
Export
BibTeX
@inproceedings{Maghsoudlou_PAM2020, TITLE = {Reserved: {D}issecting Internet Traffic on Port 0}, AUTHOR = {Maghsoudlou, Aniss and Gasser, Oliver and Feldmann, Anja}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/2004.03653}, EPRINT = {2004.03653}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {Transport protocols use port numbers to allow connection multiplexing on Internet hosts. TCP as well as UDP, the two most widely used transport protocols, have limitations on what constitutes a valid and invalid port number. One example of an invalid port number for these protocols is port 0. In this work, we present preliminary results from analyzing port 0 traffic at a large European IXP. In one week of traffic we find 74GB port 0 traffic. The vast majority of this traffic has both source and destination ports set to 0, suggesting scanning or reconnaissance as its root cause. Our analysis also shows that more than half of all port 0 traffic is targeted to just 18 ASes, whereas more than half of all traffic is originated by about 100 ASes, suggesting a more diverse set of source ASes.}, BOOKTITLE = {Extended abstract of a poster presented at Passive and Active Measurement Conference (PAM) 2020}, ADDRESS = {Virtual Conference}, }
Endnote
%0 Conference Proceedings %A Maghsoudlou, Aniss %A Gasser, Oliver %A Feldmann, Anja %+ Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society %T Reserved: Dissecting Internet Traffic on Port 0 : %G eng %U http://hdl.handle.net/21.11116/0000-0006-0D13-7 %U http://arxiv.org/abs/2004.03653 %D 2020 %B The Passive and Active Measurement Conference %Z date of event: 2020-03-30 - 2020-03-31 %C Virtual Conference %X Transport protocols use port numbers to allow connection multiplexing on Internet hosts. TCP as well as UDP, the two most widely used transport protocols, have limitations on what constitutes a valid and invalid port number. One example of an invalid port number for these protocols is port 0. In this work, we present preliminary results from analyzing port 0 traffic at a large European IXP. In one week of traffic we find 74GB port 0 traffic. The vast majority of this traffic has both source and destination ports set to 0, suggesting scanning or reconnaissance as its root cause. Our analysis also shows that more than half of all port 0 traffic is targeted to just 18 ASes, whereas more than half of all traffic is originated by about 100 ASes, suggesting a more diverse set of source ASes. %K Computer Science, Networking and Internet Architecture, cs.NI %B Extended abstract of a poster presented at Passive and Active Measurement Conference (PAM) 2020
Shukla, A., Saidi, S. J., Schmid, S., Canini, M., Zinner, T., & Feldmann, A. (2020). Toward Consistent SDNs: A Case for Network State Fuzzing. IEEE Transactions on Network and Service Management, 17(2). doi:10.1109/TNSM.2019.2955790
Export
BibTeX
@article{Shukla2020, TITLE = {Toward Consistent {SDNs}: {A} Case for Network State Fuzzing}, AUTHOR = {Shukla, Apoorv and Saidi, S. Jawad and Schmid, Stefan and Canini, Marco and Zinner, Thomas and Feldmann, Anja}, LANGUAGE = {eng}, ISSN = {1932-4537}, DOI = {10.1109/TNSM.2019.2955790}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2020}, JOURNAL = {IEEE Transactions on Network and Service Management}, VOLUME = {17}, NUMBER = {2}, PAGES = {668--681}, }
Endnote
%0 Journal Article %A Shukla, Apoorv %A Saidi, S. Jawad %A Schmid, Stefan %A Canini, Marco %A Zinner, Thomas %A Feldmann, Anja %+ External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Toward Consistent SDNs: A Case for Network State Fuzzing : %G eng %U http://hdl.handle.net/21.11116/0000-0006-DADE-B %R 10.1109/TNSM.2019.2955790 %7 2020 %D 2020 %J IEEE Transactions on Network and Service Management %V 17 %N 2 %& 668 %P 668 - 681 %I IEEE %C Piscataway, NJ %@ false
Semmler, N., Rost, M., Smaragdakis, G., & Feldmann, A. (2020). Edge Replication Strategies for Wide-Area Distributed Processing. In EdgeSys’20, Third ACM International Workshop on Edge Systems, Analytics and Networking. Heraklion, Greece: ACM. doi:10.1145/3378679.3394532
Export
BibTeX
@inproceedings{Semmler_EdgeSys2020, TITLE = {Edge Replication Strategies for Wide-Area Distributed Processing}, AUTHOR = {Semmler, Niklas and Rost, Matthias and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-7132-2}, DOI = {10.1145/3378679.3394532}, PUBLISHER = {ACM}, YEAR = {2020}, BOOKTITLE = {EdgeSys'20, Third ACM International Workshop on Edge Systems, Analytics and Networking}, PAGES = {1--6}, ADDRESS = {Heraklion, Greece}, }
Endnote
%0 Conference Proceedings %A Semmler, Niklas %A Rost, Matthias %A Smaragdakis, Georgios %A Feldmann, Anja %+ External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Edge Replication Strategies for Wide-Area Distributed Processing : %G eng %U http://hdl.handle.net/21.11116/0000-0007-0A9F-C %R 10.1145/3378679.3394532 %D 2020 %B Third ACM International Workshop on Edge Systems, Analytics and Networking %Z date of event: 2020-04-27 - 2020-04-27 %C Heraklion, Greece %B EdgeSys'20 %P 1 - 6 %I ACM %@ 978-1-4503-7132-2
Shukla, A., Hudemann, K., Vági, Z., Hügerich, L., Smaragdakis, G., Schmid, S., … Feldmann, A. (2020). Towards Runtime Verification of Programmable Switches. Retrieved from http://arxiv.org/abs/2004.10887
(arXiv: 2004.10887)
Abstract
Is it possible to patch software bugs in P4 programs without human involvement? We show that this is partially possible in many cases due to advances in software testing and the structure of P4 programs. Our insight is that runtime verification can detect bugs, even those that are not detected at compile-time, with machine learning-guided fuzzing. This enables a more automated and real-time localization of bugs in P4 programs using software testing techniques like Tarantula. Once the bug in a P4 program is localized, the faulty code can be patched due to the programmable nature of P4. In addition, platform-dependent bugs can be detected. From P4_14 to P4_16 (latest version), our observation is that as the programmable blocks increase, the patchability of P4 programs increases accordingly. To this end, we design, develop, and evaluate P6 that (a) detects, (b) localizes, and (c) patches bugs in P4 programs with minimal human interaction. P6 tests P4 switch non-intrusively, i.e., requires no modification to the P4 program for detecting and localizing bugs. We used a P6 prototype to detect and patch seven existing bugs in eight publicly available P4 application programs deployed on two different switch platforms: behavioral model (bmv2) and Tofino. Our evaluation shows that P6 significantly outperforms bug detection baselines while generating fewer packets and patches bugs in P4 programs such as switch.p4 without triggering any regressions.
Export
BibTeX
@online{Shukla_arXiv2004.10887, TITLE = {Towards Runtime Verification of Programmable Switches}, AUTHOR = {Shukla, Apoorv and Hudemann, Kevin and V{\'a}gi, Zsolt and H{\"u}gerich, Lily and Smaragdakis, Georgios and Schmid, Stefan and Hecker, Artur and Feldmann, Anja}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/2004.10887}, EPRINT = {2004.10887}, EPRINTTYPE = {arXiv}, YEAR = {2020}, ABSTRACT = {Is it possible to patch software bugs in P4 programs without human involvement? We show that this is partially possible in many cases due to advances in software testing and the structure of P4 programs. Our insight is that runtime verification can detect bugs, even those that are not detected at compile-time, with machine learning-guided fuzzing. This enables a more automated and real-time localization of bugs in P4 programs using software testing techniques like Tarantula. Once the bug in a P4 program is localized, the faulty code can be patched due to the programmable nature of P4. In addition, platform-dependent bugs can be detected. From P4_14 to P4_16 (latest version), our observation is that as the programmable blocks increase, the patchability of P4 programs increases accordingly. To this end, we design, develop, and evaluate P6 that (a) detects, (b) localizes, and (c) patches bugs in P4 programs with minimal human interaction. P6 tests P4 switch non-intrusively, i.e., requires no modification to the P4 program for detecting and localizing bugs. We used a P6 prototype to detect and patch seven existing bugs in eight publicly available P4 application programs deployed on two different switch platforms: behavioral model (bmv2) and Tofino. Our evaluation shows that P6 significantly outperforms bug detection baselines while generating fewer packets and patches bugs in P4 programs such as switch.p4 without triggering any regressions.}, }
Endnote
%0 Report %A Shukla, Apoorv %A Hudemann, Kevin %A Vági, Zsolt %A Hügerich, Lily %A Smaragdakis, Georgios %A Schmid, Stefan %A Hecker, Artur %A Feldmann, Anja %+ External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Towards Runtime Verification of Programmable Switches : %G eng %U http://hdl.handle.net/21.11116/0000-0007-0AAD-C %U http://arxiv.org/abs/2004.10887 %D 2020 %X Is it possible to patch software bugs in P4 programs without human involvement? We show that this is partially possible in many cases due to advances in software testing and the structure of P4 programs. Our insight is that runtime verification can detect bugs, even those that are not detected at compile-time, with machine learning-guided fuzzing. This enables a more automated and real-time localization of bugs in P4 programs using software testing techniques like Tarantula. Once the bug in a P4 program is localized, the faulty code can be patched due to the programmable nature of P4. In addition, platform-dependent bugs can be detected. From P4_14 to P4_16 (latest version), our observation is that as the programmable blocks increase, the patchability of P4 programs increases accordingly. To this end, we design, develop, and evaluate P6 that (a) detects, (b) localizes, and (c) patches bugs in P4 programs with minimal human interaction. P6 tests P4 switch non-intrusively, i.e., requires no modification to the P4 program for detecting and localizing bugs. We used a P6 prototype to detect and patch seven existing bugs in eight publicly available P4 application programs deployed on two different switch platforms: behavioral model (bmv2) and Tofino. Our evaluation shows that P6 significantly outperforms bug detection baselines while generating fewer packets and patches bugs in P4 programs such as switch.p4 without triggering any regressions. %K Computer Science, Software Engineering, cs.SE,Computer Science, Learning, cs.LG,Computer Science, Networking and Internet Architecture, cs.NI
Enghardt, T., Zinner, T., & Feldmann, A. (2020). Using Informed Access Network Selection to Improve HTTP Adaptive Streaming Performance. In MMSys’20, 11th ACM Multimedia Systems Conference. Istanbul, Turkey: ACM. doi:10.1145/3339825.3391865
Export
BibTeX
@inproceedings{Enghardt_MMSys2020, TITLE = {Using Informed Access Network Selection to Improve {HTTP} Adaptive Streaming Performance}, AUTHOR = {Enghardt, Theresa and Zinner, Thomas and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-6845-2}, DOI = {10.1145/3339825.3391865}, PUBLISHER = {ACM}, YEAR = {2020}, BOOKTITLE = {MMSys'20, 11th ACM Multimedia Systems Conference}, PAGES = {126--140}, ADDRESS = {Istanbul, Turkey}, }
Endnote
%0 Conference Proceedings %A Enghardt, Theresa %A Zinner, Thomas %A Feldmann, Anja %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Using Informed Access Network Selection to Improve HTTP Adaptive Streaming Performance : %G eng %U http://hdl.handle.net/21.11116/0000-0007-0AA5-4 %R 10.1145/3339825.3391865 %D 2020 %B 11th ACM Multimedia Systems Conference %Z date of event: 2020-06-08 - 2020-06-11 %C Istanbul, Turkey %B MMSys'20 %P 126 - 140 %I ACM %@ 978-1-4503-6845-2
2019
Enghardt, T., Zinner, T., & Feldmann, A. (2019). Web Performance Pitfalls. In Passive and Active Measurement Conference (PAM 2019). Puerto Varas, Chile: Springer. doi:10.1007/978-3-030-15986-3_19
Export
BibTeX
@inproceedings{Engelhardt_PAM2019, TITLE = {Web Performance Pitfalls}, AUTHOR = {Enghardt, Theresa and Zinner, Thomas and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-3-030-15985-6}, DOI = {10.1007/978-3-030-15986-3_19}, PUBLISHER = {Springer}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {Passive and Active Measurement Conference (PAM 2019)}, EDITOR = {Choffnes, David and Barcellos, Marinho}, PAGES = {286--303}, SERIES = {Lecture Notes in Computer Science}, VOLUME = {11419}, ADDRESS = {Puerto Varas, Chile}, }
Endnote
%0 Conference Proceedings %A Enghardt, Theresa %A Zinner, Thomas %A Feldmann, Anja %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Web Performance Pitfalls : %G eng %U http://hdl.handle.net/21.11116/0000-0002-F657-7 %R 10.1007/978-3-030-15986-3_19 %D 2019 %B 20th Passive and Active Measurement Conference %Z date of event: 2019-03-27 - 2019-03-29 %C Puerto Varas, Chile %B Passive and Active Measurement Conference %E Choffnes, David; Barcellos, Marinho %P 286 - 303 %I Springer %@ 978-3-030-15985-6 %B Lecture Notes in Computer Science %N 11419
Shukla, A., Saidi, S. J., Schmid, S., Canini, M., Zinner, T., & Feldmann, A. (2019a). Towards Consistent SDNs: A Case for Network State Fuzzing. IEEE Transactions on Network and Service Management, (Early Access). doi:10.1109/TNSM.2019.2955790
Export
BibTeX
@article{Shukla_2019, TITLE = {Towards Consistent {SDNs}: {A} Case for Network State Fuzzing}, AUTHOR = {Shukla, Apoorv and Saidi, Said Jawad and Schmid, Stefan and Canini, Marco and Zinner, Thomas and Feldmann, Anja}, LANGUAGE = {eng}, ISSN = {1932-4537}, DOI = {10.1109/TNSM.2019.2955790}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, JOURNAL = {IEEE Transactions on Network and Service Management}, NUMBER = {Early Access}, }
Endnote
%0 Journal Article %A Shukla, Apoorv %A Saidi, Said Jawad %A Schmid, Stefan %A Canini, Marco %A Zinner, Thomas %A Feldmann, Anja %+ External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Towards Consistent SDNs: A Case for Network State Fuzzing : %G eng %U http://hdl.handle.net/21.11116/0000-0005-492A-B %R 10.1109/TNSM.2019.2955790 %7 2019 %D 2019 %J IEEE Transactions on Network and Service Management %N Early Access %I IEEE %C Piscataway, NJ %@ false
Bajpai, V., Brunstrom, A., Feldmann, A., Kellerer, W., Pras, A., Schulzrinne, H., … Wehrle, K. (2019a). The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research. ACM SIGCOMM Computer Communication Review, 49(1). doi:10.1145/3314212.3314217
Export
BibTeX
@article{Bajpai2019, TITLE = {The {D}agstuhl Beginners Guide to Reproducibility for Experimental Networking Research}, AUTHOR = {Bajpai, Vaibhav and Brunstrom, Anna and Feldmann, Anja and Kellerer, Wolfgang and Pras, Aiko and Schulzrinne, Henning and Smaragdakis, Georgios and W{\"a}hlisch, Matthias and Wehrle, Klaus}, LANGUAGE = {eng}, ISSN = {0146-4833}, DOI = {10.1145/3314212.3314217}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {ACM SIGCOMM Computer Communication Review}, VOLUME = {49}, NUMBER = {1}, PAGES = {24--30}, }
Endnote
%0 Journal Article %A Bajpai, Vaibhav %A Brunstrom, Anna %A Feldmann, Anja %A Kellerer, Wolfgang %A Pras, Aiko %A Schulzrinne, Henning %A Smaragdakis, Georgios %A Wählisch, Matthias %A Wehrle, Klaus %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research : %G eng %U http://hdl.handle.net/21.11116/0000-0003-36CA-D %R 10.1145/3314212.3314217 %7 2019 %D 2019 %J ACM SIGCOMM Computer Communication Review %V 49 %N 1 %& 24 %P 24 - 30 %I ACM %C New York, NY %@ false
Bajpai, V., Brunstrom, A., Feldmann, A., Kellerer, W., Pras, A., Schulzrinne, H., … Wehrle, K. (2019b). The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research. Retrieved from http://arxiv.org/abs/1902.02165
(arXiv: 1902.02165)
Abstract
Reproducibility is one of the key characteristics of good science, but hard to achieve for experimental disciplines like Internet measurements and networked systems. This guide provides advice to researchers, particularly those new to the field, on designing experiments so that their work is more likely to be reproducible and to serve as a foundation for follow-on work by others.
Export
BibTeX
@online{Bajpai_arXiv2019, TITLE = {The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research}, AUTHOR = {Bajpai, Vaibhav and Brunstrom, Anna and Feldmann, Anja and Kellerer, Wolfgang and Pras, Aiko and Schulzrinne, Henning and Smaragdakis, Georgios and W{\"a}hlisch, Matthias and Wehrle, Klaus}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1902.02165}, EPRINT = {1902.02165}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {Reproducibility is one of the key characteristics of good science, but hard to achieve for experimental disciplines like Internet measurements and networked systems. This guide provides advice to researchers, particularly those new to the field, on designing experiments so that their work is more likely to be reproducible and to serve as a foundation for follow-on work by others.}, }
Endnote
%0 Report %A Bajpai, Vaibhav %A Brunstrom, Anna %A Feldmann, Anja %A Kellerer, Wolfgang %A Pras, Aiko %A Schulzrinne, Henning %A Smaragdakis, Georgios %A Wählisch, Matthias %A Wehrle, Klaus %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research : %G eng %U http://hdl.handle.net/21.11116/0000-0003-F012-9 %U http://arxiv.org/abs/1902.02165 %D 2019 %X Reproducibility is one of the key characteristics of good science, but hard to achieve for experimental disciplines like Internet measurements and networked systems. This guide provides advice to researchers, particularly those new to the field, on designing experiments so that their work is more likely to be reproducible and to serve as a foundation for follow-on work by others. %K Computer Science, Networking and Internet Architecture, cs.NI
Pujol, E., Poese, I., Zerwas, J., Smaragdakis, G., & Feldmann, A. (2019). Steering Hyper-Giants’ Traffic at Scale. In CoNEXT’19, 15th International Conference on Emerging Networking Experiments And Technologies. Orlando, FL, USA: ACM. doi:10.1145/3359989.3365430
Export
BibTeX
@inproceedings{Pujol_CoNEXT2019, TITLE = {Steering Hyper-Giants' Traffic at Scale}, AUTHOR = {Pujol, Enric and Poese, Ingmar and Zerwas, Johannes and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-6998-5}, DOI = {10.1145/3359989.3365430}, PUBLISHER = {ACM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {CoNEXT'19, 15th International Conference on Emerging Networking Experiments And Technologies}, PAGES = {82--95}, ADDRESS = {Orlando, FL, USA}, }
Endnote
%0 Conference Proceedings %A Pujol, Enric %A Poese, Ingmar %A Zerwas, Johannes %A Smaragdakis, Georgios %A Feldmann, Anja %+ External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Steering Hyper-Giants' Traffic at Scale : %G eng %U http://hdl.handle.net/21.11116/0000-0005-74C6-9 %R 10.1145/3359989.3365430 %D 2019 %B 15th International Conference on Emerging Networking Experiments And Technologies %Z date of event: 2019-12-09 - 2019-12-12 %C Orlando, FL, USA %B CoNEXT'19 %P 82 - 95 %I ACM %@ 978-1-4503-6998-5
Semmler, N., Smaragdakis, G., & Feldmann, A. (2019a). Online Replication Strategies for Distributed Data Stores. Open Journal of Internet Of Things, 5(1). Retrieved from urn:nbn:de:101:1-2019092919335387371884
Export
BibTeX
@article{Semmler2019, TITLE = {Online Replication Strategies for Distributed Data Stores}, AUTHOR = {Semmler, Niklas and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISSN = {2364-7108}, URL = {urn:nbn:de:101:1-2019092919335387371884}, PUBLISHER = {RonPub UG}, ADDRESS = {L{\"u}beck}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, JOURNAL = {Open Journal of Internet Of Things}, VOLUME = {5}, NUMBER = {1}, PAGES = {47--57}, }
Endnote
%0 Journal Article %A Semmler, Niklas %A Smaragdakis, Georgios %A Feldmann, Anja %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Online Replication Strategies for Distributed Data Stores : %G eng %U http://hdl.handle.net/21.11116/0000-0005-74C1-E %U urn:nbn:de:101:1-2019092919335387371884 %F OTHER: GLN-LP 1195986211 %7 2019 %D 2019 %J Open Journal of Internet Of Things %O OJIOT %V 5 %N 1 %& 47 %P 47 - 57 %I RonPub UG %C Lübeck %@ false
Semmler, N., Smaragdakis, G., & Feldmann, A. (2019b). Distributed Mega-Datasets: The Need for Novel Computing Primitives. In 39th IEEE International Conference on Distributed Computing Systems (ICDCS 2019). Richardson, TX, USA: IEEE Computer Society. doi:10.1109/ICDCS.2019.00167
Export
BibTeX
@inproceedings{Semmler_ICDCS2019, TITLE = {Distributed Mega-Datasets: {T}he Need for Novel Computing Primitives}, AUTHOR = {Semmler, Niklas and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-7281-2519-0}, DOI = {10.1109/ICDCS.2019.00167}, PUBLISHER = {IEEE Computer Society}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, BOOKTITLE = {39th IEEE International Conference on Distributed Computing Systems (ICDCS 2019)}, PAGES = {1684--1692}, ADDRESS = {Richardson, TX, USA}, }
Endnote
%0 Conference Proceedings %A Semmler, Niklas %A Smaragdakis, Georgios %A Feldmann, Anja %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Distributed Mega-Datasets: The Need for Novel Computing Primitives : %G eng %U http://hdl.handle.net/21.11116/0000-0005-74CE-1 %R 10.1109/ICDCS.2019.00167 %D 2019 %B 39th IEEE International Conference on Distributed Computing Systems %Z date of event: 2019-07-07 - 2019-07-09 %C Richardson, TX, USA %B 39th IEEE International Conference on Distributed Computing Systems %P 1684 - 1692 %I IEEE Computer Society %@ 978-1-7281-2519-0
Shukla, A., Saidi, S. J., Schmid, S., Canini, M., Zinner, T., & Feldmann, A. (2019b). Consistent SDNs through Network State Fuzzing. Retrieved from http://arxiv.org/abs/1904.08977
(arXiv: 1904.08977)
Abstract
The conventional wisdom is that a software-defined network (SDN) operates under the premise that the logically centralized control plane has an accurate representation of the actual data plane state. Nevertheless, bugs, misconfigurations, faults or attacks can introduce inconsistencies that undermine correct operation. Previous work in this area, however, lacks a holistic methodology to tackle this problem and thus, addresses only certain parts of the problem. Yet, the consistency of the overall system is only as good as its least consistent part. Motivated by an analogy of network consistency checking with program testing, we propose to add active probe-based network state fuzzing to our consistency check repertoire. Hereby, our system, PAZZ, combines production traffic with active probes to continuously test if the actual forwarding path and decision elements (on the data plane) correspond to the expected ones (on the control plane). Our insight is that active traffic covers the inconsistency cases beyond the ones identified by passive traffic. PAZZ prototype was built and evaluated on topologies of varying scale and complexity. Our results show that PAZZ requires minimal network resources to detect persistent data plane faults through fuzzing and localize them quickly.
Export
BibTeX
@online{Shukla_arXiv1904.08977, TITLE = {Consistent {SDNs} through Network State Fuzzing}, AUTHOR = {Shukla, Apoorv and Saidi, Said Jawad and Schmid, Stefan and Canini, Marco and Zinner, Thomas and Feldmann, Anja}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1904.08977}, EPRINT = {1904.08977}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {The conventional wisdom is that a software-defined network (SDN) operates under the premise that the logically centralized control plane has an accurate representation of the actual data plane state. Nevertheless, bugs, misconfigurations, faults or attacks can introduce inconsistencies that undermine correct operation. Previous work in this area, however, lacks a holistic methodology to tackle this problem and thus, addresses only certain parts of the problem. Yet, the consistency of the overall system is only as good as its least consistent part. Motivated by an analogy of network consistency checking with program testing, we propose to add active probe-based network state fuzzing to our consistency check repertoire. Hereby, our system, PAZZ, combines production traffic with active probes to continuously test if the actual forwarding path and decision elements (on the data plane) correspond to the expected ones (on the control plane). Our insight is that active traffic covers the inconsistency cases beyond the ones identified by passive traffic. PAZZ prototype was built and evaluated on topologies of varying scale and complexity. Our results show that PAZZ requires minimal network resources to detect persistent data plane faults through fuzzing and localize them quickly.}, }
Endnote
%0 Report %A Shukla, Apoorv %A Saidi, Said Jawad %A Schmid, Stefan %A Canini, Marco %A Zinner, Thomas %A Feldmann, Anja %+ External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Consistent SDNs through Network State Fuzzing : %G eng %U http://hdl.handle.net/21.11116/0000-0003-F027-2 %U http://arxiv.org/abs/1904.08977 %D 2019 %X The conventional wisdom is that a software-defined network (SDN) operates under the premise that the logically centralized control plane has an accurate representation of the actual data plane state. Nevertheless, bugs, misconfigurations, faults or attacks can introduce inconsistencies that undermine correct operation. Previous work in this area, however, lacks a holistic methodology to tackle this problem and thus, addresses only certain parts of the problem. Yet, the consistency of the overall system is only as good as its least consistent part. Motivated by an analogy of network consistency checking with program testing, we propose to add active probe-based network state fuzzing to our consistency check repertoire. Hereby, our system, PAZZ, combines production traffic with active probes to continuously test if the actual forwarding path and decision elements (on the data plane) correspond to the expected ones (on the control plane). Our insight is that active traffic covers the inconsistency cases beyond the ones identified by passive traffic. PAZZ prototype was built and evaluated on topologies of varying scale and complexity. Our results show that PAZZ requires minimal network resources to detect persistent data plane faults through fuzzing and localize them quickly. %K Computer Science, Networking and Internet Architecture, cs.NI

More Publications

More Publications can be found here:

Research Interests

  • Internet traffic analysis
  • Internet Modeling
  • Internet Routing

Honours and Awards

  • 2018: Schelling Prize
  • 2017: Scientific member of the Max Planck Society
  • 2013: Full member of the Academia Europaea
  • 2011: Gottfried Wilhelm Leibniz Prize
  • 2011: Berlin Science Prize
  • since March 2010: Member of AcademiaNet after nomination by Leopoldina and the German Research Foundation
  • since July 15, 2009: Member (Matricel-No. 7279) of the German Academy of Sciences Leopoldina

Teachings