Abstract
This investigation examines all-optical multicast routing in wavelength-routed optical networks with sparse Multicast Capable (MC) nodes that have three phases. The first phase is the MC node placement, and the maximum path count first (MPCF) algorithm is utilized to obtain candidates for MC nodes. The second phase is a multicast routing with MC-based schemes which including two algorithms, namely, the Pre-computing Minimum Cost Tree (PMC) and Pre-computing Shortest Path Tree (PSP) algorithms. Both algorithms use Steiner tree and shortest path tree to create an MC-based tree. The third phase is the system maintenance. System performance of PMC and PSP is compared with that of the Route to Source (RTS) algorithm in terms of average number of wavelengths needed、average call blocking probability and mean maximum transmission delay. Simulation results indicate that the proposed schemes utilize the minimum number of wavelengths needed and reduce blocking probability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
