TY - JOUR
T1 - An Efficient Multi-Cloud Service Composition Using a Distributed Multiagent-Based, Memory-Driven Approach
AU - Kendrick, Philip
AU - Baker, Thar
AU - Maamar, Zakaria
AU - Hussain, Abir
AU - Buyya, Rajkummar
AU - Al-Jumeily, Dhiya
PY - 2018/11/18
Y1 - 2018/11/18
N2 - Cloud services are often distributed across several data centers requiring new scalable approaches to efficiently perform searching to reduce the energy and price cost of fulfilling requests. Multiagent-based systems have arisen as a powerful technique for improving distributed processing on a wide scale, which can operate in environments where partial observability is the norm and the cost of prolonged search can be exponential. In this paper, we present a multiagent-based service composition approach, using agent-matchmakers and agent-representatives, for the efficient retrieval of distributed services and propagation of information within the agent network to reduce the amount of brute-force search. Our extensive simulation results indicate that by introducing localized agent-based memory searches, the amount of actions (with their associated energy costs) can be reduced by over 50 percent which results in a lower energy cost per composition request.
AB - Cloud services are often distributed across several data centers requiring new scalable approaches to efficiently perform searching to reduce the energy and price cost of fulfilling requests. Multiagent-based systems have arisen as a powerful technique for improving distributed processing on a wide scale, which can operate in environments where partial observability is the norm and the cost of prolonged search can be exponential. In this paper, we present a multiagent-based service composition approach, using agent-matchmakers and agent-representatives, for the efficient retrieval of distributed services and propagation of information within the agent network to reduce the amount of brute-force search. Our extensive simulation results indicate that by introducing localized agent-based memory searches, the amount of actions (with their associated energy costs) can be reduced by over 50 percent which results in a lower energy cost per composition request.
U2 - 10.1109/TSUSC.2018.2881416
DO - 10.1109/TSUSC.2018.2881416
M3 - Article
VL - 6
SP - 358
EP - 369
JO - IEEE Transactions on Sustainable Computing
JF - IEEE Transactions on Sustainable Computing
IS - 3
ER -