<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">23056</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2022.023056</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Hybrid Whale Optimization Algorithm for Resource Optimization in Cloud E-Healthcare Applications</article-title>
<alt-title alt-title-type="left-running-head">Hybrid Whale Optimization Algorithm for Resource Optimization in Cloud E-Healthcare Applications</alt-title>
<alt-title alt-title-type="right-running-head">Hybrid Whale Optimization Algorithm for Resource Optimization in Cloud E-Healthcare Applications</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Gupta</surname><given-names>Punit</given-names></name><xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Bhagat</surname><given-names>Sanjit</given-names></name><xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Saini</surname><given-names>Dinesh Kumar</given-names></name><xref ref-type="aff" rid="aff-1">1</xref>
<email>dkssohar@gmail.com</email>
</contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Kumar</surname><given-names>Ashish</given-names></name><xref ref-type="aff" rid="aff-2">2</xref>
</contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Alahmadi</surname><given-names>Mohammad</given-names></name><xref ref-type="aff" rid="aff-3">3</xref>
</contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Sharma</surname><given-names>Prakash Chandra</given-names></name><xref ref-type="aff" rid="aff-1">1</xref>
</contrib>
<aff id="aff-1"><label>1</label><institution>School of Computing &#x0026; Information Technology, Manipal University Jaipur</institution>, <addr-line>Jaipur, 303007</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>School of Basic Sciences, Manipal University Jaipur</institution>, <addr-line>Jaipur, 303007</addr-line>, <country>India</country></aff>
<aff id="aff-3"><label>3</label><institution>Department of Software Engineering, College of Computer Science and Engineering, University of Jeddah</institution>, <addr-line>Jeddah, 23218</addr-line>, <country>Saudi Arabia</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Dinesh Kumar Saini. Email: <email>dkssohar@gmail.com</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-xx-xx"><day>11</day>
<month>01</month>
<year>2022</year></pub-date>
<volume>71</volume>
<issue>3</issue>
<fpage>5659</fpage>
<lpage>5676</lpage>
<history>
<date date-type="received"><day>26</day><month>8</month><year>2021</year></date>
<date date-type="accepted"><day>01</day><month>12</month><year>2021</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Gupta et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Gupta et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_23056.pdf"></self-uri>
<abstract>
<p>In the next generation of computing environment e-health care services depend on cloud services. The Cloud computing environment provides a real-time computing environment for e-health care applications. But these services generate a huge number of computational tasks, real-time computing and comes with a deadline, so conventional cloud optimization models cannot fulfil the task in the least time and within the deadline. To overcome this issue many resource optimization meta-heuristic models are been proposed but these models cannot find a global best solution to complete the task in the least time and manage utilization with the least simulation time. In order to overcome existing issues, an artificial neural-inspired whale optimization is proposed to provide a reliable solution for healthcare applications. In this work, two models are proposed one for reliability estimation and the other is based on whale optimization technique and neural network-based binary classifier. The predictive model enhances the quality of service using performance metrics, makespan, least average task completion time, resource usages cost and utilization of the system. From results as compared to existing algorithms the proposed ANN-WHO algorithms prove to improve the average start time by 29.3&#x0025;, average finish time by 29.5&#x0025; and utilization by 11&#x0025;.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Cloud computing</kwd>
<kwd>whale optimization</kwd>
<kwd>health care</kwd>
<kwd>resource optimization</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Internet-based computing puts the demand of the service-oriented computing paradigm. Among the developers, businesses and end-users cloud computing has become popular providing storage, computing and network resources. In the global business world, cloud computing provides an optimal assignment of cloud resources [<xref ref-type="bibr" rid="ref-1">1</xref>]. Resources are provided to the various category of users using pricing models pay-as-you-go model and subscription model [<xref ref-type="bibr" rid="ref-2">2</xref>,<xref ref-type="bibr" rid="ref-3">3</xref>]. The heterogeneous virtualized resources shared pool handles the user requests using a set of virtual machines [<xref ref-type="bibr" rid="ref-4">4</xref>,<xref ref-type="bibr" rid="ref-5">5</xref>]. Cloud computing supports the features of the market-oriented computing paradigm which provides optimal resource utilization with minimum operational cost. The operational cost and time play a prominent role in the performance evaluation and analysis process [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-7">7</xref>]. The provisioning tasks on virtual machines perform using static, dynamic and meta-heuristic approaches. Broad classification of scheduling in a scalable cloud environment performs virtual machine level. First category include user request mapping on virtual machine and second category include virtual machine mapping on host machine [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>]. The primary focus of the scheduling of tasks on a virtual machine and virtual machine on a host improves the performance evaluation parameters time and cos. The optimal assignment of the tasks-vm and vm-host mapping comes under the category of Np-hard problem. Hence when the size of the universal solution space increases the optimal solution may converge slowly and exponential time is required for the optimal solution findings. The meta-heuristic techniques provide better results than simple static, dynamic approaches which provide the solution using polynomial time for the completion of the tasks execution and virtual machine execution. The meta-heuristic techniques Genetic, ACO, and PSO and their variations are used for effective mapping of virtual machine level [<xref ref-type="bibr" rid="ref-10">10</xref>&#x2013;<xref ref-type="bibr" rid="ref-13">13</xref>]. The optimal solution depends on the fitness values of the individual schedule of the evolutionary technique. Meta-heuristic techniques follow the features of the biological and nature-inspired methodologies [<xref ref-type="bibr" rid="ref-14">14</xref>]. The optimization technique whale optimization algorithm (WOA) is a meta-heuristic technique that supports the global search capability. It plays a prominent role in the domain of science and engineering.</p>
<p>The healthcare sector is one of the highest data-generated industries. Due to advanced medical facilities life expectancy of a human is rapidly increased. The increased population aging required additional resources and diverse medical facilities. A large volume of data on patients is generated daily that plays a vital role in decision making to propose treatment strategies for patients. To store and analyze it some innovative and cost-effective strategies are required to help the healthcare sector to meet our challenges at the global level. Cloud computing is one such cost-effective method that helps in real-time data collection, storage, and exchange of data. Cloud infrastructure is used for high-volume storage and efficient data analysis. It becomes necessary to transit paper-based services of the health sector on the cloud using information technology. Though, cloud infrastructure is very effective, but security, reliability and privacy are prominent concerns associated with the use of the cloud in the health sector. By ensuring the reliability and security of cloud infrastructure cloud computing can play a centerpiece role in the transformation of paper records to modern information technology tools. This transformation can establish a better relationship between doctors and patients, as well as helps in better decision making. So, presently scientists should focus on ensuring the reliability of cloud infrastructure in the health sector. Up to the best of our knowledge, reliability aspects of the cloud in the health sector are not so much explored. Some work on the reliability of cloud and computing networks is available in the literature. The main issue with cloud healthcare applications is real-time processing and the need for a highly reliable infrastructure to complete the task within a deadline with the least processing time. So to achieve there exist many solutions but the solution like genetic and interactive algorithms have high simulation time/searching time to find the best solution. So in order to remove this, an artificial neural-based optimization is proposed to find the best solution in constant time by training the machine learning model once with the best solution from the Whale algorithm. Here whale algorithm is proposed because it has a high probability to find the best solution in the least time as compare ACO, PSO, Bat and genetic algorithm as shown in results.</p>
<p>In this manuscript, our focus is to develop a reliability model for cloud infrastructure as well as proposing a hybrid approach ANN-WOA technique that provides an optimal solution using performance metrics time and resource utilization. The performance evaluation process includes the training process and validation. The whale optimization technique provides the training data set of the ANN-WOA model. The major contribution of the proposed ANN-WOA model and reliability model summarizes as follows.
<list list-type="simple">
<list-item><label>1)</label><p>The tasks execution on virtual machine enhances using the proposed ANN-WOA, Our focus includes to introduce a neural inspired whale optimization model for task scheduling and apply the hybrid model to solve the virtual machine level scheduling problem.</p></list-item>
<list-item><label>2)</label><p>The proposed ANN-WOA focuses on efficient task scheduling by incorporating advanced optimization strategies to improve both the convergence speed and accuracy of the whale optimization approach.</p></list-item>
<list-item><label>3)</label><p>The detailed design and implementation of neural inspired whale optimization technique described and compare it against existing meta-heuristics technique Genetic, and BB-BC cost. Our results and discussions section demonstrates that hybrid technique ANN-WOA outperforms using resource utilization in a scalable cloud environment.</p></list-item>
<list-item><label>4)</label><p>The proposed model focuses on the identification of the sensitive component of cloud infrastructure by estimating the reliability of the cloud and measuring the effect of variation in failure and repair rates. The proposed model improves the performance of task and cloud infrastructure both at the same time.</p></list-item>
</list></p>
<p>The rest of this manuscript is organized as follows. In Section 2 covers the related works. Section 3 includes the motivations of task scheduling optimization. Section 4 presents the proposed ANN-WOA approach and its implementation details. In Section 5, incorporates a reliability model of cloud infrastructure. The performance evaluation and analysis includes in Section 6, and finally, Section 7 concludes the work.</p>
</sec>
<sec id="s2"><label>2</label><title>Related Work</title>
<p>Resource assignment to the tasks in a cloud computing environment is a challenging concern. It is complex problem of assignment of storage, computing and network resources. The datacenter provides heterogeneous resources to the users in a scalable cloud environment. Optimal assignment of tasks on virtual machines follows the various static, dynamic and meta-heuristic techniques. The researchers have been proposed the techniques using multiple performance evaluation criteria. In exiting work [<xref ref-type="bibr" rid="ref-15">15</xref>&#x2013;<xref ref-type="bibr" rid="ref-19">19</xref>] author has showcased a study on the issue in cloud computing and existing work to solve those issues. Malawski et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] focused on performance metrics deadline of the tasks and the cost of the resources used in a hybrid cloud scenario. Su et al. presented a task scheduling in a cloud environment using performance metrics cost of the storage, computing and network resources across the globe. The presented approach follows the features of the Pareto dominance [<xref ref-type="bibr" rid="ref-21">21</xref>]. Researchers focused on cluster base scheduling and list base scheduling approaches DSC [<xref ref-type="bibr" rid="ref-22">22</xref>] and list scheduling algorithm (e.g., DSL [<xref ref-type="bibr" rid="ref-23">23</xref>]). The meta-heuristic approaches have wide application in a cloud computing system. Still, there may be low quality of service due to an exponential increase in the number of user requests [<xref ref-type="bibr" rid="ref-24">24</xref>]. Various meta-heuristic techniques follow the features of nature-inspired and bio-inspired techniques. The meta-heuristic techniques include Genetic awareness, ACO, and PSO. Aziza et al. presented the bio-inspired Genetic time shared and space shared techniques. The proposed technique enhances the performance using evaluation metrics makespan and cost [<xref ref-type="bibr" rid="ref-25">25</xref>]. Li et al. demonstrated ACO base tasks scheduling using load balancing in a cloud computing environment [<xref ref-type="bibr" rid="ref-26">26</xref>]. Wang et al. presented an enhanced PSO technique for the optimal placement of the virtual machine. The performance is evaluated using performance metric power savings and quality of service parameters of Global optimization [<xref ref-type="bibr" rid="ref-27">27</xref>]. The performance can be improved using a hybrid technique that follows the features of multiple nature-inspired techniques. Chen et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] proposed swarm optimization and ant colony optimization-based hybrid tasks scheduling techniques which focused on performance metrics makespan of the tasks on a virtual machine. Liu et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] demonstrated the bio-inspired technique which follows the features of the bio-inspired technique which provides a Global optimal solution. Tsai et al. [<xref ref-type="bibr" rid="ref-30">30</xref>] proposed a hyper-heuristic technique based on Genetic, PSO, and ACO techniques. Performance is evaluated using makespan. Further, the efficiency can be improved using whale optimization technique of task scheduling on a virtual machine. The multi-objective model provides better performance than simple meta-heuristic techniques. The multi-objective performance metrics in a scalable cloud computing environment include time, cost and power savings [<xref ref-type="bibr" rid="ref-31">31</xref>]. Ramezani et al. [<xref ref-type="bibr" rid="ref-32">32</xref>] multi-objective particle swarm optimization technique which provides the better quality of service using performance metrics execution time and cost paid in the duration of execution time. Mao et al. [<xref ref-type="bibr" rid="ref-33">33</xref>] focused on performance metrics stability of the cloud computing system and time. Liu et al. [<xref ref-type="bibr" rid="ref-34">34</xref>] presented a framework that focused on the performance metrics response time and resource utilization of cloud environments. The reliability modeling and estimation of communication networks is very vital and attracted the researcher [<xref ref-type="bibr" rid="ref-35">35</xref>]. Various redundancy strategies have been utilized in designing a cloud infrastructure [<xref ref-type="bibr" rid="ref-36">36</xref>]. As redundancy is very helpful in increasing the efficiency of cloud infrastructure. The performance of big data applications is also assessed using concurrent modeling [<xref ref-type="bibr" rid="ref-37">37</xref>]. Reliability estimation of cloud service-based applications is also done using SRGM and NMSPN methodologies [<xref ref-type="bibr" rid="ref-38">38</xref>]. Various subsystems of cloud infrastructure were also discussed as a reliability point of view [<xref ref-type="bibr" rid="ref-39">39</xref>]. The semi-Markovian approach is utilized for the availability assessment of the cloud having multiple pools of physical and virtual equipment [<xref ref-type="bibr" rid="ref-40">40</xref>].</p>
<p>The concepts of switching failure, common cause failure and vacations along with warm standby units in computer networks have been used extensively [<xref ref-type="bibr" rid="ref-41">41</xref>]. The technique for the development of a stochastic model of cloud infrastructure is discussed in the literature [<xref ref-type="bibr" rid="ref-42">42</xref>]. End-to-end performance analysis in a cloud using stochastic models has been done [<xref ref-type="bibr" rid="ref-43">43</xref>]. The 80/20 rule has been suggested to improve the reliability of cloud-based data centers [<xref ref-type="bibr" rid="ref-44">44</xref>]. Markovian approach applied in fuzzy reliability investigation of data center [<xref ref-type="bibr" rid="ref-45">45</xref>]. Hence meta-heuristic techniques are widely used in multi-objective resource optimization in a cloud environment as well as Markovian is used in reliability evaluation. In this work, our key focus will be to proposed ANN-WOA model which follows the features of multi-objective intelligent meta-heuristic technique and reliability investigation of cloud infrastructure. Our objective is to improve the performance of the state-of-the-art method of task scheduling in the cloud computing environment. This is best of our knowledge to propose a neural whale optimization model which will improve the performance of the cloud datacenter resources using the optimal placement of tasks on a virtual machine.</p>
</sec>
<sec id="s3"><label>3</label><title>Motivation for Work</title>
<p>The key focuses are to improve the quality of service using enhanced meta-heuristic techniques and investigate the reliability of cloud infrastructure. The existing meta-heuristic technique and static approaches include the performance metrics time, cost and power savings. Our objective is to improve the research gaps in existing approaches. The major focus of the researchers includes time and resource utilization cost. The state of art methodologies provides the direction to improve the performance of the static, dynamic and meta-heuristic techniques using multi-objective performance evaluation metrics. The proposed model will integrate the whale optimization meta-heuristic technique with a neural network. The artificial neural network-inspired whale optimization (ANN-WOA) technique will focus on multi-objective criteria i.e., time, cost, power, and service level agreement. The performance evaluation and analysis parameters are shown in the Tab. 1 are evaluated using real-time workload and fabricated workload. The proposed model ANN-WOA will be validated against the static, dynamic and meta-heuristic techniques, GA-Cost, GA-Exe, Max-Min, and PSO respectively. The state of art methods and proposed ANN-WOA will be implemented using the integrated environment of cloudsim 4.0 and NetBeans IDE 8.0.1. The results and discussions section will show the comparisons of the simulation results using different user requests and population sizes.</p>
</sec>
<sec id="s4"><label>4</label><title>Proposed Model</title>
<p>The proposed model is based on the hybrid technique ANN-WOA. It includes the whale optimizer to prepare the training data sets. The training data sets includes (ti, vmj) pair of tasks mapping on the virtual machine using optimal objective parameters. The output of the whale optimizer acts as input parameters to the neural classifier which predicts the virtual machine identity for the allocation of the tasks on virtual machines with an optimal solution. The data set is prepared using the whale optimization technique. The prepared data sets is divided into training and testing data sets for the training and testing of the neural network-based binary classifier which ensures the selection of an appropriate virtual machine for the assignment of the tasks. The preparation of the data set depends on the input parameters of the whale optimizer. The ANN-WOA model assures the high quality of service in a complex cloud computing environment having n&#x2009;&#x003E;&#x003E;&#x003E;&#x2009;m i.e., number of tasks assigned to the limited number of virtual machines in a scalable cloud computing environment. The ANN whale optimization technique provides an optimal assignment of the tasks on virtual machines in a scalable cloud computing environment.</p>
<p>The following steps are used in the case of ANN-WOA model.</p>
<sec id="s4_1"><label>4.1</label><title>Initialization of the Parameters</title>
<p>In this phase the parameters of the whale optimizer, neural network-based binary classifier initialize. Once the parameters initialize the whale optimizer provides an optimal set of the tasks and associated virtual machine decisions.</p>
</sec>
<sec id="s4_2"><label>4.2</label><title>Dataset Preparation for Training Purpose</title>
<p>This subsection covers the allocation of the tasks on virtual machines using the nature-inspired meta-heuristic whale optimizer technique. This whale optimizer technique provides data sets that are used for training and testing purposes. This subsection also covers all the steps used in this data set preparation for training purposes.</p>
<sec id="s4_2_1"><label>4.2.1</label><title>Initialization</title>
<p>The initialization step generates the random population of the search agent. The search agents provide the solution space which includes multiple local optimal search agents and may include global optimal search agents.</p>
</sec>
<sec id="s4_2_2"><label>4.2.2</label><title>Calculation of Fitness Function</title>
<p>Step 2 calculates the fitness function values using the following equations.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mrow></mml:mrow><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mi>c</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>d</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>L</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mi>M</mml:mi><mml:mi>I</mml:mi><mml:mi>P</mml:mi><mml:mi>S</mml:mi></mml:math></disp-formula>
</p>
<p>The fitness values evaluate for all the search agents and select the Global optimal agent with the fittest function value.</p>
</sec>
<sec id="s4_2_3"><label>4.2.3</label><title>Encircling Prey</title>
<p>The agent becomes aware of the prey and the agent considers itself as an optimal agent i.e., according to the position of the humpback whale (acts as an optimal agent) other solution agents update their position. The parameters associated with the agent acts as input parameters to the whale-inspired scheduler. The input parameters include tasks count, virtual machine count and the position vector of the best agent, position vector of the agents in the search space, coefficient vector, and search vector respectively. The encircling pray step of the whale optimizer includes search agent position according to the best search agent position as shown in <xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mover><mml:mi>Q</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2219;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> presents the position of the search agent. The variable <italic>x</italic> represents the current iteration. <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> presents the position vector and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mrow><mml:msup><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> presents the position vector of the best agent in the solution space, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mrow><mml:mover><mml:mi>Q</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> shows the coefficient vector. The new position of the search agent updates using <xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mover><mml:mi>p</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>M</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2219;</mml:mo><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:mover><mml:mi>M</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> represents the coefficient vector, and operator <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mo>&#x2219;</mml:mo></mml:math></inline-formula> indicates the element-wise multiplication. The coefficient vector <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:mover><mml:mi>Q</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:mover><mml:mi>M</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> calculated using <xref ref-type="disp-formula" rid="eqn-5">Eqs. (5)</xref> and <xref ref-type="disp-formula" rid="eqn-6">(6)</xref> respectively.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mrow><mml:mover><mml:mi>M</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mrow><mml:mover><mml:mi>l</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mover><mml:mi>l</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mi>Q</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mover><mml:mi>k</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo></mml:mover></mml:mrow></mml:math></disp-formula>where <sup>1</sup> varies from 2 to 0, and random vector <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msup><mml:mi></mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">k</mml:mi></mml:mrow><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>.</p>
</sec>
<sec id="s4_2_4"><label>4.2.4</label><title>Exploitation and Exploration</title>
<p>The exploitation phase includes shrinking the encircling mechanism and agent position updating in a spiral manner. In the exploration phase the position of the search agent updates in a random fashion.</p>
</sec>
<sec id="s4_2_5"><label>4.2.5</label><title>Termination</title>
<p>The data set prepared used for the training process of the Binary classifier for the prediction of the appropriate virtual machine identity. It follows the iterations of the steps used to obtain an optimal solution.</p>
<fig id="fig-7"><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-7.png"/></fig>
</sec>
</sec>
<sec id="s4_3"><label>4.3</label><title>Design of Neural Computing Model</title>
<p>The initialization parameters and the output of the whale optimizer act as an input to the multi-layer neural network classifier. The multi-layer classifier configuration contains the input layer, hidden layers and output layer respectively. The number of hidden layers, number input parameters, and the number of output parameters depends on the number of virtual machines and the number of submitted tasks on the virtual machine. <?A3B2 "fig1",5,"anchor"?><xref ref-type="fig" rid="fig-1">Fig. 1</xref> exhibits the block diagram of the presented ANN-WOA model which includes a detailed description of the multi-layer perceptron and whale optimization technique that generates the scheduling decision of the tasks on virtual machines. The output of the nature-inspired technique acts as an input (X1, X2) to the neural network classifier. The output of the ANN-WOA provides the virtual machine identity of allocation to tasks with optimal performance metrics time and cost. <xref ref-type="fig" rid="fig-1">Fig. 1</xref> shows the proposed model using whale optimization and ML model.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Proposed solution architecture</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-1.png"/></fig>
</sec>
<sec id="s4_4"><label>4.4</label><title>Training of the Neural Model (Using Data Set Prepared Using WOA)</title>
<p>The scheduling decisions of the WOA provide the data sets which is used for the training of the neural network model. The training process trains the model using free parameters, hyperparameters and input parameters of the ANN-WOA model. The prepared data sets divide into two parts 80&#x0025; data set used for the training of the model sown in the block diagram and 20&#x0025; data set to use for the testing of the training model using variations of iterations.</p>
<p>The training process includes the following steps</p>
<list list-type="simple">
<list-item><label>1.</label><p>Initialization of the bias parameter and connection weights.</p></list-item>
<list-item><label>2.</label><p>Training the model using data sets generated using whale optimization base scheduling in cloud computing</p></list-item>
<list-item><label>3.</label><p>Validation must be performed using 20&#x0025; data sets for the accuracy test and efficiency improvement of the proposed model.</p></list-item>
<list-item><label>4.</label><p>Once the model is validated then the network runs to predict the values of the expected outputs. The linear and non-linear activation functions use for the activation of the neurons in a scalable cloud computing environment. The complexity of the neural network classifier i.e., number of hidden layers and types of activation functions depends on the complexity of the datacenter node. Hence training step plays a prominent role in a scalable cloud computing environment.</p></list-item>
</list>
</sec>
<sec id="s4_5"><label>4.5</label><title>Accuracy Improvement Using Error Backpropagation and Correction</title>
<p>In this phase, our objective is to mitigate the difference between the desired output and target output. Hence in this supervised learning process, the error difference must be minimum. Smaller the difference between target and desired output better the accuracy of the model in a complex, scalable distributed data center network environment.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mo>&#x2217;</mml:mo><mml:msubsup><mml:mi>e</mml:mi><mml:mi>k</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
</p>
<p>In <xref ref-type="disp-formula" rid="eqn-7">Eqs. (7)</xref> and <xref ref-type="disp-formula" rid="eqn-8">(8)</xref>, the parameter <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the desired output, <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> denotes the calculated output, and <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the error, and <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the cost function used in the learning process of the ANN model respectively.</p>
</sec>
<sec id="s4_6"><label>4.6</label><title>Tasks Assignment on Virtual Machine Decision</title>
<p>This phase covers the assignment of the tasks on virtual machines using ANN-WOA model. The trained model provides an accuracy, correctness of the predictive outcomes in a complex scalable cloud environment.</p>
<p>Hence using the WOA-ANN model predict an output which includes the solution array of the scheduling assignment of the tasks on an appropriate virtual machine using multiple epochs and test the accuracy of the model using independent variable test values. The target outcomes and desired outcomes measure the level of accuracy. The quality of service of the model ensures using makespan and resource utilization cost which depends on utilization duration of the IaaS, PaaS and SaaS service delivery architecture. <?A3B2 "fig2",5,"anchor"?><xref ref-type="fig" rid="fig-2">Fig. 2</xref> shows the flow diagram of the proposed algorithm using the whale algorithm and artificial neural network.</p>
<fig id="fig-2"><label>Figure 2</label><caption><title>Flow diagram</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-2.png"/></fig>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Reliability Modeling of Cloud Infrastructure</title>
<p>In the last few years cloud infrastructure becomes very popular in MNC&#x0027;s. In the cloud customers have the freedom to manage applications, data, and operating systems. Many services like networking, security, billing, recovery, and load balancing are managed by cloud services. But all these tasks can be effectively performed if cloud infrastructure work with high reliability. As cloud infrastructure is a very complex structure involving various physical and virtual components and it is very difficult to attain desired performance. It can be only achieved if it is operated with high reliability. For this purpose, here a stochastic model is proposed to attain the highest reliability of cloud infrastructure.</p>
<sec id="s5_1"><label>5.1</label><title>Assumptions</title>
<p>In the development of the model, the following assumptions have been utilized:
<list list-type="bullet">
<list-item><p>All the subsystems arranged in a series configuration, i.e., failure of one cause complete cloud failure</p></list-item>
<list-item><p>No provision of simultaneous failure</p></list-item>
<list-item><p>Perfect repair and switch devices</p></list-item>
<list-item><p>All failure and repair rates are exponentially distributed and independent of each other</p></list-item>
<list-item><p>No correlated failure</p></list-item>
</list></p>
</sec>
<sec id="s5_2"><label>5.2</label><title>Notations</title>
<p>The following assumptions shown in <?A3B2 "tbl3",5,"anchor"?><xref ref-type="table" rid="table-1.1">Tab. 1.1</xref> has been made to develop the model for cloud infrastructure: for cloud infrastructure:</p>
<table-wrap id="table-1.1"><label>Table 1.1</label><caption><title>Assumptions for cloud model</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">S. No.</th>
<th align="left" rowspan="2">Sub-system</th>
<th align="left" rowspan="2">Operative model</th>
<th align="center" colspan="2">Failure mode</th>
<th align="center" colspan="2">Failure rate</th>
<th align="center" colspan="2">Repair rate</th>
</tr> 
<tr>
<th align="left">H/w</th>
<th align="left">S/w</th>
<th align="left">H/w</th>
<th align="left">S/w</th>
<th align="left">H/w</th>
<th align="left">S/w</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">1</td>
<td align="left">Client</td>
<td align="left">A</td>
<td align="left">a<sub>h</sub></td>
<td align="left">a<sub>s</sub></td>
<td align="left"><inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">Database</td>
<td align="left">B</td>
<td align="left">b<sub>h</sub></td>
<td align="left">b<sub>s</sub></td>
<td align="left"><inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">Standby database</td>
<td align="left">B1</td>
<td align="left">b<sub>h</sub></td>
<td align="left">b<sub>s</sub></td>
<td align="left"><inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">4</td>
<td align="left">Cloud</td>
<td align="left">C</td>
<td align="left">c<sub>h</sub></td>
<td align="left">c<sub>s</sub></td>
<td align="left"><inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">Service</td>
<td align="left">D</td>
<td align="left"><sub>----</sub></td>
<td align="left">d<sub>s</sub></td>
<td align="left">&#x2026;.</td>
<td align="left"><inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left">&#x2026;..</td>
<td align="left"><inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">6</td>
<td align="left">Network</td>
<td align="left">E</td>
<td align="left">e<sub>h</sub></td>
<td align="left">e<sub>s</sub></td>
<td align="left"><inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left"/>
<td align="left">Load failure</td>
<td align="left"/>
<td align="left">CF</td>
<td align="left"/>
<td align="left"/>
<td align="left"><inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"><inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td align="left"/>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td align="left" colspan="8">Probability that at time t system is in i<sup>th</sup> state</td>
</tr>
<tr>
<td align="left"><inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:msubsup><mml:mi>P</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td align="left" colspan="8">Derivate of <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5_3"><label>5.3</label><title>System Description</title>
<p>The cloud infrastructure is very complex having several physical and virtual components. Broadly, it has five subsystems namely clients, databases, cloud, service, and network. The clients, databases, cloud, and network may suffer due to hardware and software failures while the service facility suffers only due to snags in software. The complete system may collapse due to overload on the cloud and the whole cloud infrastructure causes failure. The hardware failures are rectified by the repairman and software undergoes rejuvenation upon failure. After all types of repair activities system work as good as new. All failure and repair rates are exponentially distributed.</p>
</sec>
<sec id="s5_4"><label>5.4</label><title>Stochastic Model Development and Analysis</title>
<p>In this section, a stochastic model is developed and analyzed using Runga-Kutta method of 4th order. The Markovian birth-death process is applied to develop C-K differential-difference equations. The simulated results are obtained using MATLAB R2019a. The expression of the stochastic model is as follows:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mtable columnalign="left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mtable columnalign="left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>14</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>15</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>17</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>18</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>19</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>20</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>21</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mtable columnalign="left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd><mml:mtd><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo stretchy="false">]</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>31</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>30</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>29</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>28</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>27</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd /><mml:mtd><mml:mspace width="1em" /><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>25</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>26</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>24</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>23</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mspace width="thinmathspace" /></mml:mtd></mml:mtr></mml:mtable></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>11</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>13</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>14</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>14</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>15</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>15</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>16</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>17</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>17</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>18</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>18</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>19</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>19</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-28"><label>(28)</label><mml:math id="mml-eqn-28" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>20</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>20</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-29"><label>(29)</label><mml:math id="mml-eqn-29" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>21</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>21</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-30"><label>(30)</label><mml:math id="mml-eqn-30" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-31"><label>(31)</label><mml:math id="mml-eqn-31" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>23</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>23</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-32"><label>(32)</label><mml:math id="mml-eqn-32" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>24</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>24</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-33"><label>(33)</label><mml:math id="mml-eqn-33" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>25</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>25</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-34"><label>(34)</label><mml:math id="mml-eqn-34" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>26</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>26</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-35"><label>(35)</label><mml:math id="mml-eqn-35" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>27</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>27</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-36"><label>(36)</label><mml:math id="mml-eqn-36" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>28</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>28</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-37"><label>(37)</label><mml:math id="mml-eqn-37" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>29</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>29</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-38"><label>(38)</label><mml:math id="mml-eqn-38" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>30</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>30</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
<disp-formula id="eqn-39"><label>(39)</label><mml:math id="mml-eqn-39" display="block"><mml:msup><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>31</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mi mathvariant="normal">&#x2032;</mml:mi></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mn>31</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>initial conditions
<disp-formula id="eqn-40"><label>(40)</label><mml:math id="mml-eqn-40" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mspace width="1em" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mspace width="negativethinmathspace" /><mml:mspace width="negativethinmathspace" /></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mspace width="1em" /><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-41"><label>(41)</label><mml:math id="mml-eqn-41" display="block"><mml:mi>S</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>y</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mspace width="thinmathspace" /><mml:mspace width="thinmathspace" /><mml:mi>A</mml:mi><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>a</mml:mi><mml:mi>b</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mspace width="thinmathspace" /><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>
As the mathematical model <xref ref-type="disp-formula" rid="eqn-9">(9)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-39">(39)</xref> along with the initial condition <xref ref-type="disp-formula" rid="eqn-40">(40)</xref> is very complex and in this situation, numerical solution is recommended instead of an analytical approach. The availability of the cloud infrastructure is given by.</p>
</sec>
</sec>
<sec id="s6"><label>6</label><title>Result and Discussions</title>
<p>In this section, the simulation setup and result using various simulation configurations are discussed. Simulation is performed using Cloudsim 3.0, The simulation uses workload traces for real-time task simulation which is an SWF format workload file from parallel workload, a free open-source dataset from parallel workload repository. <?A3B2 "tbl3",5,"anchor"?><xref ref-type="table" rid="table-1.2">Tab. 1.2</xref> shows the configuration of tasks with its size varying from 200 instructions to 40000 Instruction. Where the instructions are of small, moderate and large size.</p>
<p>The simulation is carried out with ANN model with 3 hidden layers and leaky Relu function as smoothening function at output layer and hidden layers. The number of neurons in each hidden layer is 50. In <?A3B2 "fig3",5,"anchor"?><xref ref-type="fig" rid="fig-3">Figs. 3a</xref> and <xref ref-type="fig" rid="fig-3">3b</xref> shows a comparison of the average start time of task with 5 and 10 virtual machines in 4 datacenters. The results show the proposed algorithm provides better performance and the least average start time with increasing task load as compared to existing approaches. This shows that the waiting time in queue for the task in the least for most of the tasks. <?A3B2 "fig4",5,"anchor"?><xref ref-type="fig" rid="fig-4">Figs. 4a</xref> and <xref ref-type="fig" rid="fig-4">4b</xref> discusses a comparison of the average finish time of task with 5 and 10 virtual machines in 4 datacenters. The experiment shows that the proposed algorithm completes tasks with the least average finish time with increasing tasks in different scenarios. This shows that most of the tasks are allocated to resources with high computation performance which can complete the task in the least time within the deadline.</p>
<table-wrap id="table-1.2"><label>Table 1.2</label><caption><title>Configuration parameters of user tasks</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Task parameters</th>
<th align="left">Values</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Task length</td>
<td align="left">200&#x2013;40000</td>
</tr>
<tr>
<td align="left">Input size</td>
<td align="left">300 Byte</td>
</tr>
<tr>
<td align="left">Output size</td>
<td align="left">300 Byte</td>
</tr>
<tr>
<td align="left">PE</td>
<td align="left">1/2</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="fig-3"><label>Figure 3</label><caption><title>(a) Comparison average start time <italic>vs.</italic> number of tasks for 5 VM (b) Comparison average start time <italic>vs.</italic> number of tasks for 5 VM</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-3.png"/></fig>
<fig id="fig-4"><label>Figure 4</label><caption><title>(a) Comparison average finish time <italic>vs.</italic> number of tasks for 5 VM (b) Comparison average finish time <italic>vs.</italic> number of tasks for 5 VM</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-4.png"/></fig>
<p><?A3B2 "fig5",5,"anchor"?><xref ref-type="fig" rid="fig-5">Figs. 5a</xref> and <xref ref-type="fig" rid="fig-5">5b</xref> discusses a comparison of the execution time of tasks with 4 datacenters. The results show the proposed algorithm provides the least execution time with scaling tasks and virtual machines. For less number of tasks, the proposed algorithm proves to provide similar to existing best meta-heuristic algorithms like genetic algorithm, harmony search and bat-inspired algorithms.</p>
<p><?A3B2 "fig6",5,"anchor"?><xref ref-type="fig" rid="fig-6">Figs. 6a</xref> and <xref ref-type="fig" rid="fig-6">6b</xref> discusses a comparison of the change in utilization of with 5 and 10 virtual machines in 4 datacenters. The results show the proposed algorithm provides better performance and high utilization with increasing task load. This shows the proposed algorithm provides better resource management by utilizing the resources and high performance. This also shows that there is a low probability of hot spots in the cloud infrastructure. Where power is directly promotional to the utilization of the server. Better the utilization least the power consumption of the system, in existing systems there exist host spots which are highly loaded which consume more power leaver other consuming power without been utilized.</p>
<fig id="fig-5"><label>Figure 5</label><caption><title>(a) Comparison execution time <italic>vs.</italic> number of tasks for 5 VM (b) Comparison execution time <italic>vs.</italic> number of tasks for 5 VM</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-5.png"/></fig>
<fig id="fig-6"><label>Figure 6</label><caption><title>(a) Comparison average utilization <italic>vs.</italic> number of tasks for 5 VM (b) Comparison average utilization <italic>vs.</italic> number of tasks for 5 VM</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="CMC_23056-fig-6.png"/></fig>
<p>The simulated results of steady state availability were obtained for a particular set of parametric values with respect to time. The base values are as follows: <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.0002, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.0006, <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.0003, <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.0001, <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.002, <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.00025, <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.017, <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.0018, <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.021, <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mrow><mml:msub><mml:mi>&#x03C4;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.0038, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.221, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.181, <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.451, <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.204, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>5</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.218, <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>6</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.458, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.259, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>8</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.456, <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>9</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.318, <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mrow><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mrow><mml:mn>10</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> &#x003D; 0.318. From <?A3B2 "tbl3",5,"anchor"?><xref ref-type="table" rid="table-2">Tab. 2</xref>, it is revealed that SSA decreases with time, h/w failure rate and software failure rate. At time t &#x003D; 20, initially cloud infrastructure availability is 0.911775 while after making 100&#x0025; variation in the failure rate of hardware and software of client, it is observed that availability more rapidly declined in case of software failure. The 100&#x0025; variation in h/w repair and software rejuvenation shows that software rejuvenation is more sensitive than hardware repair. <xref ref-type="table" rid="table-2">Tab. 2</xref> shows that hardware failure and repair rates of the cloud are more sensitive instead of software failure and rejuvenation. <xref ref-type="table" rid="table-2">Tab. 2</xref> depicted that software failures of services and load failure of cloud infrastructure highly influence the SSA of the cloud infrastructure. <xref ref-type="table" rid="table-2">Tab. 2</xref> revealed that software failure in network and software rejuvenation sharply decline of the incline the availability of the system. <xref ref-type="table" rid="table-2">Tab. 2</xref> revealed that software failure in databases decreases the SSA of cloud infrastructure.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Analysis of impact on failure and repair rates</title></caption>
<table frame="hsides" >
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left"/>
<th align="left">Average base values</th>
<th align="left">Average H/w failure</th>
<th align="left">Average S/w failure</th>
<th align="left">Average H/w repair</th>
<th align="left">Average S/w rejuvenation</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Impact of client&#x0027;s failure and repair rates</td>
<td align="left">0.9114029</td>
<td align="left">0.910652</td>
<td align="left">0.908663</td>
<td align="left">0.911778</td>
<td align="left">0.9127762</td>
</tr>
<tr>
<td align="left">Impact of cloud&#x0027;s failure and repair rates</td>
<td align="left">0.9114029</td>
<td align="left">0.910851</td>
<td align="left">0.910996</td>
<td align="left">0.911679</td>
<td align="left">0.9116063</td>
</tr>
<tr>
<td align="left">Impact of service &#x0026; load failure and repair rates</td>
<td align="left">0.9114029</td>
<td align="left">0.903851</td>
<td align="left">0.901584</td>
<td align="left">0.915223</td>
<td align="left">0.9163935</td>
</tr>
<tr>
<td align="left">Impact of network&#x0027;s failure and repair rates</td>
<td align="left">0.9114029</td>
<td align="left">0.91095</td>
<td align="left">0.859967</td>
<td align="left">0.91163</td>
<td align="left">0.9394854</td>
</tr>
<tr>
<td align="left">Impact of database&#x0027;s failure and repair rates</td>
<td align="left">0.9114029</td>
<td align="left">0.910978</td>
<td align="left">0.901793</td>
<td align="left">0.911608</td>
<td align="left">0.9141128</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s7"><label>7</label><title>Conclusions and Future Directions</title>
<p>This work presented a whale optimization and neural-inspired virtual machine assignment to the user requests approach based on the features of the human brain and optimization method for healthcare cloud applications. The proposed algorithm tries to improve the fault tolerance of the cloud environment and managing to improve the performance of the system at the same time using machine learning techniques. The results and discussions section illustrates that WHA-ANN performs better than existing meta-heuristic techniques. The study of the proposed algorithm is performed with scaling task load and resources. The proposed stochastic model revealed that software failure of network subsystem is most sensitive and needs additional care for operation. In the future work may focus on virtual machine allocation in a data center network. The drawback of the proposed algorithm is that the neural network needs to be trained after some time with updated upcoming tasks to overcome the decay of the trained model. This training time will although be much lesser than the total sum of the simulation time of the existing algorithm. In the future, the algorithm may be tried to improve the power consumption and scalability in the cloud environment. In future work, the idea of arbitrary failure and repair rates and multiple failures can be incorporated to enhance the availability of the cloud infrastructure.</p>
</sec>
</body>
<back>
<fn-group>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that they have no conflicts of interest to report regarding the present study.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A. N.</given-names> <surname>Toosi</surname></string-name>, <string-name><given-names>R. N.</given-names> <surname>Calheiros</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Buyya</surname></string-name></person-group>, &#x201C;<article-title>Interconnected cloud computing environments: Challenges, taxonomy, and survey</article-title>,&#x201D; <source>ACM Computing Surveys (CSUR)</source>, vol. <volume>47</volume>, no. <issue>1</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>47</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Cusumano</surname></string-name></person-group>, &#x201C;<article-title>Cloud computing and SaaS as new computing platforms</article-title>,&#x201D; <source>Communications of the ACM</source>, vol. <volume>53</volume>, no. <issue>4</issue>, pp. <fpage>27</fpage>&#x2013;<lpage>29</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S. K.</given-names> <surname>Gavvala</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Jatoth</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Gangadharan</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Buyya</surname></string-name></person-group>, &#x201C;<article-title>QoS-Aware cloud service composition using eagle strategy</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>90</volume>, pp. <fpage>273</fpage>&#x2013;<lpage>290</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Kaur</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Mehta</surname></string-name></person-group>, &#x201C;<article-title>Resource provisioning and work flow scheduling in clouds using augmented shuffled frog leaping algorithm</article-title>,&#x201D; <source>Journal of Parallel and Distributed Computing</source>, vol. <volume>101</volume>, pp. <fpage>41</fpage>&#x2013;<lpage>50</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Shen</surname></string-name> and <string-name><given-names>C.</given-names> <surname>Miles</surname></string-name></person-group>, &#x201C;<article-title>PageRankVM: A pagerank based algorithm with anti-collocation constraints for virtual machine placement in cloud datacenters</article-title>,&#x201D; in <conf-name>Proc. of the IEEE 38th Int. Conf. on Distributed Computing Systems (ICDCS)</conf-name>, <conf-loc>Vienna, Austria</conf-loc>, pp. <fpage>634</fpage>&#x2013;<lpage>644</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Michael</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Fox</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Griffith</surname></string-name>, <string-name><given-names>A. D.</given-names> <surname>Joseph</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Katz</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>A view of cloud computing</article-title>,&#x201D; <source>Communications of the ACM</source>, vol. <volume>4</volume>, pp. <fpage>50</fpage>&#x2013;<lpage>58</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Morshedlou</surname></string-name> and <string-name><given-names>M. R.</given-names> <surname>Meybodi</surname></string-name></person-group>, &#x201C;<article-title>Decreasing impact of SLA violations: A proactive resource allocation approachfor cloud computing environments</article-title>,&#x201D; <source>IEEE Transactions on Cloud Computing</source>, vol. <volume>2</volume>, no. <issue>2</issue>, pp. <fpage>156</fpage>&#x2013;<lpage>167</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhao</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Hu</surname></string-name> and <string-name><given-names>B.</given-names> <surname>Hu</surname></string-name></person-group>, &#x201C;<article-title>Job scheduling algorithm based on berger model in cloud environment</article-title>,&#x201D; <source>Advances in Engineering Software</source>, vol. <volume>42</volume>, no. <issue>7</issue>, pp. <fpage>419</fpage>&#x2013;<lpage>425</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Kayalvili</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Selvam</surname></string-name></person-group>, &#x201C;<article-title>Hybrid SFLA-GA algorithm for an optimal resource allocation in cloud</article-title>,&#x201D; <source>Cluster Computing</source>, pp. <fpage>3165</fpage>&#x2013;<lpage>3173</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Arunarani</surname></string-name>, <string-name><given-names>D.</given-names> <surname>Manjula</surname></string-name> and <string-name><given-names>V.</given-names> <surname>Sugumaran</surname></string-name></person-group>, &#x201C;<article-title>Task scheduling techniques in cloud computing: A literature survey</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>91</volume>, pp. <fpage>407</fpage>&#x2013;<lpage>415</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Gen</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Cheng</surname></string-name></person-group>, <source>Genetic Algorithms and Engineering Optimization</source>, vol. <volume>7</volume>, <publisher-loc>Hoboken, NJ, USA</publisher-loc>: <publisher-name>Wiley</publisher-name>, <year>2000</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Dorigo</surname></string-name> and <string-name><given-names>G. D.</given-names> <surname>Caro</surname></string-name></person-group>, &#x201C;<article-title>Ant colony optimization: A new metaheuristic</article-title>,&#x201D; <source>Proceedings of the 1999 Congress on Evolutionary Computation-CEC99</source>, vol. <volume>2</volume>, pp. <fpage>1470</fpage>&#x2013;<lpage>1477</lpage>, <year>1999</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Kennedy</surname></string-name></person-group>, &#x201C;<article-title>Particle swarm optimization</article-title>,&#x201D; in <conf-name>Proc. of the the IEEE Int. Conf. on Neural Networks</conf-name>, <publisher-name>Springer</publisher-name>, pp. <fpage>760</fpage>&#x2013;<lpage>766</lpage>, <year>2011</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W. Z.</given-names> <surname>Sun</surname></string-name>, <string-name><given-names>J. S.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>X.</given-names> <surname>Wei</surname></string-name></person-group>, &#x201C;<article-title>An improved whale optimization algorithm based on different searching paths and perceptual disturbance</article-title>,&#x201D; <source>Symmetry</source>, vol. <volume>10</volume>, no. <issue>6</issue>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>N.</given-names> <surname>Anand</surname></string-name></person-group>. &#x201C;<article-title>Handbook of cloud computing: Basic to advance research on the concepts and design of cloud computing</article-title>,&#x201D; <publisher-name>BPB Publications</publisher-name>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Kaur</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Singh</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Nayyar</surname></string-name></person-group>, &#x201C;<article-title>Data placement in era of cloud computing: A survey, taxonomy and open research issues</article-title>,&#x201D; <source>Scalable Computing: Practice and Experience</source>, vol. <volume>20</volume>, pp. <fpage>377</fpage>&#x2013;<lpage>398</lpage>, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Ali</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Hafeez</surname></string-name>, <string-name><given-names>N. Z.</given-names> <surname>Jhanjhi</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Humayun</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Imran</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Towards pattern-based change verification framework for cloud-enabled healthcare component-based</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>8</volume>, pp. <fpage>148007</fpage>&#x2013;<lpage>148020</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Nayyar</surname></string-name>, <string-name><given-names>D. N.</given-names> <surname>Le and N</surname></string-name></person-group>. <person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Nguyen</surname></string-name></person-group>, &#x201C;<article-title>Advances in swarm intelligence for optimizing problems in computer science</article-title>,&#x201D; <publisher-name>CRC Press</publisher-name>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P. S.</given-names> <surname>Rawat</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Dimri</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Gupta</surname></string-name> and <string-name><given-names>G. P.</given-names> <surname>Saroha</surname></string-name></person-group>, &#x201C;<article-title>Resource provisioning in scalable cloud using bio-inspired artificial neural network model</article-title>,&#x201D; <source>Applied Soft Computing</source>, vol. <volume>99</volume>, pp. <fpage>106876</fpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Malawski</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Figiela</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Nabrzyski</surname></string-name></person-group>, &#x201C;<article-title>Cost minimization for computational applications on hybrid cloud infrastructures</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>29</volume>, no. <issue>7</issue>, pp. <fpage>1786</fpage>&#x2013;<lpage>1794</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Su</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Li</surname></string-name>, <string-name><given-names>Q.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Shuang</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Cost-efficient task scheduling for executing large programs in the cloud</article-title>,&#x201D; <source>Parallel Computing</source>, vol. <volume>39</volume>, no. <issue>4/5</issue>, pp. <fpage>177</fpage>&#x2013;<lpage>188</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Yang</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Gerasoulis</surname></string-name></person-group>, &#x201C;<article-title>DSC: Scheduling parallel tasks on an unbounded number of processors</article-title>,&#x201D; <source>IEEE Transactions on Parallel and Distributed Systems</source>, vol. <volume>5</volume>, no. <issue>9</issue>, pp. <fpage>951</fpage>&#x2013;<lpage>967</lpage>, <year>1994</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G. C.</given-names> <surname>Sih</surname></string-name> and <string-name><given-names>E. A.</given-names> <surname>Lee</surname></string-name></person-group>, &#x201C;<article-title>A Compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures</article-title>,&#x201D; <source>IEEE Transactions on Parallel and Distributed Systems</source>, vol. <volume>4</volume>, no. <issue>2</issue>, pp. <fpage>175</fpage>&#x2013;<lpage>187</lpage>, <year>1993</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. W.</given-names> <surname>Tsai</surname></string-name> and <string-name><given-names>J. J.</given-names> <surname>Rodrigues</surname></string-name></person-group>, &#x201C;<article-title>Metaheuristic scheduling for cloud: A survey</article-title>,&#x201D; <source>IEEE Systems Journal</source>, vol. <volume>8</volume>, no. <issue>1</issue>, pp. <fpage>279</fpage>&#x2013;<lpage>291</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H.</given-names> <surname>Aziza</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Krichen</surname></string-name></person-group>, &#x201C;<article-title>Bi-objective decision support system for task scheduling based on genetic algorithm in cloud computing</article-title>,&#x201D; <source>Computin</source>, vol. <volume>100</volume>, no. <issue>2</issue>, pp. <fpage>65</fpage>&#x2013;<lpage>91</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Mirjalili</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Lewis</surname></string-name></person-group>, &#x201C;<article-title>The whale optimization algorithm</article-title>,&#x201D; <source>Advances in Engineering Software</source>, vol. <volume>95</volume>, pp. <fpage>51</fpage>&#x2013;<lpage>67</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>C. H.</given-names> <surname>Hsu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Xiao</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>Provision of data-intensive services through energy-and QoS-aware virtual machine placement in national cloud data centers</article-title>,&#x201D; <source>IEEE Transactions on Emerging Topics in Computing</source>, vol. <volume>4</volume>, no. <issue>2</issue>, pp. <fpage>290</fpage>&#x2013;<lpage>300</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Chen</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Long</surname></string-name></person-group>, &#x201C;<article-title>Task scheduling of cloud computing using integrated particle swarm algorithm and ant colony algorithm</article-title>,&#x201D; <source>Cluster Computing</source>, vol. <volume>22</volume>, no. <issue>4</issue>, pp. <fpage>2761</fpage>&#x2013;<lpage>2769</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>C. Y.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>C. M.</given-names> <surname>Zou</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Wu</surname></string-name></person-group>, &#x201C;<article-title>A task scheduling algorithm based on genetic algorithm and ant colony optimization in cloud computing</article-title>,&#x201D; in <conf-name>Proc. of the 13th Int. Symp. on Distributed Computing and Applications to Business, Engineering and Science</conf-name>, <conf-loc>Hubei, China</conf-loc>, pp. <fpage>68</fpage>&#x2013;<lpage>72</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C. W.</given-names> <surname>Tsai</surname></string-name>, <string-name><given-names>W. C.</given-names> <surname>Huang</surname></string-name>, <string-name><given-names>M. H.</given-names> <surname>Chiang</surname></string-name>, <string-name><given-names>M. -C.</given-names> <surname>Chiang</surname></string-name> and <string-name><given-names>C. -S.</given-names> <surname>Yang</surname></string-name></person-group>, &#x201C;<article-title>A Hyper-heuristic scheduling algorithm for cloud</article-title>,&#x201D; <source>IEEE Transactions on Cloud Computing</source>, vol. <volume>2</volume>, no. <issue>2</issue>, pp. <fpage>236</fpage>&#x2013;<lpage>250</lpage>, <year>2014</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Zuo</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Shu</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Dong</surname></string-name>, <string-name><given-names>C.</given-names> <surname>Zhu</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Hara</surname></string-name></person-group>, &#x201C;<article-title>A Multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing</article-title>,&#x201D; <source>IEEE Access</source>, vol. <volume>3</volume>, pp. <fpage>2687</fpage>&#x2013;<lpage>2699</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>F.</given-names> <surname>Ramezani</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Lu</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Hussain</surname></string-name></person-group>, &#x201C;<article-title>Task scheduling optimization in cloud computing applying multi-objective particle swarm optimization</article-title>,&#x201D; in <conf-name>Proc. of the Int. Conf. on Service-Oriented Computing</conf-name>, <conf-loc>Berlin, Germany</conf-loc>, pp. <fpage>237</fpage>&#x2013;<lpage>251</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>Y.</given-names> <surname>Mao</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Green</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Xiong</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Guo</surname></string-name></person-group>, &#x201C;<article-title>DRESS: Dynamic resource-reservation scheme for congested data-intensive computing platforms</article-title>,&#x201D; in <conf-name>Proc. of the IEEE 11th Int. Conf. on Cloud Computing (CLOUD)</conf-name>, <conf-loc>San Francisco, CA, USA</conf-loc>, pp. <fpage>694</fpage>&#x2013;<lpage>701</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Shen</surname></string-name></person-group>, &#x201C;<article-title>Dependency-aware and resource-efficient scheduling for heterogeneous jobs in clouds</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Cloud Computing Technology and Science (CloudCom)</conf-name>, <conf-loc>Luxembourg City</conf-loc>, pp. <fpage>110</fpage>&#x2013;<lpage>117</lpage>, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>W.</given-names> <surname>Ahmad</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Hasan</surname></string-name>, <string-name><given-names>U.</given-names> <surname>Pervez</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Qadir</surname></string-name></person-group>, &#x201C;<article-title>Reliability modeling and analysis of communication networks</article-title>,&#x201D; <source>Journal of Network and Computer Applications</source>, vol. <volume>78</volume>, pp. <fpage>191</fpage>&#x2013;<lpage>215</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Sousa</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Lins</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Tavares</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Maciel</surname></string-name></person-group>, &#x201C;<article-title>Cloud infrastructure planning considering different redundancy mechanisms</article-title>,&#x201D; <source>Computing</source>, vol. <volume>99</volume>, no. <issue>9</issue>, pp. <fpage>841</fpage>&#x2013;<lpage>864</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Castiglione</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Gribaudo</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Iacono</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Palmieri</surname></string-name></person-group>, &#x201C;<article-title>Modeling performances of concurrent big data applications</article-title>,&#x201D; <source>Software: Practice and Experience</source>, vol. <volume>45</volume>, no. <issue>8</issue>, pp. <fpage>1127</fpage>&#x2013;<lpage>1144</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Xu</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Pei</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Guo</surname></string-name>, <string-name><given-names>R.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Hu</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Reliability analysis of cloud service-based applications through SRGM and NMSPN</article-title>,&#x201D; <source>Journal of Shanghai Jiaotong University (Science)</source>, vol. <volume>25</volume>, no. <issue>1</issue>, pp. <fpage>57</fpage>&#x2013;<lpage>64</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Ignatova</surname></string-name> and <string-name><given-names>A. V.</given-names> <surname>Biehun</surname></string-name></person-group>, &#x201C;<article-title>Estimating the reliability of the elements of cloud services</article-title>,&#x201D; <source>Operations Research and Decisions</source>, vol. <volume>27</volume>, no. <issue>3</issue>, pp. <fpage>65</fpage>&#x2013;<lpage>80</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>O.</given-names> <surname>Ivanchenko</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Kharchenko</surname></string-name>, <string-name><given-names>B.</given-names> <surname>Moroz</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Kabak</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Smoktii</surname></string-name></person-group>, &#x201C;<article-title>Semi-markov&#x0027;s models for availability assessment of an infrastructure as a service cloud with multiple pools of physical and virtual machines</article-title>,&#x201D; in <conf-name>Proc. of the IEEE 9th Int. Conf. on Dependable Systems, Services and Technologies (DESSERT)</conf-name>, <conf-loc>Kyiv, Ukraine</conf-loc>, pp. <fpage>98</fpage>&#x2013;<lpage>102</lpage>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>C.</given-names> <surname>Shekhar</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Kumar</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Gupta</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name> and <string-name><given-names>S.</given-names> <surname>Varshney</surname></string-name></person-group>, &#x201C;<article-title>Warm-spare provisioning computing network with switching failure, common cause failure, vacation interruption, and synchronized reneging</article-title>,&#x201D; <source>Reliability Engineering &#x0026; System Safety</source>, vol. <volume>199</volume>, pp. <fpage>106910</fpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Sousa</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Maciel</surname></string-name></person-group>. <person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Medeiros</surname></string-name>, <string-name><given-names>F.</given-names> <surname>Lins</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Tavares</surname></string-name> and <string-name><given-names>E.</given-names> <surname>Medeiros</surname></string-name></person-group>, &#x201C;<article-title>Stochastic model generation for cloud infrastructure planning</article-title>,&#x201D; in <conf-name>Proc. of the IEEE Int. Conf. on Systems, Man, and Cybernetics</conf-name>, <conf-loc>Manchester, United Kingdom</conf-loc>, pp. <fpage>4098</fpage>&#x2013;<lpage>4103</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Ghosh</surname></string-name>, <string-name><given-names>K. S.</given-names> <surname>Trivedi</surname></string-name>, <string-name><given-names>V. K.</given-names> <surname>Naik</surname></string-name> and <string-name><given-names>D. S.</given-names> <surname>Kim</surname></string-name></person-group>, &#x201C;<article-title>End-to-end performability analysis for infrastructure-as-a-service cloud: An interacting stochastic models approach</article-title>,&#x201D; in <conf-name>Proc. of the IEEE 16th Pacific Rim Int. Symp. on Dependable Computing</conf-name>, <conf-loc>Tokyo, Japan</conf-loc>, pp. <fpage>125</fpage>&#x2013;<lpage>132</lpage>, <year>2010</year>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M. R.</given-names> <surname>Mesbahi</surname></string-name>, <string-name><given-names>A. M.</given-names> <surname>Rahmani</surname></string-name> and <string-name><given-names>M.</given-names> <surname>Hosseinzadeh</surname></string-name></person-group>, &#x201C;<article-title>Highly reliable architecture using the 80/20 rule in cloud computing datacenters</article-title>,&#x201D; <source>Future Generation Computer Systems</source>, vol. <volume>77</volume>, pp. <fpage>77</fpage>&#x2013;<lpage>86</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Saini</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Dahiya</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Kumar</surname></string-name></person-group>, &#x201C;<article-title>Modeling and availability analysis of data center: A fuzzy approach</article-title>,&#x201D; <source>International Journal of Information Technology</source>, vol. <volume>13</volume>, pp. <fpage>1</fpage>&#x2013;<lpage>8</lpage>, <year>2020</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>