GRASP-based resource re-optimization for effective big data access in federated clouds

Federated cloud organizations, spanning across multiple networked sites that provide both computing and storage resources, can be considered the state-of-the-art solutions for providing multi-tenant runtime services in modern distributed processing environments. In these scenarios, by re-optimizing the communication paths between virtual machines and big data sources, at evenly spaced interval or when required by circumstances, the overall communication and runtime resource utilization on the cloud infrastructure is re-balanced, so that more virtual machines can be allowed to access the needed big data sources with adequate bandwidth, thereby significantly improving the perceived performance and quality of service. The problem of re-optimization is tackled with a powerful meta-heuristic, the greedy randomized adaptive search procedure (GRASP), augmented by path re-linking. In order to evaluate the proposed approach, extensive simulations have been performed, leading to very interesting results, demonstrating the effectiveness and validity of the underlying ideas and their applicability to real large-scale federated cloud scenarios. Efficient re-optimization strategy for big data access in multi-tenant cloud infrastructures.Based on a Greedy Randomized Adaptive Search meta-heuristic working on a flexible federated cloud model.Performs end-to-end path rerouting and Virtual Machine migration to improve access to big data.Rebalances cloud resource usage so that more virtual machines can effectively access data sources.

[1]  Rolf Stadler,et al.  Resource Management in Clouds: Survey and Research Challenges , 2015, Journal of Network and Systems Management.

[2]  Viktor K. Prasanna,et al.  A unified resource scheduling framework for heterogeneous computing environments , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[3]  Richard J. La,et al.  OPNp1-2: Reconfiguration of Survivable MPLS/WDM Networks , 2006, IEEE Globecom 2006.

[4]  Francesco Palmieri,et al.  Network-aware scheduling for real-time execution support in data-intensive optical Grids , 2009, Future Gener. Comput. Syst..

[5]  Alexandre Plastino,et al.  GRASP with Path-Relinking for the Maximum Diversity Problem , 2005, WEA.

[6]  Francine Berman,et al.  The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[7]  Florin Pop,et al.  Adaptive Resource Management and Scheduling for Cloud Computing , 2014, Lecture Notes in Computer Science.

[8]  Miron Livny,et al.  Harnessing the Capacity of Computational Grids for High Energy Physics , 2000 .

[9]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[10]  Kavitha Ranganathan,et al.  Simulation Studies of Computation and Data Scheduling Algorithms for Data Grids , 2003, Journal of Grid Computing.

[11]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[12]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[13]  Samee Ullah Khan,et al.  Data Scheduling in Data Grids and Data Centers: A Short Taxonomy of Problems and Intelligent Resolution Techniques , 2013, Trans. Comput. Collect. Intell..

[14]  Marco Mellia,et al.  A realistic model to evaluate routing algorithms in the Internet , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[15]  Francesco Palmieri,et al.  A GRASP-based network re-optimization strategy for improving RWA in multi-constrained optical transport infrastructures , 2010, Comput. Commun..

[16]  F. Glover Scatter search and path relinking , 1999 .

[17]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[18]  Fatos Xhafa,et al.  Computational models and heuristic methods for Grid scheduling problems , 2010, Future Gener. Comput. Syst..

[19]  T. V. Lakshman,et al.  Network aware resource allocation in distributed clouds , 2012, 2012 Proceedings IEEE INFOCOM.

[20]  Michael Thomas,et al.  Data Intensive and Network Aware (DIANA) Grid Scheduling , 2007, Journal of Grid Computing.

[21]  Vasileios Pappas,et al.  Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.

[22]  Zahir Tari,et al.  Pareto frontier for job execution and data transfer time in hybrid clouds , 2014, Future Gener. Comput. Syst..

[23]  Alfredo De Santis,et al.  A Cluster-Based Data-Centric Model for Network-Aware Task Scheduling in Distributed Systems , 2013, International Journal of Parallel Programming.

[24]  Matthew Caesar,et al.  Walk the line: consistent network updates with bandwidth guarantees , 2012, HotSDN '12.

[25]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .