Autonomic cloud resource sharing for intercloud federations

Recent advances in information technology make remote collaboration and resource sharing easier for next generation distributed systems, such as grids and clouds. One common model of study is the convergence of these systems, along with interclouds to a unified global computing resource. Despite similarities between grids and clouds, there are a number of fundamental differences that make this convergence process harder. For example, clouds have inherent administrative boundaries, something which the grid computing paradigm avoided from the early stages of research. Such administrative boundaries primarily affect capabilities of clouds to be interoperable. Moreover, they also negatively affect the possibility of a seamless intercloud federation on the path to convergence. Resource sharing in general and related communication methodologies, such as information dissemination and matchmaking are also integral elements in this convergence process. To help improve the success of distributed cloud resource schedulers, we propose proxies that disseminate information as agents of dissemination sources. Such proxies can then make information about resource states available at 'distant' clouds, where there may be no direct, or even no indirect control. Moreover, they can make this resource state available more efficiently than where no proxies are used. In particular, with proxies, dissemination overhead is reduced by up to 65% under different scenarios, where existing solutions may not even produce efficient protocols. In addition, proxies help reduce dissemination overhead by 19% on average. Our results also show that randomly selecting proxy nodes perform comparably to other strategies that may select proxies based on particular criteria.

[1]  David S. Rosenblum,et al.  Design of a Scalable Event Notification Service: Interface and Architecture , 1998 .

[2]  Deger Cenk Erdil,et al.  Adaptive dissemination protocols for hybrid grid resource scheduling , 2007 .

[3]  Yongguang Zhang,et al.  Dynamic multicast information dissemination in hybrid satellite-wireless networks , 1999, MobiDe '99.

[4]  Nael B. Abu-Ghazaleh,et al.  Proxy-based Grid Information Dissemination , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[5]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Iradj Ouveysi,et al.  Dissemination of dynamic multimedia content in networked virtual environments , 2006 .

[7]  Rajesh Raman,et al.  Matchmaking: distributed resource management for high throughput computing , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[8]  Erik Maehle,et al.  Swarm intelligence for self-reconfiguring walking robot , 2008, 2008 IEEE Swarm Intelligence Symposium.

[9]  Thomas F. La Porta,et al.  Dynamic proxy tree-based data dissemination schemes for wireless sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[10]  Thamarai Selvi Somasundaram,et al.  A Grid resource brokering strategy based on resource and network performance in Grid , 2012, Future Gener. Comput. Syst..

[11]  Leili Mohammad Khanli,et al.  FRDT: Footprint Resource Discovery Tree for grids , 2011, Future Gener. Comput. Syst..

[12]  Sarbani Roy,et al.  Efficient resource management for running multiple concurrent jobs in a computational grid environment , 2011, Future Gener. Comput. Syst..

[13]  Praveen Yalagandula,et al.  A scalable distributed information management system , 2004, SIGCOMM 2004.

[14]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[15]  Keith Marzullo,et al.  Directional Gossip: Gossip in a Wide Area Network , 1999, EDCC.

[16]  Andrea Clematis,et al.  Job-resource matchmaking on Grid through two-level benchmarking , 2010, Future Gener. Comput. Syst..

[17]  Deborah Estrin,et al.  A hierarchical proxy architecture for Internet-scale event services , 1999, Proceedings. IEEE 8th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE'99).

[18]  Johan Tordsson,et al.  Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions , 2008, Future Gener. Comput. Syst..

[19]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[20]  Prashant J. Shenoy,et al.  Dissemination of dynamic data , 2001, SIGMOD '01.

[21]  Michael Dahlin,et al.  Transparent Information Dissemination , 2004, Middleware.

[22]  Toby Velte,et al.  Cloud Computing, A Practical Approach , 2009 .

[23]  Michael J. Lewis,et al.  Grid Resource Scheduling with Gossiping Protocols , 2007 .

[24]  Indranil Gupta,et al.  Scalable fault-tolerant aggregation in large process groups , 2001, 2001 International Conference on Dependable Systems and Networks.

[25]  James Cowie Hongbo Liu Jason Liu David Nicol Andy Ogielski Towards Realistic Million-Node Internet Simulations , 1999 .

[26]  Balachander Krishnamurthy,et al.  Flash crowds and denial of service attacks: characterization and implications for CDNs and web sites , 2002, WWW.

[27]  David M. Nicol,et al.  Towards Realistic Million-Node Internet Simulation , 1999, PDPTA.

[28]  Deger Cenk Erdil,et al.  Gossiping protocols for hybrid grid resource scheduling , 2009, Peer Peer Netw. Appl..