Suki Arif
Universiti Utara Malaysia
Routing protocolForwarding planeDynamic priority schedulingWireless networkThe InternetScheduling (computing)AlgorithmCacheDistributed computingTabu searchWorld Wide WebLoad balancing (computing)Network packetCode (cryptography)Mobile deviceGridNetwork congestionConstant-weight codeData scienceInformation-centric networkingComputer networkActive queue managementComputer scienceCode division multiple accessQuality of serviceResource (project management)Bit error rateGrid computingDecision ruleLink-state routing protocolEnd userMobile ad hoc network
27Publications
5H-index
138Citations
Publications 27
Newest
#1Mowafaq Salem Alzboon (Jadara University)H-Index: 1
#2Massudi Mahmuddin (UUM: Universiti Utara Malaysia)H-Index: 9
Last. Suki Arif (UUM: Universiti Utara Malaysia)H-Index: 5
view all 3 authors...
The increased number of computers, enlarged network bandwidth, more powerful computers, consumed resources and the acceptance of the Internet has driven the ongoing demand for new and better ways to execute huge problems in shared computing infrastructure such as grid and P2P computing. Resource discovery is extremely significant and challenging issues in Grid and P2P. It is complex because resources are heterogeneous, dynamic, geographically distributed, manageability and autonomous. A well-org...
Source
#1Omar DakkakH-Index: 2
#2Shahrudin Awang Nor (UUM: Universiti Utara Malaysia)H-Index: 6
Last. Yousef Fazea (UUM: Universiti Utara Malaysia)H-Index: 10
view all 4 authors...
Classical scheduling mechanisms don’t satisfy the requirements for the end user, especially if the number of the jobs has increased massively in grid computing environment. To meet the expectations for non-trivial applications, the efficiency of the system has to be improved and the resources have to be ultimately utilized. Thus, backfilling technique becomes highly required due to its efficiency in exploiting the resources by filling the gaps that was created in the scheduler by short jobs. The...
Source
#1Mohammed Al-SammanH-Index: 2
#2Suhaidi HassanH-Index: 16
Last. Suki ArifH-Index: 5
view all 3 authors...
#1Mohammed Al-SammanH-Index: 2
#2Suhaidi HassanH-Index: 16
Last. Suki ArifH-Index: 5
view all 3 authors...
#1Omar DakkakH-Index: 2
Last. Suki ArifH-Index: 5
view all 5 authors...
Grid Computing is a set of resources; the separate computational power of these resources has combination to execute a huge task. Usually, in a Computational Grid environment, the main resource is the Central Processing Unit (CPU), mostly used in research fields that demand high computational power to perform massive and complicated calculations. Cloud Computing is a promising computing pattern which offers facilities and common resources on demand over the Web. The implementation of cloud compu...
2 CitationsSource
#2Suki ArifH-Index: 5
Last. Mohd Hasbullah OmarH-Index: 5
view all 3 authors...
For quite a while, data replication has attracted the attention of many researchers in the field of data grid system, with a few researchers focusing on data replication in a federated data grid environment.The central goal of data replication mechanisms is to improve data locality, by creating more copies of the most popular files, and evicting unpopular files. In the conventional data grid systems, a common practice was to evaluate popular files based on economic approach, which evicts unpopul...
#1Musa Sule Argungu (UUM: Universiti Utara Malaysia)
#2Suki Arif (UUM: Universiti Utara Malaysia)H-Index: 5
Last. Mohd Hasbullah Omar (UUM: Universiti Utara Malaysia)H-Index: 5
view all 3 authors...
Grid federation is fast emerging as an alternative solution to the problems posed by the large data handling and computational needs of the existing numerous worldwide scientific projects. Efficient access to such extensively distributed data sets has become a fundamental challenge in grid computing. Creating and placing replicas to suitable sites, using data replication mechanisms can increase the system’s performance. Data Replication reduces data access time, ensures load balancing as well as...
Nov 1, 2017 in TENCON (IEEE Region 10 Conference)
#1Omar Dakkak (UUM: Universiti Utara Malaysia)H-Index: 2
#2Shahrudin Awang Nor (UUM: Universiti Utara Malaysia)H-Index: 6
Last. Suki Arif (UUM: Universiti Utara Malaysia)H-Index: 5
view all 3 authors...
To tackle complex and massive number of jobs sent by end users, a powerful and dedicated computational resources are required. Grid computing provides such environment in which applications may run for a quite long time. Therefore, efficient scheduling policy is indispensable. In our previous work, a mechanism named Swift Gap followed by developed completion time rule is introduced. This paper deeply analysis the interactions between the introduced mechanism with the simulated workloads and the ...
1 CitationsSource
Nov 1, 2017 in TENCON (IEEE Region 10 Conference)
#1Suhaidi Hassan (UUM: Universiti Utara Malaysia)H-Index: 16
#2Atheer F. Hassan (UUM: Universiti Utara Malaysia)
Last. Suki Arif (UUM: Universiti Utara Malaysia)H-Index: 5
view all 3 authors...
An Active Queue Management (AQM) is a proactive scheme that controls the network congestion by avoiding the congestion before it happened. When implementing AQM in wireless networks several contemporary issues must be considered, such as interference, collisions, multipath-fading, propagation distance, shadowing effects and route failure, and whether the wireless networks is WLAN or other type. Therefore, the needs for AQM algorithm that can perform in WLAN network as good and efficient as in wi...
Source
#1Suhaidi Hassan (UUM: Universiti Utara Malaysia)H-Index: 16
#2Atheer F. Hassan (UUM: Universiti Utara Malaysia)
Last. Suki Arif (UUM: Universiti Utara Malaysia)H-Index: 5
view all 3 authors...
Active Queue Management (AQM) is scheme to handle network congestion before it happened by deciding which packet has to be dropped, when to drop it, and through which port have to drop when it has become or is becoming congested. Furthermore, AQM schemes such as Random Early Detection (RED), Random Early Marking (REM), Adaptive Virtual Queue (AVQ), and Controlled Delay (CoDel) have been proposed to maintain fairness when unresponsive constant bit rate UDP flows share a bottleneck link with respo...