A cooperative game based allocation for sharing data center networks

Virtual machine placement (VMP) technology is widely used in cloud computing systems. The existing VMP methods mainly aimed at improving the cloud resource utilization, such as load balancing among physical machines (PMs), but they may result in virtual machine (VM) performance degradation because of the great resource contention among VMs running on top of the same PM. In contract to existing VMP algorithms, this paper proposes a virtual machine (VM) Performance maximization and physical machine (PM) Load balancing Virtual Machine Placement method (PLVMP) in cloud, which tries to maximize VM performance and balance PM workload from both users’ and cloud providers’ perspectives. First, we study the relationship between PM workload and VM performance to train a new and improved VM performance model, which can predict VM performance more accurately and offer help to the following VMP. Second, we take VM performance maximization and PM workload balancing into account to formulate the VMP as an optimization problem, which tries to maximize VM performance for users and make load balancing among PMs for cloud providers. Third, we propose a greedy-based algorithm to solve the VMP problem efficiently. We then evaluate PLVMP with other VMP methods on CloudSim platform and a real OpenStack platform. The results show PLVMP can maximize the VM performance significantly and make a good load balancing among PMs.

In elastic cloud computing environment, multiple virtual machines may reside in the same physical machine for services consolidation. For the same residential guest domains or multi-tiered hosting services, the inter-domain communications are complex and frequent. However, traditional inter-domain communications are conducted through the virtual network interfaces of both sending and receiving virtual machines. Such TCP/IP networking communications involve lengthy communication path and frequent kernel interactions and thus downgrade the I/O performance of virtual machines. In this paper, we present an optimized inter-domain communication approach based on shared memory to improve the communication performance of multiple virtual machines residing in the same physical machine. In our approach, the sending data is shared in memory, not transferred via TCP/IP stack. The communication data are directly mapped into user space of the virtual machine and therefore it reduces useless system calls and context switches. The memory is shared via a customized shared device kernel module with bidirectional event channel resided in both communicating virtual machines. We use state flags in circular buffer to reduce wait and notify operations and thus reduce the system calls. Experiments show that our proposed approach can provide 5 time higher throughput and 2.5 times less latency compared to TCP/IP communication path.

Public Clouds are the backbone of the modern IT Industry. The modern tech start-ups to are heavily dependent on the Public Clouds as save the capital expenditure. Public Clouds offer a wide range of Virtual Infrastructure beginning from single core 0.25 GB RAM virtual machines to 128 cored 3904 GB RAM Virtual Servers aided with GPUs. Apart from costing, The performance of the virtual machines can impact on the services offered. The paper tries to analyse the performance of the Light virtual machines provided by the different cloud vendors and maps their ability to handle certain set of tasks. The prime objective is to compare the entry level virtual machines that are mostly used across the industry for the multiple purposes and find which is the efficient and productive. The systems under Test are the 1 GB RAM machines provided by the most popular Cloud service providers.

Bandwidth allocation and admission control scheme based on Nash bargaining solution for WiMAX systems

Purpose – The physical server transition to virtualized infrastructure server have encountered crucial problems such as server consolidation, virtual machine (VM) performance, workload density, total cost of ownership (TCO), and return on investments (ROIs). In order to solve the problems mentioned above, the purpose of this paper is to perform the analysis of virtualized cloud server together with shared storage as well as the estimation of consolidation ratio and TCO/ROI in server virtualization. Design/methodology/approach – This paper introduces five distinct virtualized cloud computing servers (VCCSs), and provides the appropriate assessment to five well-known hypervisors built in VCCSs. The methodology the authors proposed in this paper will gives people an insight into the problem of physical server transition to virtualized infrastructure server. Findings – As a matter of fact, VM performance seems almost to achieve the same level, but the estimation of VM density and TCO/ROI are totally different among hypervisors. As a result, the authors have the recommendation to choose the hypervisor ESX server if you need a scheme with higher ROI and lower TCO. Alternatively, Proxmox VE would be the second choice if you like to save the initial investment at first and own a pretty well management interface at console. Research limitations/implications – In the performance analysis, instead of ESX 5.0, the authors adopted ESXi 5.0 that is free software, its function is limited, and does not have the full functionality of ESX server, such as: distributed resource scheduling, high availability, consolidated backup, fault tolerance, and disaster recovery. Moreover, this paper do not discuss the security problem on VCCS which is related to access control and cryptograph in VMs to be explored in the further work. Practical implications – In the process of virtualizing the network, ESX/ESXi has restrictions on the brand of the physical network card, only certain network cards can be detected by the VM. For instance: Intel and Broadcom network cards. The newer versions of ESXi 5.0.0 and above now support parts of Realtek series (Realtek 8186, Realtek 8169, and Realtek 8111E). Originality/value – How to precisely assess the hypervisor for server/desktop virtualization is also of hard question needed to deal with it crisply before deploying new IT with VCCS on site. The authors have utilized the VMware calculator and developed an approach to server/desktop consolidation, virtualization performance, VM density, TCO, and ROIs. As a result, in this paper the authors conducted a comprehensive approach to analyze five well-known hypervisors and will give the recommendation for IT manager to choose a right solution for server virtualization.

