Optimal workflow scheduling in cloud computing based on hybrid bacterial evolutionary and bees mating optimization algorithm

Distributed computing is the most recent developing pattern in disseminated processing that conveys equipment framework and programming applications as administrations. The clients can devour these administrations dependent on a SLA which characterizes their required QoS parameters. By using the cloud computing technique it is possible to reduce the investment on various resources like computer hardware and software. The application or processes that are hosted and executed using clouds consist of set of tasks and it is considered that this task will form the workflow. Therefore scheduling the task is considered as a major issue as resource usage has to be maximized without affecting the services that are facilitated by the cloud. In order to execute different virtual machine application of the tasks are assigned and it is termed as enterprise arranging. In the scheduling process the inter-dependent tasks are mapped and managed in the distributed resources. For additional improvement, this paper proposes a hybrid optimization algorithm for workflow scheduling (HOWS) in cloud environment. In the proposed algorithm the first contribution is the bees mating optimization (BMO) algorithm used to share physical infrastructure to enable multiple service providers to optimize scheduling. The second contribution in the proposed algorithm is the bacterial evolutionary algorithm used to flexible access of the resources in order to optimize the network resources. By combining the hybrid optimization algorithm provides the better improvement in terms of task scheduling and optimal resource allocation. The result and performance analysis shows that the proposed technique performs very efficient in terms of energy efficiency and scalability without compromising security. The performance is obtained using cloudSim tool ___________________________________________________________________________

Workflow Scheduling: in cloud computing the application that are hosted and executed in its platforms composed of set of task. These tasks are used to form he workflow. The workflow process depends on the task that is performedconstructedwith the regulatorwithfactsneeds [6]. The workflow applications [7] has designed by Directed Acyclic Graph (DAG). The DAG is portrayed utilizing the tuple G (T, E), where the assignment is represented by T and set of n errands can be represented as {t1, t2,......,tn}, E demonstrate a lot of edges and it show the conditions. The ti of T show the assignment in the application and the edge (ti ..........tj) of E speaks to a priority constraint, with the end goal that the execution of tjεT can't be begun before tiε T complete its execution. In the event that (ti, tj) ε T, at that point ti is considered as the client of tj and tj is the offspring of ti. the figure 1 demonstrates the work flow in a cloud computing platform.

Figure 1Workflow Application
Form the figure it is clear that the tasks are inter-dependent. The first task considers as the entry task and for it there is no parents.Also, the last level of task is the exit tasks and it doesn't have children. The first task is the parent task for the level 1 and 2. Assignment of the application tasks to various VMs for execution (Wu et al 2013) is considered as the progress assigning. In this assigned process the inter-dependent progress are mapped and managed. The workflow will allocate proper resources for completing the execution process. The execution will be completed by satisfying the SLAs agreed with the users.
Workflow scheduling is a commonly used for[8] NP-broaddelinquent and numerousexperiential and metaheuristics approachesare used in the grids base system. After completing workflow task atthat its paternalerrands have finished whichafter be performed. To the available resources the workflow scheduling can distribute tasks. When the resources are available thetask are executed. For placing the task in the next resources the scheduling algorithms are used. This is commonly used in data intensive workflows in which scheduling child task process on the same resources as their parent's decreases data transfer process dramatically. During the execution process a schedule that was valid in the beginning may turn into invalid, because the resource goes offline or improve network congestion\ latencies.
QoS is the aggregate exertion of administrations execution, which decides the level of the fulfillment of a client for the administrations and can be communicated as far as subjective estimates like make range (finishing time), cost, accessibility, unwavering quality, need, load parity and due date [9]. [10] have proposed a CTC calculation to accomplish lower cost while complying with the client assigned time constraint. Be that as it may, this was found to expand the general occupation fulfillment time. FIFO booking was proposed by assessing the whole gathering of undertakings in the activity line [11]. It, be that as it may, neglected to upgrade the booking to adjust to evolving loads. A heuristic put together planning with respect to PSO [12] lead to minimization of all out expense of execution yet did not take into account advancing the culmination time.
A need-based employment planning [13] model was proposed for appointing need to work process undertakings and make length, anyway we not consider the amount. In Ant Colony Optimization, a single VM which has greater implementation was used for executing all errands. This trigger the freight cumbersomeness as there would overpower trouble on one VM rest of them will be inert. The computation was seen to be not adaptable and the make range of the assignments was also broad. The PCM calculation [6] was proposed to execute the work processes with least time inside the client determined due date, yet does not address the errand consummation due date imperative. The Bi-Objective Priority based Particle Swarm Optimization [14] workflow were desined to limit execution cost while complying with a client characterized time constraint. Nonetheless, reduction of fruition duration was not examine. Meta heuristic methods designed above, it contemplate just like couple of QoS parameter [15]. Be that as it may, SLAs need various QoS indicator to met and effective work process technique are required to meet these prerequisites. Consequently, work process planning remains a key test for cloud computing models. The main objectives of the concept is summarized as follows:


