Skip to content
Preprint

SRAN: Scaling NDN Routing via Map-and-Attach

Jul 2026 · 2 citations · ⚡ 1 influential · 39 references
Computer Science

TL;DR

SRAN is presented, an intra-domain NDN routing architecture that applies the routing-scalability principle underlying Map-and-Encap through Map-and-Attach, which enables network routing and forwarding to operate on topological identifiers while keeping NDN Interests intact and preserving native NDN communication semantics.

Abstract

Network routing scalability becomes difficult when forwarding state scales with an external identifier space rather than network topology. Named Data Networking (NDN) faces this challenge acutely because routing directly on application name prefixes ties forwarding state to an unbounded namespace. This paper presents SRAN, an intra-domain NDN routing architecture that applies the routing-scalability principle underlying Map-and-Encap through Map-and-Attach: application prefixes are mapped to egress routers, and the resulting mapping information is attached to the original Interest. This enables network routing and forwarding to operate on topological identifiers while keeping NDN Interests intact and preserving native NDN communication semantics, including Interest/Data exchange, in-network caching, and data-centric security. SRAN further uses the same prefix-to-egress mapping to realize Bit Index Explicit Replication (BIER) for scalable NDN Interest multicast. SRAN leverages existing NDN mechanisms to securely maintain prefix-to-router mappings among user-facing routers without introducing new protocols. Evaluation on Rocketfuel topologies shows that routers'forwarding state scales with network topology rather than application-prefix count, while prefix updates are disseminated in real time with low communication overhead.

View source

Similar papers

Book Open access Sep 2026

Bypass-Enabled Topology-Agnostic Multicast Router for Fault-Tolerant Network-on-Chips

BEAM is introduced, which integrates three key components: a sequential topology embedding algorithm that employs a heuristic search with Warnsdorff’s rule to construct a near-Hamiltonian path, abstracting any arbitrary physical network into a unified logical sequence, enabling concurrent packet forwarding to improve t...

Juntae Jung, Tae Hee Han · 0 citations
Open access Sep 2026

Trust-Weighted Proactive Caching (TWPC): A Unified Security-Caching Protocol for Named Data Networking

In-network caching allows Named Data Networking (NDN) to inherently lower latency and bandwidth consumption, but it also creates prime vectors for security vulnerabilities like Cache Pollution Attacks (CPA) and Side-Channel Timing Attacks (SCTA). Conventional defenses typically treat security and content routing as iso...

Khelifa Kezrane, Kaddour Messaoudi, N. Lagraa · 0 citations
Open access Aug 2026

ADAPTIVE PATH ROUTING USING THE RYU CONTROLLER TO ENHANCE QUALITY OF SERVICE IN SOFTWARE-DEFINED NETWORKS

Software-Defined Networking (SDN) separates the forwarding layer from a programmable control layer, enabling traffic management from a single logical control point. However, when the controller forwards along purely topological shortest paths, it cannot exploit the path diversity of multi-rooted data-centre fabrics, so...

A. Wiranata, Intan Murniasih, Soleman Soleman · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.