Abstract

This article describes the optimization process for the multicast tree in the networks with dynamic traffic routing, which is based on the channel state and evaluates each channel. The problem of constructing a multicast connections tree on graphs is formalized. The possibility of improving the existing algorithms by selecting certain rendezvous points, as well as the algorithm for reducing the cost of the multicast routing tree are analysed. Simulation of tree construction was made in accordance with the family of Protocol-Independent Multicast protocols and the proposed algorithm. A critical analysis of the simulation results and comparative evaluation of uniformity of loading data channel at multicast routing are carried out.

Highlights

  • The global transition from an industrial society to an informational one necessitates timely and quality information management, the growth of which has long been in a non-linear function of time

  • "The reliability of network functioning is compromised by rapid growth in the number of telecommunication services, characterized by an unpredictable amount of traffic transmitted over a network and high performance requirements to the network nodes and servers for different purposes" (Samuilov et al, 2014)

  • When using the Protocol-Independent Multicast (PIM)-SM protocol, there is the possibility to specify a specific router as rendezvous point (RP)

Read more

Summary

Introduction

The global transition from an industrial society to an informational one necessitates timely and quality information management, the growth of which has long been in a non-linear function of time. "The reliability of network functioning is compromised by rapid growth in the number of telecommunication services, characterized by an unpredictable amount of traffic transmitted over a network and high performance requirements to the network nodes and servers for different purposes" (Samuilov et al, 2014). In this regard, one of the important and relevant information technology and socio-economic problems is data transmission in modern networks. It is based on the construction of the optimal structure of the data transmission between participants and services, taking into account the need to ensure continuous monitoring and integrity and availability of the transmitted data (Naumov et al, 2007)

Methods
Discussion
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call