SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:umu-169470"
 

Search: onr:"swepub:oai:DiVA.org:umu-169470" > Cloud customers ser...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Cloud customers service selection scheme based on improved conventional cat swarm optimization

Gabi, Danlami (author)
Umeå universitet,Institutionen för datavetenskap,Department of Computer Science, Faculty of Science, Kebbi State University of Science and Technology, Aliero, Kebbi State, Nigeria
Ismail, Abdul Samad (author)
Zainal, Anazida (author)
show more...
Zakaria, Zalmiyah (author)
Abraham, Ajith (author)
Dankolo, Nasiru Muhammed (author)
show less...
 (creator_code:org_t)
2020-03-17
2020
English.
In: Neural Computing & Applications. - : Springer. - 0941-0643 .- 1433-3058. ; 32, s. 14817-14838
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • With growing demand on resources situated at the cloud datacenters, the need for customers' resource selection techniques becomes paramount in dealing with the concerns of resource inefficiency. Techniques such as metaheuristics are promising than the heuristics, most especially when handling large scheduling request. However, addressing certain limitations attributed to the metaheuristic such as slow convergence speed and imbalance between its local and global search could enable it become even more promising for customers service selection. In this work, we propose a cloud customers service selection scheme called Dynamic Multi-Objective Orthogonal Taguchi-Cat (DMOOTC). In the proposed scheme, avoidance of local entrapment is achieved by not only increasing its convergence speed, but balancing between its local and global search through the incorporation of Taguchi orthogonal approach. To enable the scheme to meet customers' expectations, Pareto dominant strategy is incorporated providing better options for customers in selecting their service preferences. The implementation of our proposed scheme with that of the benchmarked schemes is carried out on CloudSim simulator tool. With two scheduling scenarios under consideration, simulation results show for the first scenario, our proposed DMOOTC scheme provides better service choices with minimum total execution time and cost (with up to 42.87%, 35.47%, 25.49% and 38.62%, 35.32%, 25.56% reduction) and achieves 21.64%, 18.97% and 13.19% improvement for the second scenario in terms of execution time compared to that of the benchmarked schemes. Similarly, statistical results based on 95% confidence interval for the whole scheduling scheme also show that our proposed scheme can be much more reliable than the benchmarked scheme. This is an indication that the proposed DMOOTC can meet customers' expectations while providing guaranteed performance of the whole cloud computing environment.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

Cloud computing
Scheduling
Cat swarm optimization
Pareto dominance

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view