Yonggen Gu

A preemptive truthful VMs allocation online mechanism in private cloud

For the random arrival tasks, maximum of the social welfare by allocating the VMs in private cloud is concerned in this work. The model of VMs allocation online mechanism is built, which is single-valued, non-parallel, and preemptive. A preemptive online mechanism is proposed, the truthfulness is proved, and the competitive ratio is given in a simple situation. Many simulations are implemented using the real tasks from data center with the value exponential distribution, which indicate a good actual competitive ratio. Some results are revealed by comparison with offline optimum allocation in different C, λ, and the total payment from the users is also simulated according to different resource capacity.

Online Mechanism Design for VMs Allocation in Private Cloud

Resource allocation mechanism plays a critical role towards the success of cloud computing. Existing allocation mechanisms in public cloud is unsuitable for private IaaS cloud because they either cannot maximize the sum of users’ value, or provide no service guarantee. This paper proposes a novel online, model-free mechanism that makes different allocations for flexible jobs and inflexible jobs. Users presenting job are incentivized to be truthful not only about their valuations for VM units, but also about their arrival, departure and the character of jobs (flexible or inflexible). We simulate the proposed online mechanism using data from RICC, showing that, compared with the mechanism which adopts same allocation method for all jobs, using our mechanism leads to high social welfare and percentage of served users.

An online greedy allocation of VMs with non-increasing reservations in clouds

Dynamic VMs allocation plays an important role in resource allocation of cloud computing. In general, a cloud provider needs both to maximize the efficiency of resource and to improve the satisfaction of in-house users simultaneously. However, industrial experience has often shown only maximizing the efficiency of resources and providing poor or little service guarantee for users. In this paper, we propose a novel model-free virtual machine allocation, which is characterized by an online greedy algorithm with reservation of virtual machines, and is named OGAWR. We couple the greedy allocation algorithm with non-increasing reserving algorithms to deal with flexible jobs and inflexible jobs. With the OGAWR, users are incentivized to be truthful not only about their valuations, but also about their arrival, departure and the characters of jobs (flexible or inflexible). We simulated the proposed OGAWR using data from RICC. The results show that OGAWR can lead to high social welfare and high percentage of served users, compared with another mechanism that adopts the same method of allocation and reservation for all jobs. The results also prove that the OGAWR is an appropriate market-based model for VMs allocation because it works better for allocation efficiency and served users.

Game Analysis of Workload Factoring with the Hybrid Cloud

Cloud computing is a novel scalable and on-demand computing service where computing resources are offered over the Internet. Under the situation of coexistence of enterprise local resources and public cloud resources, the ultimate goal of in-house users is increasing their revenues by making the right mix decision for resources utilization. This paper introduces a free workload competing game model in which in-house users consider utility influenced by two primary factors: process cost and completion time. Firstly, for analyzing generalized utility functions of users, the cost-time indifference utility curve is proposed to describe the relationship of process cost, completion time and utility of the job. Secondly, we construct a general non-cooperative game model for resources utilization in which the generalized utility functions are classified into three types of indifference utility curve. By theoretical analysis, there must exist at least one Nash equilibrium for straight line and convex to origin of indifference utility curve, and the equilibrium exists when the utility function of each user is identical and homogeneity for concave to origin. Furthermore, we propose two suggestions for enterprise making right mix decisions for constructing and utilizing of private cloud based on the analysis of users actions in hybrid cloud.

An Open Approach for the Applied Pi Calculus

A notion of open bisimulation is proposed for the Applied Pi Calculus, which extends π-calculus in order to facilitate analyzing security protocols. Our notion is based on the labeled transition system, and takes a knowledge aware open approach to model knowledge in security protocols. It is shown to be sound to labeled bisimilarity and is a congruent relation. As a running example, we analyze two e-commerce protocol, namely iKP and Ferguson’s electronic cash protocol, by Applied Pi and open bisimilarity.

Analyzing iKP security in applied pi calculus

The security for electronic payments is very important in electronic commerce. Many electronic payment protocols have been proposed recently to meet the security requirements. Since the design of a protocol is a difficult and error-prone task, the use of formal methods that allow for the verification of such protocols has received increasing attention. In this paper we take a look at the iKP from the point of view of the applied pi calculus. The iKP is described in the calculus and some security properties, mainly the authentication and anonymity properties, are verified.

A Preemptive Truthful VMs Allocation Online Mechanism in Private Cloud

For the random arrival tasks, maximum of the social welfare by allocating the VMs in private cloud is concerned in this work. The model of VMs allocation online mechanism is built, which is single-valued, non-parallel, and preemptive. A preemptive online mechanism is proposed, the truthfulness is proved, and the competitive ratio is given in a simple situation. Many simulations are implemented using the real tasks from data center with the value exponential distribution, which indicate a good actual competitive ratio. Some results are revealed by comparison with offline optimum allocation in different C,λ, and the total payment from the users is also simulated according to different resource capacity.

A Game Theoretic Model and Tree Analysis Method for Fair Exchange Protocols

Exchange protocols are an important theoretic basis to make secure electronic commerce and electronic business transactions possible, in which the fairness is a crucial property. To ensure and verify the property, a specific model is proposed, based on the extensive game with imperfect information. Fairness is built in the protocol game and the corresponding game tree. To verify the property, a tree analysis method is offered, and a linear time algorithm is given. As a case study, some flaws of ASW protocol are found.

Symbolic Analysis of Authentication Protocol Based on GSPM

Formal methods are proved to be effective in analyzing security protocols. GSPM is a general model for formal analysis of security protocols by using process algebra and knowledge inference. In order to implement the automatic tool for verification, in this paper we introduce symbolic techniques into GSPM framework. Symbolic techniques can eliminate infinite branches caused by input actions. The analysis of NSPK is given as an example to illustrate such idea.

Probabilistic Applied Pi Calculus and Zero Knowledge

As zero-knowledge proof plays a more and more important role in modern cryptography, the need for formal analysis becomes more urgent. In this paper, we make use of formal methods to establish a zero-knowledge result. The formal model is probabilistic applied pi and the zero-knowledge proof is Hamiltonian cycle. By this example, our preliminary work shows how zero-knowledge can be modeled in formal models such as process calculi and how to establish a zero-knowledge proof by checking equivalence in the model.