• Home
  • Load Balancing
  • OpenAccess
    • List of Articles Load Balancing

      • Open Access Article

        1 - Improved routing for load balancing in wireless sensor networks on the Internet of things, based on multiple ant colony algorithm
        Farhang Padidaran Moghaddam Hamid Maghsoudi
        An important issue in dynamic computer networks such as Internet networks, where the cost of connections varies continuously, is to create a traffic load balancing and increase the transmission speed of packets in the network, so that data packets are using paths with m More
        An important issue in dynamic computer networks such as Internet networks, where the cost of connections varies continuously, is to create a traffic load balancing and increase the transmission speed of packets in the network, so that data packets are using paths with minimal congestion, as a result, one of the main approaches to solve routing problems and load balancing algorithms is based on ant - based algorithms using a novel approach based on optimization of multiple ant colony optimization, the purpose of this research is to present an appropriate routing algorithm in order to shorten and improve the path due to end - to - end delay parameters, packet loss rate, bandwidth and energy consumption rate, to reach a sense of data on the Internet systems. this method has been implemented in MATLAB software and shows the results of the improvement experiments in the mentioned parameters. Manuscript profile
      • Open Access Article

        2 - WSTMOS: A Method For Optimizing Throughput, Energy, And Latency In Cloud Workflow Scheduling
        Arash Ghorbannia Delavar Reza Akraminejad sahar mozafari
        Application of cloud computing in different datacenters around the world has led to generation of more co2 gas. In addition, energy and throughput are the two most important issues in this field. This paper has presented an energy and throughput-aware algorithm for sche More
        Application of cloud computing in different datacenters around the world has led to generation of more co2 gas. In addition, energy and throughput are the two most important issues in this field. This paper has presented an energy and throughput-aware algorithm for scheduling of compressed-instance workflows in things-internet by cluster processing in cloud. A method is presented for scheduling cloud workflows with aim of optimizing energy, throughput, and latency. In the proposed method, time and energy consumption has been improved in comparison to previous methods by creating distance parameters, clustering inputs, and considering real execution time. In WSTMOS method by considering special parameters and real execution time, we managed to reach the optimized objective function. Moreover, in the proposed method parameter of time distance of tasks to virtual machines for reduction of number of migration in virtual machines was applied. In WSTMOS method by organizing the workflow inputs to low, medium and heavy groups and also by distributing appropriate load on more suitable servers for processors threshold, we accomplished to optimize energy and cost. Energy consumption was reduced by 4.8 percent while the cost was cut down by 4.4 percent using this method in comparison to studied method. Finally, average delay time, power and workload are optimized in comparison to previous methods. Manuscript profile
      • Open Access Article

        3 - Improving the load balancing in Cloud computing using a rapid SFL algorithm (R-SFLA)
        Kiomars Salimi Mahdi Mollamotalebi
        Nowadays, Cloud computing has many applications due to various services. On the other hand, due to rapid growth, resource constraints and final costs, Cloud computing faces with several challenges such as load balancing. The purpose of load balancing is management of th More
        Nowadays, Cloud computing has many applications due to various services. On the other hand, due to rapid growth, resource constraints and final costs, Cloud computing faces with several challenges such as load balancing. The purpose of load balancing is management of the load distribution among the processing nodes in order to have the best usage of resources while having minimum response time for the users’ requests. Several methods for load balancing in Cloud computing have been proposed in the literature. The shuffled frog leaping algorithm for load balancing is a dynamic, evolutionary, and inspired by nature. This paper proposed a modified rapid shuffled frog leaping algorithm (R-SFLA) that converge the defective evolution of frogs rapidly. In order to evaluate the performance of R-SFLA, it is compared to Shuffled Frog Leaping Algorithm (SFLA) and Augmented Shuffled Frog Leaping Algorithm (ASFLA) by the overall execution cost, Makespan, response time, and degree of imbalance. The simulation is performed in CloudSim, and the results obtained from the experiments indicated that the proposed algorithm acts more efficient compared to other methods based on the above mentioned factors. Manuscript profile