Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2506.13074 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911007246385152 |
|---|---|
| author | Zhang, Silong Feng, Jixuan Liu, Junyan Liu, Yu Xu, Zhou Zhang, Fan |
| author_facet | Zhang, Silong Feng, Jixuan Liu, Junyan Liu, Yu Xu, Zhou Zhang, Fan |
| contents | This paper studies a survivable traffic grooming problem in large-scale optical transport networks under double-link failures (STG2). Each communication demand must be assigned a route for every possible scenario involving zero, one, or two failed fiber links. Protection against double-link failures is crucial for ensuring reliable telecommunications services while minimizing equipment costs, making it essential for telecommunications companies today. However, this significantly complicates the problem and is rarely addressed in existing studies. Furthermore, current research typically examines networks with fewer than 300 nodes, much smaller than some emerging networks containing thousands of nodes. To address these challenges, we propose a novel hierarchical constructive heuristic for STG2. This heuristic constructs and assigns routes to communication demands across different scenarios by following a hierarchical sequence. It incorporates several innovative optimization techniques and utilizes parallel computing to enhance efficiency. Extensive experiments have been conducted on large-scale STG2 instances provided by our industry partner, encompassing networks with 1,000 to 2,600 nodes. Results demonstrate that within a one-hour time limit and a 16 GB memory limit set by the industry partner, our heuristic improves the objective values of the best-known solutions by 18.5\% on average, highlighting its significant potential for practical applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13074 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Hierarchical Constructive Heuristic for Large-Scale Survivable Traffic Grooming Problem under Double-Link Failures Zhang, Silong Feng, Jixuan Liu, Junyan Liu, Yu Xu, Zhou Zhang, Fan Combinatorics This paper studies a survivable traffic grooming problem in large-scale optical transport networks under double-link failures (STG2). Each communication demand must be assigned a route for every possible scenario involving zero, one, or two failed fiber links. Protection against double-link failures is crucial for ensuring reliable telecommunications services while minimizing equipment costs, making it essential for telecommunications companies today. However, this significantly complicates the problem and is rarely addressed in existing studies. Furthermore, current research typically examines networks with fewer than 300 nodes, much smaller than some emerging networks containing thousands of nodes. To address these challenges, we propose a novel hierarchical constructive heuristic for STG2. This heuristic constructs and assigns routes to communication demands across different scenarios by following a hierarchical sequence. It incorporates several innovative optimization techniques and utilizes parallel computing to enhance efficiency. Extensive experiments have been conducted on large-scale STG2 instances provided by our industry partner, encompassing networks with 1,000 to 2,600 nodes. Results demonstrate that within a one-hour time limit and a 16 GB memory limit set by the industry partner, our heuristic improves the objective values of the best-known solutions by 18.5\% on average, highlighting its significant potential for practical applications. |
| title | A Hierarchical Constructive Heuristic for Large-Scale Survivable Traffic Grooming Problem under Double-Link Failures |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.13074 |