8 Search Results for "Feldmann, Anja"

Document
DOI: 10.4230/OASIcs.NINeS.2026.24
SwiftQueue: Optimizing Low-Latency Applications with Swift Packet Queuing

Authors: Siddhant Ray, Xi Jiang, Jack Luo, Nick Feamster, and Junchen Jiang

Published in: OASIcs, Volume 139, 1st New Ideas in Networked Systems (NINeS 2026)

Abstract
Low Latency, Low Loss, and Scalable Throughput (L4S), as an emerging router-queue management technique, has seen steady deployment in the industry. An L4S-enabled router assigns each packet to the queue based on the packet header marking. Currently, L4S employs per-flow queue selection, i.e., all packets of a flow are marked the same way and thus use the same queues, even though each packet is marked separately. However, this may hurt tail latency and latency-sensitive applications because transient congestion and queue buildups may only affect a fraction of packets in a flow. We present SwiftQueue, a new L4S queue-selection strategy in which a sender uses a novel per-packet latency predictor to pinpoint which packets likely have latency spikes or drops. The insight is that many packet-level latency variations result from complex interactions among recent packets at shared router queues. Yet, these intricate packet-level latency patterns are hard to learn efficiently by traditional models. Instead, SwiftQueue uses a custom Transformer, which is well-studied for its expressiveness on sequential patterns, to predict the next packet’s latency based on the latencies of recently received ACKs. Based on the predicted latency of each outgoing packet, SwiftQueue’s sender dynamically marks the L4S packet header to assign packets to potentially different queues, even within the same flow. Using real network traces, we show that SwiftQueue is 45-65% more accurate in predicting latency and its variations than state-of-art methods. Based on its latency prediction, SwiftQueue reduces the tail latency for L4S-enabled flows by 36-45%, compared with the existing L4S queue-selection method.
Cite as

Siddhant Ray, Xi Jiang, Jack Luo, Nick Feamster, and Junchen Jiang. SwiftQueue: Optimizing Low-Latency Applications with Swift Packet Queuing. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 24:1-24:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{ray_et_al:OASIcs.NINeS.2026.24,
  author =	{Ray, Siddhant and Jiang, Xi and Luo, Jack and Feamster, Nick and Jiang, Junchen},
  title =	{{SwiftQueue: Optimizing Low-Latency Applications with Swift Packet Queuing}},
  booktitle =	{1st New Ideas in Networked Systems (NINeS 2026)},
  pages =	{24:1--24:29},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-414-7},
  ISSN =	{2190-6807},
  year =	{2026},
  volume =	{139},
  editor =	{Argyraki, Katerina and Panda, Aurojit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.NINeS.2026.24},
  URN =		{urn:nbn:de:0030-drops-256093},
  doi =		{10.4230/OASIcs.NINeS.2026.24},
  annote =	{Keywords: Latency prediction, L4S Queue Management}
}
Document
DOI: 10.4230/OASIcs.NINeS.2026.23
Who Holds the Steering Wheel? Opacity and Consolidation in CDN Replica Selection

Authors: Rashna Kumar, Fabián E. Bustamante, and Marcel Flores

Published in: OASIcs, Volume 139, 1st New Ideas in Networked Systems (NINeS 2026)

Abstract
Replica selection, the process by which CDNs decide which server delivers content, has become a hidden lever of power and fragility in today’s Internet. Most users, operators, and policymakers remain blind to how these decisions are made, yet they shape latency, resilience, and sovereignty at global scale. DNS resolver centralization further distorts this function, concentrating influence in the hands of a few global actors. We present the first methodology to systematically infer CDN replica selection strategies at global scale, enabling third-party visibility into opaque steering mechanisms. Using RIPE Atlas probes and a geographically distributed set of DNS resolvers, we construct latency fingerprints that distinguish DNS-based, anycast, and regional anycast deployments. We validate our approach on well-documented global providers before applying it to a diverse set of 17 global and regional CDNs serving the top 1,000 websites across 19 countries, covering 66% of Internet users. We also examine ECS support and its interaction with DNS-based redirection. Our findings show that DNS-based steering remains the dominant approach, used by over 70% of CDNs and responsible for most delivered bytes, yet regional variation and mixed strategies complicate the picture. These results highlight replica selection not only as a technical optimization, but as a sociotechnical risk: opaque steering decisions, particularly among regional CDNs, amplify the effects of resolver consolidation and shape the Internet’s future resilience and control.
Cite as

