Optimization Multicast Routing Problem by Enabled Virtualization Rendezvous Point

Abstract

Multicast provides effective communication and transmission, optimizes performance and enables truly distributed applications, also simultaneously optimizes cost of the multicast tree, average delay and maximum end-to-end delay. We analysed the shared tree algorithms that build a single tree to be used by all the multicast sessions. The tree contains a single point called core or virtualization rendezvous point (VRP) so that all the packets will be forwarded to VRP before reaching destination. In this way, we give a set of optimal solutions, based on Dijkstra's and Bellman-Ford algorithm then finding the Steiner Tree for constructs the minimum cost and get the maximum routing capacity through multicast rendezvous point by the knapsack problem with combinatorial optimization. According to simulations, the results show that algorithms realized best solution quickly and has a feasible, effective and scalability.

Authors and Affiliations

Haider Nafaa N, Fang Liu

Keywords

Related Articles

An Energy–Efficient Heuristic based Routing Protocol in Wireless Sensor Networks

Energy consumption is the critical issue to determine the lifetime of Wireless sensor networks (WSNs), due to limited batteries power resource of sensor nodes. The optimization of energy consumption is involves reduction...

Path-integral quantum PATHTREE and PATHINT Algorithms

The author previously developed a generalization of a binomial tree algorithm, PATHTREE, to develop options pricing for multiplicative-noise models possessing quite generally time dependent and nonlinear means and varian...

The Analysis of the Distribution Mode of Rookie Network

With online shopping spreading quickly, China ' s e-commerce market is rapidly expanding; the e-commerce distribution bottlenecks gradual emerge. Logistics distribution has restricted the development of Taobao. It is pro...

A Study on Fast Adaptive Detection of Pulmonary Nodules in Thoracic CT Images Using a Hierarchical Vector Quantization Scheme

This Computer-aided detection (CADe) of pulmonary nodules is critical to assisting radiologists in early identification of lung cancer from computed tomography (CT) scans. This paper proposes a novel CADe system based on...

Performing Network Simulators of TCP with E2E Network Model over UMTS Networks

Wireless links losses result in poor TCP throughput since losses are perceived as congestion by TCP with the evolution of 3G technologies like Universal Mobile Telecommunication System (UMTS), the usage of TCP has become...

Download PDF file
  • EP ID EP183833
  • DOI -
  • Views 109
  • Downloads 0

How To Cite

Haider Nafaa N, Fang Liu (2016). Optimization Multicast Routing Problem by Enabled Virtualization Rendezvous Point. International Journal of Innovative Research in Information Security, 0(0), 1-8. https://europub.co.uk./articles/-A-183833