Search arXivSearch

arXiv · 2609.08098

6SEVEN: System for EValuating IPv6 ENumeration algorithms

Abstract

The vast, sparsely populated, and often ephemeral IPv6 address space makes discovering active addresses challenging. In response, the community has developed over thirty different IPv6 Target Generation Algorithms (TGAs). TGAs learn addressing structure from seed (training) datasets, build a representative model, and generate candidate addresses. Unfortunately, the existing literature employs a wide variety of input seeds, data cleansing, and metrics of success that prevent ready comparison. Toward making TGA evaluation consistent, we present 6SEVEN, an extensible framework that hosts TGAs as plugins and links them to shared data cleaning, probing, dealiasing, and result tabulation components. We port as 6SEVEN plugins eight popular TGAs and demonstrate a controlled case study. Our results show that the performance of these TGAs varies substantially due to factors independent of the main algorithm---especially the seed set composition, dealiasing, and tabulation procedures. We observe tradeoffs between desirable features of TGA performance, including yield and exploration. We envision 6SEVEN as an enabling community resource to advance the science of current and future TGAs, and, by extension, IPv6 measurement.

Explore related subjects

Keep this discovery

BibTeXRIS

Chase Kanipe, Erik Rye, Dave Levin, Robert Beverly. 2026-09-08. 6SEVEN: System for EValuating IPv6 ENumeration algorithms. https://doi.org/10.1145/3777912.3839784

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

AEGIS: Risk-Budgeted Online Scheduling for Resilient Continuous Edge Inference

Continuous edge inference requires sustained wireless and computing support across successive service instances. Under recurring channel degradation, transient edge overload, and multi-user contention, isolated deadline misses may accumulate into persistent service degradation. Existing schedulers mainly optimize instantaneous latency or per-timeslot utility and provide limited control over such cross-time effects. To address this issue, we propose AEGIS (Adaptive Exposure-Governed Inference Scheduling), a risk-budgeted online framework for service-level operational resilience. AEGIS regulates predicted deadline-risk exposure through dynamically replenished per-user risk budgets and establishes an explicit finite-horizon bound on cumulative admitted-risk exposure. One-step state estimation supports anticipatory delay and risk assessment, while the centralized bandwidth--computing allocation is transformed into an exact-potential formulation and solved through asynchronous coordinate updates. Simulation results demonstrate that AEGIS enhances timely-service continuity, contains persistent deadline violations, and improves post-stress recovery through adaptive cross-time risk regulation. Meanwhile, it effectively controls predicted-risk exposure while preserving competitive service performance, achieving a favorable balance between service resilience and risk control.

cs.NI

Enhancing Network Resilience via Graph-Based Anomaly Detection in Sovereign Functions

Sovereign network functions, e.g., routing protocols, are becoming increasingly complex and susceptible to failures arising from protocol configuration anomalies and anomalous configurations. This paper interprets the protocol configuration anomaly detection problem as detection of structural inconsistencies of connected nodes and edges in a bipartite graph that captures both physical network entities and logical protocol states. This graph structural inconsistency detector (GSID) model is proposed to solve the problem efficiently. To handle the heterogeneous nature of protocol configuration parameters, GSID employs an adaptive configuration encoder (ACE) that dynamically selects encoding strategies per parameter to preserve fine-grained numerical discrepancies. To expose the subtle inconsistencies of connected nodes and edges in the bipartite graph, GSID uses an inconsistency dynamic attention (IDA) mechanism that scores edges by drawing asymmetric attentions from both ends, rule compliance from one end and route connectivity from the other. It is demonstrated experimentally that GSID outperforms state-of-the-art baselines by threefold in F1 score and by 23.2% in accuracy. Ablation studies validate the effectiveness of both the ACE and IDA modules. Tests on unseen network scales and real-world network topologies show the superior adaptability of our GSID, compared to the baselines.

cs.NI