\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={Application Deployment Models with Load Balancing Mechanisms using Service Level Agreement Scheduling 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{2013-05-15 (revised: 15 May 2013)}
\def\TheID{\makeatother }
\def\TheDate{2013-05-15}
\title{Application Deployment Models with Load Balancing Mechanisms using Service Level Agreement Scheduling 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]{Prof. (Dr.) R. N.  Satpathy}

             \author[2]{Prof.(Dr.) C. R.  Panda}

             \affil[1]{  }

\renewcommand\Authands{ and }

\date{\small \em Received: 8 April 2013 Accepted: 30 April 2013 Published: 15 May 2013}

\maketitle


\begin{abstract}
        


Cloud computing is a market-oriented computing paradigm with virtually unlimited scalable high performance computing resources. The High level middleware services for cloud computing and cloud workflow systems are research frontier for both cloud computing and workflow technologies. In this paper, the extension of Cloud management infrastructure with Service Level Agreement (SLA) aware application and motivating scenario for the development of the scheduling heuristic after which, the detail design and implementation of the heuristic are mentioned.

\end{abstract}


\keywords{qos, SaaS, SLA, lom2his, cloudsim, vm, iaas, PaaS.}

\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
Loud Computing is a computing paradigm \hyperref[b1]{[2,}\hyperref[b6]{6]} that refers to variety of services available on internet which delivers computing functionality on the service provider's infrastructure. Cloud is a pool of virtualized computer resources and may be hosted on grid or utility computing environments \hyperref[b0]{[1,}\hyperref[b7]{7]}. Its potential feature which includes the ability to scale, to meet changing users demand, separation of infrastructure maintenance duties from users, location of infrastructure areas with electricity, sharing of peak load capacity and so on. In this modern technical ear, the recent popularity of cloud computing on the scenario of data and computation and investigation of intensive scientific workflow applications like, climate modeling, earthquake modeling, weather forecasting, disaster recovery simulation, Astrophysics and high energy physics \hyperref[b4]{[5,}\hyperref[b8]{8,}\hyperref[b9]{9]}. These scientific processes can be modeled or redesigned as scientific cloud workflow specifications at build-time modeling stage \hyperref[b4]{[5]}. These specifications contain number of data computation activities and their non-functional requirements such as Quos constraints on time and cost basis \hyperref[b10]{[10]}. At runtime execution stage, with the support of cloud workflow execution functionalities such as workflow scheduling \hyperref[b11]{[11]}, load balancing \hyperref[b2]{[3]} and temporal verification \hyperref[b3]{[4]}, cloud workflow instances are executed by employing the time and cost basis \hyperref[b10]{[10]}. At runtime execution stage, with the support of cloud workflow execution functionalities such as workflow scheduling \hyperref[b11]{[11]}, load balancing \hyperref[b2]{[3]} and temporal verification \hyperref[b3]{[4]}, cloud workflow instances are executed by employing the supercomputing and data sharing ability computing infrastructures with satisfactory Quos. Scientific applications are time constrained which required to be completed by satisfying a set of temporal constraints and global temporal constraints. The task execution time is the basic measurements for system performance, which need to be monitored and controlled by specific system management mechanisms. To ensure satisfactory temporal correctness and on time completion of workflow application is a critical issue for enhancing the overall performance. Cloud customers are interested in cost effective deployment of single applications in clouds, which is common in the Software as a Service (SaaS) delivery model. Commercial cloud providers such as sales force \hyperref[b24]{[24]} are offering the provision for single applications based on agreed SLA terms. Commercial providers use custom techniques, which are not open to the general public. To foster competitive cloud market and reduce cost, the need for open solutions is must. their applications on the Cloud resources based on the pre agreed SLA objectives. The application of how to deploy the available virtual machines in the Cloud to ensure their performance and enforce the agreed SLA objectives including the challenge to manage resources to achieve high utilizations and maximum deployments by grid scientific computing \hyperref[b17]{[17]}. A novel scheduling heuristic considering multiple SLA parameter objectives, such as amount of required CPU, network bandwidth, and storage in deploying applications on Clouds is mentioned. The heuristic includes a load-balancing mechanism for efficient distribution of the applications' execution on the Cloud resources. We also present a flexible on-demand resource allocation strategy included in the heuristic for automatically starting new virtual machines (VM) when a non-appropriate VM is available for application deployment. The concept and detailed design of the heuristic including its implementation in the Clouds simulation tool \hyperref[b15]{[15,}\hyperref[b16]{16]}. The scheduling strategy proposed in this section is integrated into the LoM2HiS framework as shown in Figure \hyperref[fig_1]{-2}.  
\section[{Resource Provisioning}]{Resource Provisioning}\par
The idea of Cloud computing is to provide resources as a service in a flexible and scalable manner \hyperref[b14]{[14]}. There are three well known types of resource provisioning \hyperref[b21]{[21,}\hyperref[b23]{23]} in Cloud:\par
i. Infrastructure as a Service (IaaS) that offers bare hardwires such as the physical machines, storage devices, and network infrastructures as a service. Amazon EC2 \hyperref[b12]{[12]} is an example of IaaS offering; ii. Platform as a Service (PaaS), which delivers platform for application development and deployment as a service \hyperref[b20]{[20]}. It typically utilizes virtualized resources in form of virtual machines that are capable of provisioning resources to applications. A typical example of PaaS service is the Google App Engine \hyperref[b20]{[20]};\par
iii. Software as a Service (SaaS) offering resources for the provisioning of single Applications in a Cloud environment. Vendors of SaaS include salesforce.com \hyperref[b24]{[24]}.\par
The Cloud provisioning and deployment model presented in Figure \hyperref[fig_2]{-3} shows a scenario combining the three different types of resource provisioning to host service requested from customers. The customers place their service deployment requests to the service portal, which passes the requests to the request processing component to validate the requests. If the request is validated, it is then forwarded to the scheduler. The scheduler selects the appropriate VMs through the provisioning engine in PaaS layer for deploying the requested service and the load balancer balances the service provisioning among the running VMs. The provision engine manages the VMs on the virtualization layer and the virtualization layer interacts with the physical resources via the provision engine in IaaS layer. The low-level resource metrics of the physical resources at the IaaS layer are monitored by the LoM2HiS framework \hyperref[b19]{[19]}. The service status and the SLA information are communicated back to the service portal \hyperref[b22]{[22]}. Although, the scenario described above is a possible way of combining the three types of resource provisioning, there exist other scenarios like provisioning of virtual machines alone and provisioning of physical resources alone, which are possibilities of provisioning at the single layers alone.\par
However, our approach aims to provide an integrated resource provisioning strategy. The proposed scheduling heuristics considers the three layers. Efficient resource provisioning and application deployments at these layers are not trivial considering their different constraints and requirements. At the IaaS layer the physical resources must be managed to optimize utilizations. At the PaaS layer, the VMs have to be deployed and maintained on the physical host considering the agreed SLAs with the customer. The proposed scheduling heuristic \hyperref[b18]{[18]} aims at deploying applications on virtual machines based on the agreed SLA objectives. Moreover, the integrated load-balancer in the heuristic ensures high and efficient resource utilization; consequently saving the provider the cost of maintaining unused resources. In this work, we assume that the SLA terms between the customer and the Cloud provider are already established. Thus, the processes of SLA specification, negotiation, and establishment are out of scope for this work, but there is ongoing research work where the Vie SLAF framework \hyperref[b13]{[13]} is used to address the issues. By the pseudo code presented in Algorithm -1, the scheduler receives as input the customers' service requests (R) that are composed of the SLA objectives (S) and the application data (A) to be provisioned (line -1 in Algorithm -1). The request can be expressed as R = (S, A). Each SLA agreement has a unique identifier id and a collection of SLA Objectives (SLOs). The SLOs can be defined as predicates of the form: 
\section[{Algorithm}]{Algorithm}( ) \{ \} , , , , comp with , , = ? > ? < ? i i id comp x SLO ?\par
Where x i ? \{Bandwidth, Memory, Storage, Availability\} represents sample SLA parameters, comp the appropriate comparison operator, and ? i the values of the objectives.\par
The basis for finding the virtual machine with the appropriate resources for deploying the application, gathers the output of the scheduler and the confirmation about successful deployment or error message in case of failure. In first step, it extracts the SLA objectives information about the total available resources (AR) and the number of running virtual machines in the data center (line -2). The SLA objectives are used to find a list of appropriate virtual machines (AP) capable of provisioning the requested service (R). This operation can be expressed as:\{ \} R) (VM, capable AR, VM : ) , ( ? = VM AR R AP\par
Where capable (VM, R) is a predicate that returns true if the virtual machine is capable of provisioning the particular request or false otherwise (lines 3-4). Once the list of VMs is found, the loadbalancer decides on which particular VM to deploy the application in order to balance the load in the data center (lines 5-8).\par
In case no VM, the appropriate resources running in the data center, the scheduler checks if the global resources consisting of physical machines can host new VMs (lines 9-10). If that is the case, it automatically starts new VMs with predefined resource capacities to provision service requests (lines \hyperref[b11]{[11]}\hyperref[b12]{[12]}\hyperref[b13]{[13]}\hyperref[b14]{[14]}. When the global resources cannot host extra VMs, the scheduler queues the provisioning of service requests until a VM with appropriate resources is available (lines \hyperref[b15]{[15]}\hyperref[b16]{[16]}. If after a certain period of time, the service requests cannot be scheduled and deployed, the scheduler returns a scheduling failure to the Cloud admin, otherwise it returns success (lines 17-27). The load-balancer shown in Algorithm -2 is not an extension of Next-Fit algorithm and has two core differences like: i. It does not fill a box to the full before starting to fill another one and ii. It goes back to the half filled boxes to add new items.\par
The similarity lays in each iteration, does not put items in the last filled box unless there is no other appropriate box among all the boxes. In Algorithm -2, the load balancer receives as input the appropriate VM list (line -1 in Algorithm -2). It first gets the number of available running VMs in the data center in order to \par
know how to balance the load among them (line -2).\par
Then it gets a list of used VMs, i.e., VMs that are already provisioning applications (line -3). If this list is equal to the number of running VMs, it clears the list because all the VMs are currently provisioning some applications (lines 4-7). The first VM from the appropriate VM list can be selected for the deployment of the new application request. The selected VM is then added to the list of used VMs so that the load -balancer does not select it in the next iteration (lines 8-15). The load-balancer tries to place one application on each VM running in the data center in the first phase after which it goes back again to place new applications on the VMs. The idea is that VMs executing less number of applications perform better than ones executing many applications while the others are running empty. The load-balancer alone has a total worst-case complexity of 0(n 2 ) in load balancing and selecting the specific VM for application deployment. This worst-case complexity is attributed by two processes: i. By the processes of selecting the specific VM, which has a worst-case complexity of 0(n) because the load balancer in worst case has to go through the appropriate VM list of n size to select a specific VM ii. By the processes of balancing the load among the VMs, which has a worse-case complexity of 0(n).\par
The Algorithm -2 shows lines 8-14, this process is a sub-process of selecting the specific VM. Thus, the total worst-case complexity is of 0(n 2 The scheduling heuristic without the loadbalancer has a worst-case complexity of 0(m + n). This complexity is defined by the processes of finding out the resource capacities of the m physical machines and n available virtual machines in the data center. Other operations of the heuristic have constant complexity (0(1)) except the process of checking the available resources on the physical machines in order to start new VMs, which has a worst-case complexity of 0(m).\par
The total worst-case complexity of the proposed heuristic is a result of the sum of the scheduling heuristic complexity and the load-balancer complexity expressed at run time is:) ( 0 ) ( 0 ) ( 0 2 2 m n n n m + = + + IV. 
\section[{Implementation}]{Implementation}\par
The proposed scheduling heuristic is implemented as a new scheduling policy in the Clouds simulation tool for the purpose of evaluation offering with unique features are:\par
i. Support for modeling and simulation of large scale Cloud computing environments including data centers, on a single computing machine ii. A self-contained platform for modeling Clouds, service brokers, resource provisioning and application allocation policies iii. Capability of simulating network connections among simulated components iv. Support for simulation of federated Cloud environment able to network resources from both private and public providers. v. Availability of virtualization engine that aids in creation and management of multiple, independent, and co-hosted virtualized services on a data center's physical machine vi. Ability to switch between spaces shared and timeshared allocation of CPU cores to virtualized resources.\par
Clouds components shown in the custom extensions layer in Figure \hyperref[fig_5]{-4}, has infrastructure level services as modeled by the core layer representing the original Clouds data center, with homogeneous or heterogeneous configuration of their hardware. Each data center instantiates a resource provisioning component that implements a set of policies that allocates resources to computing host and virtual machines. The two groups of Java classes in clouds are: i) The control policy classes ii) The simulation specific classes\par
The control policy classes include the implementations of a new data center broker for interfacing with the data center and our proposed scheduling heuristic. The data center broker is responsible for mediating negotiations between customers and Cloud providers in respect of allocating appropriate resources to customer services to meet their application's Quos needs and to manage the provider resources in the Clouds.\par
The extended data center broker includes the capability of running dynamic simulations by removing the burden of statically configuring the whole simulation scenario before starting .With this feature one can   
\section[{Evaluation}]{Evaluation}\par
The evaluation of the scheduling heuristic demonstrates the resource utilization by the scheduler. It further shows the higher application performance obtainable while compared to an arbitrary task scheduler. The evaluations presented here are realized using the Clouds simulation tool \hyperref[b16]{[16]}.\par
Here, we begin with the experimental setup and configuration descriptions and basic experimental configurations. The experimental test bed is setup as described in Figure \hyperref[fig_6]{-5}. It demonstrates the processes of placing service request by customers and how our proposed scheduler deploys the service on appropriate Cloud resources. The Cloud resources comprise physical and virtual machines. Table -1 shows the resource capacities of the physical machines and the configuration parameters of the virtual machines. Based on the capacities of the physical machine resources and the sizes of the virtual machines, we can start several virtual machines on one physical host in the Clouds simulation engine. To achieve a reasonable application deployment scenario, we use two types of applications each with its own SLA terms to realize heterogeneous workloads. The first workload is extracted from a Web Application (WA) for an online shop and the second workload is a trace of High Performance Computing (HPC) application represented by an image rendering applications such as POV-Ray.  Guaranteeing these SLA terms ensures the good performance of the application executions. The evaluation of the efficiency of the proposed scheduler for deploying customer service requests and utilizing the available Cloud resources. The test essence of the on-demand resource provisioning feature, simulate a large data center made up of 60 physical machines and 370 virtual machines. The capabilities of the scheduler are evaluated into two groups: i) Fixed resource ii) On-demand resource In the fixed resource group the on-demand resource provisioning feature is deactivated while in the on-demand resource group, it is activated. The essence of these two groups is to demonstrate the advantages of the on-demand resource provisioning feature. Each group runs three scenarios: i. The first scenario handles the deployment of only web applications' service requests. ii. The second scenario deals only with HPC applications. iii. The third scenario deals with a mixture of web and HPC applications.\par
The three scenarios are intended to cover real world deployment situations in the sense that they handle applications from different categories, which exhibit different behaviors in terms of resource consumption. In the scenarios, the service requests are randomly generated and sent to the scheduler for scheduling and deployment. Next, we describe the achieved results in two groups. 
\section[{i. Fixed resource group}]{i. Fixed resource group}\par
The scheduler schedules and deploys the applications on the available running VM in the data center without the flexibility of starting new VMs when required. The results achieved by the three scenarios of this group are presented in Figure -6. The second bar shows the total deployment efficiency achieved by the scheduler. The deployment efficiency is calculated by counting the total number of deployed service applications in relation to the total number of requested services. In this scenario a total of 1480 service applications are deployed whereas a total of 1500 service requests were made. This gives a deployment efficiency of 98. 67\%. About 20 service requests could not be provisioned due to lack of resources on the available VMs.\par
The results of the second evaluation scenario dealing with only HPC applications are presented as Scenario -2 in HPC applications cause some resource fragmentation leaving some resource fragments that are not usable by the scheduler. The second bar represents the deployment efficiency of this scenario, which is 61.73\%. This is significantly better than the deployment efficiency achieved in the second scenario. This increase in deployment efficiency is attributed by the heterogeneous workload whereby the number of HPC applications' requests is smaller than in the second scenario.\par
ii. On-demand resource group In this group, it is possible for the scheduler to flexibly start new VMs when necessary as far as there are available resources on the physical machines. This feature allows for higher service request deployment and better usage of the resources at the data center. The results obtained by the three evaluation scenarios of this group are depicted in Figure -7. The first bar shows that the scheduler achieved 100\% utilization in this case. The observation in this scenario as compared to the first scenario of the fixed group is the 100\% deployment efficiency achieved, which is shown by the second bar. The scheduler made advantage of the flexible ondemand resource provisioning feature to start extra four virtual machines to fully deploy the whole service requests. Although the resources were fully utilized, the scheduler could only achieve 80\% deployment efficiency. This is better result than 49.67\% achieved by the equivalent scenario in the fixed group. The scheduler created extra 229 VMs for the applications deployments thereby reaching the limits of the physical machines and could not achieve 100\% deployment efficiency due to ultimate lack of resources in the data center. This problem could be addressed with Cloud federation paradigm. Scenario 3 in Figure -7 depicts the results of the third evaluation scenario dealing with a mixture of web and HPC applications. The scheduler achieved 98\% resource utilization due to resource fragmentations caused by the heterogeneous workload and resource over provisioning.\par
The last two VMs started on-demand were under-utilized. 100\% deployment efficiency was achieved in this scenario by starting 215 VMs ondemand. Comparing the results achieved by the former group scenarios (Figure -6) against those of the later group (Figure -7), it can be clearly seen that the later group obtained much better resource utilization rates and deployment efficiencies. This demonstrates the effectiveness and relevance of our proposed scheduling approach in a Cloud environment. 
\section[{b) Application Performance Comparison}]{b) Application Performance Comparison}\par
The performance of applications being provisioned in the Cloud simulation test bed but application performance is evaluated in two aspects using the scenarios of the previous section: i) Response time for the web applications ii) Completion time for the HPC applications\par
The result achieved is compared by the proposed scheduler with that achieved by an arbitrary task scheduler. Table \hyperref[tab_4]{3} presents the applications performance results. The results show the average response time and completion time of the applications while deployed by the two schedulers. It can be clearly seen that our proposed scheduler is two times better than the task scheduler. The good performance of our scheduler is attributed to the fact that it considers multiple performance objectives before deciding on which resource to deploy an application thereby finding the optimal resource combination for the application best performance, whereas the task scheduler considers mainly single objectives in its deployment, which cannot provide the optimal resources for the application best performance. Note that in Table \hyperref[tab_4]{3} the on-demand resource provisioning feature applies only to our proposed scheduler.   
\section[{Conclusion}]{Conclusion}\par
Scheduling and deployment strategies are means of achieving resource provisioning in Cloud environments. A further contribution of this thesis is the development of a novel scheduling heuristic considering multiple SLA objectives in deploying applications in Cloud environments. The heuristic includes loadbalancing mechanism for efficient distribution of the applications' execution among the Cloud resources. A flexible on-demand resource usage feature included in the heuristic for automatically starting new VMs when non-appropriate VM is available for the application deployments is presented. The design of the heuristic and its implementations with proposed scheduling heuristic using the Clouds simulation tool is discussed.\par
In order to manage the deployment of multiple applications on a single virtual machine, a proposed application monitoring architecture (CASViD), which monitors and detects SLA violations at the application layer in Cloud environments. The evaluated architecture on a real Cloud test bed using three types of image rendering application workloads with heterogeneous behaviors necessary to investigate different application provisioning scenarios and to automatically determine the optimal measurement intervals to monitor the application provisioning. By experiments, the proposed architecture is efficient in monitoring and detecting individual application SLA violation situations. Further one can automatically find the optimal measurement intervals by sampling different ones and checking their net utility values. With the realization of CASViD, the capabilities of monitoring and detecting SLA violations of single customer applications being provisioned in a shared host, in addition to the previous resource monitoring techniques, a holistic monitoring model capable of monitoring at different layers in Clouds is provided. \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Figure 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}B}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_4}B}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-7.png}
\caption{\label{fig_5}Figure 4 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{5}\includegraphics[]{image-8.png}
\caption{\label{fig_6}Figure 5 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{6}\includegraphics[]{image-9.png}
\caption{\label{fig_8}Figure 6 :}\end{figure}
   \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.0536036036036036\textwidth}P{0.1876126126126126\textwidth}P{0.25270270270270273\textwidth}P{0.16846846846846847\textwidth}P{0.08423423423423423\textwidth}P{0.10337837837837838\textwidth}}
