Stochastic modeling and analysis of hybrid mobility in reconfigurable distributed virtual machines

Virtualization provides a vehicle to manage the available resources and enhance their utilization in network computing. System dynamics requires virtual machines be distributed and reconfigurable. To construct reconfigurable distributed virtual machines, service migration moves the runtime services among physical servers when necessary. By incorporating the mobile agent technology, distributed virtual machines can improve their resource utilization and service availability significantly. This paper focuses on finding the optimal migration policies for service and agent migrations for high throughput in reconfigurable distributed virtual machines. We analyze three issues of this decision problem: migration candidate determination, migration timing and destination server selection. The service migration timing and destination server selection are formulated by two optimization models. We derive the optimal migration policy for distributed and heterogenous 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. We verify the accuracy of our migration decision policy in simulations.

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

[2]  Le Yi Wang,et al.  Optimal periodic remapping of bulk synchronous computations on multiprogrammed distributed systems , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[3]  Sheldon M. Ross,et al.  Introduction to Probability Models (4th ed.). , 1990 .

[4]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

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

[6]  Cheng-Zhong Xu,et al.  Distributed Shared Arrays: An Integration of Message Passing and Multithreading on SMP Clusters , 2005, The Journal of Supercomputing.

[7]  Cheng-Zhong Xu,et al.  Service migration in distributed virtual machines for adaptive grid computing , 2005, 2005 International Conference on Parallel Processing (ICPP'05).

[8]  Cheng-Zhong Xu,et al.  Migration decision for hybrid mobility in reconfigurable distributed virtual machines , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[9]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[10]  Luiz André Barroso,et al.  Web Search for a Planet: The Google Cluster Architecture , 2003, IEEE Micro.

[11]  Cong Du,et al.  HPCM: a pre-compiler aided middleware for the mobility of legacy code , 2003, 2003 Proceedings IEEE International Conference on Cluster Computing.

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

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

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

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

[16]  Monica S. Lam,et al.  Optimizing the migration of virtual computers , 2002, OPSR.

[17]  Sheldon M. Ross,et al.  Introduction to Probability Models, Eighth Edition , 1972 .

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

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

[20]  Le Yi Wang,et al.  Optimal periodic remapping of dynamic bulk synchronous computations , 2003, J. Parallel Distributed Comput..

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

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

[23]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

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

[25]  Marianne Shaw,et al.  Denali: Lightweight Virtual Machines for Distributed and Networked Applications , 2001 .

[26]  Emin Gün Sirer,et al.  Design and implementation of a distributed virtual machine for networked computers , 1999, SOSP.

[27]  Le Yi Wang,et al.  Optimal remapping in dynamic bulk synchronous computations via a stochastic control approach , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[28]  Sathish S. Vadhiyar,et al.  A performance oriented migration framework for the grid , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[29]  Tal Garfinkel,et al.  Terra: a virtual machine-based platform for trusted computing , 2003, SOSP '03.

[30]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[31]  Michael T. Goodrich,et al.  A bridging model for parallel computation, communication, and I/O , 1996, CSUR.

[32]  Xuxian Jiang,et al.  SODA: a service-on-demand architecture for application service hosting utility platforms , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.

[33]  George Cybenko,et al.  The Traveling Agent Problem , 2001, Math. Control. Signals Syst..

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

[35]  Gian Pietro Picco,et al.  Understanding code mobility , 1998, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

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

[37]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[38]  Francis C. M. Lau,et al.  Load balancing in parallel computers - theory and practice , 1996, The Kluwer international series in engineering and computer science.