Skip to main content
SpringerLink
Log in

Layered-routing approach for solving multicast routing and wavelength assignment problem

  • Original Article
  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

We have developed a new layered-routing approach to address the problem of all-optical multicast over wavelength-routed wavelength division multiplexing (WDM) networks. We model the WDM network as a collection of wavelength layers with sparse light- splitting (LS) and wavelength conversion (WC) capabilities. We apply the degree constraint technique to solve the problem. The approach is capable of completing multicast routing and wavelength assignment (MCRWA) in one step. We propose two generic frameworks to facilitate heuristic development. Any heuristic that is derived from either Prim’s or Kruskal’s algorithm can be easily imported to solve the MCRWA problem. One example is given for each framework to demonstrate heuristic development. Extensive simulations were carried out to measure the performance of heuristics developed from the frameworks. The results show that the STRIGENT scheme is suitable for hardware design and it is advisable to deploy light splitters and wavelength converters to the same node for better performance.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ding A., Poo G.-S. (2003) A survey of optical multicast over WDM networks. Comput. Commun. 26(2): 193–200

    Article  Google Scholar 

  2. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer (2000)

  3. Malti, R., zhang, X., Qiao, C.: Benefits of multicasting in all-optical networks. In: Proc. of SPIE’98, (Nov. 1998), vol. 3531, pp. 209–220. All-Optical Networking: Architecture, Control, and Management Issues

  4. Hwang, F.K., Richards, D.S., Winter, P. The Steiner Tree Problem. Elsevier Science Publishers (1992)

  5. Ding, A., Poo, G.-S., Tan, S.-T.: An expanded graph model for MCRWA problem in WDM networks. In: Proc. of IEEE LCN’02, Tampa, FL, USA, Nov. 2002, pp. 557–564

  6. Chung, S.-J., Hong, S.-P. et al.: Algorithms for the degree-constrained multicast trees in packet-switched networks. In: Proc. of GLOBECOM’98, Sydney, NSW, Australia, Nov. 1998, vol. 2, pp. 1054–1059

  7. Sahasrabuddhe, L.H., Mukherjee, B.: Light-trees: optical multicasting for improved performance in wavelength-routed networks. IEEE Commun. Mag. 67–73 (1999)

  8. Voss S. (1992) Steiner’s problem in graphs: heuristic methods. Discrete Appl. Math. 40, 45–72

    Article  MATH  MathSciNet  Google Scholar 

  9. Mehlhorn K. (1988) A faster approximation algorithm for the Steiner Problem in graphs. Information Process. Lett. 27, 125–128

    Article  MATH  MathSciNet  Google Scholar 

  10. Evans, J.R., Minieka, E.: Optimization Algorithms for Networks and Graphs, 2nd edn., pp. 49–54. Marcel Dekker (1992)

  11. Winter P. (1987) Steiner problem in networks: a survey. Networks 17, 129–167

    MATH  MathSciNet  Google Scholar 

  12. Waxman B.M. (1988) Routing of multipoint connections. IEEE JSAC 6(9): 1617–1622

    Google Scholar 

  13. Kompella V.P., Pasquale J.C., Polyzos G.C. (1993) Multicast for multimedia communication. IEEE\ACM Transac. Networking 1(3): 286–292

    Article  Google Scholar 

  14. Syski, R.: Introduction to congestion theory in telephone systems. North-Holland Stud. Telecommun. 4, (1986)

  15. Rosseti, I., de Aragão, M.P., Ribeiro, C.C., Uchoa, E., Werneck, R.F.: New benchmark instances for the Steiner problem in graphs. In: Extended Abstracts of the 4th Metaheuristics International Conference (MIC’ 2001), pp. 557–561

  16. Bauer, F., Varma, A.: Degree-constrained multicasting in point-to-point networks. In: Proc. of IEEE INFOCOM’95, Boston, MA, USA, April 1995, vol. 1, pp. 369–376

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, 639798, Singapore

    Gee-Swee Poo & Aijun Ding

Authors
  1. Gee-Swee Poo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aijun Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gee-Swee Poo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Poo, GS., Ding, A. Layered-routing approach for solving multicast routing and wavelength assignment problem. Photon Netw Commun 13, 123–137 (2007). https://doi.org/10.1007/s11107-006-0042-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-006-0042-1

Keywords

Search

Navigation