Abstract
With the increasing requirement for communication bandwidth, all-optical network has been more and more important owning to its large traffic capability. Multicasting is an important technology in wavelength division multiplexing (WDM) optical network, and has been studied in many works. In this paper, we consider the multicasting technology on all-optical metropolitan area network (MAN) with maximum power attenuation constraint. The objective is to minimize total cost of a multicasting request. This problem is NP-hard. We propose a heuristic, named Power-Constraint Fix-Destination-Path (PC-FDP) algorithm, to solve this maximal power-loss constrained minimizing cost multicasting problem. It means that, during the process of building a multicasting tree, when a destination is reached and its power satisfies the constraint, the path from source to it would be fixed in the tree. Simulation results show that, all multicasting trees building the proposed algorithm satisfy the power constraint, with slight increasing of the total cost.
Similar content being viewed by others
References
Zhou Y.-Z., Poo G.-S.: Optical multicast over wavelength-routed WDM networks: a survey. Opt. Switch. Netw. 2, 176–197 (2005)
Hamad A., Wu T., Kamal A.E., Somani A.K.: On multicasting in wavelength-routing mesh networks. Comput. Netw. l50, 3105–3164 (2006)
Ramaswami R., Sivarajan K.N.: Optical Networks: A Practical Perspective, 2nd edn, pp. 49–106. Morgan Kaufmann, San Francisco (2001)
Recommendation G.654: Characteristics of cut-off shifted single-mode optical fiber and cable, chapter 6, 5 (2003). http://www.itu.int/itudoc/itu-t/aap/sg15aap/history/g.654/index.html
Wu, K.-D., Wu, J.-C., Yang, C.-S.: Multicast routing with power consideration in sparse splitting WDM networks. In: Proceedings of IEEE International Conference on Communications (ICC), vol. 2, pp.513–517 (2001)
Zhang X.-J., Wei J.-Y., Qiao C.-M.: Constrained multicast routing in WDM networks with sparse light splitting. J. Lightwave Technol. 18(12), 1917–1927 (2000)
Hadas, R.L.: Efficient collective communication in WDM network with a power budget. In: Proceedings of IEEE International Conference on Computer Communication Network (ICCCN), pp. 612–616 (2000)
Gu J., Hu X.-D., Jia X., Zhang M.-H.: Routing algorithm for multicast under multi-tree model in optical networks. Theor. Comput. Sci. 314(1–2), 293–301 (2004)
Lin G.-H.: An improved approximation algorithm for multicast k-tree routing. J. Comb. Optim. 9(4), 349–356 (2005)
Cai Z.-P., Lin G.-H., Xue G.-L.: Improved approximation algorithms for the capacitated multicast routing problem. Lect. Notes Comput. Sci. 3595, 136–145 (2005)
Du D.-Z., Hu X.-D.: Steiner Tree Problems in Computer Communication Networks, pp. 195–219. World Scientific, Singapore (2008)
Korte B., Vygen J.: Combinatorial Optimization: Theory and Algorithms, 4th edn, pp. 127–149. Springer-Verlag Berlin, Heidelberg (2008)
Huo Y.-M., Leung J.Y.-T.: Online scheduling of precedence constrained tasks. SIAM J. Comput. 3(34), 743–762 (2005)
Poo G.-S., Ding A.-J.: Layered-routing approach for solving multicast routing and wavelength assignment problem. Photon. Netw. Commun. 13, 123–137 (2007)
Waxman B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. (JSAC) 6(9), 1617–1622 (1988)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, J., Yuan, J., Zhou, X. et al. A novel multicast routing algorithm in sparse splitting WDM network with power attenuation constraint. Photon Netw Commun 19, 134–143 (2010). https://doi.org/10.1007/s11107-009-0218-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-009-0218-6