PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Fault Tolerant Dense Wavelength Division Multiplexing Optical Transport Networks

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Design of fault tolerant dense wavelength division multiplexing (DWDM) backbones is a major issue for service provision in the presence of failures. The problem is an NP-hard problem. This paper presents a genetic algorithm based approach for designing fault tolerant DWDM optical networks in the presence of a single link failure. The working and spare lightpaths are encoded into variable length chromosomes. Then the best lightpaths are found by use of a fitness function and these are assigned the minimum number of wavelengths according to the problem constraints using first-fit (FF) algorithm. The proposed approach has been evaluated for dedicated path protection architecture. The results, obtained from the ARPA2 test bench network, show that the method is well suited to tackling this complex and multi-constraint problem.
Rocznik
Tom
Strony
63--67
Opis fizyczny
Bibliogr. 15 poz., rys., tab.
Twórcy
autor
autor
autor
autor
Bibliografia
  • [1] WDM Optical Networks: Concepts, Design, and Algorithms, C. S. R. Murthy and M. Gurusamy, Eds. New York: Prentice Hall, 2004.
  • [2] B. Mukherjee, “WDM optical communication networks: progress and challenges”, IEEE J. Select. Areas Commun., vol. 18, no. 10, pp. 1810–1824, 2000.
  • [3] N. Ghani, S. Dixit, and T. S. Wang,“ On IP-WDM integration: a ret- rospective”, IEEE Commun. Mag., vol. 41, no. 9, pp. 42–45, 2003.
  • [4] D. Zhou and S. Subramaniam, “Survivability in optical networks”, IEEE Network, vol. 14, pp. 16–23, 2000.
  • [5] J. Zhang and B. Mukherjee, “Review of fault management in WDM mesh networks: basic concepts and research challenges”, IEEE Network, vol. 18, no. 2, pp. 41–48, 2004.
  • [6] S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, “Surviv- able WDM mesh networks”, J. Lightw. Technol., vol. 21, no. 4, pp. 870–883, 2003.
  • [7] J. L. Kennington, E. V. Olinicka, and G. Spiride, “Basic mathe- matical programming models for capacity allocation in mesh-based survivable networks”, Int. J. Manage. Sci., vol. 35, pp. 1–16, 2006.
  • [8] R. Shenai and K. Sivalingam, “Hybrid survivability approaches for optical WDM mesh networks”, J. Lightw. Technol., vol. 23, no. 10, pp. 3046–3055, 2005.
  • [9] P. H. Ho and H. T. Mouftah, “A novel survivable routing algorithm for shared segment protection in mesh WDM networks with partial wavelength conversion”, IEEE J. Select. Areas Commun., vol. 22, no. 8, pp. 1548–1560, 2004.
  • [10] C. Ou, J. Zhang, H. Zang, H. L. Sahasrabuddhe, and B. Mukherjee, “New and improved approaches for shared-path protection in WDM mesh networks”, J. Lightw. Technol., vol. 22, no. 3, pp. 1223–1232, 2004.
  • [11] G. Lei, C. Jin, Y. Hongfang, and L. Lemin, “Path-based routing provisioning with mixed shared protection in WDM mesh networks”, J. Lightw. Technol., vol. 24, no. 3, pp. 1129–1141, 2006.
  • [12] D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Harlow: Addison-Wesley, 1989.
  • [13] C. C. Lo and W. H. Chang, “A multiobjective hybrid genetic algorithm for the capacitated multipoint network design problem”, IEEE Trans. Syst., Man Cybern. B, vol. 30, no. 3, pp. 461–470, 2000.
  • [14] L. He, C. P. Botham, and C. D. O’Shea, “An evolutionary design algorithm for ring-based SDH optical core networks”, BT Technol. J., vol. 22, no. 1, pp. 135–144, 2004.
  • [15] C. W. Ahn and R. S. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations”, IEEE Trans. Evolut. Comput., vol. 6, no. 6, pp. 566–579, 2002.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BAT8-0016-0010
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.