\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Survey on Load Balancing in Cloud Computing},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2019-01-15 (revised: 15 January 2019)}
\def\TheID{\makeatother }
\def\TheDate{2019-01-15}
\title{Survey on Load Balancing in Cloud Computing}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{R.Gowri  Prakash}

             \author[2]{R.  Shankar}

             \author[3]{S.  Duraisamy}

             \affil[1]{  Bharathiar University}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 December 2018 Accepted: 1 January 2019 Published: 15 January 2019}

\maketitle


\begin{abstract}
        


Cloud computing is a biggest technology. It is different cloud services are SaaS, PaaS, aaS. loud users are able to access software and applications from whenever they need while it is being host by an outside party in cloud. Cloud services are bought on a pay-as-user-go or subscription basis. The cloud users getting into increased day by day. In this paper mainly focused on Load balancing within the cloud computing surroundings has a crucial impact on the performance. Smart load balancing makes cloud computing additional economical and improves user satisfaction. Load balancing may be a pc networking technique to distribute work load across multiple computer or a multiple cluster,

\end{abstract}


\keywords{cloud computing, load balancing, virtual machine, cloudsim}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
Fig.  {\ref 1}: Cloud computing deployment models loud Computing enables cloud customers to enjoy the on-demand high quality applications and services from a centralized pool of configurable computing resources. This new computing model can relieve the difficult of storage management, allow universal data access with independent geographical locations, and avoid capital expenditure on hardware, software, and personnel maintenances, etc. As cloud computing becomes mature, lots of sensitive data is considered to be centralized into the cloud servers, e.g. Personal health records, secret enterprise data, government documents, etc. Cloud Computing has attracted the enormous companies like Google, Microsoft, and Amazon and regarded as a great influence in today's data Technology industry. Business owners are attracted to cloud computing concept because of several features .Cloud computing refers to applications and services that run on a distributed network using virtualized resources and accessed by common internet protocols and networking standards. It is distinguished by the notion that resources square measure virtual and limitless which details of the physical systems on that C code runs square measure abstracted from the user. cloud computing using deployment models tells you where the cloud is located and for what purpose. Public, private, community, and hybrid clouds square measure readying models. Service models describe the sort of service that the service supplier is providing. The bestknown service models are Software as a Service, Platform as a Service, and Infrastructure as a Servicethe SPI model. The service models build on one another and define what a vendor must manage and client's responsibility is. 
\section[{a) Public cloud}]{a) Public cloud}\par
A public cloud is one based on the standard cloud computing model, in which a service provider makes resources, such as virtual machines (VMs), applications or storage, available to the general public over the internet. Public cloud services may be free or offered on a pay-per-usage model  {\ref [1]}. 
\section[{b) Private cloud}]{b) Private cloud}\par
The private cloud infrastructure is operated for the exclusive use of and organization. The cloud may be managed by that organization or a third party. Private clouds maybe either on-or off-premises.[1] 
\section[{c) Hybrid cloud}]{c) Hybrid cloud}\par
A hybrid cloud combines multiple clouds (private, community of public) where those clouds retain their unique identities, but are bound together as a unit. A hybrid cloud may offer standardized or proprietary access to data and applications, as well as application portability[3]. 
\section[{d) Community cloud}]{d) Community cloud}\par
A community cloud in computing is a collaborative effort in which infrastructure is shared between several organizations from a specific community with common concerns (security, compliance, jurisdiction, etc.), whether managed internally or by a third-party and hosted internally or externally  {\ref [2]}. 
\section[{II.}]{II.} 
\section[{Services of Cloud Computing}]{Services of Cloud Computing}\par
As acloud computing has developed different vendors offer cloud that have different services associated with them.\par
Software as a Service (Saas): this is the top most layer of the cloud computing stack directly consumed by end user .i.e Saas. ? Next generation Saas promises every things as a services over the internet.\par
? Cloud computing started with similar premises. ? A computing paradigm where them exists a fixable set of computing resources across the internet. 
\section[{[3]}]{[3]}\par
Platform as a Service (PaaS): This provides a service to the user for the layer of package platform. It provides a storage device for the mixed applications and expenditure. User will have associate degree freedom to create their individual applications that gives communications for the user. It presents predefined parts of united OS and also the application server, e.g. LAMP platforms. 
\section[{Infrastructure as a Service (IaaS):}]{Infrastructure as a Service (IaaS):}\par
This provides a service to the user for the essential storage and processor infrastructure as a service over the network. For this service user have to be compelled to pay charges, once they use this service over network. During this process the cloud computing give a service over the web, hardware and package in datacenters as a service. The datacenter of hardware and package is termed as Cloud [3].  
\section[{Benefits of Cloud Computing}]{Benefits of Cloud Computing}\par
The ultimate aim of cloud computing benefits are [4]:-Flexibility: There is high rate flexibility.\par
Speed \& Scales: traditional methods to buy and configure hardware and software are time consuming\par
Easier management of data and information: Sine all data are located on centralized location, data are more or organized making it easy to managed.\par
Device diversity: we can access our application and anywhere in the world on any system.\par
Increased storage capacity: increased storage capacity is another benefits cloud computing. as it can store more data as compare to a personal computer.\par
Easy to learn and understand: since people are quite used to cloud application like Gmail, Google docs so anything related to same is most likely to be understood by user.\par
Automatic updating: Its saves companies time and effort to update multiple servers.\par
Risk: Cloud computing services means taking services from remote servers.\par
Security: security and privacy are the biggest concerns about cloud computing.\par
Migration Issue: migration problem is also a big concern about cloud computing. 
\section[{IV.}]{IV.} 
\section[{Need for Load Balancing}]{Need for Load Balancing}\par
The fundamental point of load adjusting is to appropriate the traffic among the hub similarly in the group to improve things execution of system.\par
The point of load adjusting is as per the following: 1. To improve the surety of administrations to the purchaser. 2. To improve the client fulfillment. 3. To expand use of asset. 4. To diminish the execution time and holding up time of undertaking originating from various area \hyperref[b1]{[8]}. 5. To make administration execution better. 6. Keep up bunch steadiness. 7. Assemble a framework that can endure the shortcomings. 8. Accommodate future adjustment. V. Load Balancing in Cloud Computing\par
Load balancing improve the distribution of workload across multiple computing resource for a cluster, network links, control processing unit, disk drive.\par
Load balancing is a technique used to distribute workloads uniformly across servers or other compute resources to optimize network efficiency, reliability and capacity. Load balancing is performed by an appliance --either physical or virtual --that identifies in real time which server in a pool can best meet a given client request, while ensuring heavy network traffic doesn't unduly overwhelm a single server.\par
In addition to maximizing network capacity and performance, load balancing provides failover. If one server fails, a load balancer immediately redirects its workloads to a backup server, thus mitigating the impact on end users.\par
Load balancing is usually categorized as supporting either Layer 4 or Layer 7. Layer 4 load balancers distribute traffic based on transport data, such as IP addresses and Transmission Control Protocol (TCP) port numbers. Layer 7 load-balancing devices make routing decisions based on applicationlevel characteristics that include HTTP header information and the actual contents of the message, such as URLs and cookies. Layer 7 load balancers are more common, but Layer 4 load balancers remain popular, particularly in edge deployments. 
\section[{Goals of Load Balancing}]{Goals of Load Balancing}\par
? Archive optimal resource utilization ? Maximize throughput ? Minimize response time ? Avoid overload ? Avoid crashing One of the most normally used applications of load balancing is to be produced one web services from multiple server, generally refer to as server farm. Normally load balanced system widespread website, massive web relay chat network, high band with transfer Protocol sites, Network News Transfer Protocol (NNTP) servers, name System (DNS) servers, and databases[2]. By leveling application request across multiple servers, a load balancer reduces individual server load and prevent any one of application server from changing into one purpose of failure therefore rising overall application accessibility and responsiveness. The load balancing algorithms can be categorized mainly into two groups asdiscussed in the following section. 
\section[{a) Static Algorithms}]{a) Static Algorithms}\par
Static algorithms divide the traffic equivalently between Servers. By this approach the traffic on the servers will be disdained easily and it will make the Situation more imperfect. This algorithm, which divides the traffic equally, is announced as round robin algorithm. However, there were lots of problems associated with this algorithm. Therefore, weighted round robin was developing to improve the critical issues of round robin. In weighted round robin algorithm each servers is assigned a weight and according to the highest weight they receive more connections. In a situation, when all the weights become equal, servers will receive balanced traffic [5]. 
\section[{b) Dynamic Algorithms}]{b) Dynamic Algorithms}\par
Dynamic algorithms designate proper weights on servers dynamically by searching the whole network. The lightest server is loaded to balance the traffic. However, selecting an appropriate server needs real time communication with the networks, which leads to extra traffic added to the system. Dynamic algorithm predicates on query that are made frequently on servers. However, sometimes prevailed traffic prevents these queries to be answered, and correspondingly more added overhead can be distinguished on network [5]. 
\section[{VI. Load Balancing Algorithm in Cloud Computing}]{VI. Load Balancing Algorithm in Cloud Computing}\par
There are various load balancing algorithms used in cloud computing. In this study of this paper following different algorithms have been studied. The following are:\par
Round Robin: Round Robin is simplest algorithm that use the time slicing mechanism. The one of static load balancing algorithm. round robin algorithm is job allocation method. Here time is divided into several sectors and each node is given a specific time quantum interval and quantum node operation [6] in scheduling a time a time quantum plays a very important role, because if the time slice is very large, hen the round robin scheduling algorithm is the same as the FCFS planning  {\ref [6]}.\par
The disadvantages of the method is that although the algorithm, is very simple. but it determine the quantum size, it generates an additional load scheduler. it has higher context switches that increase the turn round time, and low throughput.\par
First Come First Serve: First come, first served (FCFS) is a working framework procedure planning calculation and a system direction-finding the board instrument that naturally executes lined demands and procedures by the request of their entry. With first come, first served, what starts things out is taken care of first; the following solicitation in line will be executed once the one preceding it is finished. FCFS for parallel handling and is going for the Asset with the littlest holding up line time and is chosen for the approaching job. The Cloud Sim toolbox underpins First Come First Serve (FCFS) planning procedure for interior planning of occupations. Assignment of application-explicit VMs to Hosts in a Cloud-based server farm is the obligation of the virtual machine provisioned part. The default approach Serve (FCFS) premise. The Inconveniences of FCFS is that it is non preemptive..Its turnaround and reaction is very low \hyperref[b0]{[7]}.\par
Global scheduling algorithm: VM resource scheduling in cloud computing environment in this main advantages solution in which on the system after arrangement . in this way is load balancing and reduces or avoids dynamic migration hence resolve the problem of load balancing and high migration cost caused by traditional scheduling algorithm. therefore a monitoring and analyzing mechanism is needed to better solve the problem of load balancing. This is also a further research subject \hyperref[b4]{[11]}.\par
Min-Min Load balancing algorithm: Min-Min is a static load adjusting calculation, where the parameters related to the activity are perceived ahead of time. Min\textunderscore Min algorithm, the execution and completion time of the unassigned waiting in queue are identified by the cloud manager. The jobs with minimum execution in time are being assigned first to the processors, so that the task is completed in time. But the tasks with maximum execution need to wait for a specific period of time. As such, all the all the tasks in the processor must be updated and the tasks in the queue must be removed. The task with minimum time execution performs better than the maximum time execution. The main disadvantage of this algorithm is that it leads to starvation. The terminology related to static load balancing for Min-Min is [6]. Opportunistic Load balancing algorithm: it is also one of the static load balancing algorithm. do not consider the present workload in virtual machine. Usually keeps each and every node busy. In this algorithm in with unexecuted task is quickly and in random order to the current node. Each one task is assigned to the node randomly. Disadvantages of the method is that although the algorithm provides a load balancing schedule bus dose not produce in good result. The task in a slow manner. were the current execution time of the node is not calculated \hyperref[b1]{[8]}.\par
Generalized Priority Algorithm: Client characterize the need as per the client request you need to characterize the parameter of cloudlet like size, memory, data transfer scheduling policy and so on. In the proposed technique, the task are first organized by their size to such a that one having most highest size has highest position.\par
The key factor for prioritizing task is their size and for Vmis their MIPS. This task performing better than foe FCFS and Round Robin algorithm. The virtual machine is prioritized according to their MIPS values such that one having highest MIPS has highest rank \hyperref[b0]{[7]}.\par
Weighted Round Robin Algorithm: weighted round robin Algorithm consider the resource capabilities of the VMs and assigns higher number of task to the higher capacity VMs based on the weight age given to each of the VMs. But it failed to consider the length of the task to select the appropriate \hyperref[b2]{[9]}. 
\section[{Weighted Active Monitoring Load Balancer (AMLB):}]{Weighted Active Monitoring Load Balancer (AMLB):}\par
The active monitoring load balancer maintain information about every VMs and number of requests currently allocated to which virtual machine. When a allocate new VM arrives it identifies the least loaded VM. If there are more then one, the first identified is selected. Active VM Load balancer return the VM id to the data center controller. The data controller sends the request to virtual machine identified id. Data center controller notifies the new allocation and cloudlet is sent to it. The proposed algorithm to implemented in cloud computing using cloudsim toolkit. In java language. these VMs of different processing tasks and request assigned virtual machine to optimized performance parameters such as response time and data processing time giving an load balancing algorithm in cloud environment \hyperref[b3]{[10]}. process queue. It needs to maintain a separate queue for each and every node. Depending on the priority, the task is taken into concern, by removing the task that is waiting in the overloaded machine. The tasks removed are loaded into lightly loaded machine. Those tasks are known as scout bee for the next step \hyperref[b1]{[8]}. The behavior of honey bee in load balancing has stimulated to reduce the response time of virtual machine, which also reduces the waiting time. The main disadvantage of this algorithm is, it does not show any improvement in throughput \hyperref[b1]{[8]}. 
\section[{Biased Random Sampling Load Balancing Algorithm:}]{Biased Random Sampling Load Balancing Algorithm:}\par
Biased Random Sampling is a dynamic load balancing algorithm. Here, random sampling method is being used to achieve the load balancing across all the nodes. In this algorithm, all the servers are treated as nodes. This method is represented in the form of virtual graph, constructed with the connectivity which represents the load on each node. Each node is taken as vertex in a directed graph. When a request is received from the client to the load balancer, the load balancer assigns the job to the node that has a minimum of one indegree. Once a job is assigned to the node, the server starts executing the job, indicating the reduction in availability of free resources. After the completion of the job, the node gets incremented by one in-degree, indicating the increase in available resources. The addition and deletion of such processes are completed by the process of random sampling technique. Threshold value is used as a parameter that considers each and every process by representing the maximum walk length. The traversal is from one node to another node until finding a designation is known as a walk. After receiving the request from the load balancer, it compares the current node to the randomly selected node with the threshold value. If the threshold value is equal or greater than the current walk length, the node executes its job, or else it moves to another neighbor node that is randomly selected. The performance decreases as the number of servers increases \hyperref[b5]{[13]}. 
\section[{Ant Colony Optimization Based Load Balancing}]{Ant Colony Optimization Based Load Balancing}\par
Algorithm: This algorithm is designed to seek out the optimal path among the food and colony of ant, based on its actions. The main aim of this approach is to distribute the work load among the nodes in an efficient manner. The regional load balancing node is preferred as head node in Cloud Computing Service Provider. As the request is being sent, the ant starts is first movement from the head node. The ants collect the information from the cloud node and assign the tasks to the particular node. Once the task is assigned to the head node, the ant moves in a forward direction with the overloaded node to the next node checking whether the node is overloaded or not. During the movement, if it finds any loaded node again it moves in a forward direction, else it finds the overloaded node, it moves in backward direction and replaces were the node found before .Once the job gets successful it is updated, then the result is reported based on the individual result of the ant. After receiving the individual result they are combined together to build the complete report. The solution set is updated automatically, when the ant updates the result for every movement. To prevent backward movement, the ant commits suicide when it reaches the target node \hyperref[b6]{[14]}. 
\section[{Throttled Load balancing Algorithm (TLB)}]{Throttled Load balancing Algorithm (TLB)}\par
This algorithm load balancer maintains tables of virtual machine indexes as available are running state (buys). The client server first to make request the data center to find a suitable virtual machine perform the recommended tasks. The data center request a load balancer to distribute virtual machine load balancer scans the index table from available virtual machine index table is scan completed. VMs is found the data center passes request to virtual machine identified in a identifier. 
\section[{Fig. 5: Throttled Algorithm}]{Fig. 5: Throttled Algorithm}\par
Data center confirms the load balancing of the new distribution and data center appropriately revises the index table. When processing a client request, if the corresponding virtual machines not found load balancer returns-1 to the data center. The data center request is processed by the data center \hyperref[b6]{[14]}. 
\section[{Ant Colony Optimization Based Load Balancing}]{Ant Colony Optimization Based Load Balancing}\par
Algorithm: This algorithm is designed to seek out the optimal path among the food and colony of ant, based on its actions. The main aim of this approach is to distribute the work load among the nodes in an efficient manner. The regional load balancing node is preferred quantity of available honey. After that, the reapers gather the honey from the sources. Then, again they go for the waggle dance to specify the honey that is left. In load balancing, the servers are combined together as virtual servers, where each and every virtual server has a finds any loaded node again it moves in a forward direction, else it finds the overloaded node, it moves in backward direction and replaces were the node found before  {\ref [6]}.Once the job gets successful it is updated, then the result is reported based on the individual result of the ant. After receiving the individual result they are combined together to build the complete report. The solution set is updated when the ant updates the result for every movement. To prevent backward movement, the ant commits suicide when it reaches the target node \hyperref[b5]{[13]}.\par
Active Clustering load balancing Algorithm: Active Clustering is an improved method of random sampling. The concept of clustering is used in this algorithm. The main principle of this algorithm is grouping similar nodes together, and working based on those grouped nodes. Grouping of nodes helps the resources to increase the throughput efficiently. In this algorithm, a method called match-maker is introduced \hyperref[b0]{[7]}.While an execution starts, the first node selects the neighbor node. The neighbor node is taken as match make node, which connects the neighbor node that is same as initial node. At last the match maker node gets disconnected. And this process is done iteratively to balance the load equally. The system performance is improved highly, by increasing the throughput. There is an efficient utilization of resources when there is an increase in throughput.\par
Block-based load-balancing algorithm: Entity Resolution with multiple keys in Map Reduce. Actually, the authors extended the Block Split algorithm presented in  {\ref Kolb et al. (2011)} by considering more than one blocking key. In their algorithm, the load distribution in the Reduce phase is more precise because an entity pair may exist in a block only when the number of common blocking keys between the pair exceeds a certain threshold (i.e., kc). Since an entity may have more than one kc key, it needs to generate all the combinations of kc keys for potential key comparisons. The proposed algorithm features in the combination based blocking and loadbalanced matching. Experiments using the well-known Cite Seer X digital library showed that the proposed algorithm was both scalable and efficient.\par
Genetic Algorithm: A genetic algorithm for scheduling and load balancing for static parallel heterogeneous system. Their techniques consider five main factors: Encoding generation of initial populations, fitness function, selection operator and crossover operator.\par
Each task is considered as a gene. A generation of an initial random population for entry into the first generation was done by the genetic algorithm. Random generator functions of chromosomes are employed. Individual are selected according to their fitness value. Once fitness values have been evaluated for all chromosomes, good chromosomes is selected through rotating roulette wheel strategy. Crossover operator randomly selects two parent chromosomes (chromosomes with higher values have more chance to be selected) and randomly chooses their crossover points, and mates them to produce two child (offspring) chromosomes. However, their approach was able to reduce response time and execution time when compared with LPT, SPT and FIFO algorithms. node, the ant moves in a forward direction with the overloaded node to the next node checking whether the node is overloaded or not. During the movement, if it particular node. Once the task is assigned to the head as head node in Cloud Computing Service Provider. As the request is being sent, the ant starts is first movement from the head node. The ants collect the information from the cloud node and assign the tasks to the Table1: This table find the load balancing techniques 
\section[{References}]{References}\begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Fig. 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Fig. 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{figure5}}\end{figure}
 			\footnote{© 2019 Global JournalsSurvey on Load Balancing in Cloud Computing} 		 		\backmatter  			 \par
