The aerodynamic performances of a passenger car and a box car with different heights of windbreak walls under strong wind were studied using the numerical simulations, and the changes of aerodynamic side force, lift f...The aerodynamic performances of a passenger car and a box car with different heights of windbreak walls under strong wind were studied using the numerical simulations, and the changes of aerodynamic side force, lift force and overturning moment with different wind speeds and wall heights were calculated. According to the principle of static moment balance of vehicles, the overturning coefficients of trains with different wind speeds and wall heights were obtained. Based on the influence of wind speed and wall height on the aerodynamic performance and the overturning stability of trains, a method of determination of the load balance ranges for the train operation safety was proposed, which made the overturning coefficient have nearly closed interval. A min(|A1|+|A2|), s.t. |A1|→|A2|(A1 refers to the downwind overturning coefficient and A2 refers to the upwind overturning coefficient)was found. This minimum value helps to lower the wall height as much as possible, and meanwhile, guarantees the operation safety of various types of trains under strong wind. This method has been used for the construction and improvement of the windbreak walls along the Lanzhou–Xinjiang railway(from Lanzhou to Urumqi, China).展开更多
This paper presented an idea to replace the traditionally expensive parallel machines by heterogeneous cluster of workstations. To emphasise the usability of cluster of workstations platform for parallel and distribut...This paper presented an idea to replace the traditionally expensive parallel machines by heterogeneous cluster of workstations. To emphasise the usability of cluster of workstations platform for parallel and distributed computing, also the paper presented the status report on the effort and experiences for the implementation of a dynamic load balancing for parallel tree computation depth first search(DFS) on the cluster of a workstations project. It compared the speedup performance obtained from our platform with that obtained from the traditional one. The speedup results show that cluster of workstations can be a serious alternative to the expensive parallel machines.展开更多
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.展开更多
With the increase of high-speed network backbones, the performance of server’s network interface gradually becomes a pivotal factor. This study provides a method called Ethernet Links Trunking (ELT) technology for ac...With the increase of high-speed network backbones, the performance of server’s network interface gradually becomes a pivotal factor. This study provides a method called Ethernet Links Trunking (ELT) technology for achieving efficient connec-tivity between backbones and servers, which provides higher bandwidth and availability of server network interface. The overview of the ELT technology and the results of performance experiment are presented in this paper. Findings showed that the network bandwidth can be scaled by multiple ELT technologies so that more reliable network connectivity can be guaranteed. Some crucial techniques such as Adapter Load Balancing (ALB) and Adapter Fault Tolerance (AFT) are presented in this paper. Experimental results showed that parallel channels of Fast Ethernet are both necessary and sufficient for supporting the data rates of multiple concurrent file transfers on file server.展开更多
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.展开更多
In recent years, several results have been introduced to enhance distributed GIS performance. While much more efforts have focused on tile map and simple symbologies on dynamic map, load balancing GIS servers have not...In recent years, several results have been introduced to enhance distributed GIS performance. While much more efforts have focused on tile map and simple symbologies on dynamic map, load balancing GIS servers have not been addressed by the GIS community so far. This paper, therefore, proposed dynamic distributed load balancing for D-GIS in order to quickly render information to client interface by involving a set of GIS servers which process clients’ requests depending of an algorithm. In the model, several concepts were introduced and defined: Virtual Server within physical machine which constitutes a setup environment for a single GIS server, Load Hash Table which contains information about virtual server’s capacity, real-time load and other mandatory elements, Request Split Table which splits requests depending of the input area’s Quantity of Information and stores request tasks composition for later reconstitution. At last we have Distributed Failover Callback Function Table level one (respectively level two) which determines whether or not the request had been successfully processed by the chosen virtual server (respectively physical machine). This table allows sending back the same request to another virtual server (respectively physical node). Two load handlers (primary and secondary) are defined in case of failure. Our Model achieves efficient load balancing by: providing efficient node selection;optimizing request routing;managing node failover;involving client’s request partitioning and introducing method type decomposition. A simulation of the algorithm shows a low response time when performing GIS operations.展开更多
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.展开更多
Load balancing is a technique for identifying overloaded and underloaded nodes and balancing the load between them.To maximize various performance parameters in cloud computing,researchers suggested various load balan...Load balancing is a technique for identifying overloaded and underloaded nodes and balancing the load between them.To maximize various performance parameters in cloud computing,researchers suggested various load balancing approaches.To store and access data and services provided by the different service providers through the network over different regions,cloud computing is one of the latest technology systems for both end-users and service providers.The volume of data is increasing due to the pandemic and a significant increase in usage of the internet has also been experienced.Users of the cloud are looking for services that are intelligent,and,can balance the traffic load by service providers,resulting in seamless and uninterrupted services.Different types of algorithms and techniques are available that can manage the load balancing in the cloud services.In this paper,a newly proposed method for load balancing in cloud computing at the database level is introduced.The database cloud services are frequently employed by companies of all sizes,for application development and business process.Load balancing for distributed applications can be used to maintain an efficient task scheduling process that also meets the user requirements and improves resource utilization.Load balancing is the process of distributing the load on various nodes to ensure that no single node is overloaded.To avoid the nodes from being overloaded,the load balancer divides an equal amount of computing time to all nodes.The results of two different scenarios showed the cross-region traffic management and significant growth in revenue of restaurants by using load balancer decisions on application traffic gateways.展开更多
Software-defined networking is one of the progressive and prominent innovations in Information and Communications Technology.It mitigates the issues that our conventional network was experiencing.However,traffic data ...Software-defined networking is one of the progressive and prominent innovations in Information and Communications Technology.It mitigates the issues that our conventional network was experiencing.However,traffic data generated by various applications is increasing day by day.In addition,as an organization’s digital transformation is accelerated,the amount of information to be processed inside the organization has increased explosively.It might be possible that a Software-Defined Network becomes a bottleneck and unavailable.Various models have been proposed in the literature to balance the load.However,most of the works consider only limited parameters and do not consider controller and transmission media loads.These loads also contribute to decreasing the performance of Software-Defined Networks.This work illustrates how a software-defined network can tackle the load at its software layer and give excellent results to distribute the load.We proposed a deep learning-dependent convolutional neural networkbased load balancing technique to handle a software-defined network load.The simulation results show that the proposed model requires fewer resources as compared to existing machine learning-based load balancing techniques.展开更多
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.展开更多
The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achie...The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).展开更多
基金Project(U1334203) supported by the National Natural Science Foundation of China
文摘The aerodynamic performances of a passenger car and a box car with different heights of windbreak walls under strong wind were studied using the numerical simulations, and the changes of aerodynamic side force, lift force and overturning moment with different wind speeds and wall heights were calculated. According to the principle of static moment balance of vehicles, the overturning coefficients of trains with different wind speeds and wall heights were obtained. Based on the influence of wind speed and wall height on the aerodynamic performance and the overturning stability of trains, a method of determination of the load balance ranges for the train operation safety was proposed, which made the overturning coefficient have nearly closed interval. A min(|A1|+|A2|), s.t. |A1|→|A2|(A1 refers to the downwind overturning coefficient and A2 refers to the upwind overturning coefficient)was found. This minimum value helps to lower the wall height as much as possible, and meanwhile, guarantees the operation safety of various types of trains under strong wind. This method has been used for the construction and improvement of the windbreak walls along the Lanzhou–Xinjiang railway(from Lanzhou to Urumqi, China).
基金National Science Foundation of China(No.60 173 0 3 1)
文摘This paper presented an idea to replace the traditionally expensive parallel machines by heterogeneous cluster of workstations. To emphasise the usability of cluster of workstations platform for parallel and distributed computing, also the paper presented the status report on the effort and experiences for the implementation of a dynamic load balancing for parallel tree computation depth first search(DFS) on the cluster of a workstations project. It compared the speedup performance obtained from our platform with that obtained from the traditional one. The speedup results show that cluster of workstations can be a serious alternative to the expensive parallel machines.
文摘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.
基金Project (No. 2001AA111011) supported by the the Hi-Tech Re-search and Development Program (863) of China
文摘With the increase of high-speed network backbones, the performance of server’s network interface gradually becomes a pivotal factor. This study provides a method called Ethernet Links Trunking (ELT) technology for achieving efficient connec-tivity between backbones and servers, which provides higher bandwidth and availability of server network interface. The overview of the ELT technology and the results of performance experiment are presented in this paper. Findings showed that the network bandwidth can be scaled by multiple ELT technologies so that more reliable network connectivity can be guaranteed. Some crucial techniques such as Adapter Load Balancing (ALB) and Adapter Fault Tolerance (AFT) are presented in this paper. Experimental results showed that parallel channels of Fast Ethernet are both necessary and sufficient for supporting the data rates of multiple concurrent file transfers on file server.
基金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.
文摘In recent years, several results have been introduced to enhance distributed GIS performance. While much more efforts have focused on tile map and simple symbologies on dynamic map, load balancing GIS servers have not been addressed by the GIS community so far. This paper, therefore, proposed dynamic distributed load balancing for D-GIS in order to quickly render information to client interface by involving a set of GIS servers which process clients’ requests depending of an algorithm. In the model, several concepts were introduced and defined: Virtual Server within physical machine which constitutes a setup environment for a single GIS server, Load Hash Table which contains information about virtual server’s capacity, real-time load and other mandatory elements, Request Split Table which splits requests depending of the input area’s Quantity of Information and stores request tasks composition for later reconstitution. At last we have Distributed Failover Callback Function Table level one (respectively level two) which determines whether or not the request had been successfully processed by the chosen virtual server (respectively physical machine). This table allows sending back the same request to another virtual server (respectively physical node). Two load handlers (primary and secondary) are defined in case of failure. Our Model achieves efficient load balancing by: providing efficient node selection;optimizing request routing;managing node failover;involving client’s request partitioning and introducing method type decomposition. A simulation of the algorithm shows a low response time when performing GIS operations.
基金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.
文摘Load balancing is a technique for identifying overloaded and underloaded nodes and balancing the load between them.To maximize various performance parameters in cloud computing,researchers suggested various load balancing approaches.To store and access data and services provided by the different service providers through the network over different regions,cloud computing is one of the latest technology systems for both end-users and service providers.The volume of data is increasing due to the pandemic and a significant increase in usage of the internet has also been experienced.Users of the cloud are looking for services that are intelligent,and,can balance the traffic load by service providers,resulting in seamless and uninterrupted services.Different types of algorithms and techniques are available that can manage the load balancing in the cloud services.In this paper,a newly proposed method for load balancing in cloud computing at the database level is introduced.The database cloud services are frequently employed by companies of all sizes,for application development and business process.Load balancing for distributed applications can be used to maintain an efficient task scheduling process that also meets the user requirements and improves resource utilization.Load balancing is the process of distributing the load on various nodes to ensure that no single node is overloaded.To avoid the nodes from being overloaded,the load balancer divides an equal amount of computing time to all nodes.The results of two different scenarios showed the cross-region traffic management and significant growth in revenue of restaurants by using load balancer decisions on application traffic gateways.
基金supported by Ulsan Metropolitan City-ETRI joint cooperation Project[21AS1600]Development of intelligent technology for key industries and autonomous human-mobile-space autonomous collaboration intelligence technology].
文摘Software-defined networking is one of the progressive and prominent innovations in Information and Communications Technology.It mitigates the issues that our conventional network was experiencing.However,traffic data generated by various applications is increasing day by day.In addition,as an organization’s digital transformation is accelerated,the amount of information to be processed inside the organization has increased explosively.It might be possible that a Software-Defined Network becomes a bottleneck and unavailable.Various models have been proposed in the literature to balance the load.However,most of the works consider only limited parameters and do not consider controller and transmission media loads.These loads also contribute to decreasing the performance of Software-Defined Networks.This work illustrates how a software-defined network can tackle the load at its software layer and give excellent results to distribute the load.We proposed a deep learning-dependent convolutional neural networkbased load balancing technique to handle a software-defined network load.The simulation results show that the proposed model requires fewer resources as compared to existing machine learning-based load balancing techniques.
文摘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.
文摘The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).