To develop an efficient workflow scheduling to optimizes resource utilization in Cloud computing.  To schedule workflows on basis of multiple QoS constraints: completion time, cost and deadline  To achieve task load balance among the multiple VMs available in the cloud. Progress duration can be describe as duration need to complete a particular errand. VM. Completion time is the duration taken to complete the set of tasks that comprise the job or application. Cut-off point is defined as the extreme duration that can be taken to complete the application tasks. Load balancing looks at dividing the task evenly on different machine for optimum provisioning of cloud resources.
The major contributions are,


The first contribution is to introduce a bees mating optimization (BMO) algorithm to share physical infrastructure to enable multiple service providers to optimize scheduling.
 The flexible access requires efficient bacterial evolutionary algorithm to optimize the network resources; the combined hybrid optimization algorithm provides the better enhancement in terms of task scheduling and optimal resource allocation.

Related work
Gawaliet al.
[16] experientialmethodwhichmerges the MAHP, BATS + BAR optimization, LEPT, and divideand-conquer model is design to do errand assignment and device allocation. Commission arrangement and supply apportionment are major two factors of the cloud computing. In MAHP execution the errand is processed separately, by previous genuine distribution to internet capitals. By combiningBATS and BAR optimization method is used in MAHP process, the bandwidth and freight of distributor resources are major constraints.
According to Moonet al.
[17] the planning calculation straightforwardly influences the expense for clients as the distributed computing gives figuring assets on a compensation for every utilization premise. Along these lines, task booking calculation dependent on insect state enhancement is presented here. In that the assignments of cloud clients are allotted for implied devices in distributed determine circumstance in an appropriate way. For improving the execution assignment to organize, present in the distributor conditions broadening and fortification procedures is utilized in the subterranean insect settlement streamlining. In underground bug state streamlining computation, the overall improvement issue with slave ants by clearing long ways whose pheromones are wrongly gathered by driving the ants. Gonzalezet al. [18] workflows are considered as an approach to formalize and structure information examination, this will assist researchers with handling the mind-boggling activities. The utility registering is the significant qualities of cloud and this element is utilized for computational and capacity assets as a metered administration. Multitenancy is another component of distributed computing and this will empower asset and cost offering to a major pool of clients. In current information escalated examine and logical undertakings multitenancy and versatility are the significant variables. One of the key empowering agents of this combination of distributed computing and logical work processes is asset the executives. In any case, a few issues identified with information concentrated burdens, complex frameworks, for example, cross breed and multi-cloud situations to help extensive scale execution of work processes, execution variances, and dependability, present as difficulties to genuinely position mists as suitable elite foundations for logical registering. This paper shows a study on cloud asset the board that gives a broad investigation of the field. A scientific classification is proposed to investigate the chose works and the examination at last prompts the meaning of holes and future difficulties to be tended to by innovative work. Sahniet al.
[19] Cloud Computing, an appropriated registering worldview, empowers conveyance of IT assets over the cloud and pursues a compensation as-you-go charging method. Work process booking is a standout amid by testing a issues in distributor figuring. Despite the fact that, work process planning on appropriated frameworks like Grids and Clusters have been broadly examined, be that as it may, these arrangements are not feasible for a Cloud domain. It is on the grounds that, a Cloud domain varies from other appropriated condition has twice noteworthy methods: on-request asset reservation and pay-as-you-go estimating method. Accordingly, we accomplish a genuine advantages using work process organization onto internet assets paperback methodologies it may underwrite a focal points and point out a provokes explicit to a internet situation should be generated. This focused on implemented technique of dynamic financial savvy due date obliged heuristic calculation for booking a logical work process in an open Cloud. The proposed strategy plans to misuse the points of interest offered by Cloud figuring while at the same time considering the virtual machine execution fluctuation and case obtaining deferral to recognize a without a moment to spare timetable of a due date compelled logical work process at lesser expenses. Rimal et al. [20] Multi-inhabitance can one of the significant features of dispersed registering, which gives flexibility and money related points of interest to the end-customers and pro communities by having a comparative cloud stage and its key structure with the separation of shared framework and procedure resources. In any case, resource the administrators with respect to multi-inhabitant conveyed processing is getting the chance to be a champion among the most confounding assignments as a result of the intrinsic heterogeneity and resource isolation. This paper proposes a novel CWSA arrangement for register concentrated work process applications in multi-inhabitant distributed computing conditions, which limits the general work process finishing time, lateness, amount of performance of a work processes, when usage of inactive internet viably. The implemented formula is focused on generating best calculations in class, i.e., FCFS, EASY Backfilling, and MCT booking arrangements to evaluate the implementation. When proof-of-idea is investigated from veritable thinking workflow models is implemented to provide adaptability of the CWSA, this checks a viability of the improved assignment. The reenactment outcome demonstrate that the implemented planning arrangement develop a work process execution and beats the previously mentioned elective booking strategies under run of the mill sending situations. Wen et al.[21] The critical development in distributed computing has prompted expanding a distributors in internet, every one provides a administration with different termssingle term may be developed to secure a most affordable or progressively dependable. In the meantime, client applications have turned out to be increasingly intricate. Frequently, they comprise of an assorted accumulation of programming parts, and need to deal with variable outstanding burdens, which present diverse prerequisites on the framework. In this way, numerous associations are thinking about utilizing a blend of various mists to fulfill these necessities. It raises, regardless, a non-minor issue of how to pick the best blend of fogs to meet the application necessities. This paper shows a novel count to send work process applications on brought together fogs. To begin with, we familiarize an entropybased methodology with assess the most strong work process associations. Second, apply an expansion of the Bell-LaPadula Multi-Level security model to address application security necessities. At last, to enhance organization as far as its entropy and furthermore its financial cost, considering the expense of figuring power, information stockpiling and between cloud correspondence. It is actualized on the new methodology and thought about it against two existing booking calculations: EDCA and EBDLS. The calculation can discover organizations that are of equal unwavering quality however are more affordable and meet security prerequisites. Arabnejad et al.[22] Essential science is ending up perpetually computationally concentrated, expanding the requirement for vast scale register and capacity assets, will be inside a High-Completion Computer group, and all late inside the distributor. As a rule, extensive scale logical calculation is spoken to as a work process for planning and runtime provisioning. Such booking become a considerably all the more testing issue on cloud frameworks because of the dynamic idea in the distributor, specifically, a flexibility of valuing methods (both constant and vital), the miscellaneous asset types, a immense range of administrations, and essential. This mapping of work process endeavors on to a great deal of provisioned events is an instance of the general booking issue and is NPwrapped up. Moreover, we furthermore need to ensure that certain runtime goals are met -the most regular being the cost of the figuring and the time which that computation requires to wrap up. This paper, provides a another heuristic booking calculation, BDAS, that addresses eScience work process planning under spending plan and due date limitations by Infrastructure as a Service (IaaS) mists. The interest of our work is satisfying both spending plan and due date impediments while showing a tunable cost-time trade off over heterogeneous cases. Moreover, we consider the security and intensity of our estimation by performing affectability examination. The results demonstrate that general BDAS finds a down to earth schedule for more than 40000 tests accomplishing both portrayed necessities: spending plan and due date. Moreover, our figuring achieves a 17.0-23.8 percent higher accomplishment rate when appeared differently in relation to front line estimations. Chen et al. [23] With the wide association of disseminated figuring in various business attempts similarly as science and building spaces, shocking security organizations are continuously fundamental for taking care of work process applications with fragile transitional data. Heartbreakingly, most existing worklfow booking approaches reject the security essentials of the moderate data conveyed by work forms, and disregard the execution impact of encryption time of widely appealing data on the start of ensuing work process errands. Additionally, the idle calendar openings on resources, coming about due to data conditions among work process errands, have not been sufficient abused to direct the impact of data encryption time on work procedures' makes pans and cash related cost. To address these issues, this paper presents a novel endeavor booking framework for security fragile work forms with three novel features. In any case, we give expansive speculative examinations on how explicitly duplicating an errand's precursor assignments is helpful for staying away from both the data transmission time and encryption time from deferring undertaking's start time. By then, we portray work process errands' latest fulfillment time, and show that endeavors can be done before assignments' latest culmination time by using most economical resources for decrease cash related cost without deferring assignments' successors start time and work procedures' make ranges. In perspective on these examinations, we devise a novel arranging approach with explicit assignments duplication, named SOLID, combining two huge stages: 1) task booking with explicitly replicating herald errands to sit plan opportunities on resources; and 2) transitional data scrambling by effectively mishandling endeavors' laxity time. We evaluate our answer approach through careful execution appraisal consider using both indiscriminately made work procedures and some genuine work process pursues. Our results exhibit that the proposed SOLID approach beats existing estimations with respect to makespan, fiscal costs and resource adequacy. Li et al. [24]Distributed computing is a reasonable stage to execute the due date compelled logical work processes which are run of the mill huge information applications and regularly require numerous hours to wrap up. Besides, the issue of vitality utilization has turned out to be one of the significant worries in mists. In this paper, a CEAS calculation for internet organizer to minimize a processing amount of workflow and lessen a vitality utilization when fulfilling a time inhibition imperative. The CEAS calculation comprises a different branch-calculations. To begin with, the VM determination calculation it may apply the idea of amount provide to delineate to their ideal VM types by the branch-make range limitation. At that point, two undertakings consolidating strategies are utilized to diminish execution cost and vitality utilization of work process. Further, in order to reuse the dormant VM precedents which have been leased, the VM reuse technique is in like manner proposed. Finally, the arrangement of slack time recuperation is utilized to save essentialness of leased VM events. According to the time eccentrics examination, we gather that the time multifaceted nature of each subestimation is polynomial. The CEAS estimation is evaluated using Cloudsim and four genuine sensible work process applications, which shows that it outmaneuvers the related comprehended the philosophies. Li et al. [25] Assigning administration limits in distributed computing depends on the suspicion that they are boundless and can be utilized whenever. Be that as it may, accessible administration limits change with outstanding task at hand and can't fulfill clients' solicitations whenever from the cloud supplier's point of view since cloud administrations can be shared by numerous assignments. Cloud specialist co-ops give accessible schedule vacancies to new client's solicitations dependent on accessible limits. In this paper, we consider work process planning with due date and schedule vacancy accessibility in distributed evaluate. An repeat heuristic system were exhibited for the problem under investigation which for the most part comprises of introductory arrangement development, improvement, and bother. Three beginning arrangement development techniques, two insatiable and reasonable based development procedures and bother method are proposed. Diverse procedures in the three various stage result shows in a few heuristics.

