Equal Load Balancing Research Articles

ETERS: A comprehensive energy aware trust-based efficient routing scheme for adversarial WSNs

Trust-based secure routing schemes are more effective than cryptographic routing protocols to convey energy-efficient data in WSNs since cryptographic protocols require high computation, more convergence time as well as storage space. The paper presents a well-organized trust estimation-based routing scheme (ETERS) that consists multi-trust (communication trust, energy trust, data trust) approach to alleviate several internal attacks like badmouthing, Sybil, selective forwarding, on–off,​ black hole, and gray-hole attacks for clustered WSN. The proposed multi-trust approach is used to analyze the credibility of sensitive monitored data. A novel and efficient cluster head selection algorithm (ECHSA) is employed to improve the performance of the cluster head (CH) selection process in clustered WSN. ECHSA allows the facility to elect a robust CH after a certain period to perform an equal load balance on all CHs. ETERS utilizes the Beta distribution-based trust function because recovery of trust values under attacks is faster in Beta distribution than Gaussian and Dirichlet distribution. ETERS also incorporates an irregular attenuation factor during the evaluation of communication trust to reflect the effect of various external factors such as natural calamity (earthquake), network congestion, etc., based on the trust values. However, a trust-based attack detection algorithm (TADA) assesses the reliability of SNs to detect internal attacks. TADA employs IDs, locations, and triple trust to detect internal attacks. Additionally, the proposed trust system employs an adjustable dynamic sliding length logical timing window to eradicate the limitations of existing trust models. Furthermore, a trust-based secure routing algorithm is incorporated to dynamically detect misbehavior in terms of packet forwarding for energy-efficient communication among sensor nodes. ETERS is compared with QEBSR, ATRP, ELPC, and SQEER to examine its performance. Experimental results on the MATLAB simulation platform exhibit excellent performance in terms of severity analysis, attack detection, and prevention to protect WSN, energy consumption under (i) normal (ii) attack scenario, latency (in sec.), packet delivery ratio (PDR), and throughput (in %) in the existence of spiteful nodes.

Load Balancing for Stateful Forwarding by Mitigating Heavy Hitters: A Case for Multi-Threaded NDN Software Routers

Equal load balancing for dispatching incoming packets to multiple threads is a crucial requirement in the stateful forwarding of multi-threaded software routers to achieve high-speed forwarding and low packet loss simultaneously. However, equal load balancing is not trivial for Named Data Networking (NDN) routers because of their stateful forwarding. In other words, the consistency of flow states should be maintained so that multiple threads do not access the states simultaneously. Sharding, wherein packets of the same flow are dispatched to the same thread while keeping loads of threads equal, has been proposed; however, in this study, we reveal that heavy hitters like popular content packets cause load imbalance, which may eventually cause packet losses. This study proposes a load balancing mechanism for NDN routers by exploiting the fact that states of flows need not be rigorously maintained when content packets are returned from caches at intermediate routers.

A strategic performance of virtual task scheduling in multi cloud environment

An emerging technology of cloud computing has major issue as scheduling the task and resource allocating. To avoid this issue, there are suggestions on different scheduling algorithm and that has its own merits and demerits. The proposed virtual task scheduling in multi cloud environment using three different scheduling algorithms such as equal load balancing (ELB) algorithm, high priority scheduling algorithm and rate based scheduling (RBS) algorithm. These different scheduling algorithms are used based on the number of tasks and number of virtual machine in multi cloud environment architecture. If the number of task is equal to number of virtual machine, ELB scheduling algorithm is used. If the number of tasks is greater than the number of virtual machine, high prioritization scheduling algorithm is used. If the number of tasks are lesser than the number of virtual machines, RBS algorithm is used. By using these three different scheduling algorithms we can improve the makespan, average efficiency of the multi cloud computing. Simulation results have analyzed the overall performance by comparing these three different scheduling algorithms. From these simulation results, proposed virtual task scheduling which increases the makespan and reduces the delay and energy consumption.