In virtualized environments, the customers who purchase virtual machines (VMs) from a third-party cloud would expect that their VMs run in an isolated manner. However, the performance of a VM can be negatively affected by co-resident VMs. In this paper, the authors propose vExplorer, a distributed VM I/O performance measurement and analysis framework, where one can use a set of representative I/O operations to identify the I/O scheduling characteristics within a hypervisor, and potentially leverage this knowledge to carry out I/O based performance attacks to slow down the execution of the target VMs. The authors evaluate their prototype on both Xen and VMware platforms with four server benchmarks and show that vExplorer is practical and effective. The authors also conduct similar tests on Amazon’s EC2 platform and successfully slow down the performance of target VMs.

We experimentally evaluate the performance overhead of the virtual environments VMware Player, QEMU, VirtualPC and VirtualBox on a dual-core machine. Firstly, we assess the performance of a Linux guest OS running on a virtual machine by separately benchmarking the CPU, file I/O and the network bandwidth. These values are compared to the performance achieved when applications are run on a Linux OS directly over the physical machine. Secondly, we measure the impact that a virtual machine running a volunteer @home project worker causes on a host OS. Results show that performance attainable on virtual machines depends simultaneously on the virtual machine software and on the application type, with CPU-bound applications much less impacted than IO-bound ones. Additionally, the performance impact on the host OS caused by a virtual machine using all the virtual CPU, ranges from 10% to 35%, depending on the virtual environment.

The network, similar to CPU and memory, is a critical and shared resource in the cloud. However, unlike other resources, it is neither shared proportionally to payment, nor do cloud providers offer minimum guarantees on network bandwidth. The reason networks are more difficult to share is because the network allocation of a virtual machine (VM) X depends not only on the VMs running on the same machine with X , but also on the other VMs that X communicates with and the cross-traffic on each link used by X . In this paper, we start from the above requirements--payment proportionality and minimum guarantees--and show that the network-specific challenges lead to fundamental tradeoffs when sharing cloud networks. We then propose a set of properties to explicitly express these tradeoffs. Finally, we present three allocation policies that allow us to navigate the tradeoff space. We evaluate their characteristics through simulation and testbed experiments to show that they can provide minimum guarantees and achieve better proportionality than existing solutions.

As the size of data increases and computation becomes complicated in fog computing environments, the need for highperformance computation is increasing. One of the most popular ways to improve the performance of a virtual machine (VM) is to allocate a graphic processing unit (GPU) to the VM for supporting general purpose computing on graphic processing unit (GPGPU) operations. The direct pass-through, often used for GPUs in VMs, is popular in the cloud because VMs can use the full functionality of the GPU and experience virtually no performance degradation owing to virtualization. Direct pass-through is very useful for improving the performance of VMs. However, since the GPU usage time is not considered in the VM scheduler that operates based on the central processing unit (CPU) usage time of the VM, the VM performing the GPGPU operation degrades the performance of other VMs. In this paper, we analyze the effect of the VM performing the GPGPU operation (GPGPU-intensive VM) on other VMs through experiments. Then, we propose a method to mitigate the performance degradation of other VMs by dynamically allocating the resource usage time of the VM and preventing the priority preemption of the GPGPU-intensive VM.

Virtualization technology promotes the development of cloud computing technology, and cloud service providers provide many virtual machines with different configurations. It is becoming more and more important to analyze the performance of virtual machines based on the characteristics of the workload. This paper analyzes the performance of memory-intensive, compute-intensive and I/O intensive workloads running in virtual machines with different sizes. In order to avoid excessive overhead when comparing the performance of virtual machines, this paper proposes a performance prediction method for virtual machines based on the results of micro-benchmarks. Finally, this paper proposes the concept of virtual machine consistency. If a workload has the same performance in two virtual machines, we call the performance of the two virtual machines consistent with respect to this workload.

Virtual Machine Resource Allocation for Multimedia Cloud: A Nash Bargaining Approach