\tabcellsep \multicolumn{4}{l}{Machine Type = Physical Machine}\tabcellsep \\
OS\tabcellsep CPU Core\tabcellsep CPU Speed\tabcellsep \multicolumn{3}{l}{Memory Storage Bandwidth}\\
Linux\tabcellsep 6\tabcellsep 6000 MIPS\tabcellsep 3.072 GB\tabcellsep 30000 GB\tabcellsep 3 Gbit/s\\
\tabcellsep \tabcellsep \multicolumn{3}{l}{Machine Type = Virtual Machine}\tabcellsep \\
OS\tabcellsep CPU Core\tabcellsep CPU Speed\tabcellsep Memory\tabcellsep Storage\tabcellsep Bandwidth\\
Linux\tabcellsep 1\tabcellsep 1000 MIPS\tabcellsep 512 MB\tabcellsep 5000 GB\tabcellsep 500 Mbit/s\end{longtable} \par
 
\caption{\label{tab_2}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.3679878048780488\textwidth}P{0.12957317073170732\textwidth}P{0.09329268292682927\textwidth}P{0.10884146341463415\textwidth}P{0.15030487804878048\textwidth}}
Application Type\tabcellsep CPU Power\tabcellsep Memory\tabcellsep Storage\tabcellsep Bandwidth\\
Web\tabcellsep 240 MIPS\tabcellsep 130 MB\tabcellsep 1000 GB\tabcellsep 150 Mbit/s\\
HPC\tabcellsep 500 MIPS\tabcellsep 250 MB\tabcellsep 2000 GB\tabcellsep 240 Mbit/s\\
\multicolumn{2}{l}{a) Deployment Efficiency and Resource Utilization}\tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_3}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.85\textwidth}}
Year\end{longtable} \par
 