A new fuzzy optimal reconfiguration of distribution systems for loss reduction and load balancing using ant colony search-based algorithm

All utility companies strive to achieve the well-balanced distribution systems in order to improve system voltage regulation by means of equal load balancing of feeders and reducing power loss. Optimal reconfiguration is one of the best solutions to reach this goal. This paper presents a new combined method for optimal reconfiguration using a multi-objective function with fuzzy variables. This method considers both objectives of load balancing and loss reduction in the feeders. Since reconfiguration is a nonlinear optimization problem, the ant colony algorithm is employed for the optimized response in search space. This method has been applied on two IEEE 33-bus and 69-bus distribution systems. Simulation results confirm the effectiveness of the proposed method in comparison with other techniques for optimal reconfiguration.

Parallel Fock matrix construction program for molecular orbital calculation—Specific computer with a hierarchical network

A parallel Fock matrix construction program for a hierarchical network has been developed on the molecular orbital calculation-specific EHPC system. To obtain high parallelization efficiency on the hierarchical network system, a multilevel dynamic load-balancing scheme was adopted, which provides equal load balance and localization of communications on a tree-structured hierarchical network. The parallelized Fock matrix construction routine was implemented into a GAMESS program on the EHPC system, which has a tree-structured hierarchical network. Benchmark results on a 63-processor system showed high parallelization efficiency even on the tree-structured hierarchical network.

MAC-level measurement based traffic distribution over IEEE 802.11 multi-radio networks

It is expected that multiple radio access technologies coexist within a single terminal. In those networks, we focus on the problem of how to distribute IP traffic into multiple underlying links in order to enhance the overall aggregated throughput. As an effective aggregation mechanism, traffic is equivalently assigned to each link, in proportion to its available capacity. To this end, the capacity of each link is commonly measured for easy comparison between radio links, and then, the relative split ratio is accordingly determined. We identify LTT (link transmission time) as a common link resource measure. We specifically consider that each terminal is equipped with IEEE 802.11a and 802.11b devices, and have implemented a practical testbed network system. In IEEE 802.11 networks, LTT is considerably variable due to random back-off process, depending on neighboring contending terminals and radio signal quality variations. It is actually captured at a radio device driver instead of theoretical calculation. Based on measurements, we determine traffic split ratios to both links. Extensive experimental results show that the proposed method could reduce the packet reorder delay at the receiver by achieving equal load-balance, rapidly adapting to varying link qualities (i.e., channel access contention and radio signal attenuation).

Load balance in total knee arthroplasty: an in vitro analysis

One of the goals of total knee arthroplasty (TKA) is to balance the loads between the compartments of the knee. An instrumented load cell that measures compartment loads in real time is utilized to evaluate conventional, qualitative methods of achieving this balance. TKA was performed on 10 cadaveric knees. Prior to and after load balancing, compartment forces were measured at flexion angles of 0-90 degrees. Knees were randomly assigned into one of two groups, based upon whether or not the surgeons could visualize the load cell's output during balancing. Prior to attempting load balance, there were significant differences between the medial and lateral compartment loads for all knees (p < 0.05). After attempting balance with the aid of the load cell, there was equal load balance at all angles studied. Without the aid of the load cell, balance was not consistently achieved at every angle. Conventional load balancing techniques in TKA are not perfect.

A parallel implementation of the Car-Parrinello method by orbital decomposition

We have implemented the first-principles molecular dynamics algorithm of Car and Parrinello to take advantage of the currently available and emerging class of parallel supercomputers. Computations involving different orbitals are largely carried out in parallel. The communications intensive orthonormalization has been implemented in a way that maintains equal load balancing and takes advantage of nearly the full communications bandwidth, even on computers with a low degree of connectivity, such as the mesh communications architecture. Performance statistics on the Touchstone Delta computer and comparison with the performance of an optimized code running on the Cray Y-MP are presented.