Research Article
A Firefly Colony and Its Fuzzy Approach for Server Consolidation and Virtual Machine Placement in Cloud Datacenters
Algorithm 1
Firefly colony algorithm for server consolidation.
Step 1. Initialize Number of physical machines (PMs), Number of virtual machines (VMs) | Step 2. Set List of physical machines and their current usage | Step 3. Generate VM request demands using the procedure given in Algorithm 2. | Step 4. Set Light absorption coefficient and maxIterations | Step 5. Initialize the attractiveness matrix | Step 6. Repeat | Step 7. For each firefly : NF (Number of Fireflies) | Step 8. Repeat | Step 9. For each physical server do | Step 10. Issue a new server from the set of random ordered physical servers | Step 11. Determine the set of eligible virtual machines using (19) | Step 12. Repeat | Step 13. For each residual VM that is eligible to be placed in the currently chosen server | Step 14. Calculate the heuristic information of the VM-PM mapping using (13) | Step 15. Calculate the attractiveness of the VM-PM mapping using (16)-(17) | Step 16. End For | Step 17. Decide the next VM to place in server by applying pseudo random proportional rule (Equation (14)) | Step 18. Apply local attractiveness updating rule according to (21) | Step 19. Until no remaining VM can be placed in the server anymore | Step 20. Until all VMs are placed in the server | Step 21. End For | Step 22. Find iteration best firefly solution | Step 23. ifffSC then | Step 24. | Step 25. | Step 26. End if | Step 27. Apply global attractiveness update rule according to (22) | Step 28. Until the maximum iteration is reached |
|