Minimization of Branching in the Optical Trees with Constraints on the Degree of Nodes - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2012

Minimization of Branching in the Optical Trees with Constraints on the Degree of Nodes

Abstract

Multicast routing applied to optical networks provide several research problems on spanning tree. In optical networks, the ability of dividing the light signal is limited. Two recently problems try to take into account this constraint: looking for spanning trees with minimum number of branching vertices (vertices of degree strictly greater than 2) and looking for spanning trees such that the sum of branch vertices degrees is minimal. There are two kinds of optical nodes: nodes equipped with splitters, able to divide the input light signal, and nodes without splitters, unable to split the signal. The two problems mentioned above do not distinguish between the type of nodes. In this study, we discuss the relationship between the two problems, we thus prove that the two previous problems are not necessarily linked. We also propose two variants of them, taking into account this additional constraint in the construction of the spanning tree, and we find an experimental upper bound on the number of nodes to equip with splitters in an optical network.
Fichier principal
Vignette du fichier
Minimization_of_Branching_in_the_Optical_Trees_wit.pdf (344.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00678554 , version 1 (19-04-2021)

Identifiers

  • HAL Id : lirmm-00678554 , version 1

Cite

Massinissa Merabet, Sylvain Durand, Miklós Molnár. Minimization of Branching in the Optical Trees with Constraints on the Degree of Nodes. ICN: International Conference on Networks, Feb 2012, Saint Gilles, Réunion. pp.235-240. ⟨lirmm-00678554⟩
136 View
25 Download

Share

Gmail Facebook X LinkedIn More