Nasrin Akhter
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
Nasrin Akhter has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Mohamed Othman
Department of Communication Technology and Network, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor DE, Malaysia
3 shared publications- Mohamed Othman
Universiti Putra Malaysia
3 shared publications - Ranesh Naha
Queensland University of Technology
3 shared publications - Faria Khandaker
Department of Computer Science, Stamford University, Dhaka, Bangladesh
1 shared publication - Iftekhar Ahmad
Edith Cowan University
1 shared publication - Jason But
Department of Electrical, Robotics and Biomedical Engineering, Swinburne University of Technology, Melbourne 3122, Australia
1 shared publication
Latest Publications
- 1 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 1724-1736
Configurable Harris Hawks Optimisation for Application Placement in Space-Air-Ground Integrated Networks
Space-Air-Ground Integrated Network (SAGIN) has recently emerged as a viable solution for reliable transmission, high data rates, and seamless connectivity with extensive coverage. However, the characteristics of the computation and communication devices located at various levels of SAGIN make application placement within such environments a challenging task. Real-time service expectations and resource requirements of applications further intensify this issue, and push the domain to operate beyond its capacity, resulting in uneven delays and significant overhead. Taking these constraints into account, SAGIN’s application placement problem can be expressed as a multiobjective optimisation problem. This paper aims to solve such a problem using a Dynamic Weight-configurable Harris Hawks Optimisation (DW-HHO) algorithm, considering diverse application contexts such as deadlines, resource usage and the number of application activities. It simultaneously minimises application total service time and host resource overhead with a robust global search. The performance of the proposed solution is compared with benchmark metaheuristic solutions such as PSO, NSGA-II, Greedy and Random. Experimental results demonstrate that DW-HHO outperforms other benchmark metaheuristic solutions in optimising resource utilisation and service delivery time of applications in SAGIN environments. The proposed DW-HHO demonstrates notable improvements over existing methods. Specifically, when evaluating the total service time for PSO, NSGA-II, Greedy, and Random, DW-HHO outperforms these methods by 7.28%, 9.07%, 13.01%, and 14.97%, respectively.
- 1 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (2) , 1724-1736
Configurable Harris Hawks Optimisation for Application Placement in Space-Air-Ground Integrated Networks
Space-Air-Ground Integrated Network (SAGIN) has recently emerged as a viable solution for reliable transmission, high data rates, and seamless connectivity with extensive coverage. However, the characteristics of the computation and communication devices located at various levels of SAGIN make application placement within such environments a challenging task. Real-time service expectations and resource requirements of applications further intensify this issue, and push the domain to operate beyond its capacity, resulting in uneven delays and significant overhead. Taking these constraints into account, SAGIN’s application placement problem can be expressed as a multiobjective optimisation problem. This paper aims to solve such a problem using a Dynamic Weight-configurable Harris Hawks Optimisation (DW-HHO) algorithm, considering diverse application contexts such as deadlines, resource usage and the number of application activities. It simultaneously minimises application total service time and host resource overhead with a robust global search. The performance of the proposed solution is compared with benchmark metaheuristic solutions such as PSO, NSGA-II, Greedy and Random. Experimental results demonstrate that DW-HHO outperforms other benchmark metaheuristic solutions in optimising resource utilisation and service delivery time of applications in SAGIN environments. The proposed DW-HHO demonstrates notable improvements over existing methods. Specifically, when evaluating the total service time for PSO, NSGA-II, Greedy, and Random, DW-HHO outperforms these methods by 7.28%, 9.07%, 13.01%, and 14.97%, respectively.
- Open Access
Energy-aware virtual machine selection method for cloud data center resource allocation
Saving energy is an important issue for cloud providers to reduce energy cost in a data center. With the increasing popularity of cloud computing, it is time to examine various energy reduction methods for which energy consumption could be reduced and lead us to green cloud computing. In this paper, our aim is to propose a virtual machine selection algorithm to improve the energy efficiency of a cloud data center. We are also presenting experimental results of the proposed algorithm in a cloud computing based simulation environment. The proposed algorithm dynamically took the virtual machines' allocation, deallocation, and reallocation action to the physical server. However, it depends on the load and heuristics based on the analysis placement of a virtual machine which is decided over time. From the results obtained from the simulation, we have found that our proposed virtual machine selection algorithm reduces the total energy consumption by 19% compared to the existing one. Therefore, the energy consumption cost of a cloud data center reduces and also lowers the carbon footprint. Simulation-based experimental results show that the proposed heuristics which are based on resource provisioning algorithms reduce the energy consumption of the cloud data center and decrease the virtual machine's migration rate.
Open AccessEnergy-aware virtual machine selection method for cloud data center resource allocation
Saving energy is an important issue for cloud providers to reduce energy cost in a data center. With the increasing popularity of cloud computing, it is time to examine various energy reduction methods for which energy consumption could be reduced and lead us to green cloud computing. In this paper, our aim is to propose a virtual machine selection algorithm to improve the energy efficiency of a cloud data center. We are also presenting experimental results of the proposed algorithm in a cloud computing based simulation environment. The proposed algorithm dynamically took the virtual machines' allocation, deallocation, and reallocation action to the physical server. However, it depends on the load and heuristics based on the analysis placement of a virtual machine which is decided over time. From the results obtained from the simulation, we have found that our proposed virtual machine selection algorithm reduces the total energy consumption by 19% compared to the existing one. Therefore, the energy consumption cost of a cloud data center reduces and also lowers the carbon footprint. Simulation-based experimental results show that the proposed heuristics which are based on resource provisioning algorithms reduce the energy consumption of the cloud data center and decrease the virtual machine's migration rate.
- Open Access
Evaluation of Energy-efficient VM Consolidation for Cloud Based Data Center - Revisited
In this paper, a re-evaluation undertaken for dynamic VM consolidation problem and optimal online deterministic algorithms for the single VM migration in an experimental environment. We proceeded to focus on energy and performance trade-off by planet lab workload traces, which consists of a thousand Planetlab VMs with widespread simulation environments. All experiments are done in a simulated cloud environment by the CloudSim simulation tool. A new paradigm of utility-oriented IT services is cloud computing, which offers a pay-as-you-go model. In recent years, there has been increasing interest among many users from business, scientific, engineering and educational territories in cloud computing. There is increasing concern that high energy consumption issues are a disadvantage for various institutions. However, so far too little attention has been given to the various methods to reduce energy consumption in cloud environments while ensuring performance. Besides the evaluation of energy-efficient data center management algorithms in the cloud, we proposed a further research directed toward the development of energy efficient algorithms. By the experimental evaluation of the current proposal for the competitive analysis of dynamic VM consolidation and optimal online deterministic algorithms for the single VM migration, we found different results for different algorithm combinations. Cloud-based data centers` consume massive energy, which has a negative effect on the environment and operational cost, this work contributes to the energy consumption reduction in the cloud environment.
Open AccessEvaluation of Energy-efficient VM Consolidation for Cloud Based Data Center - Revisited
In this paper, a re-evaluation undertaken for dynamic VM consolidation problem and optimal online deterministic algorithms for the single VM migration in an experimental environment. We proceeded to focus on energy and performance trade-off by planet lab workload traces, which consists of a thousand Planetlab VMs with widespread simulation environments. All experiments are done in a simulated cloud environment by the CloudSim simulation tool. A new paradigm of utility-oriented IT services is cloud computing, which offers a pay-as-you-go model. In recent years, there has been increasing interest among many users from business, scientific, engineering and educational territories in cloud computing. There is increasing concern that high energy consumption issues are a disadvantage for various institutions. However, so far too little attention has been given to the various methods to reduce energy consumption in cloud environments while ensuring performance. Besides the evaluation of energy-efficient data center management algorithms in the cloud, we proposed a further research directed toward the development of energy efficient algorithms. By the experimental evaluation of the current proposal for the competitive analysis of dynamic VM consolidation and optimal online deterministic algorithms for the single VM migration, we found different results for different algorithm combinations. Cloud-based data centers` consume massive energy, which has a negative effect on the environment and operational cost, this work contributes to the energy consumption reduction in the cloud environment.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of Communication Networks and Distributed Systems
- Vol. 19 (1) , 99-120
Diverse approaches to cloud brokering: innovations and issues
In the cloud computing concept, users can use computing resources according to their needs and requirements. The cloud approach helps users to reduce the cost of IT infrastructure. To provide services, different cloud service providers build their own computing platform differently due to the lack of a common standard. Selecting the cloud provider from among these heterogeneous cloud environments is really challenging for users. Several brokering mechanisms have been proposed as an intermediate solution in the past few years. Cloud brokering helps users to select a cloud provider according to their needs and specific requirements. In this paper, we present the ongoing research and innovations pertaining to the cloud brokering mechanism by various researchers. We also investigate various approaches, future challenges and other obstacles to all the proposed brokering solutions. The main contribution of this paper is that it provides the first review concerning cloud brokering architecture, which will provide a better understanding of cloud brokering and identify the important research directions of this increasingly important area. Another contribution is that it depicts a unified cloud brokering architecture that can contribute to future research.
- 1 January 2017
- Published by Inderscience Publishers in International Journal of Communication Networks and Distributed Systems
- Vol. 19 (1) , 99-120
Diverse approaches to cloud brokering: innovations and issues
In the cloud computing concept, users can use computing resources according to their needs and requirements. The cloud approach helps users to reduce the cost of IT infrastructure. To provide services, different cloud service providers build their own computing platform differently due to the lack of a common standard. Selecting the cloud provider from among these heterogeneous cloud environments is really challenging for users. Several brokering mechanisms have been proposed as an intermediate solution in the past few years. Cloud brokering helps users to select a cloud provider according to their needs and specific requirements. In this paper, we present the ongoing research and innovations pertaining to the cloud brokering mechanism by various researchers. We also investigate various approaches, future challenges and other obstacles to all the proposed brokering solutions. The main contribution of this paper is that it provides the first review concerning cloud brokering architecture, which will provide a better understanding of cloud brokering and identify the important research directions of this increasingly important area. Another contribution is that it depicts a unified cloud brokering architecture that can contribute to future research.
- 24 May 2016
- Published by Springer Nature in Cluster Computing
- Vol. 19 (3) , 1163-1182
Energy aware resource allocation of cloud data center: review and open issues
- 24 May 2016
- Published by Springer Nature in Cluster Computing
- Vol. 19 (3) , 1163-1182
Energy aware resource allocation of cloud data center: review and open issues
- 14 September 2015
- Published by Pushpa Publishing House in Far East Journal of Electronics and Communications
- Vol. 15 (2) , 85-98
EVALUATION OF CLOUD BROKERING ALGORITHMS IN CLOUD BASED DATA CENTER
- 14 September 2015
- Published by Pushpa Publishing House in Far East Journal of Electronics and Communications
- Vol. 15 (2) , 85-98
EVALUATION OF CLOUD BROKERING ALGORITHMS IN CLOUD BASED DATA CENTER
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 330-334
Energy efficient virtual machine provisioning in cloud data centers
A cloud data center consumes a great amount of electrical energy, resulting in a high level of carbon footprint. The reduction of electrical power consumption cuts down operational costs, and also improves system reliability for cloud based data centers. Data center power consumption is a critical issue that could be solved by consolidating servers' workload and turning off idle physical servers. We propose a heuristic based resource allocation policy for cloud based data centers in order to reduce operational costs. Our proposed technique shows that efficient resource allocation greatly reduces energy consumption, which leads to minimize operational costs. One of the more significant findings to emerge from this study is that, based on CPU utilization and live migration, proposed algorithm helps to minimize energy costs. The present study provides additional evidence with respect to environmental issues.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 330-334
Energy efficient virtual machine provisioning in cloud data centers
A cloud data center consumes a great amount of electrical energy, resulting in a high level of carbon footprint. The reduction of electrical power consumption cuts down operational costs, and also improves system reliability for cloud based data centers. Data center power consumption is a critical issue that could be solved by consolidating servers' workload and turning off idle physical servers. We propose a heuristic based resource allocation policy for cloud based data centers in order to reduce operational costs. Our proposed technique shows that efficient resource allocation greatly reduces energy consumption, which leads to minimize operational costs. One of the more significant findings to emerge from this study is that, based on CPU utilization and live migration, proposed algorithm helps to minimize energy costs. The present study provides additional evidence with respect to environmental issues.
- Open Access
- 9 July 2010
- Published by Academy and Industry Research Collaboration Center (AIRCC) in International journal of Computer Networks & Communications
- Vol. 2 (4) , 84-95
Implementation of the Trigonometric LMS Algorithm using original CORDIC ROTATION
The LMS algorithm is one of the most successful adaptive filtering algorithms. It uses the instantaneous value of the square of the error signal as an estimate of the mean-square error (MSE). The LMS algorithm changes (adapts) the filter tap weights so that the error signal is minimized in the mean square sense. In Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS), two new versions of LMS algorithms, same formulations are performed as in the LMS algorithm with the exception that filter tap weights are now expressed using trigonometric and hyperbolic formulations, in cases for TLMS and HLMS respectively. Hence appears the CORDIC algorithm as it can efficiently perform trigonometric, hyperbolic, linear and logarithmic functions. While hardware-efficient algorithms often exist, the dominance of the software systems has kept those algorithms out of the spotlight. Among these hardware- efficient algorithms, CORDIC is an iterative solution for trigonometric and other transcendental functions. Former researches worked on CORDIC algorithm to observe the convergence behavior of Trigonometric LMS (TLMS) algorithm and obtained a satisfactory result in the context of convergence performance of TLMS algorithm. But revious researches directly used the CORDIC block output in their simulation ignoring the internal step-by-step rotations of the CORDIC processor. This gives rise to a need for verification of the convergence performance of the TLMS algorithm to investigate if it actually performs satisfactorily if implemented with step-by-step CORDIC rotation. This research work has done this job. It focuses on the internal operations of the CORDIC hardware, implements the Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS) algorithms using actual CORDIC rotations. The obtained simulation results are highly satisfactory and also it shows that convergence behavior of HLMS is much better than TLMS.Comment: 12 pages, 5 figures, 1 table. Published in IJCNC; http://airccse.org/journal/cnc/0710ijcnc08.pdf, http://airccse.org/journal/ijc2010.htm
- 9 July 2010
- Published by Academy and Industry Research Collaboration Center (AIRCC) in International journal of Computer Networks & Communications
- Vol. 2 (4) , 84-95
Open AccessImplementation of the Trigonometric LMS Algorithm using original CORDIC ROTATION
The LMS algorithm is one of the most successful adaptive filtering algorithms. It uses the instantaneous value of the square of the error signal as an estimate of the mean-square error (MSE). The LMS algorithm changes (adapts) the filter tap weights so that the error signal is minimized in the mean square sense. In Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS), two new versions of LMS algorithms, same formulations are performed as in the LMS algorithm with the exception that filter tap weights are now expressed using trigonometric and hyperbolic formulations, in cases for TLMS and HLMS respectively. Hence appears the CORDIC algorithm as it can efficiently perform trigonometric, hyperbolic, linear and logarithmic functions. While hardware-efficient algorithms often exist, the dominance of the software systems has kept those algorithms out of the spotlight. Among these hardware- efficient algorithms, CORDIC is an iterative solution for trigonometric and other transcendental functions. Former researches worked on CORDIC algorithm to observe the convergence behavior of Trigonometric LMS (TLMS) algorithm and obtained a satisfactory result in the context of convergence performance of TLMS algorithm. But revious researches directly used the CORDIC block output in their simulation ignoring the internal step-by-step rotations of the CORDIC processor. This gives rise to a need for verification of the convergence performance of the TLMS algorithm to investigate if it actually performs satisfactorily if implemented with step-by-step CORDIC rotation. This research work has done this job. It focuses on the internal operations of the CORDIC hardware, implements the Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS) algorithms using actual CORDIC rotations. The obtained simulation results are highly satisfactory and also it shows that convergence behavior of HLMS is much better than TLMS.Comment: 12 pages, 5 figures, 1 table. Published in IJCNC; http://airccse.org/journal/cnc/0710ijcnc08.pdf, http://airccse.org/journal/ijc2010.htm