Demo Data from EDBT 2026 / reviewers in the wild / expert
Korn Vajanapoom
dblp:16/4904
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 first-author
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 · 50% Routing and switching · 25% Network optimization and economics · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Optical networks › optical network design
multilayer network design |
0.1 | 1 | 2007 | Spare Capacity Allocation in Two-Layer Networks · IEEE J. Sel. Areas Commun. 2007 |
Optical networks › network survivability
shared path protection |
0.1 | 1 | 2007 | Spare Capacity Allocation in Two-Layer Networks · IEEE J. Sel. Areas Commun. 2007 |
Routing and switching › traffic engineering
spare capacity allocation |
0.1 | 1 | 2007 | Spare Capacity Allocation in Two-Layer Networks · IEEE J. Sel. Areas Commun. 2007 |
Network optimization and economics › network design
survivable network design |
0.1 | 1 | 2007 | Spare Capacity Allocation in Two-Layer Networks · IEEE J. Sel. Areas Commun. 2007 |
Methods — techniques the papers use, named apart from their topics
successive survivable routing heuristic · 0.1integer linear programming · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Spare Capacity Allocation in Two-Layer NetworksabstractIn this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity allocation (SCA) optimization problems are formulated as integer linear programming (ILP) models for the cases of protection at the top layer against failures at the bottom layer. The first model captures failure propagation using overlay information between two layers for backup paths to meet diversity requirements. The second model improves bandwidth efficiency by moving spare capacity sharing from the top layer to the bottom layer. This exposes a tradeoff between bandwidth efficiency and extra cross-layer operation. Next, the SCA model for common pool protection is developed to allow spare capacity sharing between two layers. Our previous SCA heuristic technique, successive survivable routing (SSR) is extended for these optimization problems. Numerical results for a variety of networks indicate that the common pool protection is attractive to enhance bandwidth efficiency without loss of survivability and that the SSR heuristic quickly results in near optimal solutions David Tipper, Korn Vajanapoom |
IEEE J. Sel. Areas Commun. | 3 |
| 2006 | Risk reduction based survivable WDM network designabstractThis paper presents an investment strategy to reduce the risk associated with failures in wavelength division multiplexing (WDM) optical networks. The investment strategy determines how to allocate a fixed budget for implementing survivability techniques in different parts of the network such that the expected loss of traffic (ELT) is minimized. Two survivability schemes are considered in this paper: dedicated link protection and dedicated path protection. Two analytical techniques for evaluating network unavailability and ELT are presented in this paper: a fault tree analysis and an event tree. Based on the event tree approach, we propose a novel mixed integer linear programming (MILP) formulation for the investment strategy problem. Numerical results illustrating the investment strategy for both link and path protection are presented and discussed Korn Vajanapoom, David Tipper |
IPCCC | 1 |