A distributed scheduling framework based on selfish autonomous agents for federated cloud environments

Palmieri, Francesco; Buonanno, Luigi; Venticinque, Salvatore; Aversa, Rocco; Martino, Beniamino Di

doi:10.1016/j.future.2013.01.012

Cited by 45 publications

(24 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Wei et al [15] present an iterative and non-cooperative game theoretical approach to tackle equilibrium lack in Cloud allocations. The same problem is dealt by Palmieri et al [10], but by means of an agent-based approach towards a Nash equilibrium solution.…”

Section: Related Workmentioning

confidence: 96%

Multi-user variability configuration: A game theoretic approach

García-Galán

Trinidad

Ruiz–Cortés

2013

2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

Multi-user configuration is a neglected problem in variability-intensive systems area. The appearance of conflicts among user configurations is a main concern. Current approaches focus on avoiding such conflicts, applying the mutual exclusion principle. However, this perspective has a negative impact on users satisfaction, who cannot make any decision fairly. In this work, we propose an interpretation of multi-user configuration as a game theoretic problem.Game theory is a well-known discipline which analyzes conflicts and cooperation among intelligent rational decisionmakers. We present a taxonomy of multi-user configuration approaches, and how they can be interpreted as different problems of game theory. We focus on cooperative game theory to propose and automate a tradeoff-based bargaining approach, as a way to solve the conflicts and maximize user satisfaction at the same time.

show abstract

Section: Related Workmentioning

confidence: 96%

Multi-user variability configuration: A game theoretic approach

García-Galán

Trinidad

Ruiz–Cortés

2013

2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

show abstract

“…Jang et al [33] implement personal clouds that federate local, nearby and remote cloud resources to enhance the services available on mobile devices. Palmieri et al [34] use agent-based game-theoretic scheme for scheduling computing resources between providers in federated cloud infrastructures.…”

Section: Related Workmentioning

confidence: 99%

Incentive-based resource assignment and regulation for collaborative cloud services in community networks

Khan

Büyükşahin

Freitag

2015

Journal of Computer and System Sciences

View full text Add to dashboard Cite

Community networks are a successful example of a collective where communities operate ICT infrastructure and provide IP connectivity based on the principle of reciprocal resource sharing of network bandwidth. This sharing, however, has not extended to computing and storage resources, resulting in very few applications and services which are currently deployed within community networks. Cloud computing, as in today's Internet, has made it common to consume resources provided by public clouds providers, but such cloud infrastructures have not materialized within community networks. We analyse in this paper socio-technical characteristics of community networks in order to derive scenarios for community clouds. Based on an architecture for such a community cloud, we implement a prototype for the incentive-driven resource assignment component, deploy it in a testbed of community network nodes, and evaluate its behaviour experimentally. In simulations of large scale community cloud scenarios we study the behaviour of the incentive mechanism in different configurations. Our evaluation gives insight into how the developed mechanisms regulate the consumption of cloud resources taking into account the users' contributions, and how this regulation affects the system usage. Our results suggest a further integration of this regulation component into current cloud management platforms in order to open them up for the operation of an ecosystem of collaborative cloud services in community networks.

show abstract

“…The authors proposed a number of simplified, practically motivated variants of collocation game models for which they established convergence to the NE point as well as the price of anarchy (PoA) bounds. Finally, Palmieri et al (2013) analyzed a selfish scheduling scheme for federated cloud organizations based on independent and competing agents. The agents' behavior was conditioned by marginal costs, to force a kind of implicit coordination between the conflicting objectives of the various entities involved in the job allocation process.…”

Section: State Of the Artmentioning

confidence: 99%

“…Accordingly, they must be forced to interact in order to generate a competitive schedule in which all the users will have their jobs processed in the cloud (Palmieri et al, 2013). This can be achieved by incorporating the global goal of the system into the local interests of all agents and such a formulation of the local interaction rules that will allow to achieve those interests.…”

Section: Construction Of the Competitive Scheduling Solutionmentioning

confidence: 99%

Decentralized Job Scheduling in the Cloud Based on a Spatially Generalized Prisoner’s Dilemma Game

Gźsior

Seredyński

2015

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach is based on the Pareto dominance relationship and implemented at an individual user level. To select the best scheduling strategies from the resulting Pareto frontiers and construct a global scheduling solution, we developed a decision-making mechanism based on the game-theoretic model of Spatial Prisoner's Dilemma, realized by selfish agents operating in the two-dimensional cellular automata space. Their behavior is conditioned by the objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The performance of the scheduler applied is verified by a number of numerical experiments. The related results show the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources involved in the scheduling process.

show abstract

A distributed scheduling framework based on selfish autonomous agents for federated cloud environments

Cited by 45 publications

References 18 publications

Multi-user variability configuration: A game theoretic approach

Multi-user variability configuration: A game theoretic approach

Incentive-based resource assignment and regulation for collaborative cloud services in community networks

Decentralized Job Scheduling in the Cloud Based on a Spatially Generalized Prisoner’s Dilemma Game

Contact Info

Product

Resources

About