The workload of a data center has the characteristics of complexity and requirement variability. However, in reality, the attributes of network workloads are rarely used by resource schedulers. Failure to dynamically schedule network resources according to workload changes inevitably leads to the inability to achieve optimal throughput and performance when allocating network resources. Therefore, there is an urgent need to design a scheduling framework that can be workload-aware and allocate network resources on demand based on network I/O virtualization. However, in the current mainstream I/O virtualization methods, there is no way to provide workload-aware functions while meeting the performance requirements of virtual machines (VMs). Therefore, we propose a method that can dynamically sense the VM workload to allocate network resources on demand, and can ensure the scalability of the VM while improving the performance of the system. We combine the advantages of I/O para-virtualization and SR-IOV technology, and use a limited number of virtual functions (VFs) to ensure the performance of network-intensive VMs, thereby improving the overall network performance of the system. For non-network-intensive VMs, the scalability of the system is guaranteed by using para-virtualized Network Interface Cards (NICs) which are not limited in number. Furthermore, to be able to allocate the corresponding bandwidth according to the VM’s network workload, we hierarchically divide the VF’s network bandwidth, and dynamically switch between VF and para-virtualized NICs through the active backup strategy of Bonding Drive and ACPI Hotplug technology to ensure the dynamic allocation of VF. Experiments show that the allocation framework can effectively improve system network performance, in which the average request delay can be reduced by more than 26%, and the system bandwidth throughput rate can be improved by about 5%.

Cloud Computing is captivating many organizations and individuals because it provides a framework where the user can access diverse resources such as applications, storage capacity, network bandwidth, and many resources. Cloud users rent the resources that they need from the cloud provider. The optimum allocation of resources to the users in a dynamic environment is a major challenge for the cloud providers. Virtualization technology in Cloud enables allocation of resources to the end user applications in Cloud by hosting numerous Virtual Machines on a single host. There are number of approaches to decide the placement of Virtual Machines to the various hosts. As numbers of applications are submitted by the users, some of the hosts become overloaded and some become under loaded. As a result, some of the user applications hosted on a Virtual Machine of one host needs to be transferred to another Virtual Machine of another host. The migration of Virtual Machines from one host to another needs to be minimized to improve the response time, turnaround time for an end user application. This paper addresses the various VM placement and VM selection algorithms and their scope of improvement.

Cloud service providers offer virtual machines (VMs) as services to users over Internet. As VMs are running on physical machines (PMs), PM power consumption needs to be considered. Meanwhile, VMs running on the same PM share physical resources, and there exists great resource contention, which results in VM performance degradation. Therefore, how to place VMs to reduce PM power consumption and guarantee VM performance is still one major challenge. However, existing VMPs did not study VM performance degradation, so they could not guarantee VM performance. To solve the high power consumption and VMs performance degradation problems, this paper explores the balance between saving PM power and guaranteeing VM performance, and proposes a power-aware and performance-guaranteed VMP (PPVMP). First, we investigate the relationship between power consumption and CPU utilization to build a non-linear power model, which is helpful for the following VMP. Second, we construct VM performance models to present the VM performance degradation trend. Third, based on these models, we formulate VMP as a bi-objective optimization problem, which tries to minimize PM power consumption and guarantee VM performance. We then propose an algorithm based on ant colony optimization to solve it. Finally, the results show the efficiency of our algorithm.

Cloud computing manages system resources such as processing, storage, and networking by providing users with multiple virtual machines (VMs) as needed. It is one of the rapidly growing fields that come with huge computational power for scientific workloads. Currently, the scientific community is ready to work over the cloud as it is considered as a resource-rich paradigm. The traditional way of executing scientific workloads on cloud computing is by using virtual machines. However, the latest emerging concept of containerization is growing more rapidly and gained popularity because of its unique features. Containers are treated as lightweight as compared to virtual machines in cloud computing. In this regard, a few VMs/containers-associated problems of performance and throughput are encountered because of middleware technologies such as virtualization or containerization. In this paper, we introduce the configurations of VMs and containers for cloud-based scientific workloads in order to utilize the technologies to solve scientific problems and handle their workloads. This paper also tackles throughput and efficiency problems related to VMs and containers in the cloud environment and explores efficient resource provisioning by combining four unique methods: hyperthreading (HT), vCPU cores selection, vCPU affinity, and isolation of vCPUs. The HEPSCPEC06 benchmark suite is used to evaluate the throughput and efficiency of VMs and containers. The proposed solution is to implement four basic techniques to reduce the effect of virtualization and containerization. Additionally, these techniques are used to make virtual machines and containers more effective and powerful for scientific workloads. The results show that allowing hyperthreading, isolation of CPU cores, proper numbering, and allocation of vCPU cores can improve the throughput and performance of virtual machines and containers.