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

Nico Wauters

dblp:25/6296 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1997
—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 · 93% Network optimization and economics · 7%

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

TopicWeightPapersLastEvidence papers
Optical networks › optical network architecture
optical path layer
0.011996
Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks
routing and wavelength assignment
0.011996
Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks
wavelength conversion
0.011996
Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks · IEEE J. Sel. Areas Commun. 1996
Optical networks
wavelength-division multiplexing
0.011996
Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks · IEEE J. Sel. Areas Commun. 1996
Network optimization and economics
network design
0.011996
Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks · IEEE J. Sel. Areas Commun. 1996

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

integer linear programming · 0.0heuristic · 0.0dijkstra algorithm · 0.0
YearPublicationVenuePosition
1997 Spare Capacity Assignment for Different Restoration Strategies in Mesh Survivable Networks
abstract
For restoration in the case of single link failures in meshed networks several strategies can be considered: link restoration, path restoration and path restoration with link-disjunct route. In terms of spare capacity requirement path restoration is found to be most attractive. These results are obtained by using two general optimisation techniques (simulated annealing and integer linear programming). Both techniques have each their own features; their applicability depends on the size and type of the problem. Application to WDM fibre networks is discussed.
Bart Van Caenegem, Nico Wauters, Piet Demeester
ICC (1)2
1996 Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks
abstract
We discuss the wavelength requirement for optical networks based on wavelength-division multiplexing (WDM). A mathematical model, to represent the routing and wavelength assignment in optical networks with or without wavelength conversion, is described, and metrics are defined to express the performance. A new heuristic for routing and wavelength assignment is proposed and compared with the Dijkstra algorithm and with a solution based on integer linear programming. The different techniques are applied to a variety of network examples with different traffic loads.
Nico Wauters, Piet Demeester
IEEE J. Sel. Areas Commun.1