Ahvar, Ehsan and Ahvar, Shohreh and Crespi, Noel and Garcia-Alfaro, Joaquin and Mann, Zoltán Ádám (2015) NACER: a Network-Aware Cost-Efficient Resource allocation method for processing-intensive tasks in distributed clouds. In: 14th IEEE International Symposium on Network Computing and Applications, 2015.09.28-2015.09.30, Cambridge, MA.
|
Text
Ahvar_et_al_NCA_2015.pdf Download (1MB) | Preview |
Abstract
In the distributed cloud paradigm, data centers are geographically dispersed and interconnected over a wide- area network. Due to the geographical distribution of data centers, communication networks play an important role in distributed clouds in terms of communication cost and QoS. Large-scale, processing-intensive tasks require the cooperation of many VMs, which may be distributed in more than one data center and should communicate with each other. In this setting, the number of data centers serving the given task and the network distance among those data centers have critical impact on the communication cost, traffic and even completion time of the task. In this paper, we present the NACER algorithm, a Network-Aware Cost-Efficient Resource allocation method for optimizing the placement of large multi-VM tasks in distributed clouds. NACER builds on ideas of the A * search algorithm from Artificial Intelligence research in order to obtain better results than typical greedy heuristics. We present extensive simulation results to compare the performance of NACER with competing heuristics and show its effectiveness.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány Q Science / természettudomány > QA Mathematics / matematika > QA76 Computer software / programozás |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 19 Sep 2015 19:17 |
Last Modified: | 19 Sep 2015 19:17 |
URI: | http://real.mtak.hu/id/eprint/26982 |
Actions (login required)
![]() |
Edit Item |