透過您的圖書館登入
IP:13.58.140.33
  • 期刊
  • OpenAccess

Optimization of IPv6 Protocol Independent Multicast-Sparse Mode Multicast Routing Protocol based on Greedy Rendezvous Point Selection Algorithm

摘要


Forming of the Multicast tree with the best root considered as center selection problem (typically classified as NP-complete type). Alternatively called center Rendezvous Point (RP) due to the direct impact on the multicast routing protocol in terms of the performance. This research article introduces a new compound solution for multicast RP selection called Greedy based RP Selection Algorithm (GRPSA) to select the best RP for PIM-SM multicast routing protocol in IPv6 multicast domain based on Fitness or cost criteria supported by Dijkstra algorithm. The paperwork passes through two phases. First, MATLAB phase used for GRPSA implementation assisted by Fitness calculation to select the best RP called Native-RP. The second phase investigates the performance of GRPSA using QoS metrics compared to another candidate RPs. Validated using the GNS3 emulator for the core IPv6 multicast network and realized using UDP streaming data sourced from Jperf traffic generator via virtual machines at the network edges. The multicast technology implements a very high-efficiency point-to-multipoint data transmission over IP networks (IPv4 and IPv6). The results show GRPSA-RP performs better than other possible RPs by 25.2%, 25.3%, 46.2% and 62.9%, in terms of data received, bandwidth, jitter and loss respectively on average.

延伸閱讀