Hai Dao

Dr. Hai Dao

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2018 in IET Optoelectronics
Verified
Journal Article
Open access
PDF file
HDHai Dao
Hai Dao
MMMichel Morvan
Michel Morvan
PGPhilippe Gravey
Philippe Gravey
Efficient algorithms for solving the routing and spectrum assignment (RSA) problem in flex‐grid optical networks are of paramount importance to leverage network efficiency. Exact approaches based on integer linear programming (ILP) models are known to be computationally hard and hence, difficult to solve for realistic models while heuristics have inherent downsize of local optimal trapping. In addressing those issues, this paper firstly presents a novel and efficient heuristic based on the genetic algorithm (GA) to provide (near‐) optimal solutions to the RSA problem. The effectiveness of the GA‐based algorithm is benchmarked against typically used reference heuristics for a set of network scenarios and it is shown that in addition to the better performance than conventional heuristics in the literature, the proposed GA technique indeed could achieve optimal solutions in most cases while the running time is still manageable. Secondly, we propose to make use of efficient solutions from the heuristic approaches to set the upper‐bound and warm‐start point for ILP formulation. This combination has been shown very productive in enhancing running time performance and increasing the capability of achieving an optimal solution and/or improving the solution quality in a given time span compared with traditional ways for solving ILP models.

27 June 2017 in IEEE Communications Letters
Verified
Journal Article
Closed access
HDHai Dao
Hai Dao
This paper investigates a novel use of network coding (NC) in 1+1 protection for transparent WDM networks by utilizing a cost-effective all-optical XOR encoder/decoder. In applying this scheme, we introduce a new problem, called, routing, wavelength and network coding assignment and formulate it as the integer linear programming model aiming at maximizing the network throughput under constrained bandwidth capacity. We evaluate our proposal on the realistic topology, COST239, with all-to-one traffic setting. The numerical results on studied case show that the our NCbased approach could support up to 30% traffic more than the conventional 1+1 protection.

12 October 2017 in IEEE Access
Verified
Journal Article
Open access
HDHai Dao
Hai Dao
Network coding (NC) features a new perspective for leveraging network performances as more efficient resources utilization could be achieved. In recent years, the application of NC to the realms of failure recovery in optical networks has been receiving growing attention and indeed, combining the near-instantaneous recovery of dedicated protection and improved capacity efficiency enabled by NC constitutes an important research trend in optical protection. In order to maximize the benefits empowered by NC, a critical problem on routing of traffic demands, selecting demands for encoding and determining the respective coding node and coding links has to be optimally addressed. The problem becomes even more challenging if multiple traffic demands are considered at once and the traffic is non-equal. In addressing those issues, for the first time, we present a novel unified framework for augmenting 1 + 1 dedicated protection against single link failures with a practical network coding scheme based on XOR operation for both equal and non-equal traffic scenarios. In line with this framework, a mathematical model in the form of integer linear programming for optimal routing and network coding assignment to minimize the path cost is presented. Numerical results based on evaluating the model on realistic topologies and all-to-one traffic setting highlight the cost advantages of our proposed NC-assisted protection scheme compared to traditional counterparts.


12 September 2017 in International Journal of Communication Systems
Verified
Journal Article
Closed access
PDF file
HDHai Dao
Hai Dao
MMMichel Morvan
Michel Morvan
PGPhilippe Gravey
Philippe Gravey

7 June 2023 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
HDHai Dao
Hai Dao
In optical-processing-enabled network, transitional lightpaths crossing the same node could be optically encoded to each other to achieve greater spectral efficiency. In this context, we present a new research problem, entitled, routing, wavelength, network coding assignment and protection configuration (RWNCA-PC) arisen in exploiting photonic network coding (NC) for dedicated path protection in wavelength division multiplexing (WDM) networks with an extra degree of freedom in the selection of protection triggering mechanism, that is, network-side and client-side, tailoring to each connection. In order to maximize the NC benefits, we thus provide a weighted multi-objective optimization model for solving RWNCA-PC problem so as to minimize the wavelength count as the strictly prioritized goal and the redundant resources measured by the number of client-side connections as the secondary objective. Numerical results on the realistic COST239 network reveal that a saving of up to 25% wavelength resources could be achieved thanks to the optimal use of NC compared to the non-coding designs and among coding-aware designs, the use of mixed protection configurations would be spectrally more efficient than the design with only network-side protection scheme. Our proposal yields the highest spectrum efficiency compared to all reference designs and moreover, features an average saving of more than 40% transponder count compared with its single objective counterpart.