Conference onOptical Network Design and Modeling, 2005.
DOI: 10.1109/ondm.2005.1426996
|View full text |Cite
|
Sign up to set email alerts
|

Optimization algorithms for WDM optical network dimensioning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
6
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 18 publications
1
6
0
Order By: Relevance
“…These ways include: 1) Route formulation can decrease the problem size by Limit the number of possible paths for any node-pair, in which the criteria of number of possible paths are related to the acceptable complexity and physical limitations 2) The "deterministic" heuristics, described in [8], which rerouting attempts are carried out according to a fixed lightpath-sorting rule, and the performance is improved each time the rerouting is accepted. Such sorts of heuristics are simple because that they are generally based on shortest paths graph algorithms in a greedy heuristic frame and are affected by the problem of getting trapped in local minima.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…These ways include: 1) Route formulation can decrease the problem size by Limit the number of possible paths for any node-pair, in which the criteria of number of possible paths are related to the acceptable complexity and physical limitations 2) The "deterministic" heuristics, described in [8], which rerouting attempts are carried out according to a fixed lightpath-sorting rule, and the performance is improved each time the rerouting is accepted. Such sorts of heuristics are simple because that they are generally based on shortest paths graph algorithms in a greedy heuristic frame and are affected by the problem of getting trapped in local minima.…”
Section: Introductionmentioning
confidence: 99%
“…3) The methods called "stochastic heuristics" use such techniques as simulated annealing, or genetic algorithms Monte Carlo as described in [1,8]to improve heuristic optimization by trying to avoid possible local-minima of the cost function. 4) Relaxation is also applied to reduce the complexity of a constrained optimization multi-commodity flow problem.…”
Section: Introductionmentioning
confidence: 99%
“…Finally, the study concludes that, solely, in protected networks with fixedwavelength transceivers, a significant reduction on the number of required fiber wires can be achieved with the introduction of wavelength conversion. In the works [63], [64], [67] and [69], similar studies to [10] are carried out and similar results are obtained, neglecting the utility of wavelength conversion to reduce the number of fibers to enable in the network. These papers are mainly focused on the computational tractability of the NP-hard ILP formulation, proposing ILP models ( [64], [67] and [69]) or heuristic methods ( [63] and [67]).…”
Section: Related Workmentioning
confidence: 71%
“…In the static multifiber planning, a variety of investigations have been performed under different assumptions: (a) different objective costs to optimize (maximizing the carried traffic [12], [66], minimizing the number of required wavelengths [61], [62], [68], minimizing the network congestion [65], minimizing the total number of fiber wires [10], [63], [64], [67], [69], minimizing the lightpath lengths [62], [64], [69]), (b) wavelength convertible networks [10], [63], [64], [67], [69]; or, (c) survivability and resiliency considerations [10], [12], [61], [63], [67], [69].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation