Satya Prakash Sahoo

Tabu Search Algorithm for Core Selection in Multicast Routing

With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is the selection of the root of the shared tree or the core point. In this paper, we propose an algorithm based on Tabu Search for core selection in multicast routing. This algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound.

A Bacteria Foraging-Particle Swarm Optimization Algorithm for QoS Multicast Routing

In this paper, we propose a modified Bacteria Foraging-Particles Swarm OptimizationBF-PSO algorithm for QoS multicast routing. This meta-heuristic optimization algorithm generates a least cost multicast tree under multiple constraints. The algorithm uses random parameters of Particle swarm optimization algorithm to minimize the delay in reaching the global solution. The Simulation results show that the proposed algorithm is more effecient than the existing meta-heuristic algorithms such as Genetic Algorithm, Quantum behaved Particle Swarm Optimization.

Adaptive tabu search-based core selection algorithm in heterogeneous network

Nowadays, several networks like mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), satellite networks, etc. are attached to the backbone internet through gateways. When a group of people work in a cooperative way, there is a stringent quality of service (QoS) requirement on delay and delay variation. This problem is called delay and delay variation multicast tree (DVBMT) problem. The main problem concerning the construction of shared multicast tree is to efficiently select the core point that is the root of the multicast tree. In this paper, we propose an adaptive tabu search-based core selection (ATS-CS) algorithm for multicast routing. The algorithm aims to minimise the delay variation subject to an end-to-end delay bound. The proposed algorithm is evaluated through simulation. It is observed that the proposed algorithm gives better and consistent performance than the existing algorithms. The actual execution time of the proposed algorithm is comparable to the existing algorithm.

A Tree Based Chemical Reaction Optimization Algorithm for QoS Multicast Routing

The onset of various real-time multimedia applications in whirlwind networks prompt the necessity of QoS based multicast routing. A multicast communication creates a distribution tree structure, on which a multicast source sends a single copy of data to a group of receivers. QoS multicast routing is a non-linear combinatorial optimization problem which has been proved to be NP-complete, in which we try to find a multicast tree with minimized cost that satisfies multiple constraints. In this paper, we propose a tree based Chemical Reaction Optimization CRO Algorithm to solve QoS multicast routing problem. CRO mimics trees as molecules in a chemical reaction, and performs collision between molecules and based on potential energy, we select optimal result. Reckoning results for various random generated networks show that the proposed algorithm outperforms other existing heuristics.

Processing Time Analysis of Loss-Collected Retransmission over Hierarchical Reliable Multicast Networks

Tree based multicast protocols often use hierarchical loss recovery where some special routers called proxy are assigned for retransmission handling. This leads to traffic redundancy and latency. The existing approaches of loss collected retransmission based on X-OR selective principle, which minimizes the number of packets to be retransmitted. However, the receivers send NACKs to the source expecting the retransmission from the source. This overwhelms the source affecting the throughput and processing time. In this paper we analyze the processing time of sender in loss collected retransmission by placing proxies at the intermediate router. The simulation results reveal that our framework minimizes the processing time of sender than simple loss collected retransmission model.

Adaptive tabu search algorithm for RP selection in Protocol Independent Multicast - sparse mode

Protocol Independent Multicast - sparse mode (PIM-SM) builds a shared distribution tree centred at a Rendezvous Point (RP) and then it builds source specific trees. The RP selection problem is very trivial in PIM-SM because it not only affects the structure of the multicast tree but also affects the performance of multicast. In this paper, we propose an Adaptive Tabu Search based algorithm for RP selection (ATS-RPS) in PIM-SM. The proposed algorithm aims to find the best location of RP so that the cost and delay of the multicast tree can be minimized simultaneously. The simulation results reveal that the proposed algorithm performs better than the existing algorithms in terms of multicast tree cost and delay with a comparable execution time.