Jul 2026· International Conference on Ubiquitous and Future Networks· pp. 477-482· 0 citations· 5 references
Abstract
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 traffic engineering mechanisms. Within MPLS, the Label Distribution Protocol (LDP) is typically used for label distribution, relying on routing information from the Interior Gateway Protocol (IGP). When a link or node failure occurs, LDP is forced to wait for the IGP to re-calculate and update the new paths before it can assign labels for Forwarding Equivalence Classes (FECs). This dependency significantly increases service disruption time due to the combined IGP convergence time and the subsequent label replacement mechanism (withdrawing old labels and installing new ones). Therefore, this paper proposes a novel scheme to mitigate LDP’s dependence on the IGP, thereby minimizing network restoration time during network topology changes. The method utilizes an event-driven signaling mechanism to instantly announce link and node outages across the network. Furthermore, it establishes and installs both primary and backup Label Switched Paths (LSPs) during the initial setup phase of the router. Experimental results demonstrate that the proposed method significantly outperforms LDP, achieving a convergence time up to four times faster in large-scale network scenarios and proving superior scalability.
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.
As Data Center Networks (DCNs) continue to scale, the limitations of traditional centralized Software-Defined Networking (SDN) architectures become increasingly apparent, as they fail to meet the stringent demands for low latency and quality of service (QoS). In this paper, we propose an adaptive traffic-aware load balancing mechanism (ATL), a telemetrydriven in-switch scheme implemented on the programmable data plane (PDP) using P4 and driven by In-band Network Telemetry (INT). The current traffic regime is inferred by analyzing the remaining capacity (RC) of each link and its short-term variation (VAR), and adopts a dual-optimization strategy: (i) separating elephant flows (large flows) and mice flows (small flows) onto disjoint path sets to mitigate head-of-line blocking and packet reordering; (ii) dynamically adjusting the flowlet threshold $\left(F^{*}\right)$ to strike a balance between maximizing parallelism and ensuring in-order delivery. We prototyped and evaluated ATL in a Mininet/BMv2 environment, targeting bandwidth-constrained scenarios representative of IoT and edge deployments. The results show that, compared to existing methods such as ECMP, HULA, AWCMP, and APS, ATL consistently reduces both the average and 99th-percentile AFCT while achieving superior elephant-flow throughput, with notable improvements in traffic stability and packet-ordering preservation. Furthermore, ATL demonstrates a favorable cost-performance trade-off ratio of 1:0.99, confirming its efficiency and feasibility within the resource-constrained P4 switch environment.
Software-defined wireless sensor networks (SDWSNs) improve network programmability and centralized control, but maintaining connectivity under node and link failures remains difficult because of node mobility, limited energy, and dynamic topology changes. This study proposes IPL, an Intelligent, Predefined, and Lightweight recovery framework for topology-aware SDWSNs. The framework integrates three coordinated mechanisms: predictive link-lifetime estimation using energy and mobility parameters, energy-aware target positioning through a weighted midpoint strategy, and ring-based coordination among mobile IPL relay nodes for deterministic and low-overhead recovery. IPL is designed to handle both isolated and multiple concurrent failures while reducing controller burden and avoiding expensive global recomputation. The method was evaluated in a Mininet/Floodlight-based SDWSN environment with 150 nodes under identical settings against four benchmark schemes: IFT, Fed-TSN, P4Neighbor, and LCD. Across varying failure conditions, IPL consistently achieved faster recovery and better communication reliability. Relative to the baselines, the proposed method reduced recovery time by up to 26%, lowered latency by up to 27%, decreased energy consumption by up to 18%, improved packet delivery ratio by up to 19%, increased recovery success rate by up to 17%, and extended network lifetime by up to 19%. These gains arise from proactive link monitoring, rapid relay repositioning, and structured recovery coordination. Overall, IPL offers an efficient and scalable recovery solution for dynamic SDWSNs, particularly in environments with moderate failure rates, while highlighting opportunities for future enhancement through adaptive relay allocation and improved mobility-aware prediction.
S. S, P. J, S. G et al.· International Research Journ...· 0 citations
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.
Anthony Doeraene, Olivier Bonaventure· Applied Networking Research...· 0 citations
Many resource-constrained, wide-area telecommunications deployments could benefit from an in-band SDN control plane, but several challenges stand in the way. This paper presents 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. The first three are developed in detail, while multi-controller coordination is addressed in a separate paper. For bootstrap, Periplus avoids network-wide flooding: when a new switch joins, the controller installs flow rules in only two switches. For routing and failure recovery, Periplus encodes a primary path and per-hop alternatives in a graph structure encapsulated between L2 and L3 headers; switches forward along the primary path and, upon detecting a failure, fall over locally to the encoded alternative without controller involvement. We evaluate a Ryu-based implementation of Periplus in Mininet across multiple topologies. Periplus runs on stock Open vSwitch (OVS), relying only on its built-in Nicira extensions for Network Service Header (NSH) encapsulation. The evaluation shows sub-50 ms failure recovery, scalable bootstrap across topologies of varying size and diameter, and a per-switch flow-table footprint that is independent of network size and grows only at switches where the controller encodes multiple alternatives.
E. M. C. Barbero, P. Quirós, F. J. S. Reigadas· 1 citation
Modern CDN vendors typically provide multi-server services for content deliveries, in which different requests from the same client are often scheduled to diverse CDN nodes. In this case, the requested data (e.g., short video chunks) always suffer from cold start during its transmission, especially for the first flow of established connections, due to the unknown client-side network quality. Existing schemes focus on single-server startup parameter optimization, whose referred metrics appear to be extremely limited. To address this issue, we propose hStart, a novel collective service paradigm that enables hot-start congestion control by efficient collaboration between CDN nodes. hStart synchronizes probed network quality information (e.g., bandwidth, latency) across CDN nodes to initialize congestion control from historical data, avoiding probing convergence. It uses hierarchical state synchronization to limit overhead, and adaptive prediction with a time-decay trust model to handle dynamics. We implement and deploy the hStart system for the QUIC protocol. Extensive evaluations in both controlled testbeds and large-scale production CDN environments demonstrate that hStart effectively eliminates cold start penalties, boosting 46.47% throughput gain and 21.43% rebuffering reduction.
Tong Li, Jiuxiang Zhu, Bo Wu et al.· Asia-Pacific Workshop on Net...· 0 citations