2012 UKSim 14th International Conference on Computer Modelling and Simulation 2012
DOI: 10.1109/uksim.2012.11
|View full text |Cite
|
Sign up to set email alerts
|

Load Balancing of Nodes in Cloud Using Ant Colony Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
100
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 192 publications
(100 citation statements)
references
References 8 publications
0
100
0
Order By: Relevance
“…Kumar Nishant et al [6] have implemented a modified Ant Colony Optimization (ACO) Algorithm for the purpose of load balancing suitable for both cloud and grid computing environment. In contrast to regular ACO, in this modified algorithm each ant updates its own result set after each iteration rather than updating the result set given by head ant.…”
Section: Related Workmentioning
confidence: 99%
“…Kumar Nishant et al [6] have implemented a modified Ant Colony Optimization (ACO) Algorithm for the purpose of load balancing suitable for both cloud and grid computing environment. In contrast to regular ACO, in this modified algorithm each ant updates its own result set after each iteration rather than updating the result set given by head ant.…”
Section: Related Workmentioning
confidence: 99%
“…Kumar Nishant, Pratik Sharma, Vishal Krishna, Nitin and Ravi Rastogi [6] have developed the ACO algorithm for load distribution of workloads among nodes of a cloud by the use of Ant Colony Optimization (ACO).ACO is inspired from the ant colonies that work together in foraging behavior. The ants work together in search of new sources of food and simultaneously use the existing food sources to shift the food back to the nest.…”
Section: Figure1 Cloud Computingmentioning
confidence: 99%
“…The ants work together in search of new sources of food and simultaneously use the existing food sources to shift the food back to the nest. The ant use two types of pheromone for its movement these are [8] …”
Section: Aco(ant Colony Optimization)mentioning
confidence: 99%
“…In our algorithm the ant would lay down foraging pheromone after encountering under loaded nodes for searching overloaded nodes. Therefore, after an ant comes up to an under loaded node it will try to find the next path through foraging pheromone [8].…”
Section: Foraging Pheromone (Fp)mentioning
confidence: 99%