SPARK: A Smart Parametric Online RWA Algorithm

  • Published : 2007.12.31

Abstract

The large potential bandwidth available in wavelength-division multiplexed optical networks makes this technology of crucial importance for satisfying the ever increasing capacity requirements of the next-generation Internet. In this scenario, the routing and wavelength assignment(RWA) problem that concerns determining the optical paths and wavelengths to be used for connection establishment in a wavelength-routed network, is still one of the most important open issues. In this paper we propose a new online dynamic grooming-capable RWA heuristic scheme working on wavelength division multiplexing(WDM) networks as a multistage selection process. The proposed algorithm is transparent with respect to the presence of wavelength converters, achieves very low connection rejection ratios with minimal computational complexity and is appropriate for the modern multilayer optical circuit and wavelength switched networks with sparse wavelength conversion capability.

Keywords

References

  1. I. Chlamtac, A. Ganz, and G. Karmi, 'Lightpath communications: An approach to high-bandwidth optical WANs,' IEEE Trans. Commun. vol. 40,pp. 1171-1182, 1992 https://doi.org/10.1109/26.153361
  2. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, 'A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks,' IEEE/ACM Trans. Netw., vol. 11, no.2, pp. 285-299, 2003 https://doi.org/10.1109/TNET.2003.810310
  3. X. Niu, W. D. Zhong, G. Shen, and T. H. Cheng, 'Connection establishment of label switched paths in IP/MPLS over optical networks,' Photon. Netw. Commun., vol. 6, pp. 33-41, 2003 https://doi.org/10.1023/A:1023682607475
  4. D. Awduche, L. Berger, D. Gain, T. Li, V. Srinivasan, and G. Swallow, 'Extensions to RSVP for LSP tunnels,' in Internet Draft draft-ietf-mplsrsvp-lsp-tunnel-04.txt, 1999
  5. R. Guerin, D. Williams, and A. Orda 'QoS routing mechanisms and OSPF extensions,' in Proc. IEEE GLOBECOM, 1997
  6. K. Kar, M. Kodialam, and T. V. Lakshman, 'Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications,' IEEE J. Set. Areas Commun., vol. 18, no. 12, pp. 921-940, 2000
  7. K. Kar, M. Kodialam, and T. V. Lakshman, 'Integrated dynamic IP and wavelength routing in IP over WDM networks,' in Proc. IEEE INFOCOM, 2001
  8. H. Zang, J. P. Jue, and B. Mukherjee, 'A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,' Opt. Netw. Mag., vol. 1, pp. 47-63, 2000
  9. K. Zhu and B. Mukherjee, 'Traffic grooming in an optical WDM mesh network,' IEEE J. Sel. Areas Commun., vol.20, pp. 122-133, 2002 https://doi.org/10.1109/49.974667
  10. S. Thaigaran and A. Somani, 'Capacity fairness of WDM networks with grooming capabilities,' SPIE Opt. Netw. Mag., vol. 2, pp. 24-31, 2001
  11. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, 'Dynamic traffic grooming in WDM mesh networks using a novel graph model,' SPIE Opt. Netw. Mag., vol.4, no.3, pp.65-75, 2003
  12. S. Subramaniam, M. Azizoglu, and A. K. Somani, 'All-optical networks with sparse wavelength conversion,' IEEE/ACM Trans. Netw., vol.4, no.4, pp.544-557, 1996 https://doi.org/10.1109/90.532864
  13. S. Ramamurthy and B. Mukherjee, 'Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks,' IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 351-367, 2002 https://doi.org/10.1109/TNET.2002.1012367
  14. J. Kleimberg and E. Kumar, 'Wavelength conversion in optical networks,' in Proc. the tenth Annual ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 566-575
  15. B. Ramamurthy and B. Mukherjee, 'Wavelength conversion in WDM networking,' IEEE J. Sel. Areas Commun., vol. 16, no. 7, 1998
  16. X. Chu, B. Li, and Z. Zhang, 'A dynamic RWA algorithm in a wavelength- routed all-optical network with wavelength converters:' in Proc. INFOCOM, 2003
  17. E. Kaeasan and E. Ayanoglu, 'Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks,' IEEE/ACM Trans. Netw., vol.6, no.2, pp. 186-196, 1998 https://doi.org/10.1109/90.664267
  18. H. R. Lewis and L. Denenberg, Data Structures and Their Algorithms. HarperCollins, New York, 1991
  19. N. Katoh, T. Ibaraki, and H. Mine, 'An efficient algorithm for k shortest simple paths,' Netw., vo. 12, pp. 411-427, 1982 https://doi.org/10.1002/net.3230120406
  20. A. V. Goldberg and R. E. Tarjan, 'A new approach to the maximum flow problem:' J. ACM, vol. 35, no. 4, 1988
  21. NSFNet. [Online]. Available: http://www.nsf.gov/aboutlhistory/nsf0050/ internet/launch.htm
  22. The GEANT2 network. [Oline]. Available: http://www.geant2.net/