From table1 and table2 the various nature various load balancing techniques and the timeline are mentioned in a clear manner. This is very helpful to the researchers. 
\subsection[{VII.}]{VII.} 
\subsection[{Conclusion}]{Conclusion}\par
The performance of the various load balancing algorithms are studied this paper. Load balancing is an important technique for improving distributed system performance by considering the group of hosts in the system to share their workloads. This results in a better utilization of hosts resources, a high system throughput and quick response time of user requests. In load sharing, the incoming client requests are evenly distributed among the participating hosts. Load balancing is a basic errand in cloud computing condition to accomplish greatest usages of assets. In this various proposed algorithm are numerous performance to study parameters in cpu cost, memory cost, configuration time and distance cost.  
\subsection[{REFERENCES RÉFÉRENCES REFERENCIAS}]{REFERENCES RÉFÉRENCES REFERENCIAS}			 			  				\begin{bibitemlist}{1}
\bibitem[Dharmesh Kashyap (2014)]{b1}\label{b1} 	 		\textit{A survey of various Load balancing Alogoritham in cloud computing},  		 			Dharmesh Kashyap 		.  		nov 2014. p. .  	 	 (Vol3,issuse11 pp) 
\bibitem[Amit Agarwal, saloni Jain Efficient optimal Algorithm of task scheduling in cloud computing environment]{b0}\label{b0} 	 		\textit{Amit Agarwal, saloni Jain Efficient optimal Algorithm of task scheduling in cloud computing environment},  		 	 
\bibitem[Mishra and Jaiswal ()]{b3}\label{b3} 	 		‘Ant colony Optimization: A Solution of Load balancing in Cloud’.  		 			Ratan Mishra 		,  		 			Anant Jaiswal 		.  	 	 		\textit{IJWesT}  		2012.  	 
\bibitem[Violettan]{b5}\label{b5} 	 		\textit{chernenkaya" load balancing in cloud computing},  		 			Violettan 		.  		 9788-1-5386-4340- 2/18/\&2018IEEE.  		 	 
\bibitem[James and Verma ()]{b2}\label{b2} 	 		‘Efficient VM load balancing algorithm for a cloud computing environment’.  		 			Jasmin James 		,  		 			Dr Bhupendra Verma 		.  	 	 		\textit{IJCSE}  		2012.  	 
\bibitem[Bhoi et al. (ed.) (2013)]{b4}\label{b4} 	 		\textit{Load Balancing Algorithms in Cloud Computing Environment-A Methodical Comparison},  		 			Upendra Bhoi 		,  		 			N Purvi 		,  		 			Ramanuj 		.  		4, 12. J. Uma, V. Ramasamy, A. Kaleeswaran (ed.)  		April 2013. Feb 2014. 2 p. .  	 	 (Enhanced Max-Min Task Scheduling Algorithm in Cloud Computing) 
\bibitem[Gupta and Sanghwan (2015)]{b6}\label{b6} 	 		‘Load Balancing in Cloud Computing: A Review’.  		 			Shikha Gupta 		,  		 			Suman Sanghwan 		.  	 	 		\textit{International Journal of Science, Engineering and Technology Research}  		June 2015. 4  (6) .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