\caption{\label{tab_4}Table 3 :}\end{figure}
 			\footnote{BApplication Deployment Models with Load Balancing Mechanisms using Service Level Agreement Scheduling in Cloud Computing} 			\footnote{© 2013 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 			\footnote{BApplication Deployment Models with Load Balancing Mechanisms using Service Level Agreement Scheduling in Cloud Computing} 			\footnote{© 2013 Global Journals Inc. (US)} 		 		\backmatter  			 
\subsection[{Global Journals Inc. (US) Guidelines Handbook}]{Global Journals Inc. (US) Guidelines Handbook}\par
www.GlobalJournals.org			 			  				\begin{bibitemlist}{1}
\bibitem[Amazon (2012)]{b12}\label{b12} 	 		\textit{},  		 			Amazon 		.  		 \url{http://aws.amazon.com/ec2/}  		April 3, 2012. Last Access.  	 
\bibitem[Google (2012)]{b20}\label{b20} 	 		\textit{},  		 			Google Google 		.  		 \url{https://developersgoogle.Com/appengine/}  		April 3, 2012. Last Access.  	 
\bibitem[Sales Force and Servicecloud (2012)]{b24}\label{b24} 	 		\textit{},  		 			Sales Force 		,  		 			Servicecloud 		.  		 \url{http://www.salesforce.com/}  		April 3, 2012. Last Access.  	 
\bibitem[Calheiros et al. (2009)]{b15}\label{b15} 	 		‘A heuristic for mapping virtual machines and links in emulation test beds’.  		 			Rodrigo N Calheiros 		,  		 			Rajkumar Buyya 		,  		 			Cesar A F De Rose 		.  	 	 		\textit{International Conference on Parallel Processing},  				2009. September 2009.  	 	 (ICPP '09. Pages 518 -525) 
\bibitem[Prodan and Ostermann (2009)]{b23}\label{b23} 	 		‘A survey and taxonomy of infrastructure as a service and web hosting cloud providers’.  		 			Radu Prodan 		,  		 			Simon Ostermann 		.  	 	 		\textit{10th IEEE/ACM International Conference on Grid Computing},  				2009. October 2009. p. .  	 
\bibitem[Yu and Buyya ()]{b10}\label{b10} 	 		‘A Taxonomy of Workflow Management Systems for Grid Computing’.  		 			J Yu 		,  		 			R Buyya 		.  	 	 		\textit{Journal of Grid Computing}  		2005.  (3)  p. .  	 
\bibitem[Chen and Yang ()]{b3}\label{b3} 	 		‘Activity Completion Duration Based Checkpoint Selection for Dynamic Verification of Temporal Constraints in Grid Workflow Systems’.  		 			J Chen 		,  		 			Y Yang 		.  	 	 		\textit{International Journal of High Performance and Computing Applications}  		2008. 22  (3)  p. .  	 
\bibitem[Chang et al. ()]{b2}\label{b2} 	 		‘An Ant Algorithm for Balanced Job Scheduling in Grids’.  		 			R.-S Chang 		,  		 			J.-S Chang 		,  		 			P.-S Lin 		.  	 	 		\textit{Future Generation Computer Systems}  		2009. 25  (1)  p. .  	 
\bibitem[Boss et al. (2010)]{b0}\label{b0} 	 		 			G Boss 		,  		 			P Malladi 		,  		 			D Quan 		,  		 			L Legregni 		,  		 			H Hall 		.  		 \url{http://download.boulder.ibm.com/ibmdl/pub/software/dw/wes/hipods/Cloud\textunderscore computing\textunderscore wp\textunderscore final\textunderscore 8Oct.pdf}  		\textit{IBM Cloud Computing (White Paper)},  				1st Nov. 2010.  	 	 (Technical Report) 
\bibitem[Buyya et al. ()]{b1}\label{b1} 	 		‘Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility’.  		 			R Buyya 		,  		 			C S Yeo 		,  		 			S Venugopal 		,  		 			J Broberg 		,  		 			I Brandic 		.  	 	 		\textit{Future Generation Computer Systems}  		2009. 25  (6)  p. .  	 
\bibitem[Buyya et al. ()]{b14}\label{b14} 	 		‘Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility’.  		 			Rajkumar Buyya 		,  		 			Srikumar Chee Shin Yeo 		,  		 			James Venugopal 		,  		 			Ivona Broberg 		,  		 			Brandic 		.  	 	 		\textit{Future Generation Computer Systems}  		2009. 25  (6)  p. .  	 
\bibitem[Foster et al. (2008)]{b6}\label{b6} 	 		‘Cloud Computing and Grid Computing 360-Degree Compared’.  		 			I Foster 		,  		 			Z Yong 		,  		 			I Raicu 		,  		 			S Lu 		.  	 	 		\textit{Proc. 2008 Grid Computing Environments Workshop (GCE08)},  				 (2008 Grid Computing Environments Workshop (GCE08)Austin, Texas, USA)  		Nov. 2008. p. .  	 
\bibitem[Calheiros et al. (2011)]{b16}\label{b16} 	 		‘Clouds: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms’.  		 			Rodrigo N Calheiros 		,  		 			Rajiv Ranjan 		,  		 			Anton Beloglazov 		,  		 			Cesar A F De Rose 		,  		 			Rajkumar Buyya 		.  	 	 		\textit{Software: Practice and Experience}  		January 2011. 41 p. .  	 
\bibitem[Vincent et al. (2010)]{b19}\label{b19} 	 		‘Low level metrics to high level slas -lom2his framework: Bridging the gap between monitored metrics and sla parameters in cloud environments’.  		 			C Vincent 		,  		 			Ivona Emeakaroha 		,  		 			Michael Brandic 		,  		 			Schahram Maurer 		,  		 			Dustdar 		.  	 	 		\textit{2010 International Conference on High Performance Computing and Simulation (HPCS)},  				July 2010. p. .  	 
\bibitem[Vincent et al. (2011)]{b18}\label{b18} 	 		‘Sla aware application deployment and resource allocation in clouds’.  		 			C Vincent 		,  		 			Ivona Emeakaroha 		,  		 			Michael Brandic 		,  		 			Ivan Maurer 		,  		 			Breskovic 		.  	 	 		\textit{2011 IEEE 35 th Annual Computer Software and Applications Conference Workshops (COMPSACW)},  				July 2011. p. .  	 
\bibitem[Liu et al.]{b7}\label{b7} 	 		\textit{SwinDeW-C: A Peer-to-Peer Based Cloud},  		 			X Liu 		,  		 			D Yuan 		,  		 			G Zhang 		,  		 			J Chen 		,  		 			Y Yang 		.  		 	 
\bibitem[Taylor et al. ()]{b8}\label{b8} 	 		 			I J Taylor 		,  		 			E Edelman 		,  		 			D B Gannon 		,  		 			M Shields 		.  		\textit{Workflows for e-Science: Scientific Workflows for Grids},  				2007. Springer.  	 
\bibitem[Casanova et al. (2000)]{b17}\label{b17} 	 		‘The apples parameter sweep template: User-level middleware for the grid’.  		 			Henri Casanova 		,  		 			Graziano Obertelli 		,  		 			Francine Berman 		,  		 			Richard Wolski 		.  	 	 		\textit{Scientific Programming}  		August 2000. 8  (3)  p. .  	 
\bibitem[Peerhasselmeyer ()]{b21}\label{b21} 	 		‘Towards holistic multi-tenant monitoring for virtual data centers’.  		 			Nicod'heureuse Peerhasselmeyer 		.  	 	 		\textit{Network Operations and Management Symposium Workshops},  				2010. p. .  	 
\bibitem[Maurer et al. ()]{b22}\label{b22} 	 		‘Towards knowledge management in self-adaptable clouds’.  		 			Michael Maurer 		,  		 			Ivona Brandic 		,  		 			C Vincent 		,  		 			Schahram Emeakaroha 		,  		 			Dustdar 		.  	 	 		\textit{Proceedings of the 2010 6 th World Congress on Services, SERVICES '10},  				 (the 2010 6 th World Congress on Services, SERVICES '10)  		2010. p. .  	 
\bibitem[Brandic et al. (2010)]{b13}\label{b13} 	 		‘Vieslaf framework: Facilitating negotiations in clouds by applying service mediation and negotiation bootstrapping’.  		 			Ivona Brandic 		,  		 			Dejan Music 		,  		 			Schahram Dustdar 		.  	 	 		\textit{Scalable Computing: Practice and Experiences (SCPE), Special Issue of Scalable Computing on Grid Applications and Middleware \& Large Scale Computations in Grids},  				June 2010. 11 p. .  	 
\bibitem[Wang et al. ()]{b9}\label{b9} 	 		 			L Wang 		,  		 			W Jie 		,  		 			J Chen 		.  		\textit{Grid Computing: Infrastructure, Service, and Applications},  				2009. Taylor \& Francis Group.  	 
\bibitem[Yu and Buyya ()]{b11}\label{b11} 	 		‘Workflow Scheduling Algorithms for Grid Computing’.  		 			J Yu 		,  		 			R Buyya 		.  	 	 		\textit{Met heuristics for Scheduling in Distributed Computing Environments},  				 			F Xhafa,  			A Abraham 		 (ed.)  		2008. Springer.  	 
\bibitem[Workflow System Features and Capabilities Future Generation Computer Systems ()]{b5}\label{b5} 	 		‘Workflow System Features and Capabilities’.  	 	 		\textit{Future Generation Computer Systems}  		2008. 25  (6)  p. .  	 
\bibitem[Deelman et al.]{b4}\label{b4} 	 		\textit{Workflows and e-Science: An Overview of},  		 			E Deelman 		,  		 			D Gannon 		,  		 			M Shields 		,  		 			I Taylor 		.  		 	 
\end{bibitemlist}
 			 		 	 
\end{document}
