Oct 2026· ACM SIGCOMM Computer Communication Review· Vol 56, pp. 26 - 31· 0 citations· 10 references
TL;DR
The SRM experience suggests a broader architectural lesson: scalable multiparty communication benefits from aligning network delivery mechanisms with the data-centric semantics of applications—a principle that becomes increasingly important as collaborative systems, content platforms, and large-scale multiparty applications proliferate.
Abstract
The 1995 SIGCOMM paper "A Reliable Multicast Framework for Light-weight Sessions and Application-Level Framing" (SRM) introduced a receiver-driven, data-centric approach to reliable multiparty communication, in which receivers recover losses by explicitly requesting missing data. Three decades later, we revisit SRM as a case study in data-centric networking design. Although SRM achieved scalability in controlled environments, experience with IP multicast exposed persistent inefficiencies rooted in an architectural mismatch: applications identify and request data, while the network layer forwards packets by address and is oblivious to data identity. We argue that this mismatch, rather than particular protocol mechanisms, prevents recovery from being localized to where data is needed and available. Using Named Data Networking (NDN) as a contrasting design point, we show how making data identifiers visible to the network enables localized retrieval and recovery. The SRM experience suggests a broader architectural lesson: scalable multiparty communication benefits from aligning network delivery mechanisms with the data-centric semantics of applications—a principle that becomes increasingly important as collaborative systems, content platforms, and large-scale multiparty applications proliferate.
Graft-and-Prune is proposed, a lightweight, anchor-less, and fully NDN-compliant consumer mobility management mechanism that addresses this issue by purging the stale paths from the network by reversing the order of path establishment and stale-path removal relative to Prune-and-Graft (P&G).
This work proposes a deployment strategy that reduces the need to upgrade expensive core routers by using existing networking mechanisms such as BGP communities, SRv6, and priority queues with rate caps, and demonstrates the feasibility of this approach through large scale experiments on the FABRIC testbed.
Harkirat Singh, Fatih Berkay Sarpkaya, Hakan Gulec et al.· 0 citations
The rapid growth of the Internet has exhausted the address space of Internet Protocol version 4 (IPv4), whose 32-bit scheme supports only about 4.3 billion unique addresses. Techniques such as Network Address Translation (NAT) and Classless Inter-Domain Routing (CIDR) have extended its life, but they add complexity, br...
Ajay Kumar· Proceedings of International...· 0 citations
Federated LLM fine-tuning enables large models to be adapted using private and geographically distributed data at the network edge, creating recurring and deadline-sensitive communication workloads across access and transport networks. This challenge is particularly relevant in mobile RANs, where wireless variability,...
E. Paolini, Andrea Pinto, Flavio Esposito et al.· 0 citations
A totally distributed dynamic replication scheme, which uses a (cid:12)nite automaton based technique to learn access patterns and dynamically reorder copies of data in the network, in anticipation of predicted accesses, to reduce network message costs.
S. Acharya, S. Zdonik· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.