| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Koch, Maynard | - |
| dc.contributor.author | Hiesgen, Raphael | - |
| dc.contributor.author | Nawrocki, Marcin | - |
| dc.contributor.author | Schmidt, Thomas C. | - |
| dc.contributor.author | Wählisch, Matthias | - |
| dc.date.accessioned | 2026-03-19T09:54:06Z | - |
| dc.date.available | 2026-03-19T09:54:06Z | - |
| dc.date.issued | 2025-11-25 | - |
| dc.identifier.issn | 2834-5509 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.12738/19098 | - |
| dc.description.abstract | Identifying active IPv6 addresses is challenging. Various methods emerged to master the measurement challenge in this huge address space, including hitlists, new probing techniques, and AI-generated target lists. In this short paper, we apply active Subnet-Router anycast (SRA) probing, a commonly unused method to explore the IPv6 address space. We compare our results with lists of active IPv6 nodes obtained from prior methods and with random probing. Our findings indicate that probing an SRA address reveals on average 10\%~more router IP addresses than random probing and is far less affected by ICMP rate limiting. Compared to targeting router addresses directly, SRA probing discovers 80\% more addresses. We conclude that SRA probing is an important addition to the IPv6 measurement toolbox and may improve the stability of results significantly. We also find evidence that some active scans can cause harmful conditions in current IPv6 deployments, which we started to fix in collaboration with network operators. | en |
| dc.language.iso | en | en_US |
| dc.publisher | Association for Computing Machinery | en_US |
| dc.relation.ispartof | Proceedings of the ACM on networking | en_US |
| dc.subject | IPv6 | en_US |
| dc.subject | Internet Measurement | en_US |
| dc.subject | Internet Scanning | en_US |
| dc.subject.ddc | 004: Informatik | en_US |
| dc.title | Scanning the IPv6 internet using subnet-router anycast probing | en |
| dc.type | Article | en_US |
| dc.relation.conference | International Conference on emerging Networking EXperiments and Technologies 2025 | en_US |
| dc.description.version | PeerReviewed | en_US |
| local.contributorPerson.editor | Mellia, Marco | - |
| tuhh.container.endpage | 50:15 | en_US |
| tuhh.container.issue | CoNEXT4 | en_US |
| tuhh.container.startpage | 50:1 | en_US |
| tuhh.container.volume | 3 | en_US |
| tuhh.oai.show | true | en_US |
| tuhh.publication.institute | Fakultät Informatik und Digitale Gesellschaft | en_US |
| tuhh.publisher.doi | 10.1145/3768997 | - |
| tuhh.type.opus | (wissenschaftlicher) Artikel | - |
| dc.rights.cc | https://creativecommons.org/licenses/by/4.0/ | en_US |
| dc.type.casrai | Journal Article | - |
| dc.type.dini | article | - |
| dc.type.driver | article | - |
| dc.type.status | info:eu-repo/semantics/publishedVersion | en_US |
| dcterms.DCMIType | Text | - |
| item.creatorOrcid | Koch, Maynard | - |
| item.creatorOrcid | Hiesgen, Raphael | - |
| item.creatorOrcid | Nawrocki, Marcin | - |
| item.creatorOrcid | Schmidt, Thomas C. | - |
| item.creatorOrcid | Wählisch, Matthias | - |
| item.grantfulltext | none | - |
| item.creatorGND | Koch, Maynard | - |
| item.creatorGND | Hiesgen, Raphael | - |
| item.creatorGND | Nawrocki, Marcin | - |
| item.creatorGND | Schmidt, Thomas C. | - |
| item.creatorGND | Wählisch, Matthias | - |
| item.openairetype | Article | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
| item.languageiso639-1 | en | - |
| item.fulltext | No Fulltext | - |
| item.cerifentitytype | Publications | - |
| crisitem.author.dept | Department Informatik (ehemalig, aufgelöst 10.2025) | - |
| crisitem.author.dept | Department Informatik (ehemalig, aufgelöst 10.2025) | - |
| crisitem.author.orcid | 0000-0002-0956-7885 | - |
| crisitem.author.parentorg | Fakultät Technik und Informatik (ehemalig, aufgelöst 10.2025) | - |
| crisitem.author.parentorg | Fakultät Technik und Informatik (ehemalig, aufgelöst 10.2025) | - |
| Appears in Collections: | Publications without full text | |
Add Files to Item
Note about this record
Export
This item is licensed under a Creative Commons License