Jul 2026· Applied Networking Research Workshop· 0 citations· 33 references
Computer Science
TL;DR
This paper surveys multicast forwarding-state capacity across ISP core routers and enterprise routers, and proposes a capacity-aware path-selection algorithm for PIM-SSM based on Shortest Widest Path (SWP), allowing to load-balance multicast joins over paths with remaining multicast hardware entries.
Abstract
IP multicast was designed in an era of software-based routers, when forwarding state lived in expandable RAM. Today, multicast relies on hardware for efficient replication of packets across interfaces, which has hard, fixed limits on the number of multicast forwarding entries it may hold. We argue that the limited available multicast state calls for a redefinition of the multicast protocol stack. In this paper, we survey multicast forwarding-state capacity across ISP core routers and enterprise routers to highlight their hardware limits. We then propose to extend existing routing protocols (OSPF and IS-IS) to expose the hardware replication capacities of nodes to the control plane. Building on these exposed capacities, we propose a capacity-aware path-selection algorithm for PIM-SSM based on Shortest Widest Path (SWP), allowing to load-balance multicast joins over paths with remaining multicast hardware entries. Our results show that, by exposing multicast capacities, we can not only improve the join acceptance rate by up to 22%, but our solution also allows to reach a two times higher join rate without rejecting any join. By increasing the join acceptance rate, more concurrent multicast flows can coexist in networks.
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 semant...
Multiprotocol Label Switching (MPLS) plays a critical role in the backbone networks of Internet Service Providers (ISPs), ensuring robust and scalable network operation. By employing label-based switching instead of destination-based IP forwarding, MPLS significantly reduces forwarding complexity and supports advanced...
Trung Van Vu, La Van Thien, Quyet Hoang Dinh et al.· International Conference on...· 0 citations
Ensuring security without compromising low-latency determinism is critical for modern time-sensitive (TS) applications. However, existing authentication mechanisms like Timed Efficient Stream Loss-Tolerant Authentication (TESLA) suitable for local-area real-time networks lack scalability for wide-area environments. We...
Wei-Peng Tan, Bin-Wei Wu, Shuo Wang et al.· International Conference on...· 0 citations
Collective communications (CC) and distributed artificial intelligence (AI) training workloads involve substantial one-to-many chunked data transfers. Enabling optical multicast in next-generation optical circuit switching (OCS)-based data centers could streamline such traffic and improve CC efficiency. This paper pres...
Lihua Ruan, Linbojie Huang, Longquan Dai et al.· International Conference on...· 0 citations
Periplus, an in-band SDN control plane designed to address four challenges that this approach presents in such contexts: automatic bootstrapping, source-based routing, fast failure recovery, and multi-controller coordination is presented.
E. M. Castro Barbero, P. de las Heras Quirós, F. J. Simó Reigadas· arXiv.org· 1 citation· ⚡1
This paper presents detailed algorithm for calculating L-LSR coefficient, and shows that L-LSR algorithm not only performs better than OSPF, but also has verySignificant performance improvement over the other LSR family of algorithms.
A. Tiwari, Anirudha Sahoo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.