High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

An Cost Effective Euclidean Steiner Tree Based Mechanism for Reducing Latency in Cloud

Author(s):

Rahul Kumar Sharma , MMMUT, Gorakhpur; Amrendra Singh Yadav, MMMUT, Gorakhpur; Mitra Bhushan, MMMUT, Gorakhpur; Mayank Deep Khare, MMMUT, Gorakhpur

Keywords:

Cloud Computing, Latency, Virtualization, Jitter, Round Trip Time

Abstract

Latency is the most effective performance factor in cloud. Online gaming and online shopping are totally depend on the performance of data service, If there is a large waiting time or queue delay in processing of request then the user will abort that and change the site. Here we are trying to reduce the latency in cloud. In this paper we are using to approaches one work between the user and data center that is iCloudAccess and another which work between the VM in the data center that is FARCREST. iCloudAccess is used to perform intelligently server provisioning and request dispatching, where on the other hand FARCREST is light weight real time service latency prediction system which is based on Euclidean Steiner Tree (EST) model that is used in delay-sensitive cloud services for optimum VM resource allocation. We perform iCloudAccess algorithm in that environment which is made the help of FARCREST mechanism to get minimum latency in our system.

Other Details

Paper ID: IJSRDV4I90218
Published in: Volume : 4, Issue : 9
Publication Date: 01/12/2016
Page(s): 993-996

Article Preview

Download Article