Ahmed Q. Lawey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ahmed Q. Lawey has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
- Jaafar Mohamed Hashim Elmirghani
Department of Engineering, Kings College London, London, U.K.
41 shared publications Taisir E. H. El-Gorashi
School of Electronic and Electrical Engineering, University of Leeds, Leeds, U.K.
13 shared publications- Taisir E. H. El-Gorashi
School of Electronic and Electrical Engineering University of Leeds LS2 9JT United Kingdom
7 shared publications Taisir El-Gorashi
7 shared publications- Ali M. Al-Salim
School of Electronic and Electrical Engineering, University of Leeds, LS2 9JT, United Kingdom
5 shared publications - Howraa Mehdi Mohammad Ali
School of Electronic and Electrical Engineering, University of Leeds, LS2 9JT, United Kingdom
5 shared publications
Latest Publications
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3608-3619
Analytical Bounds for Decoy-State Quantum Key Distribution With Discrete Phase Randomization
We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.
- 24 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 3608-3619
Analytical Bounds for Decoy-State Quantum Key Distribution With Discrete Phase Randomization
We analyze the performance of quantum key distribution (QKD) protocols that rely on discrete phase randomization (DPR). For many QKD protocols that rely on weak coherent pulses (WCPs), continuous phase randomization is assumed, which simplifies the security proofs for such protocols. However, it is challenging to achieve such a perfect phase randomization in practice. As an alternative, we can select a discrete set of global phase values for WCPs, but we need to redo the security analysis for such a source. While security proofs incorporating DPR have been established for several QKD protocols, they often rely on computationally intensive numerical optimizations. To address this issue, in this study, we derive analytical bounds on the secret key generation rate of BB84 and measurement-device-independent QKD protocols in the DPR setting. Our analytical bounds closely match the results obtained from more cumbersome numerical methods in the regions of interest.
- Open Access
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 10061-10078
Optimal Resource Allocation for O-RAN With Integrated Access and Backhaul
We propose a resource allocation optimisation framework that integrates the O-RAN architecture with out-band Integrated Access and Backhaul (IAB). Using mixed-integer linear programming (MILP), we coordinate multiple control functions across O-RAN to achieve global optimality. The MILP model jointly optimises: (i) radio-resource allocations among users (power, numerology, and resource block) at the DU level to satisfy diverse data rate and latency requirements in frequency-selective channels; (ii) carrier bandwidth partitioning among numerology based Bandwidth Parts (BWPs) at the CU control-plane level as a longer-term policy; and (iii) wireless backhaul routing over mmWave links from IAB Donors to IAB Nodes at the CU user-plane level. Our framework leverages mmWave frequency bands for backhaul despite their path-loss and penetration-loss challenges. The main objectives are to minimise downlink transmit power and co-channel interference (CCI) while maximising the number of simultaneously served users. Results show that integrating IAB reduces average total transmit power by 35%. We also compare flexible and non-flexible numerology allocation, with IAB and flexible numerology demonstrating significant improvements in both CCI and downlink energy efficiency. For faster implementation, we develop two hybrid genetic algorithms that converge rapidly, delivering near-optimal solutions far more quickly than the MILP model. This makes them well-suited to real-time resource allocation and dynamic network management in O-RAN with out-of-band IAB.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 10061-10078
Open AccessOptimal Resource Allocation for O-RAN With Integrated Access and Backhaul
We propose a resource allocation optimisation framework that integrates the O-RAN architecture with out-band Integrated Access and Backhaul (IAB). Using mixed-integer linear programming (MILP), we coordinate multiple control functions across O-RAN to achieve global optimality. The MILP model jointly optimises: (i) radio-resource allocations among users (power, numerology, and resource block) at the DU level to satisfy diverse data rate and latency requirements in frequency-selective channels; (ii) carrier bandwidth partitioning among numerology based Bandwidth Parts (BWPs) at the CU control-plane level as a longer-term policy; and (iii) wireless backhaul routing over mmWave links from IAB Donors to IAB Nodes at the CU user-plane level. Our framework leverages mmWave frequency bands for backhaul despite their path-loss and penetration-loss challenges. The main objectives are to minimise downlink transmit power and co-channel interference (CCI) while maximising the number of simultaneously served users. Results show that integrating IAB reduces average total transmit power by 35%. We also compare flexible and non-flexible numerology allocation, with IAB and flexible numerology demonstrating significant improvements in both CCI and downlink energy efficiency. For faster implementation, we develop two hybrid genetic algorithms that converge rapidly, delivering near-optimal solutions far more quickly than the MILP model. This makes them well-suited to real-time resource allocation and dynamic network management in O-RAN with out-of-band IAB.
- Open Access
- 23 December 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015052
Quantum data centres: a simulation-based comparative noise analysis
Quantum data centres (QDCs) could overcome the scalability challenges of modern quantum computers. Single-processor monolithic quantum computers are affected by increased cross talk and difficulty of implementing gates when the number of qubits is increased. In a QDC, multiple quantum processing units (QPUs) are linked together over short distances, allowing the total number of computational qubits to be increased without increasing the number of qubits on any one processor. In doing so, the error incurred by operations at each QPU can be kept small, however additional noise will be added to the system due to the latency cost and errors incurred during inter-QPU entanglement distribution. We investigate the relative impact of these different types of noise using a classically simulated QDC with two QPUs and compare the robustness to noise of the two main ways of implementing remote gates, cat-comm and TP-comm. We find that considering the quantity of gates or inter-QPU entangled links is often inadequate to predict the output fidelity from a quantum circuit and infer that an improved understanding of error propagation during distributed quantum circuits may represent a significant optimisation opportunity for compilation.
- 23 December 2024
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 10 (1) , 015052
Open AccessQuantum data centres: a simulation-based comparative noise analysis
Quantum data centres (QDCs) could overcome the scalability challenges of modern quantum computers. Single-processor monolithic quantum computers are affected by increased cross talk and difficulty of implementing gates when the number of qubits is increased. In a QDC, multiple quantum processing units (QPUs) are linked together over short distances, allowing the total number of computational qubits to be increased without increasing the number of qubits on any one processor. In doing so, the error incurred by operations at each QPU can be kept small, however additional noise will be added to the system due to the latency cost and errors incurred during inter-QPU entanglement distribution. We investigate the relative impact of these different types of noise using a classically simulated QDC with two QPUs and compare the robustness to noise of the two main ways of implementing remote gates, cat-comm and TP-comm. We find that considering the quantity of gates or inter-QPU entangled links is often inadequate to predict the output fidelity from a quantum circuit and infer that an improved understanding of error propagation during distributed quantum circuits may represent a significant optimisation opportunity for compilation.
- Open Access
- 5 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 5248-5259
Joint Optimization of Routing, Bandwidth, and Sub-Band Allocation in Energy-Efficient THz Nano-Networks
Nano-networks are envisioned to allow several nanoscale devices to transmit and receive information. One form of such networks is electromagnetic nano-networks working within the THz band. However, high overall path loss and molecular noise experienced in the THz band, as well as limited energy storage capabilities, restrict the communication range of nano-nodes and impact network efficiency. Therefore, optimizing the nano-network resources is necessary. In this paper, we present an optimization framework employing mixed-integer linear programming (MILP) to determine the most energy-efficient routing, bandwidth, and sub-band allocation for each nano-node in an electromagnetic nano-network operating within the THz band. Our model was tested for two different scenarios related to the priority of energy saving. We also compare our proposed optimal bandwidth, routing, and sub-band allocation against less complex designs where sub-bands with fixed bandwidth are employed in nano-nodes. Furthermore, we investigate the impact of nano-node’s processing and sensing units on the overall network energy consumption and the associated optimal bandwidth allocation and routing strategy. Given the considered parameters and the model’s assumptions, the results show that using the optimal multi-hops paths with higher bandwidth allocation for the considered sub-bands can be more energy efficient than sending the traffic using a single hop and lower bandwidths, especially when the transmission power dominates in the nano-network. On the other hand, when the processing and sensing unit’s energy consumption is dominant, then single hop schemes with lower bandwidth allocation result in the minimum network energy consumption. Finally, we discuss the limitations of the proposed energy-efficient strategies and point toward possible future research directions to which the model can be adapted.
- 5 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 5248-5259
Open AccessJoint Optimization of Routing, Bandwidth, and Sub-Band Allocation in Energy-Efficient THz Nano-Networks
Nano-networks are envisioned to allow several nanoscale devices to transmit and receive information. One form of such networks is electromagnetic nano-networks working within the THz band. However, high overall path loss and molecular noise experienced in the THz band, as well as limited energy storage capabilities, restrict the communication range of nano-nodes and impact network efficiency. Therefore, optimizing the nano-network resources is necessary. In this paper, we present an optimization framework employing mixed-integer linear programming (MILP) to determine the most energy-efficient routing, bandwidth, and sub-band allocation for each nano-node in an electromagnetic nano-network operating within the THz band. Our model was tested for two different scenarios related to the priority of energy saving. We also compare our proposed optimal bandwidth, routing, and sub-band allocation against less complex designs where sub-bands with fixed bandwidth are employed in nano-nodes. Furthermore, we investigate the impact of nano-node’s processing and sensing units on the overall network energy consumption and the associated optimal bandwidth allocation and routing strategy. Given the considered parameters and the model’s assumptions, the results show that using the optimal multi-hops paths with higher bandwidth allocation for the considered sub-bands can be more energy efficient than sending the traffic using a single hop and lower bandwidths, especially when the transmission power dominates in the nano-network. On the other hand, when the processing and sensing unit’s energy consumption is dominant, then single hop schemes with lower bandwidth allocation result in the minimum network energy consumption. Finally, we discuss the limitations of the proposed energy-efficient strategies and point toward possible future research directions to which the model can be adapted.
- Open Access
Latency Reduction for Mobile Edge Computing in HetNets by Uplink and Downlink Decoupled Access
Achieving an end-to-end low-latency for computations offloading, in Mobile Edge Computing (MEC) systems, is still a critical design problem. This is because the offloading of computational tasks via the MEC servers entails the use of uplink (UL) and downlink (DL) radio links that are usually assumed to be coupled to a single base station (BS). However, for heterogeneous networks, a new architectural paradigm whereby UL and DL are not associated with the same BS is proposed and seen to provide gains in network throughput due to the improved UL performance. Motivated by such gains, and by using typical results from stochastic geometry, we formulate the offloading latency for the MEC-based scheme with decoupled UL/DL association, or decoupled access, and compare its performance to the conventional coupled access scheme. Despite the backhaul delay necessary for the communication between the two serving BSs in UL and DL, the offloading scheme with decoupled access is still capable of providing a fairly lower offloading latency compared to the conventional offloading scheme with coupled access.
Open AccessLatency Reduction for Mobile Edge Computing in HetNets by Uplink and Downlink Decoupled Access
Achieving an end-to-end low-latency for computations offloading, in Mobile Edge Computing (MEC) systems, is still a critical design problem. This is because the offloading of computational tasks via the MEC servers entails the use of uplink (UL) and downlink (DL) radio links that are usually assumed to be coupled to a single base station (BS). However, for heterogeneous networks, a new architectural paradigm whereby UL and DL are not associated with the same BS is proposed and seen to provide gains in network throughput due to the improved UL performance. Motivated by such gains, and by using typical results from stochastic geometry, we formulate the offloading latency for the MEC-based scheme with decoupled UL/DL association, or decoupled access, and compare its performance to the conventional coupled access scheme. Despite the backhaul delay necessary for the communication between the two serving BSs in UL and DL, the offloading scheme with decoupled access is still capable of providing a fairly lower offloading latency compared to the conventional offloading scheme with coupled access.
- 13 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (10) , 2205-2209
Latency Reduction for Mobile Edge Computing in HetNets by Uplink and Downlink Decoupled Access
Achieving an end-to-end low-latency for computations offloading, in Mobile Edge Computing (MEC) systems, is still a critical design problem. This is because the offloading of computational tasks via the MEC servers entails the use of uplink (UL) and downlink (DL) radio links that are usually assumed to be coupled to a single base station (BS). However, for heterogeneous networks, a new architectural paradigm whereby UL and DL are not associated with the same BS is proposed and seen to provide gains in network throughput due to the improved UL performance. Motivated by such gains, and by using typical results from stochastic geometry, we formulate the offloading latency for the MEC-based scheme with decoupled UL/DL association, or decoupled access, and compare its performance to the conventional coupled access scheme. Despite the backhaul delay necessary for the communication between the two serving BSs in UL and DL, the offloading scheme with decoupled access is still capable of providing a fairly lower offloading latency compared to the conventional offloading scheme with coupled access.
- 13 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 10 (10) , 2205-2209
Latency Reduction for Mobile Edge Computing in HetNets by Uplink and Downlink Decoupled Access
Achieving an end-to-end low-latency for computations offloading, in Mobile Edge Computing (MEC) systems, is still a critical design problem. This is because the offloading of computational tasks via the MEC servers entails the use of uplink (UL) and downlink (DL) radio links that are usually assumed to be coupled to a single base station (BS). However, for heterogeneous networks, a new architectural paradigm whereby UL and DL are not associated with the same BS is proposed and seen to provide gains in network throughput due to the improved UL performance. Motivated by such gains, and by using typical results from stochastic geometry, we formulate the offloading latency for the MEC-based scheme with decoupled UL/DL association, or decoupled access, and compare its performance to the conventional coupled access scheme. Despite the backhaul delay necessary for the communication between the two serving BSs in UL and DL, the offloading scheme with decoupled access is still capable of providing a fairly lower offloading latency compared to the conventional offloading scheme with coupled access.
- Open Access
- 30 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 123571-123584
Resilient Service Embedding in IoT Networks
The Internet of Things (IoT) can support a significant number of services including those in smart homes and the automation of industries and public utilities. However, the growth of these deployments has posed a significant challenge especially in terms of how to build such deployments in a highly resilient manner. The IoT devices are prone to unpredicted failures and cyber-attacks, i.e. various types of damage, unreliable wireless connections, limited transmission power, computing ability, and storage space. Thus resilience is essential in IoT networks and in the services they support. In this paper, we introduce a new approach to resilience in IoT service embedding, based on traffic splitting. Our study assesses the power consumption associated with the services embedded and the data delivery time. The results are compared to recent approaches in resilience including redundancy and replication approaches. We constructed an optimization model whose goal is to determine the optimum physical resources to be used to embed the IoT virtual topology, where the latter is derived from a business process (BP). The embedding process makes use of the service-oriented architecture (SOA) paradigm. The physical resources of interest include IoT links and devices. The model made use of mixed integer linear programming (MILP) with an objective function that aimed to minimize both the total power consumption and the traffic latency. The optimization results show that the power consumption is reduced and the data delivery time is reduced in the service embedding approach where the proposed traffic splitting approach is employed resulting in the selection of energy efficient nodes and routes in the IoT network. Our methods resulted in up to 35% power saving compared to current methods and reduced the average traffic latency by up to 37% by selecting energy-efficient nodes and routes in IoT networks and by optimizing traffic flow to minimize latency.
- 30 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 123571-123584
Open AccessResilient Service Embedding in IoT Networks
The Internet of Things (IoT) can support a significant number of services including those in smart homes and the automation of industries and public utilities. However, the growth of these deployments has posed a significant challenge especially in terms of how to build such deployments in a highly resilient manner. The IoT devices are prone to unpredicted failures and cyber-attacks, i.e. various types of damage, unreliable wireless connections, limited transmission power, computing ability, and storage space. Thus resilience is essential in IoT networks and in the services they support. In this paper, we introduce a new approach to resilience in IoT service embedding, based on traffic splitting. Our study assesses the power consumption associated with the services embedded and the data delivery time. The results are compared to recent approaches in resilience including redundancy and replication approaches. We constructed an optimization model whose goal is to determine the optimum physical resources to be used to embed the IoT virtual topology, where the latter is derived from a business process (BP). The embedding process makes use of the service-oriented architecture (SOA) paradigm. The physical resources of interest include IoT links and devices. The model made use of mixed integer linear programming (MILP) with an objective function that aimed to minimize both the total power consumption and the traffic latency. The optimization results show that the power consumption is reduced and the data delivery time is reduced in the service embedding approach where the proposed traffic splitting approach is employed resulting in the selection of energy efficient nodes and routes in the IoT network. Our methods resulted in up to 35% power saving compared to current methods and reduced the average traffic latency by up to 37% by selecting energy-efficient nodes and routes in IoT networks and by optimizing traffic flow to minimize latency.
- Open Access
- 6 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 85639-85655
Patient-Centric HetNets Powered by Machine Learning and Big Data Analytics for 6G Networks
Having a cognitive and self-optimizing network that proactively adapts not only to channel conditions, but also according to its users’ needs can be one of the highest forthcoming priorities of future 6G Heterogeneous Networks (HetNets). In this paper, we introduce an interdisciplinary approach linking the concepts of e-healthcare, priority, big data analytics (BDA) and radio resource optimization in a multi-tier 5G network. We employ three machine learning (ML) algorithms, namely, naïve Bayesian (NB) classifier, logistic regression (LR), and decision tree (DT), working as an ensemble system to analyze historical medical records of stroke out-patients (OPs) and readings from body-attached internet-of-things (IoT) sensors to predict the likelihood of an imminent stroke. We convert the stroke likelihood into a risk factor functioning as a priority in a mixed integer linear programming (MILP) optimization model. Hence, the task is to optimally allocate physical resource blocks (PRBs) to HetNet users while prioritizing OPs by granting them high gain PRBs according to the severity of their medical state. Thus, empowering the OPs to send their critical data to their healthcare provider with minimized delay. To that end, two optimization approaches are proposed, a weighted sum rate maximization (WSRMax) approach and a proportional fairness (PF) approach. The proposed approaches increased the OPs’ average signal to interference plus noise (SINR) by 57% and 95%, respectively. The WSRMax approach increased the system’s total SINR to a level higher than that of the PF approach, nevertheless, the PF approach yielded higher SINRs for the OPs, better fairness and a lower margin of error.
- 6 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 85639-85655
Open AccessPatient-Centric HetNets Powered by Machine Learning and Big Data Analytics for 6G Networks
Having a cognitive and self-optimizing network that proactively adapts not only to channel conditions, but also according to its users’ needs can be one of the highest forthcoming priorities of future 6G Heterogeneous Networks (HetNets). In this paper, we introduce an interdisciplinary approach linking the concepts of e-healthcare, priority, big data analytics (BDA) and radio resource optimization in a multi-tier 5G network. We employ three machine learning (ML) algorithms, namely, naïve Bayesian (NB) classifier, logistic regression (LR), and decision tree (DT), working as an ensemble system to analyze historical medical records of stroke out-patients (OPs) and readings from body-attached internet-of-things (IoT) sensors to predict the likelihood of an imminent stroke. We convert the stroke likelihood into a risk factor functioning as a priority in a mixed integer linear programming (MILP) optimization model. Hence, the task is to optimally allocate physical resource blocks (PRBs) to HetNet users while prioritizing OPs by granting them high gain PRBs according to the severity of their medical state. Thus, empowering the OPs to send their critical data to their healthcare provider with minimized delay. To that end, two optimization approaches are proposed, a weighted sum rate maximization (WSRMax) approach and a proportional fairness (PF) approach. The proposed approaches increased the OPs’ average signal to interference plus noise (SINR) by 57% and 95%, respectively. The WSRMax approach increased the system’s total SINR to a level higher than that of the PF approach, nevertheless, the PF approach yielded higher SINRs for the OPs, better fairness and a lower margin of error.
- Open Access
- 25 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 2948-2962
Service Embedding in IoT Networks
The Internet of Things (IoT) is the cornerstone of smart applications such as smart buildings, smart factories, home automation, and healthcare automation. These smart applications express their demands in terms of high-level requests. Application requests in service-oriented IoT architectures are translated into a business process (BP) workflow. In this paper, we model such a BP as a virtual network containing a set of virtual nodes and links connected in a specific topology. These virtual nodes represent the requested processing and locations where sensing and/or actuation are needed. The virtual links capture the requested communication requirements between nodes. We introduce a framework, optimized using mixed integer linear programming (MILP), that embeds the BPs from the virtual layer into a lower-level implementation at the IoT physical layer. We formulate the problem of finding the optimal set of IoT nodes and links to embed BPs into the IoT layer considering three objective functions: i) minimizing network and processing power consumption only, ii) minimizing mean traffic latency only, iii) minimizing a weighted combination of power consumption and traffic latency to study the trade-off between minimizing the power consumption and minimizing the traffic latency. We have established, as reference, a scenario where service embedding is performed to meet all the demands with no consideration to power consumption or latency. Compared to this reference scenario, our results indicate that the power savings achieved by our energy efficient embedding scenario is 42% compared with the energy-latency unaware service embedding (ELUSE) reference scenario, while our low latency embedding reduced the traffic latency by an average of 47% compared to the ELUSE scenario. Our combined energy efficient low latency service embedding approach achieved high optimality by jointly realizing 91% of the power and latency reductions obtained under the single objective of minimizing power consumption or latency.
- 25 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 2948-2962
Open AccessService Embedding in IoT Networks
The Internet of Things (IoT) is the cornerstone of smart applications such as smart buildings, smart factories, home automation, and healthcare automation. These smart applications express their demands in terms of high-level requests. Application requests in service-oriented IoT architectures are translated into a business process (BP) workflow. In this paper, we model such a BP as a virtual network containing a set of virtual nodes and links connected in a specific topology. These virtual nodes represent the requested processing and locations where sensing and/or actuation are needed. The virtual links capture the requested communication requirements between nodes. We introduce a framework, optimized using mixed integer linear programming (MILP), that embeds the BPs from the virtual layer into a lower-level implementation at the IoT physical layer. We formulate the problem of finding the optimal set of IoT nodes and links to embed BPs into the IoT layer considering three objective functions: i) minimizing network and processing power consumption only, ii) minimizing mean traffic latency only, iii) minimizing a weighted combination of power consumption and traffic latency to study the trade-off between minimizing the power consumption and minimizing the traffic latency. We have established, as reference, a scenario where service embedding is performed to meet all the demands with no consideration to power consumption or latency. Compared to this reference scenario, our results indicate that the power savings achieved by our energy efficient embedding scenario is 42% compared with the energy-latency unaware service embedding (ELUSE) reference scenario, while our low latency embedding reduced the traffic latency by an average of 47% compared to the ELUSE scenario. Our combined energy efficient low latency service embedding approach achieved high optimality by jointly realizing 91% of the power and latency reductions obtained under the single objective of minimizing power consumption or latency.
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Energy Efficient Service Embedding In IoT over PON
- 1 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Energy Efficient Service Embedding In IoT over PON