VLDB 2026 Research / reviewers in the wild / expert
Huy Quang Duong
dblp:242/2400
· DBLP profile ↗
3ranked-venue papers
3as first author
1since 2021 · last 2021
0000-0003-2714-4605ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Optical networks · 87% Routing and switching · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Optical networks
optical transmission |
0.5 | 1 | 2021 | Efficient Make-Before-Break Layer 2 Reoptimization · IEEE/ACM Trans. Netw. 2021 |
Routing and switching
MPLS |
0.1 | 1 | 2021 | Efficient Make-Before-Break Layer 2 Reoptimization · IEEE/ACM Trans. Netw. 2021 |
Methods — techniques the papers use, named apart from their topics
integer programming · 0.5exact optimization · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Efficient Make-Before-Break Layer 2 ReoptimizationabstractOptical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX. The focus of this paper is on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings. Huy Quang Duong, Brigitte Jaumard, David Coudert, Ron Armolavicius |
IEEE/ACM Trans. Netw. | 1 |
| 2019 | A Nested Decomposition Model for Reliable NFV 5G Network Slicing
Huy Quang Duong, Brigitte Jaumard |
INOC | 1 |
| 2018 | Efficient Make Before Break Capacity DefragmentationabstractOptical multilayer optimization continuously reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need to add new resources for new requests, saving CAPEX and leads to optical network defragmentation. The focus of this paper is on Layer 2, i.e., on capacity defragmentation at the OTN layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. For the Quality of Service, it is desirable to operate under Make Before Break (MBB), with the minimum number of rerouting. The challenge is to identify the rerouting order, one connection at a time, while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with the state of the art. We also provide some defragmentation analysis in terms of the bandwidth requirement vs. the number of reroutings. Huy Quang Duong, Brigitte Jaumard, David Coudert, Ron Armolavicius |
HPSR | 1 |