Cloud computing has gained significant recognition due to its ability to provide a broad range of online services and applications.Nevertheless,existing commercial cloud computing models demonstrate an appropriate des...Cloud computing has gained significant recognition due to its ability to provide a broad range of online services and applications.Nevertheless,existing commercial cloud computing models demonstrate an appropriate design by concentrating computational assets,such as preservation and server infrastructure,in a limited number of large-scale worldwide data facilities.Optimizing the deployment of virtual machines(VMs)is crucial in this scenario to ensure system dependability,performance,and minimal latency.A significant barrier in the present scenario is the load distribution,particularly when striving for improved energy consumption in a hypothetical grid computing framework.This design employs load-balancing techniques to allocate different user workloads across several virtual machines.To address this challenge,we propose using the twin-fold moth flame technique,which serves as a very effective optimization technique.Developers intentionally designed the twin-fold moth flame method to consider various restrictions,including energy efficiency,lifespan analysis,and resource expenditures.It provides a thorough approach to evaluating total costs in the cloud computing environment.When assessing the efficacy of our suggested strategy,the study will analyze significant metrics such as energy efficiency,lifespan analysis,and resource expenditures.This investigation aims to enhance cloud computing techniques by developing a new optimization algorithm that considers multiple factors for effective virtual machine placement and load balancing.The proposed work demonstrates notable improvements of 12.15%,10.68%,8.70%,13.29%,18.46%,and 33.39%for 40 count data of nodes using the artificial bee colony-bat algorithm,ant colony optimization,crow search algorithm,krill herd,whale optimization genetic algorithm,and improved Lévy-based whale optimization algorithm,respectively.展开更多
Based on the system architecture and software structure of GMLC (Gateway Mobile Location Center) in 3G (third generation), a new dynamic load-balancing algorithm is proposed. It bases on dynamic feedback and imports t...Based on the system architecture and software structure of GMLC (Gateway Mobile Location Center) in 3G (third generation), a new dynamic load-balancing algorithm is proposed. It bases on dynamic feedback and imports the increment for admitting new request into the load forecast. It dynamically adjusts the dispatching probability according to the remainder process capability of each node. Experiments on the per- formance of algorithm have been carried out in GMLC and the algorithm is compared with Pick-KX algorithm and DFB (Dynamic FeedBack) algorithm in average throughput and average response time. Experiments re- sults show that the average throughput of the proposed algorithm is about five percents higher than that of the other two algorithms and the average response time is four percents higher under high system loading condi- tion.展开更多
Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clu...Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clusters by utilizing all system resources effectively and to avoid violent shaking of the system per- formance. A lot of simulations on the Petri net model of load balance system are conducted and the algorithm is compared with some traditional algorithms on balancing ability for heterogeneity, system throughput, re- quest response time and performance stability. The results of simulations show that the algorithm achieves system higher performance and it has excellent ability to deal with the heterogeneity of clustered media server.展开更多
Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use...Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).展开更多
The fast growth of Internet has cre-ated the need for high-speed switches. Re-cently, the crosspoint-queue switch has at-tracted attention because of its scalability and high performance. However, the Cross-point-Queu...The fast growth of Internet has cre-ated the need for high-speed switches. Re-cently, the crosspoint-queue switch has at-tracted attention because of its scalability and high performance. However, the Cross-point-Queue switch does not perform well under non-uniform traffic. To overcome this limitation, the Load-Balanced Cross-point-Queued switch architecture has been proposed. In this architecture, a load-balance stage is placed ahead of the Cross-point-Queued stage. The load-balance stage transforms the incoming non-uniform traffic into nearly uniform traffic at the input port of the second stage. To avoid out-of-order cells, this stage employs flow-based queues in each crosspoint buffer. Analysis and simulation results reveal that under non-uniform traffic, this new switch architecture achieves a delay performance similar to that of the Out-put-Queued switch without the need for inter- nal acceleration. In addition, its throughput is much better than that of the pure cross- point-queued switch. Finally, it can achieve the same packet loss rate as the cross- point-queue switch, while using a buffer size that is only 65% of that used by the cross- point-queue switch.展开更多
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.展开更多
Background-A prior diagnosis of diabetes mellitus is associated with adverse outcomes after acute myocardial infarction(MI), but the risk associated with a new diagnosis of diabetes in this setting has not been well d...Background-A prior diagnosis of diabetes mellitus is associated with adverse outcomes after acute myocardial infarction(MI), but the risk associated with a new diagnosis of diabetes in this setting has not been well defined. Methods and Results-We assessed the risk of death and major cardiovascular events associated with previously known and newly diagnosed diabetes by studying 14 703 patients with acute MI enrolled in the VALsartan In Acute myocardial iNfarcTion(VALIANT) trial. Patients were grouped by diabetic status: previously known diabetes (insulin use or diagnosis of diabetes before MI, n=3400, 23%); newly diagnosed diabetes(use of diabetic therapy or diabetes diagnosed at randomization[median 4.9 d after infarction], but no known diabetes at presentation, n=580, 4%); or no diabetes(n=10 719). Patients with newly diagnosed diabetes were younger and had fewer comorbid conditions than did patients with previously known diabetes. At 1 year after enrollment, patients with previously known and newly diagnosed diabetes had similarly increased adjusted risks of mortality(hazard ratio 1.43; 95%confidence interval, 1.29 to 1.59 and HR, 1.50; 95%CI, 1.21 to 1.85, respectively) and cardiovascular events (HR, 1.37; 95%CI, 1.27 to 1.48 and HR, 1.34; 95%CI, 1.14 to 1.56). Conclusions-Diabetes mellitus, whether newly diagnosed or previously known, is associated with poorer long-term outcomes after MI in high-risk patients. The poor prognosis of patients with newly diagnosed diabetes, despite having baseline characteristics similar to those of patients without diabetes, supports the idea that metabolic abnormalities contribute to their adverse outcomes.展开更多
New rules for this year＇s national college entrance examination, or gaokao in Mandarin, which takes place from June 7 to 9 every year, sparked heated debate among the public in China. Before gaokao in 2014, some prov...New rules for this year＇s national college entrance examination, or gaokao in Mandarin, which takes place from June 7 to 9 every year, sparked heated debate among the public in China. Before gaokao in 2014, some provincial education authorities released a new policy stipulating that gaokao applicants may receive 10 to 20 extra points if they have ＂excellent morality＂ or have records of helping others for a just cause.展开更多
基金This work was supported in part by the Natural Science Foundation of the Education Department of Henan Province(Grant 22A520025)the National Natural Science Foundation of China(Grant 61975053)the National Key Research and Development of Quality Information Control Technology for Multi-Modal Grain Transportation Efficient Connection(2022YFD2100202).
文摘Cloud computing has gained significant recognition due to its ability to provide a broad range of online services and applications.Nevertheless,existing commercial cloud computing models demonstrate an appropriate design by concentrating computational assets,such as preservation and server infrastructure,in a limited number of large-scale worldwide data facilities.Optimizing the deployment of virtual machines(VMs)is crucial in this scenario to ensure system dependability,performance,and minimal latency.A significant barrier in the present scenario is the load distribution,particularly when striving for improved energy consumption in a hypothetical grid computing framework.This design employs load-balancing techniques to allocate different user workloads across several virtual machines.To address this challenge,we propose using the twin-fold moth flame technique,which serves as a very effective optimization technique.Developers intentionally designed the twin-fold moth flame method to consider various restrictions,including energy efficiency,lifespan analysis,and resource expenditures.It provides a thorough approach to evaluating total costs in the cloud computing environment.When assessing the efficacy of our suggested strategy,the study will analyze significant metrics such as energy efficiency,lifespan analysis,and resource expenditures.This investigation aims to enhance cloud computing techniques by developing a new optimization algorithm that considers multiple factors for effective virtual machine placement and load balancing.The proposed work demonstrates notable improvements of 12.15%,10.68%,8.70%,13.29%,18.46%,and 33.39%for 40 count data of nodes using the artificial bee colony-bat algorithm,ant colony optimization,crow search algorithm,krill herd,whale optimization genetic algorithm,and improved Lévy-based whale optimization algorithm,respectively.
基金(1) National Science Fund for Distin-guished Young Scholars (No. 60525110) (2) Special-ized Research Fund for the Doctoral Program of Higher Education (No. 20030013006)+3 种基金 (3) National Specialized R&D Project for the Product of Mobile Communica-tions (Development and Application of Next Generation Mobile Intelligent Network) (4) Key Project of Devel-opment Fund for Electronic and Information Industry (Core Service Platform for Next Generation Network) (5) Development Fund Project for Electronic and Infor-mation Industry (Value-added Service Platform and Ap-plication System for Mobile Communications) (6) Na-tional Specific Project for Hi-tech Industrialization and Information Equipments (Mobile Intelligent Network Supporting Value-added Data Services).
文摘Based on the system architecture and software structure of GMLC (Gateway Mobile Location Center) in 3G (third generation), a new dynamic load-balancing algorithm is proposed. It bases on dynamic feedback and imports the increment for admitting new request into the load forecast. It dynamically adjusts the dispatching probability according to the remainder process capability of each node. Experiments on the per- formance of algorithm have been carried out in GMLC and the algorithm is compared with Pick-KX algorithm and DFB (Dynamic FeedBack) algorithm in average throughput and average response time. Experiments re- sults show that the average throughput of the proposed algorithm is about five percents higher than that of the other two algorithms and the average response time is four percents higher under high system loading condi- tion.
基金Supported by: (1) Specialized Research Fund for the Doctoral Program of Higher Education (No. 20030013006) (2) National Specialized R&D Project for the Product of Mobile Communications (Develop-ment and Application of Next Generation Mobile Intel-ligent Network System) (3) Development Fund for Electronic and Information Industry (Value-added Ser-vice Platform and Application System for Mobile Communications).
文摘Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clusters by utilizing all system resources effectively and to avoid violent shaking of the system per- formance. A lot of simulations on the Petri net model of load balance system are conducted and the algorithm is compared with some traditional algorithms on balancing ability for heterogeneity, system throughput, re- quest response time and performance stability. The results of simulations show that the algorithm achieves system higher performance and it has excellent ability to deal with the heterogeneity of clustered media server.
文摘Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).
文摘The fast growth of Internet has cre-ated the need for high-speed switches. Re-cently, the crosspoint-queue switch has at-tracted attention because of its scalability and high performance. However, the Cross-point-Queue switch does not perform well under non-uniform traffic. To overcome this limitation, the Load-Balanced Cross-point-Queued switch architecture has been proposed. In this architecture, a load-balance stage is placed ahead of the Cross-point-Queued stage. The load-balance stage transforms the incoming non-uniform traffic into nearly uniform traffic at the input port of the second stage. To avoid out-of-order cells, this stage employs flow-based queues in each crosspoint buffer. Analysis and simulation results reveal that under non-uniform traffic, this new switch architecture achieves a delay performance similar to that of the Out-put-Queued switch without the need for inter- nal acceleration. In addition, its throughput is much better than that of the pure cross- point-queued switch. Finally, it can achieve the same packet loss rate as the cross- point-queue switch, while using a buffer size that is only 65% of that used by the cross- point-queue switch.
基金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.
文摘Background-A prior diagnosis of diabetes mellitus is associated with adverse outcomes after acute myocardial infarction(MI), but the risk associated with a new diagnosis of diabetes in this setting has not been well defined. Methods and Results-We assessed the risk of death and major cardiovascular events associated with previously known and newly diagnosed diabetes by studying 14 703 patients with acute MI enrolled in the VALsartan In Acute myocardial iNfarcTion(VALIANT) trial. Patients were grouped by diabetic status: previously known diabetes (insulin use or diagnosis of diabetes before MI, n=3400, 23%); newly diagnosed diabetes(use of diabetic therapy or diabetes diagnosed at randomization[median 4.9 d after infarction], but no known diabetes at presentation, n=580, 4%); or no diabetes(n=10 719). Patients with newly diagnosed diabetes were younger and had fewer comorbid conditions than did patients with previously known diabetes. At 1 year after enrollment, patients with previously known and newly diagnosed diabetes had similarly increased adjusted risks of mortality(hazard ratio 1.43; 95%confidence interval, 1.29 to 1.59 and HR, 1.50; 95%CI, 1.21 to 1.85, respectively) and cardiovascular events (HR, 1.37; 95%CI, 1.27 to 1.48 and HR, 1.34; 95%CI, 1.14 to 1.56). Conclusions-Diabetes mellitus, whether newly diagnosed or previously known, is associated with poorer long-term outcomes after MI in high-risk patients. The poor prognosis of patients with newly diagnosed diabetes, despite having baseline characteristics similar to those of patients without diabetes, supports the idea that metabolic abnormalities contribute to their adverse outcomes.
文摘New rules for this year＇s national college entrance examination, or gaokao in Mandarin, which takes place from June 7 to 9 every year, sparked heated debate among the public in China. Before gaokao in 2014, some provincial education authorities released a new policy stipulating that gaokao applicants may receive 10 to 20 extra points if they have ＂excellent morality＂ or have records of helping others for a just cause.