Rashna Kumar, Fabián E. Bustamante, and Marcel Flores. Who Holds the Steering Wheel? Opacity and Consolidation in CDN Replica Selection. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 23:1-23:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{kumar_et_al:OASIcs.NINeS.2026.23,
  author =	{Kumar, Rashna and Bustamante, Fabi\'{a}n E. and Flores, Marcel},
  title =	{{Who Holds the Steering Wheel? Opacity and Consolidation in CDN Replica Selection}},
  booktitle =	{1st New Ideas in Networked Systems (NINeS 2026)},
  pages =	{23:1--23:23},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-414-7},
  ISSN =	{2190-6807},
  year =	{2026},
  volume =	{139},
  editor =	{Argyraki, Katerina and Panda, Aurojit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.NINeS.2026.23},
  URN =		{urn:nbn:de:0030-drops-256085},
  doi =		{10.4230/OASIcs.NINeS.2026.23},
  annote =	{Keywords: CDN, replica selection, Anycast, Regional Anycast, DNS, consolidation, centralization}
}
Document
DOI: 10.4230/OASIcs.NINeS.2026.25
Five Blind Men and the Internet: Towards an Understanding of Internet Traffic

Authors: Ege Cem Kirci, Ayush Mishra, and Laurent Vanbever

Published in: OASIcs, Volume 139, 1st New Ideas in Networked Systems (NINeS 2026)

Abstract
Our current view of traffic on the Internet - the world’s largest and most pervasive network - comes from a variety of perspectives, each with its own blind spots and biases. In this paper, we make the case for using publicly available Internet exchange point (IXP) statistics as a complementary vantage point. While IXP data has its own limitations, it is fine-grained, accessible, and independently verifiable - offering a distinct perspective on Internet usage patterns. We present results from a two-year study (2023-2024) of 472 IXPs worldwide, capturing approximately 300 Tbps of peak daily aggregate traffic by late 2024. Over this period, aggregate IXP traffic increased by 49.2% (24.5% annualized), with regionally distinct diurnal patterns and event-driven anomalies. These results provide an accessible framework for researchers and operators to study the Internet’s evolving ecosystem from an IXP-based perspective, and lay the groundwork for systematic, global-scale detection of network anomalies and outages.
Cite as

Ege Cem Kirci, Ayush Mishra, and Laurent Vanbever. Five Blind Men and the Internet: Towards an Understanding of Internet Traffic. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 25:1-25:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{kirci_et_al:OASIcs.NINeS.2026.25,
  author =	{Kirci, Ege Cem and Mishra, Ayush and Vanbever, Laurent},
  title =	{{Five Blind Men and the Internet: Towards an Understanding of Internet Traffic}},
  booktitle =	{1st New Ideas in Networked Systems (NINeS 2026)},
  pages =	{25:1--25:26},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-414-7},
  ISSN =	{2190-6807},
  year =	{2026},
  volume =	{139},
  editor =	{Argyraki, Katerina and Panda, Aurojit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.NINeS.2026.25},
  URN =		{urn:nbn:de:0030-drops-256106},
  doi =		{10.4230/OASIcs.NINeS.2026.25},
  annote =	{Keywords: Internet Exchange Point (IXP), traffic measurement, longitudinal study, traffic growth, diurnal patterns, PeeringDB, global-scale detection, network anomalies}
}
Document
DOI: 10.4230/OASIcs.NINeS.2026.4
Understanding Partial Reachability in the Internet Core

Authors: Guillermo Baltra, Tarang Saluja, Yuri Pradkin, and John Heidemann

Published in: OASIcs, Volume 139, 1st New Ideas in Networked Systems (NINeS 2026)

Abstract
Routing strives to connect all the Internet, but compete: political pressure threatens routing fragmentation; architectural changes such as private clouds, carrier-grade NAT, and firewalls make connectivity conditional; and commercial disputes create partial reachability for days or years. This paper suggests persistent, partial reachability is fundamental to the Internet and an underexplored problem. We first derive a conceptual definition of the Internet core based on connectivity, not authority. We identify peninsulas: persistent, partial connectivity; and islands: when computers are partitioned from the Internet core. Second, we develop algorithms to observe each across the Internet, and apply them to two existing measurement systems: Trinocular, where 6 locations observe 5M networks frequently, and RIPE Atlas, where 13k locations scan the DNS roots frequently. Cross-validation shows our findings are stable over three years of data, and consistent with as few as 3 geographically-distributed observers. We validate peninsulas and islands against CAIDA Ark, showing good recall (0.94) and bounding precision between 0.42 and 0.82. Finally, our work has broad practical impact: we show that peninsulas are more common than Internet outages. Factoring out peninsulas and islands as noise can improve existing measurement systems; their "noise" is 5× to 9.7× larger than the operational events in RIPE’s DNSmon. We show that most peninsula events are routing transients (45%), but most peninsula-time (90%) is due to a few (7%) long-lived events. Our work helps inform Internet policy and governance, with our neutral definition showing no single country or organization can unilaterally control the Internet core.
Cite as

