Optimal Wavelength-Routed Multicasting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1997

Optimal Wavelength-Routed Multicasting

Pavol Hell
  • Function : Author
Stéphane Pérennes
  • Function : Author
  • PersonId : 942945


Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by the fewest number of colours so that paths of the same colour do not share an arc. We prove that this minimum number of colours is equal to the maximum number of paths that share one arc, minimized over all sets of paths from the source to the destinations. We do this by modeling the problems as network flows in two different networks and relating the structure of their minimum cuts. The problem can be efficiently solved (paths found and coloured) using network flow techniques.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3276.pdf (97.71 Ko) Télécharger le fichier

Dates and versions

inria-00073413 , version 1 (24-05-2006)


  • HAL Id : inria-00073413 , version 1


Bruno Beauquier, Pavol Hell, Stéphane Pérennes. Optimal Wavelength-Routed Multicasting. RR-3276, INRIA. 1997. ⟨inria-00073413⟩
104 View
152 Download


Gmail Facebook Twitter LinkedIn More