Skip to main content
Log in

Une heuristique taboue pour le routage et l’affectation de longueurs D’onde avec scénarios de panne

A tabu heuristic for routing and wavelength assignment with failure scenarios

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Résumé

Cet article propose une approche heuristique pour résoudre le problème de routage optique avec contrainte de continuité de longueurs d’onde. Pour chaque panne simple de lien du réseau, on cherche à maximiser le nombre de demandes de connexions satisfaites, étant donné un nombre de longueurs d’onde disponibles sur chaque lien de fibre optique. Le routage est basé sur la recherche des plus courts chemins et l’affectation des longueurs d’onde sur une méthode de coloriage de graphes utilisant la recherche taboue. Deux versions de cette approche ont été implémentées et des séries d’expériences ont été effectuées à des fins d’analyse de performance, en mettant l’accent sur le nombre de trafics bloqués et les temps d’exécution. Il en résulte que le fait d’augmenter le nombre de longueurs d’onde diminue le nombre de trafics bloqués.

Abstract

This paper proposes a heuristic approach to solve the optical routing problem with wavelength continuity constraint. For each single link failure in the network and for a number of wavelengths available on each optical link, the goal is to maximize the number of routed connections. The routing is based on the search for the shortest paths whereas the wavelength assignment is based on a graph coloring method using tabu search. Two versions of this approach have been implemented and extensive experiments have been carried out for performance evaluation purposes, by focusing on the blocking rate and the execution times. As a result, it has been observed that the fact of raising the number of wavelengths decreases the blocking rate.

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.

