Comparison of Nash Bargaining and Myopic Equilibrium for Resources Allocation in Cloud Computing

Author(s):  
Giovanni Perin ◽  
Gianluca Fighera ◽  
Leonardo Badia
2017 ◽  
Vol 8 (7) ◽  
pp. 1011-1017
Author(s):  
Mr.Ashish Sharma ◽  
Dr.Sanjay Kumar

Cloud computing enables sharing of data over internet, hence the chances of security attacks also increases. So for the security of Data Sharing or Resources Allocation various Trust Models are implemented which provides security from various attacks. One of the efficient and improved Trust Model is implemented which increases the strength of Security in Cloud Computing [1]. Here in this paper various Trust Models their advantages and limitations are analyzed and com pare on the basis of various parameters. This paper deals with the analysis and survey of all the techniques implemented for Cloud Security so that on the basis of various issues a new and efficient Trust Model is implemented in Future.


2017 ◽  
Vol 27 (2) ◽  
pp. 293-307
Author(s):  
Henryk Krawczyk ◽  
Michał Nykiel

Abstract Using mobile devices such as smartphones or iPads for various interactive applications is currently very common. In the case of complex applications, e.g. chess games, the capabilities of these devices are insufficient to run the application in real time. One of the solutions is to use cloud computing. However, there is an optimization problem of mobile device and cloud resources allocation. An iterative heuristic algorithm for application distribution is proposed. The algorithm minimizes the energy cost of application execution with constrained execution time.


Author(s):  
Wei Ming ◽  
Zhang Chunyan ◽  
Qiu Feng ◽  
Cui Yu ◽  
Sui Qiangqiang ◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Xin Xu ◽  
Huiqun Yu

On-demand resource management is a key characteristic of cloud computing. Cloud providers should support the computational resource sharing in a fair way to ensure that no user gets much better resources than others. Another goal is to improve the resource utilization by minimizing the resource fragmentation when mapping virtual machines to physical servers. The focus of this paper is the proposal of a game theoretic resources allocation algorithm that considers the fairness among users and the resources utilization for both. The experiments with an FUGA implementation on an 8-node server cluster show the optimality of this algorithm in keeping fairness by comparing with the evaluation of the Hadoop scheduler. The simulations based on Google workload trace demonstrate that the algorithm is able to reduce resource wastage and achieve a better resource utilization rate than other allocation mechanisms.


Sign in / Sign up

Export Citation Format

Share Document