Energy Efficient Routing in Iot Based on Chronological Atom Search Optimization Algorithm

Internet of Things (IoT) is a developing technology used for enhancing the communication and providing flexibility to humans. The data packets are transmitted through better routing path using the IoT nodes in the network. This research presents an effective optimization algorithm for selecting the effective routing path for the transmission of the speech signal to the destination effectively. The optimization algorithm namely, chronological atom search optimization (chronological ASO) algorithm is developed for selecting the routing path. The chronological ASO algorithm is developed by integrating the chronological concept in ASO algorithm. After the initialization of the network, the effective routing path is selected using the fitness parameters, such as energy, delay and distance. Then, the speech signal is transmitted from the source node to the destination node by selecting the routing path having maximum fitness function. The performance analysis of the proposed chronological ASO algorithm is done based on the metrics, such as energy, throughput, and PDR. When compared to the existing methods, the proposed method provided a maximal energy of 0.2375, maximal PDR of 46.1538, and maximal throughput of 0.0792 for 50 nodes and obtained a maximal energy of 0.1381, maximal PDR of 32.0988, and maximal throughput of 0.0395, respectively.

Malleable parallelism with minimal effort for maximal throughput and maximal hardware load.

A new parallel high-performance computing setup, which can use every little bit of computing resources left over by traditional scheduling, regardless how small or big it may be. This enables HPC providers to achieve 100 percent load on their machines at all times, and it enables HPC users to get substantial computing time on HPC systems that are "full" with traditional jobs.<br>

Malleable parallelism with minimal effort for maximal throughput and maximal hardware load.

A new parallel high-performance computing setup, which can use every little bit of computing resources left over by traditional scheduling, regardless how small or big it may be. This enables HPC providers to achieve 100 percent load on their machines at all times, and it enables HPC users to get substantial computing time on HPC systems that are "full" with traditional jobs.<br>

Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers

For a system of two tandem queues with a finite intermediate buffer, we study the asymptotically maximal throughput as the number of servers in each station grows to infinity. First, we study the system with only dedicated servers, and then we examine the system with both dedicated and flexible servers. We assume that travel times between the two stations are negligible and that each server can only work on one customer at a time. We model the system as a birth–death Markov process, derive a closed form solution for the stationary distribution, and quantify the maximal asymptotic normalized throughput as the number of servers grows to infinity. We show that flexibility is more favorable for small systems, and as the number of servers grows, the benefits of flexibility decrease. Furthermore, we prove that when the number of servers goes to infinity, there is no need of flexibility at all, as the maximum value of the throughput is obtained. However, flexibility still has a secondary beneficial effect — a little flexibility (on the order of the square root of the number of dedicated servers at each station) guarantees that all dedicated servers are busy and results in faster convergence to the maximum throughput.

Analysis of Performance and Efficiency of Hardware and Software Firewalls

Firewalls are key elements of network security infrastructure. They should guarantee the proper level of security and, at the same time, the satisfying performance in order to not increase the packet delay in the network. In the paper, we present the comparative study on performance and security of a few firewall technologies including hardware, software and virtual solutions. Three important criteria are considered: the maximal throughput of firewall, the introduced delay and the ability to resist Denial of Service attacks. We report results of experiments, present analysis and formulate a few practical conclusions.