Web service applications are increasing tremendously in support of high-level businesses.There must be a need of better server load balancing mechanism for improving the performance of web services in business.Though ...Web service applications are increasing tremendously in support of high-level businesses.There must be a need of better server load balancing mechanism for improving the performance of web services in business.Though many load balancing methods exist,there is still a need for sophisticated load bal-ancing mechanism for not letting the clients to get frustrated.In this work,the ser-ver with minimum response time and the server having less traffic volume were selected for the aimed server to process the forthcoming requests.The Servers are probed with adaptive control of time with two thresholds L and U to indicate the status of server load in terms of response time difference as low,medium and high load by the load balancing application.Fetching the real time responses of entire servers in the server farm is a key component of this intelligent Load balancing system.Many Load Balancing schemes are based on the graded thresholds,because the exact information about the networkflux is difficult to obtain.Using two thresholds L and U,it is possible to indicate the load on particular server as low,medium or high depending on the Maximum response time difference of the servers present in the server farm which is below L,between L and U or above U respectively.However,the existing works of load balancing in the server farm incorporatefixed time to measure real time response time,which in general are not optimal for all traffic conditions.Therefore,an algorithm based on Propor-tional Integration and Derivative neural network controller was designed with two thresholds for tuning the timing to probe the server for near optimal perfor-mance.The emulation results has shown a significant gain in the performance by tuning the threshold time.In addition to that,tuning algorithm is implemented in conjunction with Load Balancing scheme which does not tune thefixed time slots.展开更多
According to the advances in users’service requirements,physical hardware accessibility,and speed of resource delivery,Cloud Computing(CC)is an essential technology to be used in many fields.Moreover,the Internet of ...According to the advances in users’service requirements,physical hardware accessibility,and speed of resource delivery,Cloud Computing(CC)is an essential technology to be used in many fields.Moreover,the Internet of Things(IoT)is employed for more communication flexibility and richness that are required to obtain fruitful services.A multi-agent system might be a proper solution to control the load balancing of interaction and communication among agents.This paper proposes a multi-agent load balancing framework that consists of two phases to optimize the workload among different servers with large-scale CC power with various utilities and a significant number of IoT devices with low resources.Different agents are integrated based on relevant features of behavioral interaction using classification techniques to balance the workload.Aload balancing algorithm is developed to serve users’requests to improve the solution of workload problems with an efficient distribution.The activity task from IoT devices has been classified by feature selection methods in the preparatory phase to optimize the scalability ofCC.Then,the server’s availability is checked and the classified task is assigned to its suitable server in the main phase to enhance the cloud environment performance.Multi-agent load balancing framework is succeeded to cope with the importance of using large-scale requirements of CC and(low resources and large number)of IoT.展开更多
In this paper, we explored a load-balancing algorithm in a cluster file system contains two levels of metadata-server, primary-level server quickly distributestasks to second-level servers depending on the closest loa...In this paper, we explored a load-balancing algorithm in a cluster file system contains two levels of metadata-server, primary-level server quickly distributestasks to second-level servers depending on the closest load-balancing information. At the same time, we explored a method which accurately reflect I/O traffic and storage of storage-node: computing the heat-value of file, according to which we realized a more logical storage allocation. According to the experiment result, we conclude that this new algorithm shortens the executing time of tasks and improves the system performance compared with other load algorithm.展开更多
Aiming at the load imbalance and poor scalability in single-tier Web server clusters, an efficient load balancing ap- proach is proposed for constructing an N-hierarchical (multi-tier) Web server cluster. In each la...Aiming at the load imbalance and poor scalability in single-tier Web server clusters, an efficient load balancing ap- proach is proposed for constructing an N-hierarchical (multi-tier) Web server cluster. In each layer, multiple load balancers are set to receive the user requests simultaneously, and different load bal- ancing algorithms are used to construct the high-scalable Web cluster system. At the same time, an improved load balancing al- gorithm is proposed, which can dynamically calculate weights according to the utilization of the server resources, and reasonably distribute the loads for each server according to the load status of the servers. The experimental results show that the proposed ap- proach can greatly decrease the load imbalance among the Web servers and reduce the response time of the entire Web cluster system.展开更多
A new load balancing algorithm named dynamic weighed random (DWR) algorithm for the session initiation protocol (SIP) application server cluster is proposed. It uses weighted hashing random algorithm that supports...A new load balancing algorithm named dynamic weighed random (DWR) algorithm for the session initiation protocol (SIP) application server cluster is proposed. It uses weighted hashing random algorithm that supports dialog in the SIP protocol to distribute messages. The weight of each server is dynamic adaptive with feedback mechanism. DWR insures that the cluster is balanced, and it performs better than the limited resource vector (LRV) algorithm and minimum sessions first (MSF) algorithm.展开更多
文摘Web service applications are increasing tremendously in support of high-level businesses.There must be a need of better server load balancing mechanism for improving the performance of web services in business.Though many load balancing methods exist,there is still a need for sophisticated load bal-ancing mechanism for not letting the clients to get frustrated.In this work,the ser-ver with minimum response time and the server having less traffic volume were selected for the aimed server to process the forthcoming requests.The Servers are probed with adaptive control of time with two thresholds L and U to indicate the status of server load in terms of response time difference as low,medium and high load by the load balancing application.Fetching the real time responses of entire servers in the server farm is a key component of this intelligent Load balancing system.Many Load Balancing schemes are based on the graded thresholds,because the exact information about the networkflux is difficult to obtain.Using two thresholds L and U,it is possible to indicate the load on particular server as low,medium or high depending on the Maximum response time difference of the servers present in the server farm which is below L,between L and U or above U respectively.However,the existing works of load balancing in the server farm incorporatefixed time to measure real time response time,which in general are not optimal for all traffic conditions.Therefore,an algorithm based on Propor-tional Integration and Derivative neural network controller was designed with two thresholds for tuning the timing to probe the server for near optimal perfor-mance.The emulation results has shown a significant gain in the performance by tuning the threshold time.In addition to that,tuning algorithm is implemented in conjunction with Load Balancing scheme which does not tune thefixed time slots.
文摘According to the advances in users’service requirements,physical hardware accessibility,and speed of resource delivery,Cloud Computing(CC)is an essential technology to be used in many fields.Moreover,the Internet of Things(IoT)is employed for more communication flexibility and richness that are required to obtain fruitful services.A multi-agent system might be a proper solution to control the load balancing of interaction and communication among agents.This paper proposes a multi-agent load balancing framework that consists of two phases to optimize the workload among different servers with large-scale CC power with various utilities and a significant number of IoT devices with low resources.Different agents are integrated based on relevant features of behavioral interaction using classification techniques to balance the workload.Aload balancing algorithm is developed to serve users’requests to improve the solution of workload problems with an efficient distribution.The activity task from IoT devices has been classified by feature selection methods in the preparatory phase to optimize the scalability ofCC.Then,the server’s availability is checked and the classified task is assigned to its suitable server in the main phase to enhance the cloud environment performance.Multi-agent load balancing framework is succeeded to cope with the importance of using large-scale requirements of CC and(low resources and large number)of IoT.
基金Supported by the Industrialized Foundation ofHebei Province(020501) the Natural Science Foundation of HebeiUniversity(2005Q04)
文摘In this paper, we explored a load-balancing algorithm in a cluster file system contains two levels of metadata-server, primary-level server quickly distributestasks to second-level servers depending on the closest load-balancing information. At the same time, we explored a method which accurately reflect I/O traffic and storage of storage-node: computing the heat-value of file, according to which we realized a more logical storage allocation. According to the experiment result, we conclude that this new algorithm shortens the executing time of tasks and improves the system performance compared with other load algorithm.
基金Supported by the National Natural Science Foundation of China(61073063,61173029,61272182 and 61173030)the Ocean Public Welfare Scientific Research Project of State Oceanic Administration of China(201105033)National Digital Ocean Key Laboratory Open Fund Projects(KLDO201306)
文摘Aiming at the load imbalance and poor scalability in single-tier Web server clusters, an efficient load balancing ap- proach is proposed for constructing an N-hierarchical (multi-tier) Web server cluster. In each layer, multiple load balancers are set to receive the user requests simultaneously, and different load bal- ancing algorithms are used to construct the high-scalable Web cluster system. At the same time, an improved load balancing al- gorithm is proposed, which can dynamically calculate weights according to the utilization of the server resources, and reasonably distribute the loads for each server according to the load status of the servers. The experimental results show that the proposed ap- proach can greatly decrease the load imbalance among the Web servers and reduce the response time of the entire Web cluster system.
基金supported by the National Science Fund for Distinguished Young Scholars (60525110)the National Basic Research Program of China (2007CB307100, 2007CB307103)Development Fund Project for Electronic and Information Industry
文摘A new load balancing algorithm named dynamic weighed random (DWR) algorithm for the session initiation protocol (SIP) application server cluster is proposed. It uses weighted hashing random algorithm that supports dialog in the SIP protocol to distribute messages. The weight of each server is dynamic adaptive with feedback mechanism. DWR insures that the cluster is balanced, and it performs better than the limited resource vector (LRV) algorithm and minimum sessions first (MSF) algorithm.