Fair switch selection for large scale software defined networks in next generation internet of things

Mohammad Shahzad (), Lu Liu (), Ajay Kaushik (), Irum Bibi (), Nacer Edine Belkout () and Mahmood ul Hasan ()
Additional contact information
Mohammad Shahzad: Warwickshire College and University Centre
Lu Liu: University of Exeter
Ajay Kaushik: University of Derby
Nacer Edine Belkout: University of Science and Technology Houari Boumediene
Mahmood ul Hasan: Project National Industrial training Institute, TUV Rheinland Arabia

Telecommunication Systems: Modelling, Analysis, Design and Management, 2025, vol. 88, issue 2, No 17, 14 pages

Abstract: Abstract Software Defined Networking has been pivotal in enabling on-demand resource utilization and is poised to have an incredible impact on the next phase of the Internet of Things. Its ability to furnish a versatile and expandable network framework is instrumental in accommodating the overwhelming surge of IoT devices and applications. The combination of static mapping and the dynamic flow of traffic over time and space creates an uneven distribution of loads across SDN controllers. Dynamic migration is a solution aimed at rectifying this imbalance by redistributing the load between SDN controllers. Communication for control between switches and controllers becomes burdensome when the matching rules are absent from the table. Our prior research has addressed this issue by employing burst aggregation focused on consolidating similar destinations to reduce the control overhead. In this study, our focus is on ensuring fairness during migration and selecting the appropriate switch. We model a fair switch selection (FSS) algorithm tailored for large-scale software-defined networks. Unlike traditional methods using packets as a basis, FSS utilizes bursts as its input. This model prioritizes bursts considering both their distance and destination, ensuring that switches select bursts with the highest priority to maintain quality of service. Our research delves into evaluating the performance of the proposed algorithm in comparison to four baseline algorithms: round robin, exhaustive search, multi-protocol TCP (MPTCP), and random search. Through extensive simulations, we analyze experimental results based on cost, performance, packet loss, average throughput, and execution time. Experimental results demonstrated a reduction in packet loss by 30% with an average 25% throughput improvement.

Keywords: Internet of Things; Migration; Scheduling; Software defined networking (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11235-025-01290-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:telsys:v:88:y:2025:i:2:d:10.1007_s11235-025-01290-2

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11235

DOI: 10.1007/s11235-025-01290-2

Access Statistics for this article

Telecommunication Systems: Modelling, Analysis, Design and Management is currently edited by Muhammad Khan

More articles in Telecommunication Systems: Modelling, Analysis, Design and Management from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().