This thesis provides an end-to-end mathematical and machine learning framework for designing dependable, low-latency, and scalable SDN infrastructures.
Abstract
Modern network infrastructures are undergoing a major transformation driven by Software Defined Networking (SDN). However, migration from legacy hardware to fully programmable architectures is typically incremental, resulting in hybrid environments where legacy routing protocols and centralized SDN controllers coexist. Managing these heterogeneous networks requires coordinated optimization across the physical infrastructure, control plane, and data plane. This thesis presents a multi-layer optimization framework for planning, deploying, and operating homogeneous and hybrid SDN environments. At the infrastructure layer, the Controller Placement Problem (CPP) is formulated as a multi-objective Integer Linear Programming (ILP) model and solved using exact ILP solvers and a localized Tabu Search approach. The framework determines controller placement and quantity to maximize network centrality and throughput while minimizing deployment cost and propagation delay. The ILP model reduces propagation delay by 16.4\% and 24.1\%, while the localized Tabu Search further improves transmitted data by 15.6\% and 26.2\% for the selected topology. At the control-plane layer, the thesis addresses protocol heterogeneity and route redistribution across administrative boundaries. Five routing protocols---BGP, EIGRP, IS-IS, OSPF, and RIP---are evaluated in terms of round-trip time (RTT), convergence delay, and a redistribution feasibility index(capturing topology compatibility, load sensitivity, and link stability). The optimization results show that while EIGRP provides strong proprietary performance, IS-IS emerges as the most resilient open-standard protocol for hybrid control planes. At the data-plane layer, the thesis develops two port-state-aware Fast Reroute (FRR) mechanisms for unpredictable link failures: PSA-FRR, a proactive rule-based approach for homogeneous networks, and PSAR-FRR, an automated deep neural network approach for hybrid environments. The neural model maps real-time interface status (port status) directly to backup egress paths using a formulated traffic engineering dataset. Experiments on the Abilene topology using Mininet, Ryu, OpenDaylight, and GNS3 show that both approaches restore traffic within 30--100~ms. PSAR-FRR achieves a data-plane switching latency of 0.123~ms, more than 70\% lower than PSA-FRR lookup latency and faster than the other evaluated machine learning methods. Overall, this thesis provides an end-to-end mathematical and machine learning framework for designing dependable, low-latency, and scalable SDN infrastructures.
This paper incorporates the flexible optical-layer resource scheduling capability of software-defined optical networks (SDONs) and proposes an SDON-enabled CPPS model along with a control network optimization method, and proposes a multidimensional vulnerability assessment method for CPPSs.
The rapid evolution of beyond-5G and emerging 6G networks is driving the need for flexible, reliable, and cost-efficient virtualized Radio Access Network (vRAN) architectures capable of supporting heterogeneous services such as enhanced Mobile Broadband (eMBB), Ultra-Reliable Low-Latency Communication (URLLC), and Massive Machine-Type Communication (mMTC). Future disaggregated RAN systems are expected to rely heavily on network slicing, functional split flexibility, and optical x-haul infrastructures to support stringent performance, scalability, and availability requirements. In this paper, we present an integrated framework for reliable, slice-aware, and functional split-aware Virtual Network Function (VNF) placement with lightpath provisioning in disaggregated vRAN environments. The proposed approach maximizes mobile network operators'profit by jointly optimizing function placement and optical resource allocation under latency, processing, bandwidth, and availability constraints. We formulate the problem as an Integer Linear Programming (ILP) model with two variants: one that employs unshared backups and another that uses a more cost-efficient shared backup scheme. To address ILP complexity, we develop a heuristic algorithm and a Genetic Algorithm (GA)-based metaheuristic that yields near-optimal solutions in real time. Extensive evaluations on topologies up to 128 nodes show that shared backup variants yield up to 18% higher profit, while maintaining up to 5-10% lower normalized CPU usage than unshared counterparts.
Mayank Ramnani, S. Dixit, Sushil Yadav et al.· arXiv.org· 0 citations
A constrained optimization model that supports different management goals through alternative objective functions (latency-aware or power-aware) while enforcing operational constraints, including node capacities, slice-specific latency bounds, and explicit limits on VNF migrations/relocations between scheduling periods is proposed.
R. Moreno-Vozmediano, E. Huedo, R. Montero et al.· Journal of Network and Syste...· 0 citations
Findings affirm that the suggested scalable control plane is practical in supporting large scale SDN implementation and is therefore applicable in future carrier grade, data center and wide area network deployments at realistic workloads with varying topological setups in the modern programmable networks in the world.
A. Nagadeepan, Vishakha Abhay Gaidhani, Bhambare Rajesh et al.· Journal of Intelligent Decis...· 0 citations
A two-stage framework that combines graph-theoretic optimization with empirical device-level measurements to inform sustainable campus network design is developed and indicates that device-specific characteristics play a crucial role in determining actual energy efficiency.
Irmak Uzun Bayar, Ceyda Ceylan· Ankara Hacı Bayram Veli Üniv...· 0 citations
Software-defined satellite networks (SDSNs) enhance resource utilization and flexibility in space-based networks by leveraging a global view and programmability. A highly reliable control plane is essential to sustain network operations. However, the highly dynamic topology and physical failures in Low Earth Orbit (LEO) environments can cause satellite node outages or inter-satellite link disruptions, leading to control plane interruptions and local load imbalances. To address this, we propose a switch migration mechanism for failure recovery and establish a multi-objective migration model that jointly optimizes control link delay, controller load variance, and normalized migration ratio. To accommodate distinct dynamic characteristics such as frequent topology changes, failure-intensive periods, and stable periods, we design two algorithms: a robust migration algorithm, DNSGA-II, which features population diversity maintenance and environmental awareness, and an efficient migration algorithm, IHAOAVOA, which integrates strong global exploration with powerful local exploitation. Simulation results show that IHAOAVOA rapidly converges under large-scale failures, achieving millisecond-level delay recovery and low normalized migration ratio overhead during failure-intensive periods, while DNSGA-II focuses on long-term load balancing and system stability during stable periods, effectively suppressing localized controller overload. By adopting IHAOAVOA during topology fluctuations or high-failure phases to reduce delay, and switching to DNSGA-II during stable phases to optimize load distribution, the overall network robustness can be improved under the evaluated failure scenarios. This work provides effective support for achieving highly reliable control in SDSNs under failure scenarios.
Shuang Xu, Zhen-Yu Yin, Min Huang et al.· Italian National Conference...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.