Skip to main content
Log in

Heuristic and Hybrid Methods for Solving Optimal Multiple Multicast Problem on WDM Ring Network

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

The Optimal Multiple Multicast Problem (OMMP) on wavelength division multiplexing (WDM) ring networks without wavelength conversion is considered in this paper. When the physical network and the set of multicast requests are given, OMMP is the problem that selects a suitable path (or paths) and wavelength (or wavelengths) among the many possible choices for each multicast request such that not any pair of paths using the same wavelength pass through the same link. In this paper, a formulation of OMMP is given; this problem is NP-hard since the famous RWA problem which has been proved NP-hard is a special case of OMMP. In this paper, the OMMP is divided into two subproblems: path routing and wavelength assignment subproblems. For each subproblem, two heuristic algorithms are proposed to solve it. Moreover, a hybrid method which combines heuristic and simulated annealing algorithm is proposed to find the near optimal solution. Experimental results indicate that these algorithms are efficient.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Ali and J.S. Deogun, Cost-effective implementation of multicasting in wavelength-routed networks, IEEE Journal of Lightwave Technology 18(12) (2000) 1628–1638.

    Google Scholar 

  2. E. Arts and J. Korst, Simulated Annealing and Boltzman Machines (Wiley, New York, 1989).

    Google Scholar 

  3. D.-R. Din, Genetic algorithm for optimal multiple multicast problem, Computer Communications 27 (2004) 840–856.

    Google Scholar 

  4. A. Ding and G.-S. Poo, A survey of optical multicast over WDM networks, Computer Communications 26 (2003) 1193–2000.

    Google Scholar 

  5. T. Erlebach and K. Jansen, Scheduling of virtual connections in fast networks, in: Proc. of the 4th Parallel Systems Algorithms Workshop (1996) pp. 11–32.

  6. O. Gerstel and S. Kutten, Dynamic wavelength allocation in all-optical ring networks, in: Proc. of IEEE Internat. Conf. on Communications (1997) pp. 432–436.

  7. S. Hong, E.J. David, W. Liang and Y. Wang, Efficient multiple multicast in WDM Networks, IEICE Transactions on Information and Systems 82D(6) (1999) 1074–1078.

    Google Scholar 

  8. D.K. Hunter and D. Marcenac, Optimal mesh routing in four fiber WDM rings, Electronic Letters 34 (1998) 796–797.

    Google Scholar 

  9. S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680.

    MathSciNet  Google Scholar 

  10. H.W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly 2 (1955) 83–97.

    Google Scholar 

  11. V. Kumar, MBone: Interactive Multimedia on the Internet (New Riders, IN, 1996).

    Google Scholar 

  12. T. Lee, K. Lee and S. Park, Optimal routing and wavelength assignment in WDM ring networks, IEEE Journal on Selected Areas in Communications 18(10) (2000) 2146–2154.

    Google Scholar 

  13. G. Li and R. Simha, On the wavelength assignment problem in multi WDM start and ring networks, IEEE/ACM Transactions on Networking 9(1) (2000) 60–68.

    Google Scholar 

  14. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953) 1087–1091.

    Google Scholar 

  15. C. Qiao, X. Zhang and L. Zhou, Scheduling all-to-all connections in WDM rings, in: Proc. of Internat. Soc. Opt. Eng. (1994) pp. 970–979.

  16. N. Shimamot, A. Hiramatu and K. Yamasaki, A dynamic routing control based on a genetic algorithm, in: 1993 IEEE Internat. Conf. on Neural Networks (1993) pp. 1123–1128.

  17. N. Sreenath, N. Krishna Mohan Reddy, G. Mohan and C. Siva Ram Murthy, Virtual source based trees: A new approach for WDM optical multicast, in: Proc. of IEEE Workshop on High Performance Switching and Routing (2001).

  18. N. Sreenath, K. Satheesh, G. Mohan and C. Siva Ram, Murthy, Virtual source based multicast routing in WDM optical networks, Photonic Network Communications 3(3) (2001) 217–230.

    Google Scholar 

  19. S. Subramaniam and R.A. Barry, Wavelength assignment in fixed routing WDM networks, in: Proc. of IEEE Internat. Conf. on Communications (1997) pp. 406–410.

  20. A. Tucker, Coloring a family of circular arcs, SIAM Journal on Applied Mathematics 29(3) (1975) 493–502.

    Google Scholar 

  21. Van Laarhoven and E. Arts, Simulated Annealing: Theory and Application (Reidel, Dordrecht, 1987).

    Google Scholar 

  22. L. Wuttisittikulkij and M.J. O’Mahony, Design of efficient and practical algorithm for wavelength assignment in multi-wavelength ring transport networks, in: Proc. of IEEE GLOBECOM’97 (1997) pp. 571–575.

  23. X. Zhang, J. Wei and C. Qiao, On fundamental issues in IP over WDM multicast, in: Proc. of IEEE Internat. Conf. on Computer Communications and Networks (1999) pp. 84–90.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Der-Rong Din.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Din, DR. Heuristic and Hybrid Methods for Solving Optimal Multiple Multicast Problem on WDM Ring Network. Telecommun Syst 28, 245–262 (2005). https://doi.org/10.1007/s11235-004-5019-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-004-5019-8

Keywords

Navigation