Guillermo Baltra, Tarang Saluja, Yuri Pradkin, and John Heidemann. Understanding Partial Reachability in the Internet Core. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 4:1-4:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{baltra_et_al:OASIcs.NINeS.2026.4,
  author =	{Baltra, Guillermo and Saluja, Tarang and Pradkin, Yuri and Heidemann, John},
  title =	{{Understanding Partial Reachability in the Internet Core}},
  booktitle =	{1st New Ideas in Networked Systems (NINeS 2026)},
  pages =	{4:1--4:32},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-414-7},
  ISSN =	{2190-6807},
  year =	{2026},
  volume =	{139},
  editor =	{Argyraki, Katerina and Panda, Aurojit},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.NINeS.2026.4},
  URN =		{urn:nbn:de:0030-drops-255892},
  doi =		{10.4230/OASIcs.NINeS.2026.4},
  annote =	{Keywords: Internet, Internet reliability, Network outages, Active measurements}
}
Document
DOI: 10.4230/OASIcs.Gabbrielli.7
Abstract Interpretation, Symbolic Execution and Constraints

Authors: Roberto Amadini, Graeme Gange, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey

Published in: OASIcs, Volume 86, Recent Developments in the Design and Implementation of Programming Languages (2020)

Abstract
Abstract interpretation is a static analysis framework for sound over-approximation of all possible runtime states of a program. Symbolic execution is a framework for reachability analysis which tries to explore all possible execution paths of a program. A shared feature between abstract interpretation and symbolic execution is that each - implicitly or explicitly - maintains constraints during execution, in the form of invariants or path conditions. We investigate the relations between the worlds of abstract interpretation, symbolic execution and constraint solving, to expose potential synergies.
Cite as

Roberto Amadini, Graeme Gange, Peter Schachte, Harald Søndergaard, and Peter J. Stuckey. Abstract Interpretation, Symbolic Execution and Constraints. In Recent Developments in the Design and Implementation of Programming Languages. Open Access Series in Informatics (OASIcs), Volume 86, pp. 7:1-7:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{amadini_et_al:OASIcs.Gabbrielli.7,
  author =	{Amadini, Roberto and Gange, Graeme and Schachte, Peter and S{\o}ndergaard, Harald and Stuckey, Peter J.},
  title =	{{Abstract Interpretation, Symbolic Execution and Constraints}},
  booktitle =	{Recent Developments in the Design and Implementation of Programming Languages},
  pages =	{7:1--7:19},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-171-9},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{86},
  editor =	{de Boer, Frank S. and Mauro, Jacopo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.Gabbrielli.7},
  URN =		{urn:nbn:de:0030-drops-132294},
  doi =		{10.4230/OASIcs.Gabbrielli.7},
  annote =	{Keywords: Abstract interpretation, symbolic execution, constraint solving, dynamic analysis, static analysis}
}
Document
DOI: 10.4230/DagSemProc.08102.5
5. 08102 Working Group – Measurement Requirements

Authors: Lothar Braun, Thorsten Braun, Georg Carle, Falko Dressler, Anja Feldmann, Dirk Haage, Tobias Limmer, and Tanja Zseby

Published in: Dagstuhl Seminar Proceedings, Volume 8102, Perspectives Workshop: Network Attack Detection and Defense (2008)

Abstract
The objective of this working group was to derive measurement requirements and challenges that originate from intrusion detection.
Cite as

Lothar Braun, Thorsten Braun, Georg Carle, Falko Dressler, Anja Feldmann, Dirk Haage, Tobias Limmer, and Tanja Zseby. 5. 08102 Working Group – Measurement Requirements. In Perspectives Workshop: Network Attack Detection and Defense. Dagstuhl Seminar Proceedings, Volume 8102, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)

Copy BibTex To Clipboard

@InProceedings{braun_et_al:DagSemProc.08102.5,
  author =	{Braun, Lothar and Braun, Thorsten and Carle, Georg and Dressler, Falko and Feldmann, Anja and Haage, Dirk and Limmer, Tobias and Zseby, Tanja},
  title =	{{5. 08102 Working Group – Measurement Requirements}},
  booktitle =	{Perspectives Workshop: Network Attack Detection and Defense},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8102},
  editor =	{Georg Carle and Falko Dressler and Richard A. Kemmerer and Hartmut K\"{o}nig and Christopher Kruegel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08102.5},
  URN =		{urn:nbn:de:0030-drops-14962},
  doi =		{10.4230/DagSemProc.08102.5},
  annote =	{Keywords: Intrusion detection and prevention, attack response and countermeasures, reactive security, automated security, survivability and self-protection, ma network monitoring, flow analysis, denial of service detection and response, event correlation}
}
Document
DOI: 10.4230/DagSemProc.06441.1
06441 Abstracts Collection – Naming and Addressing for Next Generation Internetworks

