Dept. of Electr. Eng., National Taiwan Univ.Cheng-Yu HsiehWANJIUN LIAO2018-09-102018-09-102003-10http://scholars.lib.ntu.edu.tw/handle/123456789/304195https://www.scopus.com/inward/record.uri?eid=2-s2.0-84944404469&doi=10.1109%2fLCN.2003.1243123&partnerID=40&md5=e943e76bb327e40a2a5895da0f353a22This paper studies all-optical multicast routing in wavelength-routed optical networks with sparse light splitting. In a sparse splitting network, only a small percentage of nodes are capable of light splitting, i.e., multicast capable. The typical solutions of existing multicast routing algorithms for sparse splitting networks combine an existing Steiner tree heuristic with some rerouting procedures to refine the trees. The resulting tree cost in terms of the total number of wavelengths used on all tree links is then very expensive. In this paper, we propose a new mechanism that constructs all-optical multicast trees for sparse splitting networks without an additional rerouting procedure in the tree construction. Two efficient approaches are suggested and evaluated by simulations. The results show that our mechanism builds light-trees with the least wavelength channel cost and with the smallest number of wavelengths used per link. © 2003 IEEE.application/pdf343097 bytesapplication/pdfAll-optical networks; Costs; Intelligent networks; Multicast algorithms; Multicast protocols; Optical fiber networks; Optical receivers; Optical transmitters; Wavelength division multiplexing; Wavelength routingComputer networks; Costs; Heuristic algorithms; Intelligent networks; Multicasting; Optical communication; Optical fibers; Optical receivers; Optical transmitters; Routing algorithms; Wavelength division multiplexing; All- optical networks; Multicast algorithms; Multicast protocol; Optical fiber networks; Wavelength routing; Network routingconference paper10.1109/LCN.2003.12431232-s2.0-84944404469