DocumentCode
2389037
Title
Multicast virtual topologies in WDM paths and rings with splitting loss
Author
Libeskind-Hadas, R. ; Hartline, J.R. ; Dresner, K. ; Drucker, E. ; Ray, K.
Author_Institution
Dept. of Comput. Sci., Harvey Mudd Coll., Claremont, CA, USA
fYear
2002
fDate
14-16 Oct. 2002
Firstpage
318
Lastpage
321
Abstract
This paper addresses the problem of constructing optimal virtual topologies for multicast communication in optical networks employing wavelength-division multiplexing (WDM). For concreteness, we use the average hop distance as the metric of optimality. WDM networks supporting multicast communication typically employ multicast-capable switches which permit a path entering a switch on an incoming wavelength to be replicated or "split" optically to one or more output links. This splitting incurs a power loss which is frequently neglected in existing heuristics and algorithms. In this paper we show that the problem of finding optimal virtual topologies with splitting loss constraints can be solved in polynomial time in directed paths and rings, although the problem is NP-complete for general topologies.
Keywords
computational complexity; multicast communication; network topology; optical fibre networks; wavelength division multiplexing; NP-complete problem; WDM paths; average hop distance; directed paths; multicast communication; multicast virtual topologies; multicast-capable switches; optical networks; optimal virtual topologies; polynomial time; power loss; rings; splitting loss rings; wavelength-division multiplexing; Communication switching; Heuristic algorithms; Multicast algorithms; Multicast communication; Network topology; Optical fiber networks; Optical losses; Optical switches; WDM networks; Wavelength division multiplexing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on
ISSN
1095-2055
Print_ISBN
0-7803-7553-X
Type
conf
DOI
10.1109/ICCCN.2002.1043085
Filename
1043085
Link To Document