A neural network approach is presented to solve the delay constraint and loss data multicast routing problem, an NP-complete problem. The multicast tree is obtained in line with optimal (minimum) routing costs which are subjected to integrated delay and loss data constraints. The proposed routing algorithm is designed to find the optimal (shortest) path taking into account traffic conditions (the incoming traffic flow, routers occupancy, and link capacities), avoiding packet loss data to the input buffer overflow and combine them into the union. The experimental results showed that the proposed method using the discrete-time equation has achieved a significant difference in iterations and execution time compared to other proposals such as Runge–Kutta, Euler equations, ant colony algorithm and Hierarchical Hopfield neural network which contributes to improving the performance of Internet of Things networks in terms of the durability of interconnection between devices. In accordance with the extent of the impact of quality of service restrictions on the network, and the maintenance of the cost-effectiveness of the route, the algorithm achieved a decrease in execution time ranging from 27% to 81%, in addition to a decrease in the number of iterations by 44% to 66%.

An Intelligent Approach for Solving QoS and Multicast Routing Issues

The internet’s architecture today has a problem in routing information depending on what the receiver is interested in without knowing the sender and receiver addresses. As a result, the Publish-Subscribe paradigm was developed. In this network, we build and use in the design, implementation, and evaluation of Publish-Subscribe network via destination driven multicast routing algorithm for selecting the shortest path in the network. Basically, the networks have Router to perform routing mechanism, the publisher is the producer of information, and the subscriber is the consumer of information with their own deferent type of module for facilitating their function. Every connection in the network is bidirectional way of communication (an undirected graph) with random seed available in the network. Each Router has topology management module for creating a picture of the networks and computing the available path. It informs to the forwarder in order to send the information of network for intended receiver. Record table module used for recording of the network information comes from the subscriber or the publisher via link state advertisement then it informs to the topology manager. In this network, the receiver and sender don’t expect to be active at the same time, don’t know each other’s addresses, and don’t use any blocking mechanisms or client send requests and server replay responses. The Publish-Subscribe network is first developed and designed enough, after which it is implemented and evaluated using the destination driven multicast routing algorithm (DDMC) to pick the shortest path in the network and active match published information. The proposed work evaluated via total bit (produced 1,000,000 bit per second), and throughput was 83.33%. 

Yimenu Atinaf

Papers

Performance Analysis on Destination Driven Multicast Routing Algorithm