No abstract

Software‐defined networking (SDN) is a modern approach for current computer and data networks. The increase in the number of business websites has resulted in an exponential growth in web traffic. To cope with the increased demands, multiple web servers with a front‐end load balancer are widely used by organizations and businesses as a viable solution to improve the performance. In this paper, we propose a load‐balancing mechanism for SDN. Our approach allocates web requests to each server according to its response time and the traffic volume of the corresponding switch port. The centralized SDN controller periodically collects this information to maintain an up‐to‐date view of the load distribution among the servers, and incoming user requests are redirected to the most appropriate server. The simulation results confirm the superiority of our approach compared to several other techniques. Compared to LBBSRT, round robin, and random selection methods, our mechanism improves the average response time by 19.58%, 33.94%, and 57.41%, respectively. Furthermore, the average improvement of throughput in comparison with these algorithms is 16.52%, 29.72%, and 58.27%, respectively.

No abstract

No abstract

The Industrial Internet of Things is expected to enable the Industry 4.0 through the large deployment of lowpower devices. However, industrial applications require most of the time high reliability close to 100%, and low end-to-end delays. Thus, most industrial wireless networks rely on a strict schedule of the transmissions to avoid collisions, and implement frequency hopping to combat external interference. In multihop topologies, the network has to decide both when the transmissions have to be scheduled, and which router can forward the packets. To be fault-tolerant, multipath routing consists in exploiting several paths in parallel. We exploit here a braided path routing structure, where each router has several possible next hops. Thus, we can cope with any fault along the path, while still providing a remaining operational path. We propose also a scheduling algorithm, where multiple transmitters are attached to a single cell, to the same receiver. The schedule is constructed such that only one transmitter is active at a time, and is consequently collisionfree. Mutualizing the same cell for several transmitters reduces the energy consumption and increases the network capacity. Our approach is still fully compliant with the standard while minimizing idle listening. Our simulation results show the relevance of such solution to provide high-reliability and fault-tolerance. While the single and disjoint paths solutions achieve a very low reliability (20%) when two nodes crash, we keep on providing a packet delivery ratio above 80%, whatever the conditions. Besides, our scheduling algorithm is particularly energy efficient since it presents the same energy consumption as the classical single path routing scheme.

No abstract

No abstract

No abstract