A Distributed Application Component Placement Approach for Cloud Computing Environment

In cloud computing environment, it is common for a multi-component application to be deployed into the IT infrastructure on demand. Although the Application Component Placement Problem or ACP has been studied both in the academy and industry for some years, so far these approaches all rely on a centralized node to collect the information about the network topology and hosts of the targeting environment so that it can make the optimized decision. In cloud environment, computing resources are shared by many applications and the IT infrastructure is dynamically changing, which makes collecting the dynamic information of the environment a more difficult task. In addition, when two or more clouds are involved in the deployment, there may exist privacy concern between different clouds so that a centralized approach cannot be applied. In this paper, we propose a distributed approach to solve the ACP problem. In our approach, we transform the ACP into a Distributed Constraint Optimization Problem or DCOP and solving the ACP becomes solving the DCOP. The detail of the algorithm and experiments are given.

[1]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[2]  Shahid H. Bokhari,et al.  A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System , 1981, IEEE Transactions on Software Engineering.

[3]  Barbora Buhnova Component Placement in Distributed Environment w.r.t. Component Interaction , 2006 .

[4]  Wesley W. Chu,et al.  Task Allocation in Distributed Data Processing , 1980, Computer.

[5]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[6]  Boi Faltings,et al.  ODPOP: An Algorithm for Open/Distributed Constraint Optimization , 2006, AAAI.

[7]  Vijay Karamcheti,et al.  Constrained component deployment in wide-area networks using AI planning techniques , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[8]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[9]  Dirk Beyer,et al.  Automated application component placement in data centers using mathematical programming , 2008, Int. J. Netw. Manag..

[10]  Arnold L. Rosenberg,et al.  Application Placement on a Cluster of Servers , 2007, Int. J. Found. Comput. Sci..

[11]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[12]  Barbora Zimmerová Component Placement in Distributed Environment w.r.t. ComponentInteraction , 2006 .

[13]  Adrian Petcu,et al.  A Class of Algorithms for Distributed Constraint Optimization , 2009, Frontiers in Artificial Intelligence and Applications.

[14]  Boi Faltings,et al.  PC-DPOP: A New Partial Centralization Algorithm for Distributed Optimization , 2007, IJCAI.

[15]  Colin Low Decentralised application placement , 2005, Future Gener. Comput. Syst..

[16]  Boi Faltings,et al.  H-DPOP: Using Hard Constraints to Prune the Search Space , 2007, IJCAI 2007.

[17]  Asser N. Tantawi,et al.  Dynamic placement for clustered web applications , 2006, WWW '06.