Multicast tree construction algorithm for dynamic traffic on software defined networks

Abstract Dynamic traffic of multicast communication in the Software Defined Network environment focused less though it is more natural and practical. In multicast communication, the traffic is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which a...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Gururaj Bijur, M. Ramakrishna, Karunakar A. Kotegar
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2021
Materias:	Medicine R Science Q
Acceso en línea:	https://doaj.org/article/9c9ddbad470e4589a31ae81b18131d2e
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:9c9ddbad470e4589a31ae81b18131d2e
record_format	dspace
spelling	oai:doaj.org-article:9c9ddbad470e4589a31ae81b18131d2e2021-12-05T12:11:21ZMulticast tree construction algorithm for dynamic traffic on software defined networks10.1038/s41598-021-02292-12045-2322https://doaj.org/article/9c9ddbad470e4589a31ae81b18131d2e2021-11-01T00:00:00Zhttps://doi.org/10.1038/s41598-021-02292-1https://doaj.org/toc/2045-2322Abstract Dynamic traffic of multicast communication in the Software Defined Network environment focused less though it is more natural and practical. In multicast communication, the traffic is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which are not explored much in the previous research works. The multicast in dynamic traffic requires a method to handle dynamic group membership and minimum tree alteration for every join and leave of participants from the multicast group. This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the multicast path. The proposed routing method uses Dijkstra’s Shortest Path algorithm for initial tree formation, identifies a multicast path, and processes the Shortest Path Tree to reduce the overall hop count and path cost. The multicast tree generated by the proposed enables the dynamic join and leaves of participating devices with reduced tree alteration using more common paths to reach the devices. The implementation and results show that the proposed method works efficiently in resource utilization with a reduced hop count and quality for multicast communication in static and dynamic scenarios. Also, the results demonstrate that the proposed method generates a stable common path for multicast communication.Gururaj BijurM. RamakrishnaKarunakar A. KotegarNature PortfolioarticleMedicineRScienceQENScientific Reports, Vol 11, Iss 1, Pp 1-15 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	Medicine R Science Q
spellingShingle	Medicine R Science Q Gururaj Bijur M. Ramakrishna Karunakar A. Kotegar Multicast tree construction algorithm for dynamic traffic on software defined networks
description	Abstract Dynamic traffic of multicast communication in the Software Defined Network environment focused less though it is more natural and practical. In multicast communication, the traffic is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which are not explored much in the previous research works. The multicast in dynamic traffic requires a method to handle dynamic group membership and minimum tree alteration for every join and leave of participants from the multicast group. This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the multicast path. The proposed routing method uses Dijkstra’s Shortest Path algorithm for initial tree formation, identifies a multicast path, and processes the Shortest Path Tree to reduce the overall hop count and path cost. The multicast tree generated by the proposed enables the dynamic join and leaves of participating devices with reduced tree alteration using more common paths to reach the devices. The implementation and results show that the proposed method works efficiently in resource utilization with a reduced hop count and quality for multicast communication in static and dynamic scenarios. Also, the results demonstrate that the proposed method generates a stable common path for multicast communication.
format	article
author	Gururaj Bijur M. Ramakrishna Karunakar A. Kotegar
author_facet	Gururaj Bijur M. Ramakrishna Karunakar A. Kotegar
author_sort	Gururaj Bijur
title	Multicast tree construction algorithm for dynamic traffic on software defined networks
title_short	Multicast tree construction algorithm for dynamic traffic on software defined networks
title_full	Multicast tree construction algorithm for dynamic traffic on software defined networks
title_fullStr	Multicast tree construction algorithm for dynamic traffic on software defined networks
title_full_unstemmed	Multicast tree construction algorithm for dynamic traffic on software defined networks
title_sort	multicast tree construction algorithm for dynamic traffic on software defined networks
publisher	Nature Portfolio
publishDate	2021
url	https://doaj.org/article/9c9ddbad470e4589a31ae81b18131d2e
work_keys_str_mv	AT gururajbijur multicasttreeconstructionalgorithmfordynamictrafficonsoftwaredefinednetworks AT mramakrishna multicasttreeconstructionalgorithmfordynamictrafficonsoftwaredefinednetworks AT karunakarakotegar multicasttreeconstructionalgorithmfordynamictrafficonsoftwaredefinednetworks
_version_	1718372208059875328

Multicast tree construction algorithm for dynamic traffic on software defined networks

Ejemplares similares