scholarly journals A Performance Analysis of Virtual Mail Server on Type-2 Hypervisors

2021 ◽  
Vol 18 (13) ◽  
Author(s):  
Faizan Ali KHAJI ◽  
Sri Varun POTLURI ◽  
Anil Kumar KAKELLI

Virtualization is now the most efficient and successful procedure to use server resources. Virtualization is a technology that will efficiently allow the instructions or programs based on the available hardware. With the help of virtualization, we can achieve benefits like reduced capital and operating costs, minimized downtime, increased productivity, and good disaster recovery, etc. This work compares the virtual mail server performance on 3 different Hypervisor software. The 3 different type-2 hypervisor software we chose to compare were Kernel-based Virtual Machine (KVM), Oracle VirtualBox, and VMware. A computer system that sends and also receives an email over a network either on LAN or the internet is called a Mail Server. Although large ISPs and public email services have their dedicated hardware, in most cases, the web servers and mail servers are hosted on a single machine by virtualization. When a Mail server is implemented on the hypervisor, it is then considered as a virtual mail server. A virtual mail server is good at load balancing and has many more benefits. This paper presents how to implement a virtual mail server and shows the comparative results of the virtual mail server on different type-2 hypervisor software. HIGHLIGHTS Virtualization will efficiently run the instructions or programs based on the available hardware The virtual mail server has more significant advantages than the standard mail server. It helps in achieving faster deployment of mail servers with fewer hardware requirements Comparison of the performance of the virtual mail server on three different Type-2 Hypervisor software: Kernel-based Virtual Machine (KVM), Oracle VirtualBox, and VMware The web servers and mail servers can be hosted on a single machine by virtualization A virtual mail server is best for load balancing and disaster recovery as well

Author(s):  
Ibrahim Mahmood Ibrahim ◽  
Siddeeq Y. Ameen ◽  
Hajar Maseeh Yasin ◽  
Naaman Omar ◽  
Shakir Fattah Kak ◽  
...  

Today, web services rapidly increased and are accessed by many users, leading to massive traffic on the Internet. Hence, the web server suffers from this problem, and it becomes challenging to manage the total traffic with growing users. It will be overloaded and show response time and bottleneck, so this massive traffic must be shared among several servers. Therefore, the load balancing technologies and server clusters are potent methods for dealing with server bottlenecks. Load balancing techniques distribute the load among servers in the cluster so that it balances all web servers. The motivation of this paper is to give an overview of the several load balancing techniques used to enhance the efficiency of web servers in terms of response time, throughput, and resource utilization. Different algorithms are addressed by researchers and get good results like the pending job, and IP hash algorithms achieve better performance.


2014 ◽  
Vol 3 (4) ◽  
pp. 1-16 ◽  
Author(s):  
Harikesh Singh ◽  
Shishir Kumar

Load balancing applications introduce delays due to load relocation among various web servers and depend upon the design of balancing algorithms and resources required to share in the large and wide applications. The performance of web servers depends upon the efficient sharing of the resources and it can be evaluated by the overall task completion time of the tasks based on the load balancing algorithm. Each load balancing algorithm introduces delay in the task allocation among the web servers, but still improved the performance of web servers dynamically. As a result, the queue-length of web server and average waiting time of tasks decreases with load balancing instants based on zero, deterministic, and random types of delay. In this paper, the effects of delay due to load balancing have been analyzed based on the factors: average queue-length and average waiting time of tasks. In the proposed Ratio Factor Based Delay Model (RFBDM), the above factors are minimized and improved the functioning of the web server system based on the average task completion time of each web server node. Based on the ratio of average task completion time, the average queue-length and average waiting time of the tasks allocated to the web server have been analyzed and simulated with Monte-Carlo simulation. The results of simulation have shown that the effects of delays in terms of average queue-length and average waiting time using proposed model have minimized in comparison to existing delay models of the web servers.


2020 ◽  
Vol 10 (7) ◽  
pp. 2323
Author(s):  
T. Renugadevi ◽  
K. Geetha ◽  
K. Muthukumar ◽  
Zong Woo Geem

Drastic variations in high-performance computing workloads lead to the commencement of large number of datacenters. To revolutionize themselves as green datacenters, these data centers are assured to reduce their energy consumption without compromising the performance. The energy consumption of the processor is considered as an important metric for power reduction in servers as it accounts to 60% of the total power consumption. In this research work, a power-aware algorithm (PA) and an adaptive harmony search algorithm (AHSA) are proposed for the placement of reserved virtual machines in the datacenters to reduce the power consumption of servers. Modification of the standard harmony search algorithm is inevitable to suit this specific problem with varying global search space in each allocation interval. A task distribution algorithm is also proposed to distribute and balance the workload among the servers to evade over-utilization of servers which is unique of its kind against traditional virtual machine consolidation approaches that intend to restrain the number of powered on servers to the minimum as possible. Different policies for overload host selection and virtual machine selection are discussed for load balancing. The observations endorse that the AHSA outperforms, and yields better results towards the objective than, the PA algorithm and the existing counterparts.


Sign in / Sign up

Export Citation Format

Share Document