Algorithmic Support of Optimization of Multicast Data Transmission in Networks with Dynamic Routing

Anatoliy Nyrkov, Andrey Belousov and Sergey Sokolov

Modern Applied Science, 2015, vol. 9, issue 5, 162

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.

Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/46787/25228 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/46787 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:9:y:2015:i:5:p:162

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().