Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrea Dacomo

dblp:78/1274 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 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 · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Optical networks
routing and wavelength assignment
0.012002
Design of Static Resilient WDM Mesh Networks with Multiple Heuristic Criteria · INFOCOM 2002
Optical networks › network survivability
shared path protection
0.012002
Design of Static Resilient WDM Mesh Networks with Multiple Heuristic Criteria · INFOCOM 2002
Optical networks
wavelength-division multiplexing
0.012002
Design of Static Resilient WDM Mesh Networks with Multiple Heuristic Criteria · INFOCOM 2002
Mathematical optimization
integer programming
0.012002
Design of Static Resilient WDM Mesh Networks with Multiple Heuristic Criteria · INFOCOM 2002

Methods — techniques the papers use, named apart from their topics

link-disjoint path search · 0.1heuristic optimization · 0.1
YearPublicationVenuePosition
2002 Design of Static Resilient WDM Mesh Networks with Multiple Heuristic Criteria
abstract
We present a heuristic method to optimize the capacity of a WDM mesh network assigning working and protection capacity to a set of static optical-connection requests under the link-disjoint constraint. The method can be applied to networks supporting either dedicated or shared path-protection. Routing and fiber and wavelength assignment (RFWA) are jointly performed for all the lightpaths with the aim of minimizing the number of fibers in the network. The employment of multiple prioritized heuristic criteria and an efficient link disjoint paths search algorithm are proposed. With less computational effort, the proposed heuristic approach allows one to obtain good suboptimal results compared to the exact integer-linear-programming optimization. After introducing our design approach, we discuss the optimization of particular case-study networks under various conditions and compare the results.
Andrea Dacomo, Simone De Patre, Guido Maier, Achille Pattavina, Mario Martinelli
INFOCOM1