Volume
OASIcs, Volume 139
1st New Ideas in Networked Systems (NINeS 2026)
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: New Ideas in Networked Systems (NINeS)
Event
Editors
Publication Details
- published at: 2026-03-19
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-414-7
Access Numbers
- Detailed Access Statistics available here
-
Total Accesses (updated on a weekly basis)
0Documents
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 139, NINeS 2026, Complete Volume
Abstract
OASIcs, Volume 139, NINeS 2026, Complete Volume
Cite as
1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 1-794, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@Proceedings{argyraki_et_al:OASIcs.NINeS.2026,
title = {{OASIcs, Volume 139, NINeS 2026, Complete Volume}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {1--794},
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},
URN = {urn:nbn:de:0030-drops-256819},
doi = {10.4230/OASIcs.NINeS.2026},
annote = {Keywords: OASIcs, Volume 139, NINeS 2026, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 0:i-0:xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{argyraki_et_al:OASIcs.NINeS.2026.0,
author = {Argyraki, Katerina and Panda, Aurojit},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {0:i--0:xvi},
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.0},
URN = {urn:nbn:de:0030-drops-256804},
doi = {10.4230/OASIcs.NINeS.2026.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Tidal: Tackling Concept Drift in Provenance-Based Advanced Persistent Threats Detection
Abstract
Advanced Persistent Threats (APTs) pose significant challenges to cybersecurity due to their evolving nature and ability to evade detection. This paper introduces Tidal, a novel provenance-based intrusion detection system (PIDS) that is specifically designed to address concept drift in APT detection. Tidal designs a modified Transformer architecture tailored for transfer learning, including a Multi-head Transformer (MHT) with shared layers for learning common knowledge and task-specific head layers for learning unique patterns. The system uses a pre-training and fine-tuning workflow to achieve high post-drift adaptation and pre-drift retention accuracy. Additionally, Tidal customizes its data embedding for detection on flexible audit log lengths and computes entity relevance scores alongside classified attacks to aid in attack investigation. We evaluate Tidal by simulating concept drift scenarios with real-world datasets. Results demonstrate that compared to state-of-the-art detection systems, Tidal achieves an average of 27% higher recall and 31% higher precision with only half of new training data for post-drift adaptation accuracy.
Cite as
Yajie Zhou, Nengneng Yu, Tuo Zhao, and Zaoxing Liu. Tidal: Tackling Concept Drift in Provenance-Based Advanced Persistent Threats Detection. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 1:1-1:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{zhou_et_al:OASIcs.NINeS.2026.1,
author = {Zhou, Yajie and Yu, Nengneng and Zhao, Tuo and Liu, Zaoxing},
title = {{Tidal: Tackling Concept Drift in Provenance-Based Advanced Persistent Threats Detection}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {1:1--1:28},
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.1},
URN = {urn:nbn:de:0030-drops-255867},
doi = {10.4230/OASIcs.NINeS.2026.1},
annote = {Keywords: Advanced Persistent Threat (APT), Provenance-based Intrusion Detection (PIDS), Concept Drift, Transfer Learning, Machine Learning for Security}
}
Document
Performance Isolation for 5G RAN Slices Across Multiple Interfering Cells
Abstract
Radio Access Network (RAN) slicing, a key 5G feature, enables different slices (i.e. tenants or applications) to share the same physical network infrastructure while pursuing diverse objectives such as fairness, prioritization, or maximizing throughput. Each slice is allocated a share of radio resource blocks (RBs), which it further schedules among its users as per its own performance objective. In this paper, we identify the unique challenges that arise when performing RAN slicing in today’s multi-cell deployments that require a mechanism for managing interference among cells. We highlight how interference management decisions, that can be easily made in the absence of slicing (where all users share a common objective set by the network operator), become challenging with 5G slicing where we must respect the individual objectives of multiple slices, while retaining performance isolation across slices. We present a system, RadioNinja, that tackles this challenge through a unique decision-making framework that allows different slices to independently contribute towards interference management decisions. RadioNinja further employs a series of techniques to make such decisions within tight RAN scheduling budget of hundreds of microseconds. Trace-driven simulations with real-world channel measurements show that RadioNinja improves slice-level objectives (e.g., throughput, fairness, flow completion times) by 20–60% over state-of-the-art baselines, while consistently meeting sub-millisecond decision deadlines.
Cite as
Taimoor Tariq, Yongzhou Chen, Haitham Hassanieh, and Radhika Mittal. Performance Isolation for 5G RAN Slices Across Multiple Interfering Cells. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 2:1-2:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{tariq_et_al:OASIcs.NINeS.2026.2,
author = {Tariq, Taimoor and Chen, Yongzhou and Hassanieh, Haitham and Mittal, Radhika},
title = {{Performance Isolation for 5G RAN Slices Across Multiple Interfering Cells}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {2:1--2: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.2},
URN = {urn:nbn:de:0030-drops-255875},
doi = {10.4230/OASIcs.NINeS.2026.2},
annote = {Keywords: Cellular Networks, Resource Management, RAN Slicing, Interference Management}
}
Document
Limix: Limiting Lamport Exposure to Distant Failures in Globally-Managed Distributed Systems
Abstract
Globalized computing infrastructures offer the convenience and elasticity of globally managed objects and services, but lack the resilience to distant failures that localized infrastructures such as private clouds provide. Providing both global management and resilience to distant failures, however, poses a fundamental problem for configuration services: How to discover a possibly migratory, strongly-consistent service/object in a globalized infrastructure without dependencies on globalized state? Limix is the first metadata configuration service that addresses this problem. With Limix, global strongly-consistent data-plane services and objects are insulated from remote gray failures by ensuring that the definitive, strongly-consistent metadata for any object is always confined to the same region as the object itself. Limix guarantees availability bounds: any user can continue accessing any strongly consistent object that matters to the user located at distance Δ away, insulated from failures outside a small multiple of Δ. We built a Limix metadata service based on the key-value interface of CockroachDB. Our experiments on Internet-like networks and on AWS, using realistic trace-driven workloads, show that Limix enables global management and significantly improves availability over the state-of-the-art.
Cite as
Cristina Băsescu, Georgia Fragkouli, Enis Ceyhun Alp, Michael F. Nowlan, Jose M. Faleiro, Gaylor Bosson, Kelong Cong, Pierluca Borsò-Tan, Vero Estrada-Galiñanes, and Bryan Ford. Limix: Limiting Lamport Exposure to Distant Failures in Globally-Managed Distributed Systems. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 3:1-3:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{basescu_et_al:OASIcs.NINeS.2026.3,
author = {B\u{a}sescu, Cristina and Fragkouli, Georgia and Alp, Enis Ceyhun and Nowlan, Michael F. and Faleiro, Jose M. and Bosson, Gaylor and Cong, Kelong and Bors\`{o}-Tan, Pierluca and Estrada-Gali\~{n}anes, Vero and Ford, Bryan},
title = {{Limix: Limiting Lamport Exposure to Distant Failures in Globally-Managed Distributed Systems}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {3:1--3: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.3},
URN = {urn:nbn:de:0030-drops-255880},
doi = {10.4230/OASIcs.NINeS.2026.3},
annote = {Keywords: Distributed systems, Availability, Fault tolerance, Strong-consistency, Coordination systems, Lamport exposure}
}
Document
Understanding Partial Reachability in the Internet Core
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
OrbitalBrain: A Distributed Framework for Training ML Models in Space
Abstract
Earth observation nanosatellites capture high-resolution photos of the Earth in near real-time. These images increasingly support ML applications that are critical for safety and response, such as forest fire and flood detection. However, the downlink bandwidth is limited, resulting in days or weeks of delay from image capture to training. In this work, we propose OrbitalBrain, an efficient in-space distributed ML training framework that leverages limited and predictable satellite compute, bandwidth, and power to intelligently balance data transfer, model aggregation, and local training. Our evaluations demonstrate that OrbitalBrain achieves 1.52×-12.4× speedup in time-to-accuracy while always reaching a higher final model accuracy compared to state-of-the-art ground-based or federated learning baselines. Furthermore, our approach is complementary to satellite imagery capturing and downloading, enhancing the overall efficiency of satellite-based applications.
Cite as
Om Chabra, Chenning Li, Kevin Hsieh, Santiago Segarra, Behnaz Arzani, Peder Olsen, and Ranveer Chandra. OrbitalBrain: A Distributed Framework for Training ML Models in Space. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 5:1-5:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{chabra_et_al:OASIcs.NINeS.2026.5,
author = {Chabra, Om and Li, Chenning and Hsieh, Kevin and Segarra, Santiago and Arzani, Behnaz and Olsen, Peder and Chandra, Ranveer},
title = {{OrbitalBrain: A Distributed Framework for Training ML Models in Space}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {5:1--5: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.5},
URN = {urn:nbn:de:0030-drops-255907},
doi = {10.4230/OASIcs.NINeS.2026.5},
annote = {Keywords: Satellite networks, Distributed machine learning, Federated learning, Earth observation, In-orbit computing}
}
Document
EcoCell: Energy Conservation Through Traffic Shaping in Cellular Radio Access Networks
Abstract
Cellular networks contribute significantly to global energy demands and carbon emissions due to the millions of base stations deployed worldwide. We characterize the energy consumption of production base stations by performing fine-grained power and network telemetry measurements using off-the-shelf base stations. Our measurements reveal unique insights about how variations in temporal-usage patterns affect base station energy consumption. Based on these insights, we design EcoCell, a software-only solution that introduces energy-efficient traffic patterns in network flows. EcoCell can be implemented either as a traffic scheduler in the radio access network or as an independent middlebox. We evaluate EcoCell with five popular networked applications on a production basestation. We demonstrate savings up to 32% in dynamic energy consumption of a base station, without drops in application-level quality of experience.
Cite as
Zikun Liu, Seoyul Oh, Bill Tao, Yaxiong Xie, Anuj Kalia, and Deepak Vasisht. EcoCell: Energy Conservation Through Traffic Shaping in Cellular Radio Access Networks. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 6:1-6:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{liu_et_al:OASIcs.NINeS.2026.6,
author = {Liu, Zikun and Oh, Seoyul and Tao, Bill and Xie, Yaxiong and Kalia, Anuj and Vasisht, Deepak},
title = {{EcoCell: Energy Conservation Through Traffic Shaping in Cellular Radio Access Networks}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {6:1--6:25},
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.6},
URN = {urn:nbn:de:0030-drops-255911},
doi = {10.4230/OASIcs.NINeS.2026.6},
annote = {Keywords: energy efficiency, traffic shaping, cellular networks, radio access networks}
}
Document
What Obstructed Skies Teach Us About Satellite Internet
Abstract
Low Earth Orbit satellite networks can extend Internet connectivity to remote areas where traditional broadband infrastructure is unavailable. However physical obstructions, e.g., dense forest cover, can interfere with satellite communication by blocking the user terminal’s line of sight to the satellite constellation. Unfortunately the impact of such obstructions on the connectivity of user terminals is not well studied. We bridge this gap by conducting an experimental study of how physical obstructions influence satellite network connectivity. Through controlled experiments using a purpose-built hardware testbed, we quantify the performance degradation caused by physical obstructions to user terminals. Our results show that obstructions increase round-trip latency by an average of 4% and packet loss by 0.3%. Obstructions cause user terminals to connect to a different satellite than the unobstructed terminal approximately 15% of the time. We find evidence of a previously undocumented adaptive mechanism we call responsive routing, where the satellite network switches obstructed terminals to alternative satellites within the standard 15-second interval between typical handovers. Our data is publicly available as supplementary material to this article.
Cite as
Bhaskar Kataria, Hammas Bin Tanveer, Rishab Nithyanand, and Rachee Singh. What Obstructed Skies Teach Us About Satellite Internet. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 7:1-7:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{kataria_et_al:OASIcs.NINeS.2026.7,
author = {Kataria, Bhaskar and Tanveer, Hammas Bin and Nithyanand, Rishab and Singh, Rachee},
title = {{What Obstructed Skies Teach Us About Satellite Internet}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {7:1--7:25},
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.7},
URN = {urn:nbn:de:0030-drops-255923},
doi = {10.4230/OASIcs.NINeS.2026.7},
annote = {Keywords: Satellite Internet, Starlink, Network Measurement, LEO Satellites, Obstructions}
}
Document
Contracts: A Unified Lens on Congestion Control Robustness, Fairness, Congestion, and Generality
Abstract
Congestion control algorithms (CCAs) operate in partially observable environments. They cannot directly observe link capacities or competing flows. To share network resources fairly, CCAs (implicitly) communicate fair shares through observable signals. For instance, Reno encodes the fair share as ∝ 1/√{loss rate}. We call such communication mechanisms as contracts. We find that the choice of contract fixes key steady-state performance metrics, including (1) robustness to errors in congestion signals, (2) fairness, (3) amount of congestion (e.g., delay, loss), and (4) generality (e.g., range of supported link rates). This leads to fundamental tradeoffs between these metrics. Further, we show that many contracts lead to starvation (extreme unfairness), and must be avoided. Hence, contracts are a powerful way to analyze tradeoffs and avoid pitfalls in CCA design and analysis. We empirically validate our findings and discuss their implications on CCA design and network measurement.
Cite as
Anup Agarwal, Venkat Arun, and Srinivasan Seshan. Contracts: A Unified Lens on Congestion Control Robustness, Fairness, Congestion, and Generality. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 8:1-8:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{agarwal_et_al:OASIcs.NINeS.2026.8,
author = {Agarwal, Anup and Arun, Venkat and Seshan, Srinivasan},
title = {{Contracts: A Unified Lens on Congestion Control Robustness, Fairness, Congestion, and Generality}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {8:1--8:30},
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.8},
URN = {urn:nbn:de:0030-drops-255933},
doi = {10.4230/OASIcs.NINeS.2026.8},
annote = {Keywords: Transport Protocols, Congestion Control, Fairness}
}
Document
Tight Loops, Smooth Streams: Responsive Congestion Control for Real-Time Video
Abstract
Real-time video streaming relies on rate control to match video bitrate to network capacity while keeping latency low. Existing deployed video rate controllers react slowly to network changes, causing under-utilization and latency spikes. In contrast, modern delay-sensitive congestion control algorithms (CCAs) adapt on round-trip-time timescales, maintaining a tight feedback loop that achieves both high utilization and low latency.
We introduce Vidaptive, a lightweight framework that enables real-time video to leverage responsive CCAs without codec changes. Vidaptive decouples encoding from transmission: it paces video frames at the CCA’s rate and injects dummy packets when the encoder output is insufficient, preserving a continuous feedback loop. An online algorithm dynamically adjusts the encoder’s target bitrate to align with CCA capacity while bounding frame latency.
Implemented in Google WebRTC, Vidaptive improves both video quality and tail latency on diverse cellular traces. Compared to GCC, it delivers 1.5× higher bitrate, +40% VMAF, +1.4 dB SSIM, +1.3 dB PSNR, and reduces 95th-percentile frame latency by 57% (2.2 seconds). Against Salsify, it achieves lower tail latency without invasive codec modifications. These results show that coupling existing CCAs with a thin adaptation layer can outperform specialized video rate controllers while remaining deployable in practice.
Cite as
Pantea Karimi, Sadjad Fouladi, Vibhaalakshmi Sivaraman, and Mohammad Alizadeh. Tight Loops, Smooth Streams: Responsive Congestion Control for Real-Time Video. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 9:1-9:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{karimi_et_al:OASIcs.NINeS.2026.9,
author = {Karimi, Pantea and Fouladi, Sadjad and Sivaraman, Vibhaalakshmi and Alizadeh, Mohammad},
title = {{Tight Loops, Smooth Streams: Responsive Congestion Control for Real-Time Video}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {9:1--9: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.9},
URN = {urn:nbn:de:0030-drops-255942},
doi = {10.4230/OASIcs.NINeS.2026.9},
annote = {Keywords: real-time video, congestion control, transport protocols, video rate control, low-latency video communication, tight feedback loop}
}
Document
Scalable Routing in a City-Scale Wi-Fi Network for Disaster Recovery
Abstract
This paper presents CityMesh, a city-scale decentralized mesh network designed for disaster recovery and emergency scenarios. When wide-area Internet connectivity is unavailable or severely degraded, CityMesh leverages both static access points and mobile devices equipped with Wi-Fi to provide intra-city connectivity and reach opportunistic gateways to the Internet (e.g., via satellite links). The main contribution of this paper is a scalable routing protocol that supports millions of devices, addressing a long-standing limitation of wireless mesh and mobile ad hoc networks. Unlike prior approaches, CityMesh exploits rich building-location and building-geometry data from widely available city maps to guide route computation, improving packet delivery while significantly reducing transmission overhead. Simulation results from 70 cities show that CityMesh improves packet delivery rates by 88% over WEAVE (a state-of-the-art geographic routing protocol). A campus-scale deployment of 300 Wi-Fi devices across 31 buildings shows the practical deployability of CityMesh. These results demonstrate the promise of map-aware routing as a foundation for scalable, resilient city-wide Wi-Fi networks.
Cite as
Ziqian Liu, Om Chabra, James Lynch, Aaron Martin, Chenning Li, and Hari Balakrishnan. Scalable Routing in a City-Scale Wi-Fi Network for Disaster Recovery. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 10:1-10:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{liu_et_al:OASIcs.NINeS.2026.10,
author = {Liu, Ziqian and Chabra, Om and Lynch, James and Martin, Aaron and Li, Chenning and Balakrishnan, Hari},
title = {{Scalable Routing in a City-Scale Wi-Fi Network for Disaster Recovery}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {10:1--10:31},
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.10},
URN = {urn:nbn:de:0030-drops-255954},
doi = {10.4230/OASIcs.NINeS.2026.10},
annote = {Keywords: mesh networking, disaster recovery, geographic routing, scalability, Wi-Fi}
}
Document
Stealthy Low Earth Orbit Satellite-To-Ground Quantum Communication
Abstract
Quantum key distribution (QKD) leveraging satellites holds promise for global-scale secure communication. However, its practical deployment is threatened by the inherent predictability of satellite orbits, which exposes quantum channels to targeted eavesdropping attacks, compromising the physical-layer security guarantees of QKD. Through security analysis, we demonstrate that such attacks can drastically increase the quantum bit error rate (QBER) from 4.7% to 27.5%, effectively disrupting secure key generation. To address this fundamental vulnerability, we introduce a novel defense framework that integrates two strategies: (1) Stealthy Deployment, which obfuscates quantum satellites within massive LEO constellations to drastically increase an adversary’s search space, and (2) Dynamic Re-routing, which is an adaptive countermeasure that re-establishes QKD sessions via alternative paths upon eavesdropping detection. Evaluated through large-scale simulations incorporating real-world satellite data, our framework demonstrates up to a 90% improvement in key generation rate under active attack, ensuring robust and resilient satellite-based QKD without modifications to the underlying quantum hardware.
Cite as
Guanqun Song and Ting Zhu. Stealthy Low Earth Orbit Satellite-To-Ground Quantum Communication. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 11:1-11:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{song_et_al:OASIcs.NINeS.2026.11,
author = {Song, Guanqun and Zhu, Ting},
title = {{Stealthy Low Earth Orbit Satellite-To-Ground Quantum Communication}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {11:1--11: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.11},
URN = {urn:nbn:de:0030-drops-255963},
doi = {10.4230/OASIcs.NINeS.2026.11},
annote = {Keywords: LEO satellites, QKD, quantum communication}
}
Document
No Signal to Rule Them All: A Systematic Analysis of In-Network Congestion Signals
Abstract
In this paper, we address the following question: what in-network signals should a network provide to congestion control algorithms? To answer this guiding question, we use prior work to automatically generate congestion control algorithms optimized for a given performance objective and set of in-network congestion signals. We then make observations about the relative value of these congestion signals across a range of performance objectives. Our analysis yields a surprising central finding: for the average case, sophisticated In-Network Telemetry (INT) offers minimal performance benefits over traditional end-to-end (E2E) signals, with performance typically within 3%. We also find no single "best" INT signal, but rather a clear trade-off that manifests in many scenarios: link-based signals often excel at controlling delay, while queue-based signals are better for maximizing throughput. To make these findings concrete, we validate them by examining the extent to which in-network signals improve the performance of the BBR congestion control algorithm.
Cite as
Sarah McClure, Nandita Dukkipati, Sylvia Ratnasamy, and Scott Shenker. No Signal to Rule Them All: A Systematic Analysis of In-Network Congestion Signals. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 12:1-12:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{mcclure_et_al:OASIcs.NINeS.2026.12,
author = {McClure, Sarah and Dukkipati, Nandita and Ratnasamy, Sylvia and Shenker, Scott},
title = {{No Signal to Rule Them All: A Systematic Analysis of In-Network Congestion Signals}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {12:1--12:30},
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.12},
URN = {urn:nbn:de:0030-drops-255974},
doi = {10.4230/OASIcs.NINeS.2026.12},
annote = {Keywords: Congestion control, in-network telemetry}
}
Document
In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication
Abstract
Broadcasting and aggregation dominate the communication overhead in distributed systems, from machine learning training to data analytics. Current acceleration approaches require specialized hardware (RDMA) or dedicated resources (DPDK), limiting their deployment in commodity clouds. However, we present a counter-intuitive alternative: rather than bypassing the kernel, we move operations into it using eBPF. While this imposes severe constraints including no floating-point, limited memory, and stateless execution, we show these restrictions paradoxically drive innovative protocol designs that yield unexpected benefits.
We introduce AggBox, which implements broadcast and aggregation operations entirely within eBPF’s constrained environment. Our key innovations include stateless group acknowledgments for reliability, edge quantization for floating-point aggregation using only integer arithmetic, and tail-call chains that create virtual memory beyond eBPF’s 512-byte stack limit. These designs emerge from and exploit the constraints rather than fighting them. AggBox achieves remarkable performance on commodity hardware: 84.5% reduction in broadcast latency, 43× speedup for MapReduce workloads, and 56.1% faster ML gradient aggregation, all without specialized NICs or dedicated cores. Beyond performance, our work demonstrates that constrained environments can drive fundamental innovation in protocol design, offering insights for future resource-limited and verified systems.
Cite as
Jianchang Su, Yifan Zhang, and Wei Zhang. In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 13:1-13:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{su_et_al:OASIcs.NINeS.2026.13,
author = {Su, Jianchang and Zhang, Yifan and Zhang, Wei},
title = {{In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {13:1--13: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.13},
URN = {urn:nbn:de:0030-drops-255981},
doi = {10.4230/OASIcs.NINeS.2026.13},
annote = {Keywords: eBPF, distributed communication, broadcast, aggregation, in-kernel processing, XDP}
}
Document
Passive Data-Plane Telemetry to Mitigate Long-Distance BGP Hijacks
Abstract
Poor security of Internet routing enables adversaries to divert user data through unintended infrastructures in attacks known as hijacks. Of particular concern - and the focus of this paper - are cases where attackers reroute domestic traffic through foreign countries and still deliver it to the intended destination, exposing traffic to surveillance, bypassing legal privacy protections, and posing national security threats. Efforts to detect and mitigate such attacks have focused primarily on the control plane, while data-plane signals remain largely overlooked. In this paper, we argue that passively-monitored round-trip time (RTT) - and, in particular, changes in its propagation-delay component - offers a promising signal for detection: the increased propagation delay is unavoidable and directly observable from affected networks, enabling opportunities for faster detection and mitigation. We explore the practicality of using RTT variations for hijack detection, addressing two key questions: (1) What coverage can this provide, given its heavy dependence on the geolocations of the sender, receiver, and adversary? and (2) Can an always-on RTT-based detection system be deployed without disrupting normal network operations? Focusing on cross-country interception attacks, we find that coverage is high: 97% under ideal (i.e., data travels at the speed of light) conditions, and 91% and 86% with real traffic from two datasets. To demonstrate practicality, we design HiDe, which reliably detects delay surges from long-distance hijacks at line rate using commodity programmable hardware. We measure HiDe’s accuracy and false-positive rate on real-world data and validate it with ethically conducted hijacks.
Cite as
Satadal Sengupta, Hyojoon Kim, Daniel Jubas, Maria Apostolaki, and Jennifer Rexford. Passive Data-Plane Telemetry to Mitigate Long-Distance BGP Hijacks. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 14:1-14:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{sengupta_et_al:OASIcs.NINeS.2026.14,
author = {Sengupta, Satadal and Kim, Hyojoon and Jubas, Daniel and Apostolaki, Maria and Rexford, Jennifer},
title = {{Passive Data-Plane Telemetry to Mitigate Long-Distance BGP Hijacks}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {14:1--14: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.14},
URN = {urn:nbn:de:0030-drops-255992},
doi = {10.4230/OASIcs.NINeS.2026.14},
annote = {Keywords: Network security, routing, Border Gateway Protocol, hijack, interception attack, programmable networks, in-network detection, in-network mitigation}
}
Document
BISCAY: Practical Radio KPI Driven Congestion Control for Mobile Networks
Abstract
Mobile application performance is often bottlenecked by cellular links with rapid bandwidth fluctuations. We show that radio KPIs from the device chipset can precisely and promptly measure available cellular bandwidth. Building on this, we propose Biscay, a practical KPI-driven congestion control for mobile networks. Biscay leverages OpenDiag, an in-kernel, real-time KPI extractor we introduce along with a KPI-based bandwidth estimator to adjust the congestion window, utilizing available bandwidth while minimizing delay. We implement Biscay and OpenDiag on unrooted Android 5G phones. Across trace-driven emulations and real-world 4G/5G experiments, Biscay outperforms state-of-the-art CCAs (e.g., BBR, CUBIC), typically reducing average and tail delay by >90% while matching or improving throughput. These gains stem from OpenDiag’s 100× finer on-device KPI granularity than existing alternatives like MobileInsight.
Cite as
Jon Larrea, Tanya Shreedhar, Atte Niemi, Adel Sefiane, and Mahesh K. Marina. BISCAY: Practical Radio KPI Driven Congestion Control for Mobile Networks. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 15:1-15:32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{larrea_et_al:OASIcs.NINeS.2026.15,
author = {Larrea, Jon and Shreedhar, Tanya and Niemi, Atte and Sefiane, Adel and Marina, Mahesh K.},
title = {{BISCAY: Practical Radio KPI Driven Congestion Control for Mobile Networks}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {15:1--15: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.15},
URN = {urn:nbn:de:0030-drops-256002},
doi = {10.4230/OASIcs.NINeS.2026.15},
annote = {Keywords: Cellular Networks, Congestion Control, LTE/5G}
}
Document
Monitoring Latency on Submarine Cables: Limitations and Opportunities
Abstract
The world’s Submarine Cable Network (SCN) is a critical component of the Internet, supporting both inter- and intra- continental communication. We describe a methodology to extract packet latency (via RTT) information on submarine segments, using existing deployed infrastructure collecting standard traceroute measurements. The first component of the methodology identifies vantage points whose measurements traverse submarine segments. The second component provides novel, path-change-aware, approaches to extract the minRTT over the segments, using those vantage points. We demonstrate the efficacy of our method by using traceroute measurements from perfSONAR deployments as ground truth. Our results provide a clear view of the inherent limitations of existing deployed infrastructure. Although both our methodology and minimum RTT estimators raise the state of the art, they also reveal that such infrastructure cannot hope, in general, to access dynamic latency metrics such as latency variability (variance) arising from congestion.
Cite as
Mia Weaver, Darryl Veitch, Paul Barford, Fabián E. Bustamante, and Esteban Carisimo. Monitoring Latency on Submarine Cables: Limitations and Opportunities. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 16:1-16:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{weaver_et_al:OASIcs.NINeS.2026.16,
author = {Weaver, Mia and Veitch, Darryl and Barford, Paul and Bustamante, Fabi\'{a}n E. and Carisimo, Esteban},
title = {{Monitoring Latency on Submarine Cables: Limitations and Opportunities}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {16:1--16:24},
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.16},
URN = {urn:nbn:de:0030-drops-256013},
doi = {10.4230/OASIcs.NINeS.2026.16},
annote = {Keywords: Submarine Cable Network, Internet Measurement}
}
Document
Don’t Get Caught, Keep Your Onions in a Vault
Abstract
When web applications wish to operate anonymously, they routinely host themselves as "Hidden Services" in the Tor network. However, these services are frequently threatened by deanonymization attacks, whereby their IP address and location may be inferred by the authorities. We present VaulTor, a novel architecture for the Tor network that ensures an extra layer of security for the Hidden Services against deanonymization attacks. In this new architecture, a volunteer (vault) is incentivized to host the web application content on behalf of the Hidden Service. The vault runs the hosted application in a Trusted Execution Environment (TEE) and becomes the point of contact for interested clients. This setup can substantially reduce the uptime requirement of the original Hidden Service provider, thereby significantly decreasing the chance of deanonymization attacks against them. Using a vault node in place of the hidden service node does not cause any noticeable performance degradation when accessing the hosted content.
Cite as
Humza Ikram, Rumaisa Habib, Muaz Ali, and Zartash Afzal Uzmi. Don’t Get Caught, Keep Your Onions in a Vault. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 17:1-17:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{ikram_et_al:OASIcs.NINeS.2026.17,
author = {Ikram, Humza and Habib, Rumaisa and Ali, Muaz and Uzmi, Zartash Afzal},
title = {{Don’t Get Caught, Keep Your Onions in a Vault}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {17:1--17:24},
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.17},
URN = {urn:nbn:de:0030-drops-256027},
doi = {10.4230/OASIcs.NINeS.2026.17},
annote = {Keywords: Tor, anonymity, Hidden Services, Trusted Execution Environments}
}
Document
TURBO: Utility-Aware Bandwidth Allocation for Cloud-Augmented Autonomous Control
Abstract
Autonomous driving system progress has been driven by improvements in machine learning (ML) models, whose computational demands now exceed what edge devices alone can provide. The cloud offers abundant compute, but the network has long been treated as an unreliable bottleneck rather than a co-equal part of the autonomous vehicle control loop. We argue that this separation is no longer tenable: safety-critical autonomy requires co-design of control, models, and network resource allocation itself.
We introduce TURBO, a cloud-augmented control framework that addresses this challenge, formulating bandwidth allocation and control pipeline configuration across both the car and cloud as a joint optimization problem. TURBO maximizes benefit to the car while guaranteeing safety in the face of highly variable network conditions. We implement TURBO and evaluate it in both simulation and real-world deployment, showing it can improve average accuracy by up to 15.6%pt over existing on-vehicle-only pipelines. Our code is made available at www.github.com/NetSys/turbo.
Cite as
Peter Schafhalter, Alexander Krentsel, Hongbo Wei, Joseph E. Gonzalez, Sylvia Ratnasamy, Scott Shenker, and Ion Stoica. TURBO: Utility-Aware Bandwidth Allocation for Cloud-Augmented Autonomous Control. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 18:1-18:34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{schafhalter_et_al:OASIcs.NINeS.2026.18,
author = {Schafhalter, Peter and Krentsel, Alexander and Wei, Hongbo and Gonzalez, Joseph E. and Ratnasamy, Sylvia and Shenker, Scott and Stoica, Ion},
title = {{TURBO: Utility-Aware Bandwidth Allocation for Cloud-Augmented Autonomous Control}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {18:1--18:34},
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.18},
URN = {urn:nbn:de:0030-drops-256039},
doi = {10.4230/OASIcs.NINeS.2026.18},
annote = {Keywords: autonomous vehicles, bandwidth allocation, cloud computing, edge computing, machine learning}
}
Document
Simulate Before Sending: Rethinking Transport in Datacenter Networks
Abstract
Existing transport protocols in commodity datacenter networks struggle to provide low collective completion times (CCTs) to AI training collectives, as packet losses and retransmissions significantly degrade performance.
We propose dcSim, an efficient transport that achieves low CCTs and practically lossless performance with commodity switches. In dcSim, each packet first employs a small simulation probe to traverse the network and explore congestion along a candidate path. Only packets whose simulation probes succeed are then transmitted, expecting to succeed as well. Evaluations confirm that dcSim achieves faster CCTs than existing schemes, with small queues and virtually zero packet loss. Finally, dcSim also excels in adverse conditions, including oversubscribed topologies.
Cite as
Dan Straussman, Isaac Keslassy, Alexander Shpiner, and Liran Liss. Simulate Before Sending: Rethinking Transport in Datacenter Networks. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 19:1-19:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{straussman_et_al:OASIcs.NINeS.2026.19,
author = {Straussman, Dan and Keslassy, Isaac and Shpiner, Alexander and Liss, Liran},
title = {{Simulate Before Sending: Rethinking Transport in Datacenter Networks}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {19:1--19:22},
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.19},
URN = {urn:nbn:de:0030-drops-256044},
doi = {10.4230/OASIcs.NINeS.2026.19},
annote = {Keywords: Datacenter networks, transport protocols, AI training, lossless networks}
}
Document
OpenFLAME: A Federated Spatial Naming Infrastructure
Abstract
Spatial applications, i.e., applications that tie digital information with the physical world, have improved many of our daily activities, such as navigation and ride-sharing. This class of applications also holds significant promise of enabling new industries such as augmented reality and robotics. The development of these applications is enabled by a system that can resolve real-world locations to names, or a spatial naming system. Today, mapping platforms provided by organizations like Google and Apple serve as spatial naming systems. These maps are centralized and primarily cover outdoor spaces. We envision that future spatial applications, such as persistent world-scale augmented reality, would require detailed and precise spatial data across indoor and outdoor spaces. The scale of cartography efforts required to survey indoor spaces and their privacy needs inhibit existing centralized maps from incorporating such spaces into their platform.
In this paper, we present the design and implementation of OpenFLAME, a federated spatial naming system, or in other words, a federated mapping infrastructure. OpenFLAME enables independent parties to manage and serve their own maps of physical regions. This unlocks scalability of map management, isolation, and privacy of maps. The discovery system that identifies maps hosted at a given location is a primary component of OpenFLAME. We implement OpenFLAME on top of the existing Domain Name System (DNS), which enables us to leverage its existing infrastructure. We implement map services such as address-to-location mapping, routing, and localization on top of our federated mapping infrastructure.
Cite as
Sagar Bharadwaj, Ziyong Ma, Ivan Liang, Michael Farb, Anthony Rowe, and Srinivasan Seshan. OpenFLAME: A Federated Spatial Naming Infrastructure. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 20:1-20:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{bharadwaj_et_al:OASIcs.NINeS.2026.20,
author = {Bharadwaj, Sagar and Ma, Ziyong and Liang, Ivan and Farb, Michael and Rowe, Anthony and Seshan, Srinivasan},
title = {{OpenFLAME: A Federated Spatial Naming Infrastructure}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {20:1--20: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.20},
URN = {urn:nbn:de:0030-drops-256051},
doi = {10.4230/OASIcs.NINeS.2026.20},
annote = {Keywords: Geographic naming system, Augmented reality, Robotics}
}
Document
Accio: Rethinking OS-Architecture Co-Design for Next-Gen I/O
Abstract
In this paper, we propose a novel software/hardware design to improve I/O performance while maintaining existing POSIX-standard APIs. Our approach stands in contrast to existing kernel-bypass strategies that improve performance at the expense of abandoning familiar programming abstractions. Our key insight is that navigating the performance-functionality trade-off requires changes to the processor; it cannot be done without support of the CPU micro-architecture. Our design, called Accio, includes: dedicated hardware for interrupt management, a hardware assist for thread scheduling, tables in hardware that manage I/O state, and modifications to the operating system to support the new hardware. Our evaluation demonstrates that Accio saturates the bus bandwidth, reduces CPU usage by up to 66% compared to state-of-the-art kernel-bypass systems, and reduces latency to 1/12th of that of the Linux kernel, matching that of kernel-bypass systems.
Cite as
Amirmohammad Nazari, Rajit Manohar, and Robert Soulé. Accio: Rethinking OS-Architecture Co-Design for Next-Gen I/O. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 21:1-21:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{nazari_et_al:OASIcs.NINeS.2026.21,
author = {Nazari, Amirmohammad and Manohar, Rajit and Soul\'{e}, Robert},
title = {{Accio: Rethinking OS-Architecture Co-Design for Next-Gen I/O}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {21:1--21:24},
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.21},
URN = {urn:nbn:de:0030-drops-256063},
doi = {10.4230/OASIcs.NINeS.2026.21},
annote = {Keywords: Networks, Operating Systems, I/O Optimization}
}
Document
There Is More to Internet Invariants Than Meets the Eye
Abstract
A rich body of literature assembled over the last 30 years shows that traffic traversing wide-area Internet links is consistent with self-similar (temporal) scaling behavior and that sets of observed addresses have multifractal (spatial) scaling behavior. In view of this empirical evidence, these behaviors cannot be viewed as mere mathematical curiosities but should justifiably be called invariants of measured Internet traffic (Internet invariants, for short). At the same time, it is fair to say that the early architects of the Internet were largely unaware of these properties and certainly did not intend to design a network so that the traffic traversing its links would exhibit self-similar scaling in time or multifractal scaling in the IP address space.
In this paper, we resolve this apparent disconnect between architectural intentions and observed behaviors by applying a three-part framework that leverages, at its core, the perspective of Highly Optimized Tolerance (HOT). In particular, we take inspiration from studies on the origins of (temporal) self-similarity in measured Internet traffic but focus on a fundamentally new approach to understanding multifractal (spatial) scaling behavior. Specifically, we examine whether this invariant can be viewed as a visible hallmark of underlying but largely unknown robust design efforts, and explore a reverse-engineering approach to determine the concrete nature of the constrained optimization problems that these robust designs solve. Based on the insights gained from such reverse-engineering efforts, we speculate on the benefits of future efforts at forward-engineering - systematically leveraging the identified robust designs in order to provide scientifically sound intellectual foundations and practical principles for designing future networked systems.
Cite as
Chris Misa, Walter Willinger, Ramakrishnan Durairajan, and Reza Rejaie. There Is More to Internet Invariants Than Meets the Eye. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 22:1-22:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{misa_et_al:OASIcs.NINeS.2026.22,
author = {Misa, Chris and Willinger, Walter and Durairajan, Ramakrishnan and Rejaie, Reza},
title = {{There Is More to Internet Invariants Than Meets the Eye}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {22:1--22: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.22},
URN = {urn:nbn:de:0030-drops-256077},
doi = {10.4230/OASIcs.NINeS.2026.22},
annote = {Keywords: Internet traffic, self-similarity, multifractal scaling, reverse-engineering}
}
Document
Who Holds the Steering Wheel? Opacity and Consolidation in CDN Replica Selection
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
SwiftQueue: Optimizing Low-Latency Applications with Swift Packet Queuing
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
Five Blind Men and the Internet: Towards an Understanding of Internet Traffic
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
Running Distributed Systems like Clockwork
Abstract
Distributed Systems are commonly built using a set of standard assumptions: we assume that message delays are unbounded, that any packet can be lost in the network, and that clocks cannot be closely synchronized. On the one hand, these conservative assumptions result in robust systems that can operate reliably in a wide variety of conditions. On the other hand, they also force the system to do a lot of complex ad-hoc coordination and thus limit the performance it can achieve.
In this paper, we take a look at what lies beyond this standard model. We observe that, on modern hardware in a single-tenant data center, distributed systems are able to closely coordinate and essentially "run like clockwork" with very little effort. If we are willing to additionally rule out some worst-case failure scenarios, this results in a large performance improvement, both in practice and even in theory. We demonstrate this effect using state-machine replication (SMR) as a case study: our SMR protocol, Watchmaker, exceeds the throughput of state-of-the-art algorithms by two orders of magnitude, and it requires only half as many replicas to tolerate the same number of faults.
Cite as
Karan Newatia, Robert Gifford, Qingjie Lu, Andreas Haeberlen, and Linh Thi Xuan Phan. Running Distributed Systems like Clockwork. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 26:1-26:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{newatia_et_al:OASIcs.NINeS.2026.26,
author = {Newatia, Karan and Gifford, Robert and Lu, Qingjie and Haeberlen, Andreas and Phan, Linh Thi Xuan},
title = {{Running Distributed Systems like Clockwork}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {26:1--26:31},
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.26},
URN = {urn:nbn:de:0030-drops-256115},
doi = {10.4230/OASIcs.NINeS.2026.26},
annote = {Keywords: State-machine replication, distributed systems, data centers, clock synchronization, fault tolerance, synchrony}
}
Document
Making Congestion Control Algorithms Insensitive to Underlying Propagation Delays
Abstract
Underlying propagation delays, which significantly impact flow Round-Trip-Times (RTTs), fundamentally shape how congestion control algorithms (CCAs) allocate bandwidth among competing flows. Traditionally, lower RTTs were desirable, as a flow rate would decrease as RTT increased under conventional CCAs such as Reno and Cubic. More recently, algorithms like BBR reversed this behavior, favoring flows with larger RTTs. In modern heterogeneous networks, where competing flows may employ different CCAs and serve diverse application workloads, notions of fairness become ambiguous and RTT’s role further complexifies addressing an already very challenging problem. We offer a simple but initially counter-intuitive remedy to address how all CCAs can remove this inherent sensitivity to propagation delay: have all flows "emulate" the same underlying propagation delay. Unsurprisingly, this idea is often met with a lot of resistance, since it is in many ways counter to many fundamental tenets of networking and congestion control. In this paper, we try to make the case that while the idea is not a silver bullet on its own, it can greatly simplify design and predictability across existing and future congestion control protocols going forward.
Cite as
Cyrus Illick, Michael Roger, Vishal Misra, and Dan Rubenstein. Making Congestion Control Algorithms Insensitive to Underlying Propagation Delays. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 27:1-27:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{illick_et_al:OASIcs.NINeS.2026.27,
author = {Illick, Cyrus and Roger, Michael and Misra, Vishal and Rubenstein, Dan},
title = {{Making Congestion Control Algorithms Insensitive to Underlying Propagation Delays}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {27:1--27: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.27},
URN = {urn:nbn:de:0030-drops-256122},
doi = {10.4230/OASIcs.NINeS.2026.27},
annote = {Keywords: Congestion Control, Propagation Delay}
}
Document
CrowdLink: Unlocking Idle LEO Network Capacity with User Terminals
Abstract
The Low Earth Orbit (LEO) network is booming worldwide thanks to its unprecedented number of satellites. However, most of these satellites remain underutilized to connect more users or boost performance, posing tensions for their return on investment. A critical cause is that their gateways to the Internet (ground stations) are geographically skewed or even centralized, forming last-mile bottlenecks. We examine the potential of eliminating these bottlenecks with ubiquitous user terminals (UTs). Our solution, CrowdLink, reuses UTs as local access points to decentralize satellites' gateways to the Internet, and as relays to convert idle satellite radio links into additional paths for more network capacity. This user-centric paradigm is self-scaling to more UTs and satellites (akin to P2P networks), resilient to rapid satellite mobility, mutually beneficial for users and operators, and readily deployable in operational LEO networks. Our real tests with Starlink UTs across three countries and large-scale simulations show that CrowdLink can increase each UT’s throughput by 3.09× on average (up to 65.27×), double the LEO network capacity utilization, and unlock 2.05-7.99 million more users for Starlink without adding satellites/ground stations.
Cite as
Lixin Liu, Jinyao Zhang, Bijia You, Yimei Chen, Jiabo Yang, Yuanjie Li, Hewu Li, Qian Wu, Zeqi Lai, and Jun Liu. CrowdLink: Unlocking Idle LEO Network Capacity with User Terminals. In 1st New Ideas in Networked Systems (NINeS 2026). Open Access Series in Informatics (OASIcs), Volume 139, pp. 28:1-28:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
Copy BibTex To Clipboard
@InProceedings{liu_et_al:OASIcs.NINeS.2026.28,
author = {Liu, Lixin and Zhang, Jinyao and You, Bijia and Chen, Yimei and Yang, Jiabo and Li, Yuanjie and Li, Hewu and Wu, Qian and Lai, Zeqi and Liu, Jun},
title = {{CrowdLink: Unlocking Idle LEO Network Capacity with User Terminals}},
booktitle = {1st New Ideas in Networked Systems (NINeS 2026)},
pages = {28:1--28: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.28},
URN = {urn:nbn:de:0030-drops-256130},
doi = {10.4230/OASIcs.NINeS.2026.28},
annote = {Keywords: LEO Satellite Networks, User Terminal Relaying, Capacity Utilization}
}