Bibliographie

  1. Baskiotis (N.),Perennes (S.),Rivano (H.), « Dimensionnement Heuristique des Réseaux OptiquesWdm Multifibres par Arrondi Aléatoire de Multiflot »,Rapport de recherche Projet Mascotte, Université Nice Sophia Antipolis, 2002.

  2. Beauquier (B.),Bermond (J-C.),Gargano (L.),Hell (P.),Perennes (S.), Vacarro (U.), « Graph Problems Arising from Wavelength-Routing in All-Optical Networks »,Rapport de recherche de l’ Inria-Sophia Antipolis, 1997.

  3. Chamberland (S.), Oulaï (D.), Pierre (S.), « Joint Routing and Wavelength Assignment inWdm Networks for Permanent and Reliable Paths »,Computers and Operations Research,32, no 5, May 2005, pp. 1073–1087.

    MATH  Google Scholar 

  4. Chen (B.),Wang (J.), “Efficient Routing and Wavelength Assignment for Multicast inWdm Networks”,IEEE Journal on Selected Areas in Communications,20, no 1, 2002.

  5. Chu (X.), LI (B.), Sohraby (K.), Zhang (Z.), “Routing and Wavelength Assignment Issues in the Presence of Wavelength Conversion for All-Optical Networks”,IEEE Global Telecommunications Conference,Globecom ’02,3, 2002, pp. 2787–2791.

    Google Scholar 

  6. Coudert (D.),Rivano (H.), « Routage optique dans les réseauxWdm multifibres avec conversion partielle »,AlgoTel’02, Mèze, France, 2002, pp. 17–24.

  7. Krishnaswamy (R.M.), Sivarajan (K. N.), “Algorithms for Routing and Wavelength Assignment Based on Solutions ofLp-Relaxations”,IEEE Communications Letters,5, no 10, 2001, pp. 435–437.

    Article  Google Scholar 

  8. Kuchar (A.), “All-Optical Routing - Progress and Challenges”,Proceedings of the 4th International Conference on Transparent Optical Networks,1, 2002, pp. 49–50.

    Google Scholar 

  9. Lee (T.), Lee (K.), Park (S.), “Optimal Routing and Wavelength Assignment inWdm Ring Networks”,IEEE Journal on Selected Areas in Communications,18, no 10, 2000, pp. 2146–2154.

    Article  Google Scholar 

  10. Li (B.), Chu (X.), Sohraby (K.), “Routing and Wavelength Assignment vs. Wavelength Converter Placement in All-Optical Networks”,IEEE Communications Magazine,41, no 8, 2003, pp. S22-S28.

    Article  Google Scholar 

  11. Limal (E.),Stubkjaer (K.E.), “An algorithm for link restoration of wavelength routing optical networks”,IEEE International on Communications,Icc 1999,3, 1999.

  12. Manohar (P.),Manjunath (D.),Shevgaonkar (R.K.), “A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks”,IEEE Communications Letters,6, no 5, 2002.

    Google Scholar 

  13. Modiano (E.), Narula-Tam (A.), “Designing Survivable Networks using Effective routing and Wavelength Assignment (RWA)”,Optical Fiber Communication Conference and Exhibit,Ofc 2001,2, 2001, pp. TuG5?1-TuG5?3.

    Google Scholar 

  14. Modiano (E.), Narula-Tam (A.), “Survivable Lightpath Routing: A New Approach to the Design ofWdm-Based Networks”,IEEE Journal on Selected Areas in Communications,20, no 4, 2002, pp. 800–809.

    Article  Google Scholar 

  15. Narula-Tam (A.),Lin (P. J.),Modiano (E.), “Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks”,IEEE Journal on Selected Areas in Communications,20, no 1, 2002.

  16. Ozdaglar (A.E.), Bertsekas (D.P.), “Routing and Wavelength Assignment in Optical Networks”,Ieee/acm Transactions on Networking,11, no 2, 2003, pp. 259–272.

    Article  Google Scholar 

  17. Poppe (F.),De Neve (H.),Petit (G.H.), “Constrained Shortest Path First Algorithm for Lambda-Switched mesh Optical Networks with Logical Overlay Och/SP Rings”,IEEE Workshop on High Performance Switching and Routing, 2001, pp. 150–154.

  18. Qin (H.), Liu (Z.), Zhang (S.), Wen (A.), “Routing and Wavelength Assignment Based on Genetic Algorithm”,IEEE Communications Letters,6, no 10, 2002, pp. 455–457.

    Article  Google Scholar 

  19. Ramamurthy (S.), Sahasrabuddhe (L.), Mukherjee (B.), “SurvivableWdm Mesh Networks”,Journal of Lightwave Technology,21, no 4, 2003, pp. 870–883.

    Article  Google Scholar 

  20. Shifeng (L.), Jun (T.), Guanqun (G.), “Routing and Wavelength Assignment in all Optical Networks to Establish Survivable Lightpaths”,Tencon ’02,IEEE Conference on Computers, Communications, Control and Power Engineering,2, 2002, pp. 1193–1196.

    Google Scholar 

  21. Somani (A.K.),Azigoglu (M.), “Wavelength Assignment Algorithms for Wavelength Routed Interconnection ofLans”,Journal of Ligthwave Technology, 18, no 12, 2000.

  22. Zang (H.), Ou (C.S.), Mukherjee (B.), “Path-Protection Routing and Wavelength Assignment (RWA) inWdm Mesh Networks Under Duct-Layer Constraints”,Ieee/acm Transactions on Networking,11, no 2, 2003, pp. 248–258.

    Article  Google Scholar 

  23. Zhang (Y.),Taira (K.),Takagi (H.),Das (S.K.), “An Efficient Heuristic for Routing and Wavelength Assignment in OpticalWdm Networks”,IEEE International Conference on Communications,Ice 2002,5, 2002.

  24. Zhemin (D.),Hamdi (M.), “A Simple Routing and Wavelength Assignment Algorithm using the Blocking Island Technique for All-Optical Networks”,IEEE International Conference on Communications,Ice 2002,5, 2002.

  25. Zhou (B.), Mouftah (H.T.), “Adaptive Least Loaded Routing for Multi-fiberWdm Networks Using Approximate Congestions Information”,IEEE International Conf. on Communications,Ice 2002,5, May 2002, pp. 2745–2749.

    Google Scholar 

  26. Galinier (P.), Hao (J. K.), “Hybrid Evolutionary Algorithms for Graph Coloring”,Journal of Combinatorial Optimization,3, no 4, pp. 379–397, 1999.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dzongang, C., Galinier, P. & Pierre, S. Une heuristique taboue pour le routage et l’affectation de longueurs D’onde avec scénarios de panne. Ann. Télécommun. 60, 1140–1160 (2005). https://doi.org/10.1007/BF03219840

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03219840

Mots clés

Key words

Navigation