Migration decision for hybrid mobility in reconfigurable distributed virtual machines

Virtual machine (VM) is an important mechanism to multiplex computer resources. The increasing popularity of network computing has renewed research interests in the adaptive and distributed virtual machines. Service migration is a vital technique to construct reconfigurable VMs. By incorporating mobile agent technology, VM systems can improve their resource utilization, load-balancing and fault-tolerance significantly. This work focuses on the decision problem of hybrid mobility for load-balancing in reconfigurable distributed VMs. We tackle this problem from three aspects: migration candidate determination, migration timing and destination server selection. The service migration timing and destination server selection are formulated as two optimization models. We derive the optimal migration policy for distributed and heterogeneous systems based on stochastic optimization theories. Renewal processes are applied to model the dynamics of migration. We solve the agent migration problem by dynamic programming and extend the optimal service migration decision by considering the interplay of the hybrid mobility. Our decision policy is complementary to the existing service and agent migration techniques. Its accuracy is verified by simulations.

[1]  Le Yi Wang,et al.  Optimal Remapping in Dynamic Bulk Synchronous Computations via a Stochastic Control Approach , 2003, IEEE Trans. Parallel Distributed Syst..

[2]  Cho-Li Wang,et al.  JESSICA2: a distributed Java Virtual Machine with transparent thread migration support , 2002, Proceedings. IEEE International Conference on Cluster Computing.

[3]  Santosh Pande,et al.  Compiler scheduling of mobile agents for minimizing overheads , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[4]  Le Yi Wang,et al.  Stochastic Prediction of Execution Time for Dynamic Bulk Synchronous Computations , 2004, The Journal of Supercomputing.

[5]  Cheng-Zhong Xu,et al.  A mobile agent based push methodology for global parallel computing , 2000 .

[6]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[7]  Jiannong Cao,et al.  Scalable load balancing on distributed web servers using mobile agents , 2003, J. Parallel Distributed Comput..

[8]  Renato J. O. Figueiredo,et al.  A case for grid computing on virtual machines , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[9]  Giovanni Vigna,et al.  Understanding Code Mobility , 1998, IEEE Trans. Software Eng..

[10]  Cheng-Zhong Xu,et al.  Distributed shared arrays: A distributed virtual machine with mobility support for reconfiguration , 2006, Cluster Computing.

[11]  Wilson H. Tang,et al.  Probability concepts in engineering planning and design , 1984 .

[12]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[13]  Joel H. Saltz,et al.  Dynamic Remapping of Parallel Computations with Varying Resource Demands , 1988, IEEE Trans. Computers.

[14]  Emin Gün Sirer,et al.  Design and implementation of a distributed virtual machine for networked computers , 2000, OPSR.

[15]  David Wong,et al.  Java-based mobile agents , 1999, CACM.

[16]  G. Cybenko,et al.  The Travelling Agent Problem , 1998 .

[17]  M. Rosenblum,et al.  Optimizing the migration of virtual computers , 2002, OSDI '02.

[18]  William E. Weihl,et al.  Lottery scheduling: flexible proportional-share resource management , 1994, OSDI '94.