2016
DOI: 10.14257/astl.2016.123.40
|View full text |Cite
|
Sign up to set email alerts
|

Application of Ant Colony Algorithm in Cloud Resource Scheduling Based on Three Constraint Conditions

Abstract: Abstract. Aiming at the problem of resource scheduling in cloud computing, an ant colony algorithm based on the three constraint conditions is proposed. The implementation of this method is divided into three steps: With the help of the information elicitation factor and expect inspiration factor, with the help of the pheromone intensity design pheromone update strategy, with the help of three constraints to complete the optimization process. Experimental results show that the three constraint conditions ant c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…In this section, results of proposed scheme is compared with ''A Trusted Real-Time Scheduling Model for Wireless Sensor Networks'' (referred as TRTSM scheme in graphs) [31]. Figure 11 indicates that increase in node density w.r.t.…”
Section: Results Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…In this section, results of proposed scheme is compared with ''A Trusted Real-Time Scheduling Model for Wireless Sensor Networks'' (referred as TRTSM scheme in graphs) [31]. Figure 11 indicates that increase in node density w.r.t.…”
Section: Results Analysismentioning
confidence: 99%
“…An Ant Colony Algorithm (ACA) based on the three constraint conditions to determine the issue of resource scheduling in edge/fog and cloud computing is presented in [31]. Ant colony algorithm operates in three phases: information elicitation factor, expect inspiration factor, and pheromone update strategy.…”
Section: Literature Surveymentioning
confidence: 99%
“…Ant colony algorithm is a random search algorithm, which has been applied in the research of TSP class problems. It uses natural ants routing way of artificial simulation, the main characteristic is to search for the optimal path through the positive feedback, the distributed cooperation [22][23][24][25].…”
Section: Traditional Ant Colony Algorithmmentioning
confidence: 99%
“…This article is a revised and expanded version of a paper entitled Application of Ant colony Algorithm in Cloud Resource Scheduling Based on Three Constraint Conditions presented at The 5th International Conference on Computer Science and Technology April 22-23, 2016 at Suzhou Youngor Leidisen Hotel, Suzhou, China.…”
Section: Appendixmentioning
confidence: 99%