Problem definition
Cloud computing is the dynamic group of assorted resources including retention, packing, webrange, computedcontrol and requestexpansionthing. These resources provide scientific, engineering and business applications services to its customers. Cloud datacenters are rich in versatile computing resources satisfying the needs of both cloud service provider and service consumer. Furthermore, cloud benefits additionally include powerfully provisioning the sharable assets among the client demand. The assets are distributed and deapportioned ideally according to the application request while thinking about asset accessibility and execution prerequisites dependent on Quality of Service parameters like vitality use, cost, time, asset use and throughput. Workflow scheduling problem is a very dynamic and random in nature. They lack prior knowledge about randomness due to unpredictable workloads, and hence, execution time and cost factors which makes this problem to be in the class of NP-hard problem, being intractable in polynomial time. Various heuristic and metaheuristic methods are used to get an optimal schedule with polynomial time complexity. The workflow scheduling plays major role in cloud computing, but fluctuating demand and dynamic nature of resources are affect the performances are efficiency and scalability. The contributions are:


Bees Mating Optimization (BMO) algorithm to share physical infrastructure to enable multiple service providers to optimize scheduling.
 Bacterial Evolutionary Algorithm for flexible access of network resources

The System Model
The figure 2 demonstrates the framework model. IaaS cloud system were used for system model. Different information hubs include storing and calculating capitals which are present in VMs. For proper scheduling HOWS algorithm is used. Different tasksare there in the resources which are scheduled depending up on the priority. The bees mating optimization (BMO) algorithm used to share physical infrastructure to enable multiple service providers to optimize scheduling. The bacterial evolutionary algorithm used to flexible access of the resources in order to optimize the network resources.

