Nasrin Akhter

Mrs. Nasrin Akhter


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 May 2016 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
NANasrin Akhter
Nasrin Akhter
MOMohamed Othman
Mohamed Othman

1 February 2024 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
NANasrin Akhter
Nasrin Akhter
MMMd. Redowan Mahmud
Md. Redowan Mahmud
JJJiong Jin
Jiong Jin
JBJason But
Jason But
IAIftekhar Ahmad
Iftekhar Ahmad
YXYong Xiang
Yong Xiang
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.

9 July 2010 in International journal of Computer Networks & Communications
Verified
Journal Article
Open access
NANasrin Akhter
Nasrin Akhter
KFKaniz Fatema
Kaniz Fatema
LFLilatul Fersouse
Lilatul Fersouse
FKFaria Khandaker
Faria Khandaker
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

14 September 2015 in Far East Journal of Electronics and Communications
Verified
Journal Article
Closed access
Ranesh NahaRanesh Naha
Ranesh Naha
MOMohamed Othman
Mohamed Othman
NANasrin Akhter
Nasrin Akhter

1 November 2014
Verified
Conference Paper
Closed access
PDF file
NANasrin Akhter
Nasrin Akhter
MOMohamed Othman
Mohamed Othman
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 January 2017 in International Journal of Communication Networks and Distributed Systems
Verified
Journal Article
Closed access
Ranesh NahaRanesh Naha
Ranesh Naha
MOMohamed Othman
Mohamed Othman
NANasrin Akhter
Nasrin Akhter
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.