Ilora Maity
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ilora Maity has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Sudip Misra
Indian Institute of Technology Kharagpur, India
12 shared publications - Symeon Chatzinotas
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg City 1855, Luxembourg
10 shared publications - Chittaranjan Mandal
Department of Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, India
6 shared publications Christos Politis
SES S.A., Chateau de Betzdorf, Betzdorf, Luxemburg
5 shared publicationsSymeon Chatzinotas
University of Luxembourg,Interdisciplinary Centre for Security, Reliability and Trust (SnT),Luxembourg
5 shared publications- Ayan Mondal
Department of Computer Science and Engineering, Indian Institute of Technology Indore, Indore, India
4 shared publications
Latest Publications
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 4355-4368
VNF Mapping and Selective Handover for eMBB and mMTC Services in a LEO Satellite Network
The integrated satellite-terrestrial networks (STNs) aim to provide global connectivity and support heterogeneous services, including enhanced mobile broadband (eMBB) and massive machine-type communication (mMTC). Each service request requires a series of virtual network functions (VNFs) to be deployed consecutively. The VNFs are mapped on nodes that constitute a path where a request is mapped. Provisioning multiple slices through satellite networks is challenging due to limited storage and computation resources. In addition, there are dynamic changes in the satellite positions that cause frequent variations in the topology. For requests lasting more than one time frame, a handover can be performed at the beginning of the next time frame. Handover implies overall reconfiguration, which induces significant computation costs in satellite networks. Therefore, in this article, we propose a path and VNF mapping strategy with selective handover while considering dynamic changes in the satellite topology and the limitation of available resources. We formulate a mathematical model based on Binary Integer Linear Programming (BILP), aiming to maximize the served requests. To reduce the time complexity of the model, we solve it using an iterative algorithm based on successive convex approximation (SCA). We refine the solution of the SCA after binary recovery using VNF and path mapping algorithm. For the mapped multi-frame requests in the current time frame, the resources are reserved in the nodes and links for the next time frame if the current routing path is available for the remaining duration of the request. The simulation results certify the performance of the proposed technique with a significant improvement in the served request percentage compared to previous works in the literature, while also reducing the number of handovers.
- 28 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 4355-4368
VNF Mapping and Selective Handover for eMBB and mMTC Services in a LEO Satellite Network
The integrated satellite-terrestrial networks (STNs) aim to provide global connectivity and support heterogeneous services, including enhanced mobile broadband (eMBB) and massive machine-type communication (mMTC). Each service request requires a series of virtual network functions (VNFs) to be deployed consecutively. The VNFs are mapped on nodes that constitute a path where a request is mapped. Provisioning multiple slices through satellite networks is challenging due to limited storage and computation resources. In addition, there are dynamic changes in the satellite positions that cause frequent variations in the topology. For requests lasting more than one time frame, a handover can be performed at the beginning of the next time frame. Handover implies overall reconfiguration, which induces significant computation costs in satellite networks. Therefore, in this article, we propose a path and VNF mapping strategy with selective handover while considering dynamic changes in the satellite topology and the limitation of available resources. We formulate a mathematical model based on Binary Integer Linear Programming (BILP), aiming to maximize the served requests. To reduce the time complexity of the model, we solve it using an iterative algorithm based on successive convex approximation (SCA). We refine the solution of the SCA after binary recovery using VNF and path mapping algorithm. For the mapped multi-frame requests in the current time frame, the resources are reserved in the nodes and links for the next time frame if the current routing path is available for the remaining duration of the request. The simulation results certify the performance of the proposed technique with a significant improvement in the served request percentage compared to previous works in the literature, while also reducing the number of handovers.
- Open Access
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 1128-1144
Revenue-Aware Seamless Content Distribution in Satellite-Terrestrial Integrated Networks
With the surging demand for data-intensive applications, ensuring seamless content delivery in Satellite-Terrestrial Integrated Networks (STINs) is crucial, especially for remote users. Dynamic Ad Insertion (DAI) enhances monetization and user experience, while Mobile Edge Computing (MEC) in STINs enables distributed content caching and ad insertion. However, satellite mobility and time-varying topologies cause service disruptions, while excessive or poorly placed ads risk user disengagement, impacting revenue. This paper proposes a novel framework that jointly addresses three challenges: (i) service continuity-and topology-aware content caching to adapt to STIN dynamics, (ii) Distributed DAI (D-DAI) that minimizes feeder link load and storage overhead by avoiding redundant ad-variant content storage through distributed ad stitching, and (iii) revenue-aware content distribution that explicitly models user disengagement due to ad overload to balance monetization and user satisfaction. We formulate the problem as two hierarchical Integer Linear Programming (ILP) optimizations: one content caching that aims to maximize cache hit rate and another optimizing content distribution with DAI to maximize revenue, minimize end-user costs, and enhance user experience. We develop greedy algorithms for fast initialization and a Binary Particle Swarm Optimization (BPSO)–based strategy for enhanced performance. Simulation results demonstrate that the proposed approach achieves over a 4.5% increase in revenue and reduces cache retrieval delay by more than 39% compared to the benchmark algorithms.
- 6 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 1128-1144
Open AccessRevenue-Aware Seamless Content Distribution in Satellite-Terrestrial Integrated Networks
With the surging demand for data-intensive applications, ensuring seamless content delivery in Satellite-Terrestrial Integrated Networks (STINs) is crucial, especially for remote users. Dynamic Ad Insertion (DAI) enhances monetization and user experience, while Mobile Edge Computing (MEC) in STINs enables distributed content caching and ad insertion. However, satellite mobility and time-varying topologies cause service disruptions, while excessive or poorly placed ads risk user disengagement, impacting revenue. This paper proposes a novel framework that jointly addresses three challenges: (i) service continuity-and topology-aware content caching to adapt to STIN dynamics, (ii) Distributed DAI (D-DAI) that minimizes feeder link load and storage overhead by avoiding redundant ad-variant content storage through distributed ad stitching, and (iii) revenue-aware content distribution that explicitly models user disengagement due to ad overload to balance monetization and user satisfaction. We formulate the problem as two hierarchical Integer Linear Programming (ILP) optimizations: one content caching that aims to maximize cache hit rate and another optimizing content distribution with DAI to maximize revenue, minimize end-user costs, and enhance user experience. We develop greedy algorithms for fast initialization and a Binary Particle Swarm Optimization (BPSO)–based strategy for enhanced performance. Simulation results demonstrate that the proposed approach achieves over a 4.5% increase in revenue and reduces cache retrieval delay by more than 39% compared to the benchmark algorithms.
- Open Access
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 5727-5745
On-Board Content Caching With Dynamic Cache Reconfiguration in Multi-Layer Satellite Edge Networks
Satellite Edge Computing (SEC) integrated with multi-layer networks is a promising solution for on-board content caching to meet the stringent content delivery requirements in the future network. However, designing an efficient on-board content caching strategy is challenging in satellite edge networks because of limited on-board resources, dynamic topology, and fluctuating traffic demand. Frequent cache updates are required to adapt to these dynamic conditions, but incur cache reconfiguration overhead, which can overload feeder links and increase cache update delays. To address these challenges, in this paper, we propose an on-board dynamic cache reconfiguration strategy that maximizes the cache hit rate while minimizing reconfiguration overhead. We design a proximity-based content popularity model and an Age of Information (AoI)-aware caching strategy to optimize on-board satellite resources, enhancing the cache hit rate and ensuring content freshness. We employ a greedy algorithm for an initial and fast solution for caching contents and enhance it with a Genetic Algorithm (GA)-based approach. Simulations with realistic datasets demonstrate that the proposed solution outperforms the Cooperative Content Caching (CCC) benchmark by 11.63% and 9.25% in terms of cache hit rate and feeder link load, respectively.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 5727-5745
Open AccessOn-Board Content Caching With Dynamic Cache Reconfiguration in Multi-Layer Satellite Edge Networks
Satellite Edge Computing (SEC) integrated with multi-layer networks is a promising solution for on-board content caching to meet the stringent content delivery requirements in the future network. However, designing an efficient on-board content caching strategy is challenging in satellite edge networks because of limited on-board resources, dynamic topology, and fluctuating traffic demand. Frequent cache updates are required to adapt to these dynamic conditions, but incur cache reconfiguration overhead, which can overload feeder links and increase cache update delays. To address these challenges, in this paper, we propose an on-board dynamic cache reconfiguration strategy that maximizes the cache hit rate while minimizing reconfiguration overhead. We design a proximity-based content popularity model and an Age of Information (AoI)-aware caching strategy to optimize on-board satellite resources, enhancing the cache hit rate and ensuring content freshness. We employ a greedy algorithm for an initial and fast solution for caching contents and enhance it with a Genetic Algorithm (GA)-based approach. Simulations with realistic datasets demonstrate that the proposed solution outperforms the Cooperative Content Caching (CCC) benchmark by 11.63% and 9.25% in terms of cache hit rate and feeder link load, respectively.
- Open Access
- 28 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 6, 1-16
TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning
Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.
- 28 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 6, 1-16
Open AccessTAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning
Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.
- Open Access
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (6) , 6716-6730
Fairness-Aware VNF Mapping and Scheduling in Satellite Edge Networks for Mission-Critical Applications
Satellite Edge Computing (SEC) is seen as a promising solution for deploying network functions in orbit to provide ubiquitous services with low latency and bandwidth. Software Defined Networks (SDN) and Network Function Virtualization (NFV) enable SEC to manage and deploy services more flexibly. In this paper, we study a dynamic and topology-aware VNF mapping and scheduling strategy within an SDN/NFV-enabled SEC infrastructure. Our focus is on meeting the stringent requirements of mission-critical (MC) applications, recognizing their significance in both satellite-to-satellite and edge-to-satellite communications while ensuring service delay margin fairness across various time-sensitive service requests. We formulate the VNF mapping and scheduling problem as an Integer Nonlinear Programming problem (), with the objective of minimax fairness among specified requests while considering dynamic satellite network topology, traffic, and resource constraints. We then propose two algorithms for solving the problem: Fairness-Aware Greedy Algorithm for Dynamic VNF Mapping and Scheduling () and Fairness-Aware Simulated Annealing-Based Algorithm for Dynamic VNF Mapping and Scheduling () which are suitable for low and high service arrival rates, respectively. Our extensive simulations demonstrate that both and approaches are very close to the optimization-based solution and outperform the benchmark solution in terms of service acceptance rates.
- 29 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (6) , 6716-6730
Open AccessFairness-Aware VNF Mapping and Scheduling in Satellite Edge Networks for Mission-Critical Applications
Satellite Edge Computing (SEC) is seen as a promising solution for deploying network functions in orbit to provide ubiquitous services with low latency and bandwidth. Software Defined Networks (SDN) and Network Function Virtualization (NFV) enable SEC to manage and deploy services more flexibly. In this paper, we study a dynamic and topology-aware VNF mapping and scheduling strategy within an SDN/NFV-enabled SEC infrastructure. Our focus is on meeting the stringent requirements of mission-critical (MC) applications, recognizing their significance in both satellite-to-satellite and edge-to-satellite communications while ensuring service delay margin fairness across various time-sensitive service requests. We formulate the VNF mapping and scheduling problem as an Integer Nonlinear Programming problem (), with the objective of minimax fairness among specified requests while considering dynamic satellite network topology, traffic, and resource constraints. We then propose two algorithms for solving the problem: Fairness-Aware Greedy Algorithm for Dynamic VNF Mapping and Scheduling () and Fairness-Aware Simulated Annealing-Based Algorithm for Dynamic VNF Mapping and Scheduling () which are suitable for low and high service arrival rates, respectively. Our extensive simulations demonstrate that both and approaches are very close to the optimization-based solution and outperform the benchmark solution in terms of service acceptance rates.
- 28 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73  (11) , 17400-17415
Traffic-Aware Resource Management in SDN/NFV-Based Satellite Networks for Remote and Urban Areas
This paper proposes distributing Virtual Network Requests (VNRs) in Non-Geostationary Orbit (NGSO) satellite networks based on diverse traffic demands from remote and urban areas. VNRs have allocated node resources, but resource management is challenging due to topology dynamics and limited availability. Provisioned on-board resources in remote or urban areas require customized VNR management solutions for satellite networks. We address these challenges by designing an End-to-End (E2E) resource management solution that considers network topology and payload capabilities to route VNRs optimally based on resource availability. This solution includes modules for topology prediction, traffic prediction, and Virtual Network Function (VNF) mapping and resource allocation. The topology prediction module uses supervised learning to predict satellite-to-gateway link availability and stability. The traffic prediction module classifies the gateway into urban and remote and predicts the traffic load between gateway pairs. Based on the predicted data, the VNF mapping and resource allocation module allocates substrate networks to the VNRs by assigning optimal routing paths customized to the traffic generation area (remote or urban). Simulation results based on realistic topology, parameters, and datasets show that the proposed solution achieves promising performance regarding link stability prediction and VNR mapping accuracy. The proposed solution reduced E2E delay by 11.17 % for remote traffic compared to the benchmark VNE-TEG.
- 28 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 73  (11) , 17400-17415
Traffic-Aware Resource Management in SDN/NFV-Based Satellite Networks for Remote and Urban Areas
This paper proposes distributing Virtual Network Requests (VNRs) in Non-Geostationary Orbit (NGSO) satellite networks based on diverse traffic demands from remote and urban areas. VNRs have allocated node resources, but resource management is challenging due to topology dynamics and limited availability. Provisioned on-board resources in remote or urban areas require customized VNR management solutions for satellite networks. We address these challenges by designing an End-to-End (E2E) resource management solution that considers network topology and payload capabilities to route VNRs optimally based on resource availability. This solution includes modules for topology prediction, traffic prediction, and Virtual Network Function (VNF) mapping and resource allocation. The topology prediction module uses supervised learning to predict satellite-to-gateway link availability and stability. The traffic prediction module classifies the gateway into urban and remote and predicts the traffic load between gateway pairs. Based on the predicted data, the VNF mapping and resource allocation module allocates substrate networks to the VNRs by assigning optimal routing paths customized to the traffic generation area (remote or urban). Simulation results based on realistic topology, parameters, and datasets show that the proposed solution achieves promising performance regarding link stability prediction and VNR mapping accuracy. The proposed solution reduced E2E delay by 11.17 % for remote traffic compared to the benchmark VNE-TEG.
- Open Access
- 14 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72  (10) , 6316-6327
ReViNE: Reinforcement Learning-Based Virtual Network Embedding in Satellite-Terrestrial Networks
This paper addresses the virtual network embedding (VNE) problem in integrated satellite-terrestrial networks (STNs). VNE consists of mapping virtual network functions (VNFs) in a service function chain (SFC) to physical nodes and mapping virtual links connecting the VNFs to physical links. Compared to terrestrial networks, VNE in STNs is challenging due to the movement of the non-geostationary orbit (NGSO) satellites and limited onboard processing resources. A static VNE strategy fails to efficiently address the diverse requirements of heterogeneous service requests in such a highly dynamic topology. In addition, existing solutions do not consider the capacity limitation and connectivity duration of inter-satellite links (ISLs) and ground-to-satellite links, which are essential parameters for deploying a VNE strategy in STNs. This work proposes a heuristic solution and reinforcement learning (RL)-based improved solution for the VNE scheme that can dynamically modify the existing VNF deployment strategy to maximize the average service acceptance rate and revenue. The RL agent selects a suitable VNE strategy for each service request considering the time-varying network topology and service’s requirements. The proposed scheme increases the service acceptance ratio by 19.95% compared to the benchmark TS-MAPSCH.
- 14 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72  (10) , 6316-6327
Open AccessReViNE: Reinforcement Learning-Based Virtual Network Embedding in Satellite-Terrestrial Networks
This paper addresses the virtual network embedding (VNE) problem in integrated satellite-terrestrial networks (STNs). VNE consists of mapping virtual network functions (VNFs) in a service function chain (SFC) to physical nodes and mapping virtual links connecting the VNFs to physical links. Compared to terrestrial networks, VNE in STNs is challenging due to the movement of the non-geostationary orbit (NGSO) satellites and limited onboard processing resources. A static VNE strategy fails to efficiently address the diverse requirements of heterogeneous service requests in such a highly dynamic topology. In addition, existing solutions do not consider the capacity limitation and connectivity duration of inter-satellite links (ISLs) and ground-to-satellite links, which are essential parameters for deploying a VNE strategy in STNs. This work proposes a heuristic solution and reinforcement learning (RL)-based improved solution for the VNE scheme that can dynamically modify the existing VNF deployment strategy to maximize the average service acceptance rate and revenue. The RL agent selects a suitable VNE strategy for each service request considering the time-varying network topology and service’s requirements. The proposed scheme increases the service acceptance ratio by 19.95% compared to the benchmark TS-MAPSCH.
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10  (4) , 1525-1534
RATE: Reliability-Aware Task Service in Fog-Enabled IoV Environments
In this work, we introduce a reliability-aware task service framework, named RATE, designed for fog-enabled Internet of Vehicle (IoV) environments. In RATE, each fog entity makes an efficient decision for task service while considering the task requirements and availability of the resources. Existing works focus mainly on delay and energy as the main factor of decision-making. However, in a mobile IoV environment, it is vital to consider the reliability of entities serving the task. The factor of reliability affects the quality of service (QoS) offered by the task service while having an impact on the resource utilization of the nodes. To offer a reliable service while fulfilling the task demands on the fly, we propose a Q-learning-based algorithm for selecting a candidate for handling the offloaded task. On the contrary, it is important to consider the aspect of the entity offering the offloaded service. Thus, RATE uses a simulated-annealing-based algorithm for the entities to make the decision of accepting or rejecting the task based on its own resource and profit parameters. Numerical results depict that RATE reduces the delay of task service by 38%, 26%, and 18% compared to the benchmark schemes while achieving high QoS.
- 11 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 10  (4) , 1525-1534
RATE: Reliability-Aware Task Service in Fog-Enabled IoV Environments
In this work, we introduce a reliability-aware task service framework, named RATE, designed for fog-enabled Internet of Vehicle (IoV) environments. In RATE, each fog entity makes an efficient decision for task service while considering the task requirements and availability of the resources. Existing works focus mainly on delay and energy as the main factor of decision-making. However, in a mobile IoV environment, it is vital to consider the reliability of entities serving the task. The factor of reliability affects the quality of service (QoS) offered by the task service while having an impact on the resource utilization of the nodes. To offer a reliable service while fulfilling the task demands on the fly, we propose a Q-learning-based algorithm for selecting a candidate for handling the offloaded task. On the contrary, it is important to consider the aspect of the entity offering the offloaded service. Thus, RATE uses a simulated-annealing-based algorithm for the entities to make the decision of accepting or rejecting the task based on its own resource and profit parameters. Numerical results depict that RATE reduces the delay of task service by 38%, 26%, and 18% compared to the benchmark schemes while achieving high QoS.
- 16 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72  (5) , 2881-2896
Non-Grid-Mesh Topology Design for MegaLEO Constellations: An Algorithm Based on NSGA-III
The rapid deployment of Low Earth Orbit (LEO) satellites, driven by technological advancements and cost reductions, has led to the emergence of mega-constellations for satellite-based Internet services. Among them, the networking problem has become a significant area of research. Specifically, breaking away from the traditional Grid-Mesh + topology schemes has been a focal point. Although some related studies have been conducted, there are still three major challenges in optimizing the topology of laser inter-satellite links: the lack of theoretical derivation for satellite visibility, the need for comprehensive modeling goals, and the absence of network simulation verification. To address these challenges, we introduce the theory of visibility analysis of laser terminals in real scenarios and propose a theoretical model of topologically feasible solutions for integer linear programming. Furthermore, a mathematical model is developed that considers time delay, hop count, and link load as optimization objectives. The Many-objective Non-Grid-Mesh Topology Optimization (M-NGTO) algorithm, based on Non-dominated Sorting Genetic Algorithm III (NSGA-III), is then designed to effectively optimize the topology. The optimized Non-Grid-Mesh topology is validated through packet-level simulations on the Hypatia platform. Additionally, consistency analysis is performed to establish agreement between theory and simulation results. The results of simulations conducted on two megaLEO satellite Internet constellations, GW and Starlink, demonstrate that the performance of the Non-Grid-Mesh topology in the above three optimization objectives is approximately 39.11% better than the average of the Grid-Mesh + topology, confirming the effectiveness of the M-NGTO algorithm. The findings have significant implications for enhancing the communication performance and load balancing of satellite Internet systems.
- 16 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72  (5) , 2881-2896
Non-Grid-Mesh Topology Design for MegaLEO Constellations: An Algorithm Based on NSGA-III
The rapid deployment of Low Earth Orbit (LEO) satellites, driven by technological advancements and cost reductions, has led to the emergence of mega-constellations for satellite-based Internet services. Among them, the networking problem has become a significant area of research. Specifically, breaking away from the traditional Grid-Mesh + topology schemes has been a focal point. Although some related studies have been conducted, there are still three major challenges in optimizing the topology of laser inter-satellite links: the lack of theoretical derivation for satellite visibility, the need for comprehensive modeling goals, and the absence of network simulation verification. To address these challenges, we introduce the theory of visibility analysis of laser terminals in real scenarios and propose a theoretical model of topologically feasible solutions for integer linear programming. Furthermore, a mathematical model is developed that considers time delay, hop count, and link load as optimization objectives. The Many-objective Non-Grid-Mesh Topology Optimization (M-NGTO) algorithm, based on Non-dominated Sorting Genetic Algorithm III (NSGA-III), is then designed to effectively optimize the topology. The optimized Non-Grid-Mesh topology is validated through packet-level simulations on the Hypatia platform. Additionally, consistency analysis is performed to establish agreement between theory and simulation results. The results of simulations conducted on two megaLEO satellite Internet constellations, GW and Starlink, demonstrate that the performance of the Non-Grid-Mesh topology in the above three optimization objectives is approximately 39.11% better than the average of the Grid-Mesh + topology, confirming the effectiveness of the M-NGTO algorithm. The findings have significant implications for enhancing the communication performance and load balancing of satellite Internet systems.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (5) , 4936-4948
Traffic-Aware Virtual Network Embedding With Joint Load Balancing and Datarate Assignment for SDN-Based Networks
Non-Geostationary Orbit satellite (NGSO) is an essential element in 5G Non-Terrestrial Networks (NTNs), which can operate either independently or as complementary parts to terrestrial systems to boost the network capacity, coverage and resilience. Due to the highly dynamic topologies, one of the challenges in NGSO is how to harmonize the network virtualized resources to satisfy diverse quality of service requirements in an efficient manner. In this paper, we investigate Virtual Network Embedding (VNE) for integrated NGSO-terrestrial systems while considering dynamic topologies. We propose a Dynamic Topology-Aware VNE (DTA-VNE) algorithm which, given priori information about the network’s evolution over time, can plan the embedding for each Virtual Network Request (VNR) over its lifetime. In a highly dynamic environment, the VNE decision can be varying for different VNRs at the expense of a considerable cost of migrating traffic and reconfiguring resources. The proposed DTA-VNE aims at minimizing this migration cost and thus avoids unnecessary re-mappings. In numerical results, the effectiveness of the proposed DTA-VNE is demonstrated with much lower migration cost than the conventional implementations. We show the benefit of planning for more time slots, in terms of migration cost, and the impact on the computation time, due to the increasing problem complexity. The trade-off between these two performance metrics is studied. Furthermore, we verify the efficiency of DTA-VNE in a MultI-layer awaRe SDN-based testbed for SAtellite-Terrestrial networks (MIRSAT). Finally, the application of DTA-VNE to novel scenarios such as mega LEO constellations is discussed, highlighting the challenges and possible solutions.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21  (5) , 4936-4948
Traffic-Aware Virtual Network Embedding With Joint Load Balancing and Datarate Assignment for SDN-Based Networks
Non-Geostationary Orbit satellite (NGSO) is an essential element in 5G Non-Terrestrial Networks (NTNs), which can operate either independently or as complementary parts to terrestrial systems to boost the network capacity, coverage and resilience. Due to the highly dynamic topologies, one of the challenges in NGSO is how to harmonize the network virtualized resources to satisfy diverse quality of service requirements in an efficient manner. In this paper, we investigate Virtual Network Embedding (VNE) for integrated NGSO-terrestrial systems while considering dynamic topologies. We propose a Dynamic Topology-Aware VNE (DTA-VNE) algorithm which, given priori information about the network’s evolution over time, can plan the embedding for each Virtual Network Request (VNR) over its lifetime. In a highly dynamic environment, the VNE decision can be varying for different VNRs at the expense of a considerable cost of migrating traffic and reconfiguring resources. The proposed DTA-VNE aims at minimizing this migration cost and thus avoids unnecessary re-mappings. In numerical results, the effectiveness of the proposed DTA-VNE is demonstrated with much lower migration cost than the conventional implementations. We show the benefit of planning for more time slots, in terms of migration cost, and the impact on the computation time, due to the increasing problem complexity. The trade-off between these two performance metrics is studied. Furthermore, we verify the efficiency of DTA-VNE in a MultI-layer awaRe SDN-based testbed for SAtellite-Terrestrial networks (MIRSAT). Finally, the application of DTA-VNE to novel scenarios such as mega LEO constellations is discussed, highlighting the challenges and possible solutions.