The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Embora o problema de roteamento multicast e atribuição de comprimento de onda (MC-RWA) em redes ópticas de multiplexação por divisão de comprimento de onda (WDM) tenha sido investigado, relativamente poucos pesquisadores consideraram a capacidade de sobrevivência da rede para multicast. Este artigo fornece uma estrutura de otimização para resolver o problema MC-RWA em uma rede WDM multifibra que pode se recuperar de uma falha de link único com proteção compartilhada. Utilizando o conceito light-tree (LT) para suportar sessões multicast, consideramos duas estratégias de proteção que tentam reduzir interrupções de serviço após uma falha no link. A primeira estratégia, chamada de proteção light-tree reconfiguration (LTR), calcula um novo LT multicast para cada sessão afetada pela falha. A segunda estratégia, chamada proteção de reconfiguração de ramificação óptica (OBR), tenta restaurar uma conexão lógica entre dois membros multicast adjacentes desconectados pela falha. Para resolver o problema MC-RWA de forma otimizada, propomos uma formulação de programação linear inteira (ILP) que minimiza o número total de fibras necessárias para o tráfego de trabalho e de backup. A formulação do ILP leva em consideração o roteamento conjunto do tráfego de trabalho e de backup, a restrição de continuidade do comprimento de onda e o grau de divisão limitado das conexões cruzadas ópticas com capacidade de multicast (MC-OXCs). Após mostrar alguns resultados numéricos para soluções ótimas, propomos algoritmos heurísticos que reduzem a complexidade computacional e tornam o problema solucionável para grandes redes. Os resultados numéricos sugerem que a heurística proposta produz soluções eficientes em comparação com soluções ótimas obtidas a partir da otimização exata.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Kampol WORADIT, Matthieu GUYOT, Pisit VANICHCHANUNT, Poompat SAENGUDOMLERT, Lunchakorn WUTTISITTIKULKIJ, "Multicast Routing and Wavelength Assignment with Shared Protection in Multi-Fiber WDM Mesh Networks: Optimal and Heuristic Solutions" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 11, pp. 3401-3409, November 2009, doi: 10.1587/transcom.E92.B.3401.
Abstract: While the problem of multicast routing and wavelength assignment (MC-RWA) in optical wavelength division multiplexing (WDM) networks has been investigated, relatively few researchers have considered network survivability for multicasting. This paper provides an optimization framework to solve the MC-RWA problem in a multi-fiber WDM network that can recover from a single-link failure with shared protection. Using the light-tree (LT) concept to support multicast sessions, we consider two protection strategies that try to reduce service disruptions after a link failure. The first strategy, called light-tree reconfiguration (LTR) protection, computes a new multicast LT for each session affected by the failure. The second strategy, called optical branch reconfiguration (OBR) protection, tries to restore a logical connection between two adjacent multicast members disconnected by the failure. To solve the MC-RWA problem optimally, we propose an integer linear programming (ILP) formulation that minimizes the total number of fibers required for both working and backup traffic. The ILP formulation takes into account joint routing of working and backup traffic, the wavelength continuity constraint, and the limited splitting degree of multicast-capable optical cross-connects (MC-OXCs). After showing some numerical results for optimal solutions, we propose heuristic algorithms that reduce the computational complexity and make the problem solvable for large networks. Numerical results suggest that the proposed heuristic yields efficient solutions compared to optimal solutions obtained from exact optimization.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3401/_p
Copiar
@ARTICLE{e92-b_11_3401,
author={Kampol WORADIT, Matthieu GUYOT, Pisit VANICHCHANUNT, Poompat SAENGUDOMLERT, Lunchakorn WUTTISITTIKULKIJ, },
journal={IEICE TRANSACTIONS on Communications},
title={Multicast Routing and Wavelength Assignment with Shared Protection in Multi-Fiber WDM Mesh Networks: Optimal and Heuristic Solutions},
year={2009},
volume={E92-B},
number={11},
pages={3401-3409},
abstract={While the problem of multicast routing and wavelength assignment (MC-RWA) in optical wavelength division multiplexing (WDM) networks has been investigated, relatively few researchers have considered network survivability for multicasting. This paper provides an optimization framework to solve the MC-RWA problem in a multi-fiber WDM network that can recover from a single-link failure with shared protection. Using the light-tree (LT) concept to support multicast sessions, we consider two protection strategies that try to reduce service disruptions after a link failure. The first strategy, called light-tree reconfiguration (LTR) protection, computes a new multicast LT for each session affected by the failure. The second strategy, called optical branch reconfiguration (OBR) protection, tries to restore a logical connection between two adjacent multicast members disconnected by the failure. To solve the MC-RWA problem optimally, we propose an integer linear programming (ILP) formulation that minimizes the total number of fibers required for both working and backup traffic. The ILP formulation takes into account joint routing of working and backup traffic, the wavelength continuity constraint, and the limited splitting degree of multicast-capable optical cross-connects (MC-OXCs). After showing some numerical results for optimal solutions, we propose heuristic algorithms that reduce the computational complexity and make the problem solvable for large networks. Numerical results suggest that the proposed heuristic yields efficient solutions compared to optimal solutions obtained from exact optimization.},
keywords={},
doi={10.1587/transcom.E92.B.3401},
ISSN={1745-1345},
month={November},}
Copiar
TY - JOUR
TI - Multicast Routing and Wavelength Assignment with Shared Protection in Multi-Fiber WDM Mesh Networks: Optimal and Heuristic Solutions
T2 - IEICE TRANSACTIONS on Communications
SP - 3401
EP - 3409
AU - Kampol WORADIT
AU - Matthieu GUYOT
AU - Pisit VANICHCHANUNT
AU - Poompat SAENGUDOMLERT
AU - Lunchakorn WUTTISITTIKULKIJ
PY - 2009
DO - 10.1587/transcom.E92.B.3401
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2009
AB - While the problem of multicast routing and wavelength assignment (MC-RWA) in optical wavelength division multiplexing (WDM) networks has been investigated, relatively few researchers have considered network survivability for multicasting. This paper provides an optimization framework to solve the MC-RWA problem in a multi-fiber WDM network that can recover from a single-link failure with shared protection. Using the light-tree (LT) concept to support multicast sessions, we consider two protection strategies that try to reduce service disruptions after a link failure. The first strategy, called light-tree reconfiguration (LTR) protection, computes a new multicast LT for each session affected by the failure. The second strategy, called optical branch reconfiguration (OBR) protection, tries to restore a logical connection between two adjacent multicast members disconnected by the failure. To solve the MC-RWA problem optimally, we propose an integer linear programming (ILP) formulation that minimizes the total number of fibers required for both working and backup traffic. The ILP formulation takes into account joint routing of working and backup traffic, the wavelength continuity constraint, and the limited splitting degree of multicast-capable optical cross-connects (MC-OXCs). After showing some numerical results for optimal solutions, we propose heuristic algorithms that reduce the computational complexity and make the problem solvable for large networks. Numerical results suggest that the proposed heuristic yields efficient solutions compared to optimal solutions obtained from exact optimization.
ER -