Proposed Methodology
Thissection describes the proposed algorithm for scheduling the workflow. It also explains the two contributions of the proposed algorithm like bee mating algorithm and evaluation bacterial algorithm.

Bees mating optimization (BMO) algorithm
Parameters ofmultiple service providers for optimize scheduling as follows: User request (U r ): set of user request which consist of 1 to some number 'n' task elements.
Task Type(T t ):typeof task can be described and it consists of 1 to m. the T m indicatemaximum number of tasks inside the task unit.
RAM in PM (R):the existing RAM or storage size of separate PM. Computing Energy(CE): A matrix which indicates theexecution time of a task unit. The energy absorb by a PM j to implement i task unit type per unit time per unit information is given asCEij.
Bandwidth (BW): the bandwidth between PMs and, the information transfer ratio between PM i to PM j and this indicated by BW ij .

BMO Algorithm
Initially it is considered that there are k subtasks for the users in the cloud services. This k subtasks are scheduled using m computational resourcesand it is indicated by {R 1 ,R 2 , ..., R m }.
It is considered that each resource, R j hasfixed costsprice and it is indicated asp j . The price vector is given by p = {p 1 ,p 2 ,….pm}.The time allocated for R i to execute the subtask is given t i .The execution time vector is given by t = {t 1 ,t 2 ,….t m }.
To optimize the swarm-based honey bee mating algorithm is usedand the optimization is based on thelook calculation is empowered by the way toward mating in genuine bumble bees. The conduct of bumble bees is the cooperation of their:: Genetic probability II.
Ecological and physiological conditions III.
The social states of the province, just as different prior and continuous cooperations between these three parameters.
The arrangements of move make place by every honey bee areunfolded as per hereditary, environmental, and social states of the settlement. The five steps included in the algorithm are: 1. The computation starts with the mating-flight, where a ruler (best game plan) picks meanders probabilistically to shape the spermatheca (once-over of machines). A machine is then looked over the summary at sporadic for the development of broods.
2. Creation of new broods (fundamental game plans) by cross overring the drones" genotypes with the queen"s.
3. Use of workers (heuristics) to conduct local search on broods (trial solutions). 4. Adaptation of workers" capability is depend on cost of development attain on broods 5. Replacement of flimsier rulers by fitter broods.
Honey bees are a remarkable assortment of social creepy crawlies and they live in hives framed by them. The three regular components in the hive are one ruler, a few automatons and the laborers. Because of its encouraged illustrious jam the extent of the ruler is bigger than different honey bees. Normally ruler's life expectancy is around five to six years and it has the ability to set down 1500 eggs. While the ruler flies outside and a long way from the hive, the automaton attempts to mate with her noticeable all around. The working standard of the BMO is given the figure 2.

