Publications

2020
[1]
C. Coupette and C. Lenzen, “A Breezing Proof of the KMW Bound,” 2020. [Online]. Available: https://arxiv.org/abs/2002.06005. (arXiv: 2002.06005)
Abstract
In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum degree $\Delta$ on which $\Omega(\min\{\sqrt{\log n/\log \log n},\log \Delta/\log \log \Delta\})$ (expected) communication rounds are required to obtain polylogarithmic approximations to a minimum vertex cover, minimum dominating set, or maximum matching. Via reduction, this hardness extends to symmetry breaking tasks like finding maximal independent sets or maximal matchings. Today, more than $15$ years later, there is still no proof of this result that is easy on the reader. Setting out to change this, in this work, we provide a fully self-contained and $\mathit{simple}$ proof of the KMW lower bound. The key argument is algorithmic, and it relies on an invariant that can be readily verified from the generation rules of the lower bound graphs.
Export
BibTeX
@online{Coupette_arXiv2002.06005, TITLE = {A Breezing Proof of the {KMW} Bound}, AUTHOR = {Coupette, Corinna and Lenzen, Christoph}, LANGUAGE = {eng}, URL = {https://arxiv.org/abs/2002.06005}, EPRINT = {2002.06005}, EPRINTTYPE = {arXiv}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, ABSTRACT = {In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum degree $\Delta$ on which $\Omega(\min\{\sqrt{\log n/\log \log n},\log \Delta/\log \log \Delta\})$ (expected) communication rounds are required to obtain polylogarithmic approximations to a minimum vertex cover, minimum dominating set, or maximum matching. Via reduction, this hardness extends to symmetry breaking tasks like finding maximal independent sets or maximal matchings. Today, more than $15$ years later, there is still no proof of this result that is easy on the reader. Setting out to change this, in this work, we provide a fully self-contained and $\mathit{simple}$ proof of the KMW lower bound. The key argument is algorithmic, and it relies on an invariant that can be readily verified from the generation rules of the lower bound graphs.}, }
Endnote
%0 Report %A Coupette, Corinna %A Lenzen, Christoph %+ Internet Architecture, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society %T A Breezing Proof of the KMW Bound : %G eng %U http://hdl.handle.net/21.11116/0000-0007-46DC-3 %U https://arxiv.org/abs/2002.06005 %D 2020 %X In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum degree $\Delta$ on which $\Omega(\min\{\sqrt{\log n/\log \log n},\log \Delta/\log \log \Delta\})$ (expected) communication rounds are required to obtain polylogarithmic approximations to a minimum vertex cover, minimum dominating set, or maximum matching. Via reduction, this hardness extends to symmetry breaking tasks like finding maximal independent sets or maximal matchings. Today, more than $15$ years later, there is still no proof of this result that is easy on the reader. Setting out to change this, in this work, we provide a fully self-contained and $\mathit{simple}$ proof of the KMW lower bound. The key argument is algorithmic, and it relies on an invariant that can be readily verified from the generation rules of the lower bound graphs. %K Computer Science, Distributed, Parallel, and Cluster Computing, cs.DC,Computer Science, Computational Complexity, cs.CC,Computer Science, Discrete Mathematics, cs.DM,Computer Science, Data Structures and Algorithms, cs.DS
[2]
T. Enghardt, T. Zinner, and A. Feldmann, “Using Informed Access Network Selection to Improve HTTP Adaptive Streaming Performance,” in MMSys’20, 11th ACM Multimedia Systems Conference, Istanbul, Turkey, 2020.
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}, MARGINALMARK = {$\bullet$}, 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
[3]
A. Feldmann, O. Gasser, F. Lichtblau, E. Pujol, I. Poese, C. Dietzel, D. Wagner, M. Wichtlhuber, J. Tapiador, N. Vallina-Rodriguez, O. Hohlfeld, and G. Smaragdakis, “The Lockdown Effect: Implications of the COVID-19 Pandemic on Internet Traffic,” in IMC’20, 20th ACM Internet Measurement Conference, Virtual Event, USA, 2020.
Export
BibTeX
@inproceedings{Feldmann_IMC2020, 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}, ISBN = {9-781-4503-8138-3}, DOI = {10.1145/3419394.3423658}, PUBLISHER = {ACM}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2020}, BOOKTITLE = {IMC'20, 20th ACM Internet Measurement Conference}, PAGES = {1--18}, ADDRESS = {Virtual Event, USA}, }
Endnote
%0 Conference Proceedings %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 %R 10.1145/3419394.3423658 %D 2020 %B 20th ACM Internet Measurement Conference %Z date of event: 2020-10-27 - 2020-10-29 %C Virtual Event, USA %B IMC'20 %P 1 - 18 %I ACM %@ 9-781-4503-8138-3 %U https://labs.ripe.net/Members/oliver_gasser/the-lockdown-effect-implications-of-the-covid-19-pandemic-on-internet-traffic
[4]
A. Feldmann, O. Gasser, F. Lichtblau, E. Pujol, I. Poese, C. Dietzel, D. Wagner, M. Wichtlhuber, J. Tapiador, N. Vallina-Rodriguez, O. Hohlfeld, and G. Smaragdakis, “A View of Internet Traffic Shifts at ISP and IXPs during the COVID-19 Pandemic,” in COVID-19 Network Impacts Workshop, Virtual Workshop, 2020.
Export
BibTeX
@inproceedings{Feldmann_IABWorkshop2020, TITLE = {A view of Internet Traffic Shifts at {ISP} and {IXPs} during the {COVID}-19 Pandemic}, 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 = {https://www.iab.org/activities/workshops/covid-19-network-impacts-workshop-2020/}, PUBLISHER = {IAB}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {COVID-19 Network Impacts Workshop}, ADDRESS = {Virtual Workshop}, }
Endnote
%0 Conference Proceedings %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 External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T A View of Internet Traffic Shifts at ISP and IXPs during the COVID-19 Pandemic : %G eng %U http://hdl.handle.net/21.11116/0000-0007-6FA5-3 %D 2020 %B COVID-19 Network Impacts Workshop %Z date of event: 2020-11-09 - 2020-11-13 %C Virtual Workshop %B COVID-19 Network Impacts Workshop %I IAB %U https://www.iab.org/activities/workshops/covid-19-network-impacts-workshop-2020/
[5]
A. Maghsoudlou, O. Gasser, and A. Feldmann, “Reserved: Dissecting Internet Traffic on Port 0,” in Extended abstract of a poster presented at Passive and Active Measurement Conference (PAM) 2020, Virtual Conference, 2020. (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}, MARGINALMARK = {$\bullet$}, 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
[6]
A. Mittos, Z. Zannettou, J. Blackburn, and E. De Cristofaro, “Analyzing Genetic Testing Discourse on the Web Through the Lens of Twitter, Reddit, and 4chan,” ACM Transactions on the Web, vol. 14, no. 4, 2020.
Export
BibTeX
@article{Mittos_2020, TITLE = {Analyzing Genetic Testing Discourse on the Web Through the Lens of {Twitter, Reddit, and 4chan}}, AUTHOR = {Mittos, Alexandros and Zannettou, Zavvas and Blackburn, Jeremy and De Cristofaro, Emiliano}, LANGUAGE = {eng}, DOI = {10.1145/3404994}, PUBLISHER = {ACM}, ADDRESS = {New York, NY}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, JOURNAL = {ACM Transactions on the Web}, VOLUME = {14}, NUMBER = {4}, EID = {17}, }
Endnote
%0 Journal Article %A Mittos, Alexandros %A Zannettou, Zavvas %A Blackburn, Jeremy %A De Cristofaro, Emiliano %+ External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Analyzing Genetic Testing Discourse on the Web Through the Lens of Twitter, Reddit, and 4chan : %G eng %U http://hdl.handle.net/21.11116/0000-0007-72E1-A %R 10.1145/3404994 %7 2020 %D 2020 %J ACM Transactions on the Web %V 14 %N 4 %Z sequence number: 17 %I ACM %C New York, NY
[7]
S. J. Saidi, A. Maghsoudlou, D. Foucard, G. Smaragdakis, I. Poese, and A. Feldmann, “Exploring Network-Wide Flow Data with Flowyager,” IEEE Transactions on Network and Service Management, 2020.
Export
BibTeX
@article{Saidi_10.1109/TNSM.2020.3034278, TITLE = {Exploring Network-Wide Flow Data with {Flowyager}}, AUTHOR = {Saidi, Said Jawad and Maghsoudlou, Aniss and Foucard, Damien and Smaragdakis, Georgios and Poese, Ingmar and Feldmann, Anja}, LANGUAGE = {eng}, ISSN = {1932-4537}, DOI = {10.1109/TNSM.2020.3034278}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, JOURNAL = {IEEE Transactions on Network and Service Management}, EID = {9241237}, }
Endnote
%0 Journal Article %A Saidi, Said Jawad %A Maghsoudlou, Aniss %A Foucard, Damien %A Smaragdakis, Georgios %A Poese, Ingmar %A Feldmann, Anja %+ Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Exploring Network-Wide Flow Data with Flowyager : %G eng %U http://hdl.handle.net/21.11116/0000-0007-7295-0 %R 10.1109/TNSM.2020.3034278 %7 2020 %D 2020 %J IEEE Transactions on Network and Service Management %Z sequence number: 9241237 %I IEEE %C Piscataway, NJ %@ false
[8]
S. J. Saidi, A. M. Mandalari, R. Kolcun, H. Haddadi, D. J. Dubois, D. Choffnes, G. Smaragdakis, and A. Feldmann, “A Haystack Full of Needles: Scalable Detection of IoT Devices in the Wild,” in IMC’20, 20th ACM Internet Measurement Conference, Virtual Event, USA, 2020.
Export
BibTeX
@inproceedings{Saidi_IMC2020, TITLE = {A Haystack Full of Needles: {Scalable} Detection of {IoT} Devices in the Wild}, AUTHOR = {Saidi, Said Jawad and Mandalari, Anna Maria and Kolcun, Roman and Haddadi, Hamed and Dubois, Daniel J. and Choffnes, David and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {9-781-4503-8138-3}, DOI = {10.1145/3419394.3423650}, PUBLISHER = {ACM}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2020}, BOOKTITLE = {IMC'20, 20th ACM Internet Measurement Conference}, PAGES = {87--100}, ADDRESS = {Virtual Event, USA}, }
Endnote
%0 Conference Proceedings %A Saidi, Said Jawad %A Mandalari, Anna Maria %A Kolcun, Roman %A Haddadi, Hamed %A Dubois, Daniel J. %A Choffnes, David %A Smaragdakis, Georgios %A Feldmann, Anja %+ Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society %T A Haystack Full of Needles: Scalable Detection of IoT Devices in the Wild : %G eng %U http://hdl.handle.net/21.11116/0000-0007-72B5-C %R 10.1145/3419394.3423650 %D 2020 %B 20th ACM Internet Measurement Conference %Z date of event: 2020-10-27 - 2020-10-29 %C Virtual Event, USA %B IMC'20 %P 87 - 100 %I ACM %@ 9-781-4503-8138-3 %U https://dl.acm.org/doi/10.1145/3419394.3423650
[9]
N. Semmler, M. Rost, G. Smaragdakis, and A. Feldmann, “Edge Replication Strategies for Wide-Area Distributed Processing,” in EdgeSys’20, Third ACM International Workshop on Edge Systems, Analytics and Networking, Heraklion, Greece, 2020.
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}, MARGINALMARK = {$\bullet$}, 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
[10]
A. Shukla, S. Fathalli, T. Zinner, A. Hecker, and S. Schmid, “P4Consist: Toward Consistent P4 SDNs,” IEEE Journal on Selected Areas in Communications, vol. 38, no. 7, 2020.
Export
BibTeX
@article{Shukla2020b, TITLE = {{P4Consist}: {T}oward Consistent {P4 SDNs}}, AUTHOR = {Shukla, Apoorv and Fathalli, Seifeddine and Zinner, Thomas and Hecker, Artur and Schmid, Stefam}, LANGUAGE = {eng}, ISSN = {0733-8716}, DOI = {10.1109/JSAC.2020.2999653}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2020}, MARGINALMARK = {$\bullet$}, DATE = {2020}, JOURNAL = {IEEE Journal on Selected Areas in Communications}, VOLUME = {38}, NUMBER = {7}, PAGES = {1293--1307}, }
Endnote
%0 Journal Article %A Shukla, Apoorv %A Fathalli, Seifeddine %A Zinner, Thomas %A Hecker, Artur %A Schmid, Stefam %+ External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T P4Consist: Toward Consistent P4 SDNs : %G eng %U http://hdl.handle.net/21.11116/0000-0006-D337-E %R 10.1109/JSAC.2020.2999653 %7 2020 %D 2020 %J IEEE Journal on Selected Areas in Communications %V 38 %N 7 %& 1293 %P 1293 - 1307 %I IEEE %C Piscataway, NJ %@ false
[11]
A. Shukla, S. J. Saidi, S. Schmid, M. Canini, T. Zinner, and A. Feldmann, “Toward Consistent SDNs: A Case for Network State Fuzzing,” IEEE Transactions on Network and Service Management, vol. 17, no. 2, 2020.
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}, MARGINALMARK = {$\bullet$}, 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
[12]
A. Shukla, K. Hudemann, Z. Vági, L. Hügerich, G. Smaragdakis, S. Schmid, A. Hecker, and A. Feldmann, “Towards Runtime Verification of Programmable Switches,” 2020. [Online]. Available: 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}, MARGINALMARK = {$\bullet$}, 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
2019
[13]
V. Bajpai, A. Brunstrom, A. Feldmann, W. Kellerer, A. Pras, H. Schulzrinne, G. Smaragdakis, M. Wählisch, and K. Wehrle, “The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research,” ACM SIGCOMM Computer Communication Review, vol. 49, no. 1, 2019.
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
[14]
V. Bajpai, A. Brunstrom, A. Feldmann, W. Kellerer, A. Pras, H. Schulzrinne, G. Smaragdakis, M. Wählisch, and K. Wehrle, “The Dagstuhl Beginners Guide to Reproducibility for Experimental Networking Research,” 2019. [Online]. Available: 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
[15]
T. Chung, E. Aben, T. Bruijnzeels, B. Chandrasekaran, D. R. Choffnes, D. Levin, B. M. Maggs, A. Mislove, R. van Rijswijk-Deij, J. P. Rula, and N. Sullivan, “RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment and Invalid Route Origins,” in IMC’19, ACM Internet Measurement Conference, Amsterdam, Netherlands, 2019.
Export
BibTeX
@inproceedings{Chung_IMC2019, TITLE = {{RPKI} is Coming of Age: {A} Longitudinal Study of {RPKI} Deployment and Invalid Route Origins}, AUTHOR = {Chung, Taejoong and Aben, Emile and Bruijnzeels, Tim and Chandrasekaran, Balakrishnan and Choffnes, David R. and Levin, Dave and Maggs, Bruce M. and Mislove, Alan and van Rijswijk-Deij, Roland and Rula, John P. and Sullivan, Nick}, LANGUAGE = {eng}, ISBN = {978-1-4503-6948-0}, DOI = {10.1145/3355369.3355596}, PUBLISHER = {ACM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {IMC'19, ACM Internet Measurement Conference}, PAGES = {406--419}, ADDRESS = {Amsterdam, Netherlands}, }
Endnote
%0 Conference Proceedings %A Chung, Taejoong %A Aben, Emile %A Bruijnzeels, Tim %A Chandrasekaran, Balakrishnan %A Choffnes, David R. %A Levin, Dave %A Maggs, Bruce M. %A Mislove, Alan %A van Rijswijk-Deij, Roland %A Rula, John P. %A Sullivan, Nick %+ External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T RPKI is Coming of Age: A Longitudinal Study of RPKI Deployment and Invalid Route Origins : %G eng %U http://hdl.handle.net/21.11116/0000-0005-7678-0 %R 10.1145/3355369.3355596 %D 2019 %B ACM Internet Measurement Conference %Z date of event: 2019-10-21 - 2019-10-23 %C Amsterdam, Netherlands %B IMC'19 %P 406 - 419 %I ACM %@ 978-1-4503-6948-0
[16]
T. Enghardt, T. Zinner, and A. Feldmann, “Web Performance Pitfalls,” in Passive and Active Measurement Conference (PAM 2019), Puerto Varas, Chile, 2019.
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
[17]
T. Enghardt, P. S. Tiesel, T. Zinner, and A. Feldmann, “Informed Access Network Selection: The Benefits of Socket Intents for Web Performance,” in 15th International Conference on Network and Service Management (CNSM 2019), Halifax, Canada, 2019.
Export
BibTeX
@inproceedings{Enghardt_CNSM2019, TITLE = {Informed Access Network Selection: {The} Benefits of Socket Intents for {Web} Performance}, AUTHOR = {Enghardt, Theresa and Tiesel, Philipp S. and Zinner, Thomas and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-3-903176-24-9}, DOI = {10.23919/CNSM46954.2019.9012714}, PUBLISHER = {IEEE}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {15th International Conference on Network and Service Management (CNSM 2019)}, PAGES = {1--9}, ADDRESS = {Halifax, Canada}, }
Endnote
%0 Conference Proceedings %A Enghardt, Theresa %A Tiesel, Philipp S. %A Zinner, Thomas %A Feldmann, Anja %+ External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Informed Access Network Selection: The Benefits of Socket Intents for Web Performance : %G eng %U http://hdl.handle.net/21.11116/0000-0007-7300-7 %R 10.23919/CNSM46954.2019.9012714 %D 2019 %B 15th International Conference on Network and Service Management %Z date of event: 2019-10-21 - 2019-10-25 %C Halifax, Canada %B 15th International Conference on Network and Service Management %P 1 - 9 %I IEEE %@ 978-3-903176-24-9
[18]
M. Hoseini, F. Saghafi, and E. Aghayi, “A Multidimensional Model of Knowledge Sharing Behavior in Mobile Social Networks,” Kybernetes, vol. 48, no. 5, 2019.
Export
BibTeX
@article{Hoseini2019, TITLE = {A Multidimensional Model of Knowledge Sharing Behavior in Mobile Social Networks}, AUTHOR = {Hoseini, Mohamad and Saghafi, Fatemeh and Aghayi, Emad}, LANGUAGE = {eng}, ISSN = {0368-492X}, DOI = {10.1108/K-07-2017-0249}, PUBLISHER = {Emerald}, ADDRESS = {Bradford}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {Kybernetes}, VOLUME = {48}, NUMBER = {5}, PAGES = {906--929}, }
Endnote
%0 Journal Article %A Hoseini, Mohamad %A Saghafi, Fatemeh %A Aghayi, Emad %+ Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations %T A Multidimensional Model of Knowledge Sharing Behavior in Mobile Social Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0003-D41E-D %R 10.1108/K-07-2017-0249 %7 2019 %D 2019 %J Kybernetes %V 48 %N 5 %& 906 %P 906 - 929 %I Emerald %C Bradford %@ false
[19]
C. Iordanou, N. Kourtellis, J. M. Carrascosa, C. Soriente, R. Cuevas, and N. Laoutaris, “Beyond Content Analysis: Detecting Targeted Ads via Distributed Counting,” in CoNEXT’19, 15th International Conference on Emerging Networking Experiments And Technologies, Orlando, FL, USA, 2019.
Export
BibTeX
@inproceedings{Iordanou_CoNEXT2019, TITLE = {Beyond Content Analysis: {D}etecting Targeted Ads via Distributed Counting}, AUTHOR = {Iordanou, Costas and Kourtellis, Nicolas and Carrascosa, Juan Miguel and Soriente, Claudio and Cuevas, Ruben and Laoutaris, Nikolaos}, LANGUAGE = {eng}, ISBN = {978-1-4503-6998-5}, DOI = {10.1145/3359989.3365428}, PUBLISHER = {ACM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {CoNEXT'19, 15th International Conference on Emerging Networking Experiments And Technologies}, PAGES = {110--122}, ADDRESS = {Orlando, FL, USA}, }
Endnote
%0 Conference Proceedings %A Iordanou, Costas %A Kourtellis, Nicolas %A Carrascosa, Juan Miguel %A Soriente, Claudio %A Cuevas, Ruben %A Laoutaris, Nikolaos %+ Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Beyond Content Analysis: Detecting Targeted Ads via Distributed Counting : %G eng %U http://hdl.handle.net/21.11116/0000-0006-8DF1-B %R 10.1145/3359989.3365428 %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 110 - 122 %I ACM %@ 978-1-4503-6998-5
[20]
D. Kopp, M. Wichtlhuber, I. Poese, J. Santanna, O. Hohlfeld, and C. Dietzel, “DDoS Hide & Seek: On the Effectiveness of a Booter Services Takedown,” in IMC’19, ACM Internet Measurement Conference, Amsterdam, Netherlands, 2019.
Export
BibTeX
@inproceedings{Kopp_IMC2019, TITLE = {{DDoS} Hide \& Seek: {O}n the Effectiveness of a Booter Services Takedown}, AUTHOR = {Kopp, Daniel and Wichtlhuber, Matthias and Poese, Ingmar and Santanna, Jair and Hohlfeld, Oliver and Dietzel, Christoph}, LANGUAGE = {eng}, ISBN = {978-1-4503-6948-0}, DOI = {10.1145/3355369.3355590}, PUBLISHER = {ACM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {IMC'19, ACM Internet Measurement Conference}, PAGES = {65--72}, ADDRESS = {Amsterdam, Netherlands}, }
Endnote
%0 Conference Proceedings %A Kopp, Daniel %A Wichtlhuber, Matthias %A Poese, Ingmar %A Santanna, Jair %A Hohlfeld, Oliver %A Dietzel, Christoph %+ External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T DDoS Hide & Seek: On the Effectiveness of a Booter Services Takedown : %G eng %U http://hdl.handle.net/21.11116/0000-0005-758A-C %R 10.1145/3355369.3355590 %D 2019 %B ACM Internet Measurement Conference %Z date of event: 2019-10-21 - 2019-10-23 %C Amsterdam, Netherlands %B IMC'19 %P 65 - 72 %I ACM %@ 978-1-4503-6948-0
[21]
R. Motamedi, B. Yeganeh, B. Chandrasekaran, R. Rejaie, B. M. Maggs, and W. Willinger, “On Mapping the Interconnections in Today’s Internet,” IEEE/ACM Transactions on Networking, vol. 27, no. 5, 2019.
Export
BibTeX
@article{Motamedi_2019, TITLE = {On Mapping the Interconnections in Today's Internet}, AUTHOR = {Motamedi, Reza and Yeganeh, Bahador and Chandrasekaran, Balakrishnan and Rejaie, Reza and Maggs, Bruce M. and Willinger, Walter}, LANGUAGE = {eng}, ISSN = {1558-2566}, DOI = {10.1109/TNET.2019.2940369}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, DATE = {2019}, JOURNAL = {IEEE/ACM Transactions on Networking}, VOLUME = {27}, NUMBER = {5}, PAGES = {2056}, }
Endnote
%0 Journal Article %A Motamedi, Reza %A Yeganeh, Bahador %A Chandrasekaran, Balakrishnan %A Rejaie, Reza %A Maggs, Bruce M. %A Willinger, Walter %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T On Mapping the Interconnections in Today's Internet : %G eng %U http://hdl.handle.net/21.11116/0000-0005-6B21-E %R 10.1109/TNET.2019.2940369 %7 2019 %D 2019 %J IEEE/ACM Transactions on Networking %V 27 %N 5 %& 2056 %P 2056 %I IEEE %C Piscataway, NJ %@ false
[22]
M. Nawrocki, J. Blendin, C. Dietzel, T. C. Schmidt, and M. Wählisch, “Down the Black Hole: Dismantling Operational Practices of BGP Blackholing at IXPs,” in IMC’19, ACM Internet Measurement Conference, Amsterdam, Netherlands, 2019.
Export
BibTeX
@inproceedings{Nawrocki_IMC2019, TITLE = {Down the Black Hole: {D}ismantling Operational Practices of {BGP} Blackholing at {IXPs}}, AUTHOR = {Nawrocki, Marcin and Blendin, Jeremias and Dietzel, Christoph and Schmidt, Thomas C. and W{\"a}hlisch, Matthias}, LANGUAGE = {eng}, ISBN = {978-1-4503-6948-0}, DOI = {10.1145/3355369.3355593}, PUBLISHER = {ACM}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, BOOKTITLE = {IMC'19, ACM Internet Measurement Conference}, PAGES = {435--448}, ADDRESS = {Amsterdam, Netherlands}, }
Endnote
%0 Conference Proceedings %A Nawrocki, Marcin %A Blendin, Jeremias %A Dietzel, Christoph %A Schmidt, Thomas C. %A Wählisch, Matthias %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations %T Down the Black Hole: Dismantling Operational Practices of BGP Blackholing at IXPs : %G eng %U http://hdl.handle.net/21.11116/0000-0005-759E-6 %R 10.1145/3355369.3355593 %D 2019 %B ACM Internet Measurement Conference %Z date of event: 2019-10-21 - 2019-10-23 %C Amsterdam, Netherlands %B IMC'19 %P 435 - 448 %I ACM %@ 978-1-4503-6948-0
[23]
E. Pujol, I. Poese, J. Zerwas, G. Smaragdakis, and A. Feldmann, “Steering Hyper-Giants’ Traffic at Scale,” in CoNEXT’19, 15th International Conference on Emerging Networking Experiments And Technologies, Orlando, FL, USA, 2019.
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
[24]
N. Semmler, G. Smaragdakis, and A. Feldmann, “Online Replication Strategies for Distributed Data Stores,” Open Journal of Internet Of Things, vol. 5, no. 1, 2019.
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
[25]
N. Semmler, G. Smaragdakis, and A. Feldmann, “Distributed Mega-Datasets: The Need for Novel Computing Primitives,” in 39th IEEE International Conference on Distributed Computing Systems (ICDCS 2019), Richardson, TX, USA, 2019.
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
[26]
A. Shukla, S. J. Saidi, S. Schmid, M. Canini, T. Zinner, and A. Feldmann, “Towards Consistent SDNs: A Case for Network State Fuzzing,” IEEE Transactions on Network and Service Management, no. Early Access, 2019.
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
[27]
A. Shukla, S. J. Saidi, S. Schmid, M. Canini, T. Zinner, and A. Feldmann, “Consistent SDNs through Network State Fuzzing,” 2019. [Online]. Available: 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
[28]
Z. Zannettou, T. Caulfield, B. Bradlyn, E. De Cristofaro, G. Stringhini, and J. Blackburn, “Characterizing the Use of Images in State-Sponsored Information Warfare Operations by Russian Trolls on Twitter,” 2019. [Online]. Available: http://arxiv.org/abs/1901.05997. (arXiv: 1901.05997)
Abstract
State-sponsored organizations are increasingly linked to efforts aimed to exploit social media for information warfare and manipulating public opinion. Typically, their activities rely on a number of social network accounts they control, aka trolls, that post and interact with other users disguised as "regular" users. These accounts often use images and memes, along with textual content, in order to increase the engagement and the credibility of their posts. In this paper, we present the first study of images shared by state-sponsored accounts by analyzing a ground truth dataset of 1.8M images posted to Twitter by accounts controlled by the Russian Internet Research Agency. First, we analyze the content of the images as well as their posting activity. Then, using Hawkes Processes, we quantify their influence on popular Web communities like Twitter, Reddit, 4chan's Politically Incorrect board (/pol/), and Gab, with respect to the dissemination of images. We find that the extensive image posting activity of Russian trolls coincides with real-world events (e.g., the Unite the Right rally in Charlottesville), and shed light on their targets as well as the content disseminated via images. Finally, we show that the trolls were more effective in disseminating politics-related imagery than other images.
Export
BibTeX
@online{Zannettou_arXIv1901.05997, TITLE = {Characterizing the Use of Images in State-Sponsored Information Warfare Operations by {R}ussian {Tr}olls on Twitter}, AUTHOR = {Zannettou, Zavvas and Caulfield, Tristan and Bradlyn, Barry and De Cristofaro, Emiliano and Stringhini, Gianluca and Blackburn, Jeremy}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1901.05997}, EPRINT = {1901.05997}, EPRINTTYPE = {arXiv}, YEAR = {2019}, MARGINALMARK = {$\bullet$}, ABSTRACT = {State-sponsored organizations are increasingly linked to efforts aimed to exploit social media for information warfare and manipulating public opinion. Typically, their activities rely on a number of social network accounts they control, aka trolls, that post and interact with other users disguised as "regular" users. These accounts often use images and memes, along with textual content, in order to increase the engagement and the credibility of their posts. In this paper, we present the first study of images shared by state-sponsored accounts by analyzing a ground truth dataset of 1.8M images posted to Twitter by accounts controlled by the Russian Internet Research Agency. First, we analyze the content of the images as well as their posting activity. Then, using Hawkes Processes, we quantify their influence on popular Web communities like Twitter, Reddit, 4chan's Politically Incorrect board (/pol/), and Gab, with respect to the dissemination of images. We find that the extensive image posting activity of Russian trolls coincides with real-world events (e.g., the Unite the Right rally in Charlottesville), and shed light on their targets as well as the content disseminated via images. Finally, we show that the trolls were more effective in disseminating politics-related imagery than other images.}, }
Endnote
%0 Report %A Zannettou, Zavvas %A Caulfield, Tristan %A Bradlyn, Barry %A De Cristofaro, Emiliano %A Stringhini, Gianluca %A Blackburn, Jeremy %+ Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations %T Characterizing the Use of Images in State-Sponsored Information Warfare Operations by Russian Trolls on Twitter : %G eng %U http://hdl.handle.net/21.11116/0000-0005-767F-9 %U http://arxiv.org/abs/1901.05997 %D 2019 %X State-sponsored organizations are increasingly linked to efforts aimed to exploit social media for information warfare and manipulating public opinion. Typically, their activities rely on a number of social network accounts they control, aka trolls, that post and interact with other users disguised as "regular" users. These accounts often use images and memes, along with textual content, in order to increase the engagement and the credibility of their posts. In this paper, we present the first study of images shared by state-sponsored accounts by analyzing a ground truth dataset of 1.8M images posted to Twitter by accounts controlled by the Russian Internet Research Agency. First, we analyze the content of the images as well as their posting activity. Then, using Hawkes Processes, we quantify their influence on popular Web communities like Twitter, Reddit, 4chan's Politically Incorrect board (/pol/), and Gab, with respect to the dissemination of images. We find that the extensive image posting activity of Russian trolls coincides with real-world events (e.g., the Unite the Right rally in Charlottesville), and shed light on their targets as well as the content disseminated via images. Finally, we show that the trolls were more effective in disseminating politics-related imagery than other images. %K cs.SI,Computer Science, Computers and Society, cs.CY
2018
[29]
R. Beverly, G. Smaragdakis, and A. Feldmann, Eds., Passive and Active Measurement, vol. 10771. Springer, 2018.
Export
BibTeX
@proceedings{PAM2018, TITLE = {Passive and Active Measurement (PAM 2018)}, EDITOR = {Beverly, Robert and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, DOI = {10.1007/978-3-319-76481-8}, PUBLISHER = {Springer}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {Lecture Notes in Computer Science (LNCS)}, VOLUME = {10771}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %E Beverly, Robert %E Smaragdakis, Georgios %E Feldmann, Anja %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Passive and Active Measurement : 19th International Conference, PAM 2018 ; Berlin, Germany, March 26-27, 2018 ; Proceedings %G eng %U http://hdl.handle.net/21.11116/0000-0001-3CC6-D %R 10.1007/978-3-319-76481-8 %I Springer %D 2018 %B 19th International Passive and Active Measurement Conference %Z date of event: 2018-03-26 - 2018-03-27 %D 2018 %C Berlin, Germany %V 10771
[30]
D. Bhattacherjee, W. Aqeel, I. N. Bozkurt, A. Aguirre, B. Chandrasekaran, P. B. Godfrey, G. Laughlin, B. Maggs, and A. Singla, “Gearing up for the 21st Century Space Race,” in HotNets-VXIII, Redmond, WA, USA, 2018.
Export
BibTeX
@inproceedings{Bhattacherjee_HotNets18, TITLE = {Gearing up for the 21st Century Space Race}, AUTHOR = {Bhattacherjee, Debopam and Aqeel, Waqar and Bozkurt, Ilker Nadi and Aguirre, Anthony and Chandrasekaran, Balakrishnan and Godfrey, P. Brighten and Laughlin, Gregory and Maggs, Bruce and Singla, Ankit}, LANGUAGE = {eng}, ISBN = {978-1-4503-6120-0}, DOI = {10.1145/3286062.3286079}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {HotNets-VXIII}, PAGES = {113--119}, ADDRESS = {Redmond, WA, USA}, }
Endnote
%0 Conference Proceedings %A Bhattacherjee, Debopam %A Aqeel, Waqar %A Bozkurt, Ilker Nadi %A Aguirre, Anthony %A Chandrasekaran, Balakrishnan %A Godfrey, P. Brighten %A Laughlin, Gregory %A Maggs, Bruce %A Singla, Ankit %+ External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Gearing up for the 21st Century Space Race : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BF0B-C %R 10.1145/3286062.3286079 %D 2018 %B ACM Workshop on Hot Topics in Networks %Z date of event: 2018-11-15 - 2018-11-16 %C Redmond, WA, USA %B HotNets-VXIII %P 113 - 119 %I ACM %@ 978-1-4503-6120-0
[31]
D. Bhattacherjee, S. A. Jyothi, I. N. Bozkurt, M. Tirmazi, W. Aqeel, A. Aguirre, B. Chandrasekaran, P. B. Godfrey, G. P. Laughlin, B. M. Maggs, and A. Singla, “cISP: A Speed-of-Light Internet Service Provider,” 2018. [Online]. Available: http://arxiv.org/abs/1809.10897. (arXiv: 1809.10897)
Abstract
Low latency is a requirement for a variety of interactive network applications. The Internet, however, is not optimized for latency. We thus explore the design of cost-effective wide-area networks that move data over paths very close to great-circle paths, at speeds very close to the speed of light in vacuum. Our cISP design augments the Internet's fiber with free-space wireless connectivity. cISP addresses the fundamental challenge of simultaneously providing low latency and scalable bandwidth, while accounting for numerous practical factors ranging from transmission tower availability to packet queuing. We show that instantiations of cISP across the contiguous United States and Europe would achieve mean latencies within 5% of that achievable using great-circle paths at the speed of light, over medium and long distances. Further, we estimate that the economic value from such networks would substantially exceed their expense.
Export
BibTeX
@online{Bhattacherjee_arXiv1809.10897, TITLE = {{cISP}: {A} Speed-of-Light Internet Service Provider}, AUTHOR = {Bhattacherjee, Debopam and Jyothi, Sangeetha Abdu and Bozkurt, Ilker Nadi and Tirmazi, Muhammad and Aqeel, Waqar and Aguirre, Anthony and Chandrasekaran, Balakrishnan and Godfrey, P. Brighten and Laughlin, Gregory P. and Maggs, Bruce M. and Singla, Ankit}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1809.10897}, EPRINT = {1809.10897}, EPRINTTYPE = {arXiv}, YEAR = {2018}, ABSTRACT = {Low latency is a requirement for a variety of interactive network applications. The Internet, however, is not optimized for latency. We thus explore the design of cost-effective wide-area networks that move data over paths very close to great-circle paths, at speeds very close to the speed of light in vacuum. Our cISP design augments the Internet's fiber with free-space wireless connectivity. cISP addresses the fundamental challenge of simultaneously providing low latency and scalable bandwidth, while accounting for numerous practical factors ranging from transmission tower availability to packet queuing. We show that instantiations of cISP across the contiguous United States and Europe would achieve mean latencies within 5% of that achievable using great-circle paths at the speed of light, over medium and long distances. Further, we estimate that the economic value from such networks would substantially exceed their expense.}, }
Endnote
%0 Report %A Bhattacherjee, Debopam %A Jyothi, Sangeetha Abdu %A Bozkurt, Ilker Nadi %A Tirmazi, Muhammad %A Aqeel, Waqar %A Aguirre, Anthony %A Chandrasekaran, Balakrishnan %A Godfrey, P. Brighten %A Laughlin, Gregory P. %A Maggs, Bruce M. %A Singla, Ankit %+ External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T cISP: A Speed-of-Light Internet Service Provider : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BF14-1 %U http://arxiv.org/abs/1809.10897 %D 2018 %X Low latency is a requirement for a variety of interactive network applications. The Internet, however, is not optimized for latency. We thus explore the design of cost-effective wide-area networks that move data over paths very close to great-circle paths, at speeds very close to the speed of light in vacuum. Our cISP design augments the Internet's fiber with free-space wireless connectivity. cISP addresses the fundamental challenge of simultaneously providing low latency and scalable bandwidth, while accounting for numerous practical factors ranging from transmission tower availability to packet queuing. We show that instantiations of cISP across the contiguous United States and Europe would achieve mean latencies within 5% of that achievable using great-circle paths at the speed of light, over medium and long distances. Further, we estimate that the economic value from such networks would substantially exceed their expense. %K Computer Science, Networking and Internet Architecture, cs.NI
[32]
I. N. Bozkurt, W. Aqeel, D. Bhattacherjee, B. Chandrasekaran, P. B. Godfrey, G. Laughlin, B. M. Maggs, and A. Singla, “Dissecting Latency in the Internet’s Fiber Infrastructure,” 2018. [Online]. Available: http://arxiv.org/abs/1811.10737. (arXiv: 1811.10737)
Abstract
The recent publication of the `InterTubes' map of long-haul fiber-optic cables in the contiguous United States invites an exciting question: how much faster would the Internet be if routes were chosen to minimize latency? Previous measurement campaigns suggest the following rule of thumb for estimating Internet latency: multiply line-of-sight distance by 2.1, then divide by the speed of light in fiber. But a simple computation of shortest-path lengths through the conduits in the InterTubes map suggests that the conversion factor for all pairs of the 120 largest population centers in the U.S.\ could be reduced from 2.1 to 1.3, in the median, even using less than half of the links. To determine whether an overlay network could be used to provide shortest paths, and how well it would perform, we used the diverse server deployment of a CDN to measure latency across individual conduits. We were surprised to find, however, that latencies are sometimes much higher than would be predicted by conduit length alone. To understand why, we report findings from our analysis of network latency data from the backbones of two Tier-1 ISPs, two scientific and research networks, and the recently built fiber backbone of a CDN.
Export
BibTeX
@online{Bozkurt_arXIv1811.10737, TITLE = {Dissecting Latency in the Internet's Fiber Infrastructure}, AUTHOR = {Bozkurt, Ilker Nadi and Aqeel, Waqar and Bhattacherjee, Debopam and Chandrasekaran, Balakrishnan and Godfrey, Philip Brighten and Laughlin, Gregory and Maggs, Bruce M. and Singla, Ankit}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1811.10737}, EPRINT = {1811.10737}, EPRINTTYPE = {arXiv}, YEAR = {2018}, ABSTRACT = {The recent publication of the `InterTubes' map of long-haul fiber-optic cables in the contiguous United States invites an exciting question: how much faster would the Internet be if routes were chosen to minimize latency? Previous measurement campaigns suggest the following rule of thumb for estimating Internet latency: multiply line-of-sight distance by 2.1, then divide by the speed of light in fiber. But a simple computation of shortest-path lengths through the conduits in the InterTubes map suggests that the conversion factor for all pairs of the 120 largest population centers in the U.S.\ could be reduced from 2.1 to 1.3, in the median, even using less than half of the links. To determine whether an overlay network could be used to provide shortest paths, and how well it would perform, we used the diverse server deployment of a CDN to measure latency across individual conduits. We were surprised to find, however, that latencies are sometimes much higher than would be predicted by conduit length alone. To understand why, we report findings from our analysis of network latency data from the backbones of two Tier-1 ISPs, two scientific and research networks, and the recently built fiber backbone of a CDN.}, }
Endnote
%0 Report %A Bozkurt, Ilker Nadi %A Aqeel, Waqar %A Bhattacherjee, Debopam %A Chandrasekaran, Balakrishnan %A Godfrey, Philip Brighten %A Laughlin, Gregory %A Maggs, Bruce M. %A Singla, Ankit %+ External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations %T Dissecting Latency in the Internet's Fiber Infrastructure : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BFB3-D %U http://arxiv.org/abs/1811.10737 %D 2018 %X The recent publication of the `InterTubes' map of long-haul fiber-optic cables in the contiguous United States invites an exciting question: how much faster would the Internet be if routes were chosen to minimize latency? Previous measurement campaigns suggest the following rule of thumb for estimating Internet latency: multiply line-of-sight distance by 2.1, then divide by the speed of light in fiber. But a simple computation of shortest-path lengths through the conduits in the InterTubes map suggests that the conversion factor for all pairs of the 120 largest population centers in the U.S.\ could be reduced from 2.1 to 1.3, in the median, even using less than half of the links. To determine whether an overlay network could be used to provide shortest paths, and how well it would perform, we used the diverse server deployment of a CDN to measure latency across individual conduits. We were surprised to find, however, that latencies are sometimes much higher than would be predicted by conduit length alone. To understand why, we report findings from our analysis of network latency data from the backbones of two Tier-1 ISPs, two scientific and research networks, and the recently built fiber backbone of a CDN. %K Computer Science, Networking and Internet Architecture, cs.NI
[33]
T. Chung, J. Lok, B. Chandrasekaran, D. Choffnes, D. Levin, B. M. Maggs, A. Mislove, J. Rula, N. Sullivan, and C. Wilson, “Is the Web Ready for OCSP Must-Staple?,” in IMC’18, Internet Measurement Conference, Boston, MA, USA, 2018.
Export
BibTeX
@inproceedings{Chung_IMC2018, TITLE = {Is the Web Ready for {OCSP} Must-Staple?}, AUTHOR = {Chung, Taejoong and Lok, Jay and Chandrasekaran, Balakrishnan and Choffnes, David and Levin, Dave and Maggs, Bruce M. and Mislove, Alan and Rula, John and Sullivan, Nick and Wilson, Christo}, LANGUAGE = {eng}, ISBN = {978-1-4503-5619-0}, DOI = {10.1145/3278532.3278543}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {IMC'18, Internet Measurement Conference}, PAGES = {105--118}, ADDRESS = {Boston, MA, USA}, }
Endnote
%0 Conference Proceedings %A Chung, Taejoong %A Lok, Jay %A Chandrasekaran, Balakrishnan %A Choffnes, David %A Levin, Dave %A Maggs, Bruce M. %A Mislove, Alan %A Rula, John %A Sullivan, Nick %A Wilson, Christo %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations External Organizations %T Is the Web Ready for OCSP Must-Staple? : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BF11-4 %R 10.1145/3278532.3278543 %D 2018 %B Internet Measurement Conference %Z date of event: 2018-10-31 - 2018-11-02 %C Boston, MA, USA %B IMC'18 %P 105 - 118 %I ACM %@ 978-1-4503-5619-0
[34]
C. Dietzel, M. Wichtlhuber, G. Smaragdakis, and A. Feldmann, “Stellar: Network Attack Mitigation Using Advanced Blackholing,” in CoNEXT’18, 14th International Conference on Emerging Networking Experiments and Technologies, Heraklion, Greece, 2018.
Export
BibTeX
@inproceedings{Dietzel_CoNTEXT, TITLE = {Stellar: {N}etwork Attack Mitigation Using Advanced Blackholing}, AUTHOR = {Dietzel, Christoph and Wichtlhuber, Matthias and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-6080-7}, DOI = {10.1145/3281411.3281413}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {CoNEXT'18, 14th International Conference on Emerging Networking Experiments and Technologies}, PAGES = {152--164}, ADDRESS = {Heraklion, Greece}, }
Endnote
%0 Conference Proceedings %A Dietzel, Christoph %A Wichtlhuber, Matthias %A Smaragdakis, Georgios %A Feldmann, Anja %+ External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Stellar: Network Attack Mitigation Using Advanced Blackholing : %G eng %U http://hdl.handle.net/21.11116/0000-0002-D534-3 %R 10.1145/3281411.3281413 %D 2018 %B 14th International Conference on Emerging Networking Experiments and Technologies %Z date of event: 2018-12-04 - 2018-12-07 %C Heraklion, Greece %B CoNEXT'18 %P 152 - 164 %I ACM %@ 978-1-4503-6080-7
[35]
T. Enghardt, P. S. Tiesel, and A. Feldmann, “Metrics for Access Network Selection,” in ANRW’18, Applied Networking Research Workshop, Montréal, Canada, 2018.
Export
BibTeX
@inproceedings{Enghardt_ANRW2018, TITLE = {Metrics for Access Network Selection}, AUTHOR = {Enghardt, Theresa and Tiesel, Philipp S. and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-5585-8}, DOI = {10.1145/3232755.3232764}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {ANRW'18, Applied Networking Research Workshop}, PAGES = {67--73}, ADDRESS = {Montr{\'e}al, Canada}, }
Endnote
%0 Conference Proceedings %A Enghardt, Theresa %A Tiesel, Philipp S. %A Feldmann, Anja %+ External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Metrics for Access Network Selection : %G eng %U http://hdl.handle.net/21.11116/0000-0002-1585-0 %R 10.1145/3232755.3232764 %D 2018 %B Applied Networking Research Workshop %Z date of event: 2018-07-16 - 2018-07-16 %C Montréal, Canada %B ANRW'18 %P 67 - 73 %I ACM %@ 978-1-4503-5585-8
[36]
T. Fiebig, K. Borgolte, S. Hao, C. Kruegel, G. Vigna, and A. Feldmann, “In rDNS We Trust: Revisiting a Common Data-Source’s Reliability,” in Lecture Notes in Computer Science (LNCS), Berlin, Germany, 2018, vol. 10771.
Export
BibTeX
@inproceedings{FiebigPAM2018, TITLE = {In {rDNS} We Trust: {R}evisiting a Common Data-Source's Reliability}, AUTHOR = {Fiebig, Tobias and Borgolte, Kevin and Hao, Shuang and Kruegel, Christopher and Vigna, Giovanni and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-3-319-76480-1}, DOI = {10.1007/978-3-319-76481-8_10}, PUBLISHER = {Springer}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {Passive and Active Measurement (PAM 2018)}, EDITOR = {Beverly, Robert and Smaragdakis, Giorgios and Feldmann, Anja}, PAGES = {131--145}, BOOKTITLE = {Lecture Notes in Computer Science (LNCS)}, VOLUME = {10771}, ADDRESS = {Berlin, Germany}, }
Endnote
%0 Conference Proceedings %A Fiebig, Tobias %A Borgolte, Kevin %A Hao, Shuang %A Kruegel, Christopher %A Vigna, Giovanni %A Feldmann, Anja %+ External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T In rDNS We Trust: Revisiting a Common Data-Source's Reliability : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3CBD-8 %R 10.1007/978-3-319-76481-8_10 %D 2018 %B 19th International Passive and Active Measurement Conference %Z date of event: 2018-03-26 - 2018-03-27 %C Berlin, Germany %B Passive and Active Measurement %E Beverly, Robert; Smaragdakis, Giorgios; Feldmann, Anja %P 131 - 145 %I Springer %@ 978-3-319-76480-1 %B Lecture Notes in Computer Science %V 10771
[37]
M. Palmer, T. Krüger, B. Chandrasekaran, and A. Feldmann, “The QUIC Fix for Optimal Video Streaming,” 2018. [Online]. Available: http://arxiv.org/abs/1809.10270. (arXiv: 1809.10270)
Abstract
Within a few years of its introduction, QUIC has gained traction: a significant chunk of traffic is now delivered over QUIC. The networking community is actively engaged in debating the fairness, performance, and applicability of QUIC for various use cases, but these debates are centered around a narrow, common theme: how does the new reliable transport built on top of UDP fare in different scenarios? Support for unreliable delivery in QUIC remains largely unexplored. The option for delivering content unreliably, as in a best-effort model, deserves the QUIC designers' and community's attention. We propose extending QUIC to support unreliable streams and present a simple approach for implementation. We discuss a simple use case of video streaming---an application that dominates the overall Internet traffic---that can leverage the unreliable streams and potentially bring immense benefits to network operators and content providers. To this end, we present a prototype implementation that, by using both the reliable and unreliable streams in QUIC, outperforms both TCP and QUIC in our evaluations.
Export
BibTeX
@online{Palmer_arXiv1809.10270, TITLE = {The {QUIC} Fix for Optimal Video Streaming}, AUTHOR = {Palmer, Mirko and Kr{\"u}ger, Thorben and Chandrasekaran, Balakrishnan and Feldmann, Anja}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1809.10270}, EPRINT = {1809.10270}, EPRINTTYPE = {arXiv}, YEAR = {2018}, ABSTRACT = {Within a few years of its introduction, QUIC has gained traction: a significant chunk of traffic is now delivered over QUIC. The networking community is actively engaged in debating the fairness, performance, and applicability of QUIC for various use cases, but these debates are centered around a narrow, common theme: how does the new reliable transport built on top of UDP fare in different scenarios? Support for unreliable delivery in QUIC remains largely unexplored. The option for delivering content unreliably, as in a best-effort model, deserves the QUIC designers' and community's attention. We propose extending QUIC to support unreliable streams and present a simple approach for implementation. We discuss a simple use case of video streaming---an application that dominates the overall Internet traffic---that can leverage the unreliable streams and potentially bring immense benefits to network operators and content providers. To this end, we present a prototype implementation that, by using both the reliable and unreliable streams in QUIC, outperforms both TCP and QUIC in our evaluations.}, }
Endnote
%0 Report %A Palmer, Mirko %A Krüger, Thorben %A Chandrasekaran, Balakrishnan %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 Internet Architecture, MPI for Informatics, Max Planck Society %T The QUIC Fix for Optimal Video Streaming : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BFC0-E %U http://arxiv.org/abs/1809.10270 %D 2018 %X Within a few years of its introduction, QUIC has gained traction: a significant chunk of traffic is now delivered over QUIC. The networking community is actively engaged in debating the fairness, performance, and applicability of QUIC for various use cases, but these debates are centered around a narrow, common theme: how does the new reliable transport built on top of UDP fare in different scenarios? Support for unreliable delivery in QUIC remains largely unexplored. The option for delivering content unreliably, as in a best-effort model, deserves the QUIC designers' and community's attention. We propose extending QUIC to support unreliable streams and present a simple approach for implementation. We discuss a simple use case of video streaming---an application that dominates the overall Internet traffic---that can leverage the unreliable streams and potentially bring immense benefits to network operators and content providers. To this end, we present a prototype implementation that, by using both the reliable and unreliable streams in QUIC, outperforms both TCP and QUIC in our evaluations. %K Computer Science, Networking and Internet Architecture, cs.NI
[38]
M. Palmer, T. Krüger, B. Chandrasekaran, and A. Feldmann, “The QUIC Fix for Optimal Video Streaming,” in EPIQ’18, Workshop on the Evolution, Performance, and Interoperability of QUIC, Heraklion, Greece, 2018.
Export
BibTeX
@inproceedings{Palmer_EPIQ18, TITLE = {The {QUIC} Fix for Optimal Video Streaming}, AUTHOR = {Palmer, Mirko and Kr{\"u}ger, Thorben and Chandrasekaran, Balakrishnan and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-6082-1}, DOI = {10.1145/3284850.3284857}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {EPIQ'18, Workshop on the Evolution, Performance, and Interoperability of QUIC}, PAGES = {43--49}, ADDRESS = {Heraklion, Greece}, }
Endnote
%0 Conference Proceedings %A Palmer, Mirko %A Krüger, Thorben %A Chandrasekaran, Balakrishnan %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 Internet Architecture, MPI for Informatics, Max Planck Society %T The QUIC Fix for Optimal Video Streaming : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BED7-6 %R 10.1145/3284850.3284857 %D 2018 %B Workshop on the Evolution, Performance, and Interoperability of QUIC %Z date of event: 2018-12-04 - 2018-12-04 %C Heraklion, Greece %B EPIQ'18 %P 43 - 49 %I ACM %@ 978-1-4503-6082-1
[39]
S. J. Saidi, D. Foucard, G. Smaragdakis, and A. Feldmann, “Flowtree: Enabling Distributed Flow Summarization at Scale,” in SIGCOMM’18, Budapest, Hungary, 2018.
Export
BibTeX
@inproceedings{Saidi_SIGCOMM2018, TITLE = {Flowtree: Enabling Distributed Flow Summarization at Scale}, AUTHOR = {Saidi, Said Jawad and Foucard, Damien and Smaragdakis, Georgios and Feldmann, Anja}, LANGUAGE = {eng}, ISBN = {978-1-4503-5915-3}, DOI = {10.1145/3234200.3234225}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {SIGCOMM'18}, PAGES = {30-32}, ADDRESS = {Budapest, Hungary}, }
Endnote
%0 Conference Proceedings %A Saidi, Said Jawad %A Foucard, Damien %A Smaragdakis, Georgios %A Feldmann, Anja %+ Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Flowtree: Enabling Distributed Flow Summarization at Scale : %G eng %U http://hdl.handle.net/21.11116/0000-0002-1577-1 %R 10.1145/3234200.3234225 %D 2018 %B SIGCOMM 2018 %Z date of event: 2018-08-20 - 2018-08-25 %C Budapest, Hungary %B SIGCOMM'18 %P 30-32 %I ACM %@ 978-1-4503-5915-3
[40]
F. Streibelt, F. Lichtblau, R. Beverly, A. Feldmann, C. Pelsser, G. Smaragdakis, and R. Bush, “BGP Communities: Even more Worms in the Routing Can,” in IMC’18, Internet Measurement Conference, Boston, MA, USA, 2018.
Export
BibTeX
@inproceedings{Streibelt_IMC2018, TITLE = {{BGP} Communities: {E}ven more Worms in the Routing Can}, AUTHOR = {Streibelt, Florian and Lichtblau, Franziska and Beverly, Robert and Feldmann, Anja and Pelsser, Cristel and Smaragdakis, Georgios and Bush, Randy}, LANGUAGE = {eng}, ISBN = {978-1-4503-5619-0}, DOI = {10.1145/3278532.3278557}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {IMC'18, Internet Measurement Conference}, PAGES = {279--292}, ADDRESS = {Boston, MA, USA}, }
Endnote
%0 Conference Proceedings %A Streibelt, Florian %A Lichtblau, Franziska %A Beverly, Robert %A Feldmann, Anja %A Pelsser, Cristel %A Smaragdakis, Georgios %A Bush, Randy %+ Internet Architecture, MPI for Informatics, Max Planck Society Internet Architecture, MPI for Informatics, Max Planck Society External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations External Organizations External Organizations %T BGP Communities: Even more Worms in the Routing Can : %G eng %U http://hdl.handle.net/21.11116/0000-0002-BFC7-7 %R 10.1145/3278532.3278557 %D 2018 %B Internet Measurement Conference %Z date of event: 2018-10-31 - 2018-11-02 %C Boston, MA, USA %B IMC'18 %P 279 - 292 %I ACM %@ 978-1-4503-5619-0
[41]
K. Thimmaraju, B. Shastry, T. Fiebig, F. Hetzelt, J.-P. Seifert, A. Feldmann, and S. Schmid, “Taking Control of SDN-based Cloud Systems via the Data Plane,” in Proceedings of the Symposium on SDN Research (SOSR 2018), Los Angeles, CA, USA, 2018.
Export
BibTeX
@inproceedings{ThimmarajuSOSR2018, TITLE = {Taking Control of {SDN}-based Cloud Systems via the Data Plane}, AUTHOR = {Thimmaraju, Kashyap and Shastry, Bhargava and Fiebig, Tobias and Hetzelt, Felicitas and Seifert, Jean-Pierre and Feldmann, Anja and Schmid, Stefan}, LANGUAGE = {eng}, ISBN = {978-1-4503-5664-0}, DOI = {10.1145/3185467.3185468}, PUBLISHER = {ACM}, YEAR = {2018}, DATE = {2018}, BOOKTITLE = {Proceedings of the Symposium on SDN Research (SOSR 2018)}, EID = {1}, ADDRESS = {Los Angeles, CA, USA}, }
Endnote
%0 Conference Proceedings %A Thimmaraju, Kashyap %A Shastry, Bhargava %A Fiebig, Tobias %A Hetzelt, Felicitas %A Seifert, Jean-Pierre %A Feldmann, Anja %A Schmid, Stefan %+ External Organizations External Organizations External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society External Organizations %T Taking Control of SDN-based Cloud Systems via the Data Plane : %G eng %U http://hdl.handle.net/21.11116/0000-0001-3CB1-4 %R 10.1145/3185467.3185468 %D 2018 %B Symposium on SDN Research %Z date of event: 2018-03-28 - 2018-03-29 %C Los Angeles, CA, USA %B Proceedings of the Symposium on SDN Research %Z sequence number: 1 %I ACM %@ 978-1-4503-5664-0
[42]
P. S. Tiesel, T. Enghardt, M. Palmer, and A. Feldmann, “Socket Intents: OS Support for Using Multiple Access Networks and its Benefits for Web Browsing,” 2018. [Online]. Available: http://arxiv.org/abs/1804.08484. (arXiv: 1804.08484)
Abstract
In today's Internet, mobile devices are connected to multiple access networks, e.g., WiFi/DSL and LTE. To take advantage of the networks' diverse paths characteristics (delay, bandwidth, and reliability) and aggregate bandwidth, we need smart strategies for choosing which interface(s) to use for what traffic. In this paper, we present an approach how to tackle this challenge as part of the Operating System (OS): With the concept of Socket Intents, applications can express what they know about their communication pattern and their preferences. Using our Socket Intents Prototype and our modified BSD Socket Interface, this information is used to choose the most appropriate path or path combination on a per message or per connection basis. We evaluate our system based on the use case of Web browsing: Using our prototype and a client-side proxy, we show the feasibility and benefits of our design. Using a flow-based simulator and a full factorial experimental design, we study a broad range of access network combinations (based on typical DSL and LTE scenarios) and real workloads (Alexa Top 100 and Top 1000 Web Sites). Our policies achieve performance benefits in more than 50% of the cases and speedups of more than factor two in 20% of the cases without adding overhead in the other cases.
Export
BibTeX
@online{Tiesel_arXiv1804.08484, TITLE = {Socket Intents: {OS} Support for Using Multiple Access Networks and its Benefits for Web Browsing}, AUTHOR = {Tiesel, Philipp S. and Enghardt, Theresa and Palmer, Mirko and Feldmann, Anja}, LANGUAGE = {eng}, URL = {http://arxiv.org/abs/1804.08484}, EPRINT = {1804.08484}, EPRINTTYPE = {arXiv}, YEAR = {2018}, ABSTRACT = {In today's Internet, mobile devices are connected to multiple access networks, e.g., WiFi/DSL and LTE. To take advantage of the networks' diverse paths characteristics (delay, bandwidth, and reliability) and aggregate bandwidth, we need smart strategies for choosing which interface(s) to use for what traffic. In this paper, we present an approach how to tackle this challenge as part of the Operating System (OS): With the concept of Socket Intents, applications can express what they know about their communication pattern and their preferences. Using our Socket Intents Prototype and our modified BSD Socket Interface, this information is used to choose the most appropriate path or path combination on a per message or per connection basis. We evaluate our system based on the use case of Web browsing: Using our prototype and a client-side proxy, we show the feasibility and benefits of our design. Using a flow-based simulator and a full factorial experimental design, we study a broad range of access network combinations (based on typical DSL and LTE scenarios) and real workloads (Alexa Top 100 and Top 1000 Web Sites). Our policies achieve performance benefits in more than 50% of the cases and speedups of more than factor two in 20% of the cases without adding overhead in the other cases.}, }
Endnote
%0 Report %A Tiesel, Philipp S. %A Enghardt, Theresa %A Palmer, Mirko %A Feldmann, Anja %+ External Organizations External Organizations External Organizations Internet Architecture, MPI for Informatics, Max Planck Society %T Socket Intents: OS Support for Using Multiple Access Networks and its Benefits for Web Browsing : %G eng %U http://hdl.handle.net/21.11116/0000-0002-158A-B %U http://arxiv.org/abs/1804.08484 %D 2018 %X In today's Internet, mobile devices are connected to multiple access networks, e.g., WiFi/DSL and LTE. To take advantage of the networks' diverse paths characteristics (delay, bandwidth, and reliability) and aggregate bandwidth, we need smart strategies for choosing which interface(s) to use for what traffic. In this paper, we present an approach how to tackle this challenge as part of the Operating System (OS): With the concept of Socket Intents, applications can express what they know about their communication pattern and their preferences. Using our Socket Intents Prototype and our modified BSD Socket Interface, this information is used to choose the most appropriate path or path combination on a per message or per connection basis. We evaluate our system based on the use case of Web browsing: Using our prototype and a client-side proxy, we show the feasibility and benefits of our design. Using a flow-based simulator and a full factorial experimental design, we study a broad range of access network combinations (based on typical DSL and LTE scenarios) and real workloads (Alexa Top 100 and Top 1000 Web Sites). Our policies achieve performance benefits in more than 50% of the cases and speedups of more than factor two in 20% of the cases without adding overhead in the other cases. %K Computer Science, Networking and Internet Architecture, cs.NI