Publications

[1]
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
[2]
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}, MARGINALMARK = {$\bullet$}, 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
[3]
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
[4]
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}, MARGINALMARK = {$\bullet$}, 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
[5]
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}, MARGINALMARK = {$\bullet$}, 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
[6]
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}, MARGINALMARK = {$\bullet$}, 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
[7]
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}, MARGINALMARK = {$\bullet$}, 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
[8]
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}, MARGINALMARK = {$\bullet$}, 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
[9]
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}, MARGINALMARK = {$\bullet$}, 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
[10]
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}, MARGINALMARK = {$\bullet$}, 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
[11]
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
[12]
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}, MARGINALMARK = {$\bullet$}, 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
[13]
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}, MARGINALMARK = {$\bullet$}, 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
[14]
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}, MARGINALMARK = {$\bullet$}, 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
[15]
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}, MARGINALMARK = {$\bullet$}, 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
[16]
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}, MARGINALMARK = {$\bullet$}, 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
[17]
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}, MARGINALMARK = {$\bullet$}, 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
[18]
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
[19]
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
[20]
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