Figure 2 BMO Algorithm
The equation (3) shows the controlled mating vibration on queen.
( 3) where P(D) determine the possibility totaling a vibration sperm (D) to the queen's spermatheca, (f) indicate the complete alteration among the vibration and queen's spermatheca, and queen's fitness. Remove the depended data from the vector. The queen's speed at time't' is given by S(t). It is considered that in the mating procedure the ruler's likelihood with mating speed stays bigger in the underlying stage and furthermore if the automaton's wellness is equivalent to the ruler's wellness. After cycle, the speed and vitality of the ruler decreases and the equation is given (2) and (3): Where, α indicate the arbitrarilyengenderedissue and its assortmentsamong [0,1] and it calculate the decreased movement and charge at single iteration. E indicate the charge and 'S' indicate the movement.

Bacterial Evolutionary Algorithm
In cloud computing the main aim is to optimal utilization of the resources.To utilize the resources the major factor is toreducemakespani.e, to boost the efficiency of the cloud systems.Another factor is the reduced cost of using the available resources.
Cost =min(C (r i , j k )) for Where, , and are hefts to arrangewith themechanismsincluding the fitness job. Cost C (r i , j k ) is the cost of the jobj k which executes on resource r j and make span is the concludingperiod of the occupation.
Thus, for the proper optimization of the resources in the network the bacterial evolutionary algorithm is used.The major steps in the bacterial evolutionary algorithm are chemo taxis, swarming, imitation, removal and scattering. The food searching behavior of the bacteria is used for forming the bacterial evolutionary algorithm. Suppose to initiate charge inhalation per duration(E/T) is maximized.
Chemo taxis:the position of the E.Coli germs changes by dip and collapse through flagella location in this process. If the direction of movement of bacterium is same for certain interval of time then it is dip. Similarly,if the movement of bacterium various for a period of time it is tumbling. The p th bacteriumatq th chemotactic r th reproductive and t th elimination and dispersal step is given by p (q, r, t). The step size of tumble is given by S(p). The computation chemo taxis is described as: (6) Swarming: set of microorganismscan be shifted to nutrientsbut then againthis can moreover be fascinated or forbidden. In particular time of stress only the bacterium can be attracted.

