Abstract

The Integrated Satellite-Terrestrial Networks (ISTNs) with Software-Defined Networking (SDN) incorporated have become the emerging architecture and have attracted considerable attention recently. Therein, the joint gateway and controller placement problem is of fundamental significance for designing ISTNs with flexible and efficient management capabilities. Hence, how to achieve network reliability maximization with low network latency in the joint placement problem is worthy of in-depth study. In this paper, a network partition algorithm, Simulated Annealing Partition-based K-means (SAPKM), is proposed and analyzed for further ameliorating the problem. Experiments are performed on real network topologies to validate the effectiveness of our approach for the joint placement problem. Compared with the state-of-the-art existing works, numerical results show that SAPKM outperforms when deploying four or more controllers in terms of network reliability performance, network latency, and inter-plane latency with less than 2 ms to converge.

Highlights

  • Many of the latest technical reports published by 3GPP have shown the significance of incorporating satellite networks into 5G scenarios [1,2]

  • We introduced the transmission process of the considered integrated satellite-terrestrial networks (ISTNs); here we focus on the leading culprits in transmission latency and network reliability

  • We investigated the joint gateway and controller placement problem in Software-Defined Networking (SDN)-enabled

Read more

Summary

Introduction

Many of the latest technical reports published by 3GPP have shown the significance of incorporating satellite networks into 5G scenarios [1,2]. By incorporating the partition-based K-means algorithm [23], the average latency between the centroid and other nodes in each sub-domain can be promptly shortened Both the performance and running time are notably optimized compared with previous joint placement algorithms [24]. A Simulated Annealing Partition-based K-Means (SAPKM) algorithm is proposed to ameliorate the joint placement problem in the SDN-enabled ISTNs. By adopting SAPKM, performance indicators can be accomplished in the sub-domains instead of the whole network, which dramatically reduces the complexity of the joint placement problem. Compared with the existing algorithms, simulation results indicate the merits of the proposed algorithm in shortening network latency, enhancing network reliability with much lower complexity, especially for adapting to large topologies with multiple gateways and controllers to deploy.

Related Works
System Model
An Architecture for SDN-Enabled Integrated Satellite-Terrestrial Networks
Preliminary Assumptions
Joint Placement Metrics
Problem Formulation
Network Partition Algorithm for the Joint Placement Problem
Simulated Annealing Partition-Based K-Means Algorithm
Analysis of the Complexity and Effectiveness of SAPKM
Simulation Results
Network Latency Minimization
Reliability Maximization with Latency Constraints
C Gea is hi n na t ne t e
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call