Abstract
For abundant bandwidth, all-optical mesh networks have been more and more important in communications, and multicasting is one of the key technologies to that. The problem to find a minimum multicasting tree is NP-hard, and all the existing algorithms are heuristics. Most of them are based on the idea of being greed. A greedy idea is always shortsighted. While it could get a good local effect, it would obtain a somewhat bad global performance. In this article, we propose a foresighted strategy for greed-based multicasting algorithms. With the co-action of the greedy idea and a foresighted strategy, a multicasting algorithm can get a good local and global performance simultaneously. We introduce the strategy by embedding it in the Member-Only algorithm and investigate two indexes, the average cost of all multicasting requests and the blocking rate of the whole network. Simulation results show that, with the presence of the proposed foresighted strategy, these two targets are all obviously decreased.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.