Reproduction:
After chemo taxis process, the next process is the reproduction. The fitness value of the bacterium is calculated in this process. The fitness value is classify based on arise order. To maintain a size of the crowd as stable it reduce a wealthy germs and lead to passaway. After wealthy germs it will separate asexually into two.

Elimination and dispersal:
The elimination dispersal method were used for local optima The parameter used in the BEA algorithm are:d -measurement of the hunt space, N -number of microbes in the, c -chemotaxis step, -swim length, r -the quantity of multiplication steps, d: the quantity of disposal dispersal occasions, d -end dispersal with likelihood, S (I): the span of the progression taken the arbitrary way.

Simulation Results
Using the real world workflow the experimental analysis to evaluate the proposed algorithm is described here. The terms like makespan, security risk, and security threatare used to evaluate the performance of the proposed algorithm. The comparison is performed with the existing algorithm WOWS.
In this paper, the analysis needs to be repeatable for comparethe algorithm with various parameters. Actualizing exploratory circumstances is costly and furthermore difficult to do as asset conditions changes from time to time because of the cloud shared infrastructure. Thus choice of reenactment instruments is additionally a significant factor. The cloud recreation instrument is utilized to reproduce work process the board and it additionally plan a dynamic cloud condition.
Data Sets: in this, we have selected five various world scientific progress approach.
CyberShake: in order to verify the earthquake alarms this were used by the Southern California Earthquake Center.
Epigenomics: to generate multiple lanes of DNA sequences it is used by the DNA sequence lanes Montage: to collect multiple input imagesof the sky to create custom mosaics. It is created by NASA/IPAC stitches. Inspiral: reason for this informational index is to make and examine gravitational waveforms from information gathered amid the combining of conservative parallel frameworks.
Sipht [58]: it is usually utilized in bioinformatics. It is utilized to look for little untranslated bacterial administrative RNAs.

Figure 3 Makespan Analysis
The functionality of the analysis is given by taking CyberShake progress with 30, 50, 100, and 1000 errand. HOWS with W Sec = 0.2 andW Sec = 0.5. MOWS with W Sec = 0.2 andW Sec = 0.5 (W Sec identifies the effect of privacy or achievement from the user's side). HOWS and MOWS are the algorithm used for the schedulingtheworkloadson a heterogeneous distributor infrastructure with 20 material and 100virtual devices. Results the execution of the calculations is examined situated as far as makespan, security warning and security chance. Figure 3 shows that makespan of outstanding tasks at hand in the majority of the two calculations are nearly the equivalent. The examination among algorithmsbased on the security hazard is outlined in Figure 4. In HOWS the normal likelihood of CyberShake work process being assaulted amid its execution is less than110, anyway this likelihood is a lot higher in MOWS. Figure 5highlights HOWS with WSec= 0.5 gives less security danger to all ofthe outstanding tasks at hand.

Conclusion
For cloud environment, data transferring between tasks is aninevitable. In cloud the security is considered as an important factor for scheduling. The task scheduling is an important procedure in the cloud platform. Different scheduling algorithms are used in cloud for the scheduling and it is described in the section 1 and section 2. In this paper hybrid optimization algorithm for workflow scheduling (HOWS) algorithm is used for scheduling the task. For enhance the performances of scheduling in cloud two algorithms are used. The bees mating optimization (BMO) algorithm used to share physical infrastructure to enable multiple service providers to optimize scheduling. Also the bacterial evolutionary algorithm used to flexible access of the resources in order to optimize the network resources. By combining the hybrid optimization algorithm provides the better improvement in terms of task scheduling and optimal resource allocation. The simulation shows that the HOWS is having low makespan and low security risk and threat. Thus, from the analysis it is clear that the proposed algorithm is having better performance