Authors: Bengt Ahlgren, Lars Eggert, Anja Feldmann, Andrei Gurtov, and Thomas Henderson

Published in: Dagstuhl Seminar Proceedings, Volume 6441, Naming and Addressing for Next-Generation Internetworks (2007)

Abstract
From 29.10.06 to 01.11.06, the Dagstuhl Seminar 06441``Naming and Addressing for Next-Generation Internetworks'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Bengt Ahlgren, Lars Eggert, Anja Feldmann, Andrei Gurtov, and Thomas Henderson. 06441 Abstracts Collection – Naming and Addressing for Next Generation Internetworks. In Naming and Addressing for Next-Generation Internetworks. Dagstuhl Seminar Proceedings, Volume 6441, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{ahlgren_et_al:DagSemProc.06441.1,
  author =	{Ahlgren, Bengt and Eggert, Lars and Feldmann, Anja and Gurtov, Andrei and Henderson, Thomas},
  title =	{{06441 Abstracts Collection – Naming and Addressing for Next Generation Internetworks}},
  booktitle =	{Naming and Addressing for Next-Generation Internetworks},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6441},
  editor =	{Bengt Ahlgren and Lars Eggert and Anja Feldmann and Andrei Gurtov and Tom R. Henderson},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06441.1},
  URN =		{urn:nbn:de:0030-drops-11309},
  doi =		{10.4230/DagSemProc.06441.1},
  annote =	{Keywords: Naming, addressing, network architecture, next-generation networks, security, privacy}
}
Document
DOI: 10.4230/DagSemProc.06441.2
06441 Summary – Naming and Addressing for Next Generation Internetworks

Authors: Thomas Henderson, Andrei Gurtov, Lars Eggert, and Christian Dannewitz

Published in: Dagstuhl Seminar Proceedings, Volume 6441, Naming and Addressing for Next-Generation Internetworks (2007)

Abstract
The design of naming and addressing for data networks is a fundamental architectural consideration, and several current or anticipated problems in the Internet – including mobility dynamics, forwarding table growth in the core routers, and security – point out possible limitations with naming and addressing schemes in use today. A seminar on the topic of naming and addressing for next generation internetworks was held at the Schloß Dagstuhl from October 29 to November 1, 2006. Researchers from different fields discussed their views and recent results pertaining to naming and addressing problems. Over twenty talks covered topics such as routing, naming components, APIs, mobility, delay-tolerant architectures, flat routing and deployment issues. This article briefly summarizes the seminar presentations and discussions.
Cite as

Thomas Henderson, Andrei Gurtov, Lars Eggert, and Christian Dannewitz. 06441 Summary – Naming and Addressing for Next Generation Internetworks. In Naming and Addressing for Next-Generation Internetworks. Dagstuhl Seminar Proceedings, Volume 6441, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{henderson_et_al:DagSemProc.06441.2,
  author =	{Henderson, Thomas and Gurtov, Andrei and Eggert, Lars and Dannewitz, Christian},
  title =	{{06441 Summary – Naming and Addressing for Next Generation Internetworks}},
  booktitle =	{Naming and Addressing for Next-Generation Internetworks},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6441},
  editor =	{Bengt Ahlgren and Lars Eggert and Anja Feldmann and Andrei Gurtov and Tom R. Henderson},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06441.2},
  URN =		{urn:nbn:de:0030-drops-11293},
  doi =		{10.4230/DagSemProc.06441.2},
  annote =	{Keywords: Network architecture, scalability, mobility, heterogeneity, extensibility, naming, addressing}
}
  • Refine by Type
  • 8 Document/PDF
  • 4 Document/HTML

  • Refine by Publication Year
  • 4 2026
  • 1 2020
  • 1 2008
  • 2 2007

  • Refine by Author
  • 2 Eggert, Lars
  • 2 Feldmann, Anja
  • 2 Gurtov, Andrei
  • 2 Henderson, Thomas
  • 1 Ahlgren, Bengt
  • Show More...

  • Refine by Series/Journal
  • 5 OASIcs
  • 3 DagSemProc

  • Refine by Classification
  • 3 Networks → Network measurement
  • 2 Networks → Public Internet
  • 1 Computing methodologies → Machine learning approaches
  • 1 Networks → Location based services
  • 1 Networks → Network architectures
  • Show More...

  • Refine by Keyword
  • 2 addressing
  • 1 Abstract interpretation
  • 1 Active measurements
  • 1 Anycast
  • 1 CDN
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact