The Achilles Heel of Some Optical Network Designs and Performance Comparisons

by   Dao Thanh Hai, et al.

This non-conventional paper represents the first attempt to uncover a possible vulnerability in some proposals for optical network designs and performance comparisons. While optical network designs and planning lie at the heart of achieving fiber capacity efficiency and/or operational efficiency, its combinatorial nature makes it computationally hard to reach optimal solutions for realistic scenarios. Therefore, the well-established way that have been taken for granted by not-so-small number of research papers is that an optimization model based on mixed integer linear programming (MILP) is first proposed and then due to the intractability of such combinatorial model, an heuristic algorithm is offered as an approximation. The solution-quality comparison between the MILP and heuristic is then carried out on small-scale instances including topologies and traffic tests to verify the efficacy of the proposed heuristic and the next step is to use such allegedly verified heuristic for optical network designs of realistic scenarios. This approach may nevertheless leave a critical vulnerability as there is no guarantee that one performs well in small tests will generalize adequately for large-scale cases, a common pitfall widely referred as the peril of extrapolation and/or overfitting. Besides, it is not uncommon that in some research works, for benchmarking purpose, the comparison between a new design proposal whose performance is obtained from on one heuristic and a reference design based on another heuristic is carried out. As the result of missing solution quality check, such performance comparison relied merely on heuristic solutions may be equally vulnerable as its results can be distorted and thus, be far from the possibly achieved zones. In this work, we pinpoint those issues and provide a realistic case study to highlight and demonstrate the impact of such vulnerabilities.



page 1


A pragmatic approach for designing transparent WDM optical networks with multi-objectives

In facing with the explosive Internet traffic growth, optical transport ...

Planning Optical Networks for Unexpected Traffic Growth

A lightpath configuration algorithm considering a multi-period traffic m...

A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks

We consider the problem of optimally designing a body wireless sensor ne...

On Solving the Minimum Common String Partition Problem by Decision Diagrams

In the Minimum Common String Partition Problem (MCSP), we are given two ...

A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks

We present an application focused on the design of resilient long-reach ...

A Conflict-Based Path-Generation Heuristic for Evacuation Planning

Evacuation planning and scheduling is a critical aspect of disaster mana...

Optimizing Capacitated Vehicle Scheduling with Time Windows: A Case Study of RMC Delivery

Ready Mixed Concrete Delivery Problem (RMCDP) is a multi-objective multi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.