Enhancing quality of service in SDNs through Pareto-optimized controller placement using NS-MF algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Jalili Ahmad

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF NONLINEAR ANALYSIS AND APPLICATIONS Year:2025 | Volume:16 | Issue:9 Page(s): 157-167

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Enhancing quality of service in SDNs through Pareto-optimized controller placement using NS-MF algorithm

Author(s)

Jalili Ahmad | Issue Writer Certificate

Keywords

Facility Location Problem (FLP)

Multi-Objective Combinatorial Optimization (MOCO)

Software Defined Networking (SDN)

Controller Placement Problem (CPP)

Non-dominated Sorting Moth Flame algorithm (NS-MF)

Heuristic Algorithms

Abstract

Software-defined networks (SDN) have emerged as a new paradigm to overcome rigidity in traditional networks. SDN controllers manage network switches through a centralized control plane. Strategically placing controllers is vital for meeting performance needs. We model the NP-hard controller placement problem (CPP) as multi-objective optimization reconciling switch-controller latency, resilience to failures, inter-controller coordination overhead and load balancing. A customized Non-dominated Sorting Moth Flame algorithm (NS-MF) with novel recombination and perturbation techniques is proposed to effectively approximate the Pareto-optimal set of placements on large problem instances. NS-MF is benchmarked on a diverse corpus of 41 topologies against the exhaustive POCO solver, assessing computational time and solution quality tradeoffs. Compared to POCO, the proposed algorithm attains over 20X speedup for the largest graphs with an average optimality gap within 0.8%. The proposed NS-MF demonstrates superior performance over state-of-the-art metaheuristics (NSGA-II and PSA) in reconciling proximity and diversity objectives when estimating Pareto-optimal fronts. Experimental results substantiate NS-MF's efficacy in effectively navigating objectives pertinent to resilient SDN design.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans